Counterexample Refinement for a Boundedness Test for CFSM Languages

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:300d2c56814fc5afd5d6ace79209685b

LEUE, Stefan, Wei WEI, 2005. Counterexample Refinement for a Boundedness Test for CFSM Languages

@techreport{Leue2005Count-5616, series={Technical Report, Chair for Software Engineering, University of Konstanz}, title={Counterexample Refinement for a Boundedness Test for CFSM Languages}, year={2005}, number={soft-05-01}, author={Leue, Stefan and Wei, Wei} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5616"> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5616/1/Counterexample_Refinement_for_a_Boundedness_Test_for_CFSM_Languages.pdf"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:57:13Z</dcterms:available> <dcterms:abstract xml:lang="eng">In precursory work we suggested an abstraction-based highly scalable semi-test for the boundedness of Communicating Finite State Machine (CFSM) based modelling and programming languages. We illustrated its application to Promela and UML-RT models. The test is sound with respect to determining boundedness, but may return inconclusive counterexamples when boundedness cannot be established. In this paper we turn to the question how to effectively determine the spuriousness of these counterexamples, and how to refine the abstraction based on the analysis. We employ methods from program analysis and illustrate the application of our refinement method to a number of Promela examples.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:57:13Z</dc:date> <dc:rights>deposit-license</dc:rights> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:issued>2005</dcterms:issued> <dc:format>application/pdf</dc:format> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Wei, Wei</dc:creator> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5616/1/Counterexample_Refinement_for_a_Boundedness_Test_for_CFSM_Languages.pdf"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:creator>Leue, Stefan</dc:creator> <dc:contributor>Leue, Stefan</dc:contributor> <dcterms:title>Counterexample Refinement for a Boundedness Test for CFSM Languages</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5616"/> <dc:language>eng</dc:language> <dc:contributor>Wei, Wei</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Counterexample_Refinement_for_a_Boundedness_Test_for_CFSM_Languages.pdf 64

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto