A Region Graph Based Approach to Termination Proofs

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:ace7dba640e4e2a4d4af42cfd23269d0

LEUE, Stefan, Wei WEI, 2006. A Region Graph Based Approach to Termination Proofs

@techreport{Leue2006Regio-5497, series={Technical Report, Chair for Software Engineering, University of Konstanz}, title={A Region Graph Based Approach to Termination Proofs}, year={2006}, number={soft-06-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/5497"> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103416863-3868037-7"/> <dc:format>application/pdf</dc:format> <dc:language>eng</dc:language> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5497"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:52Z</dcterms:available> <dcterms:abstract xml:lang="eng">Automated termination proofs are indispensable in the mechanic verification of many program properties. While most of the recent work on automated termination proofs focuses on the construction of linear ranking functions, we develop an approach based on region graphs in which regions define subsets of variable values that have different effects on loop termination. In order to establish termination, we check whether (1) any region will be exited once it is entered, and (2) no region is entered an infinite number of times.We show the effectiveness of our proof method by experiments with Java code using a prototype implementation of our approach.</dcterms:abstract> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5497/1/A_Region_Graph_Based_Approach_to_Termination_Proofs.pdf"/> <dc:creator>Leue, Stefan</dc:creator> <dc:rights>deposit-license</dc:rights> <dcterms:title>A Region Graph Based Approach to Termination Proofs</dcterms:title> <dc:creator>Wei, Wei</dc:creator> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:52Z</dc:date> <dcterms:issued>2006</dcterms:issued> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Wei, Wei</dc:contributor> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5497/1/A_Region_Graph_Based_Approach_to_Termination_Proofs.pdf"/> <dc:contributor>Leue, Stefan</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

A_Region_Graph_Based_Approach_to_Termination_Proofs.pdf 35

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto