Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Automated Proving of the Behavioral Attributes

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

GRIGORAS, Gheorghe, Dorel LUCANU, Georgiana CALTAIS, Eugen-Ioan GORIAC, 2009. Automated Proving of the Behavioral Attributes. Fourth Balkan Conference in Informatics 2009. Thessaloniki, Greece, Sep 17, 2009 - Sep 19, 2009. In: Fourth Balkan Conference in Informatics 2009. New York, NY:IEEE, pp. 33-38. ISBN 978-0-7695-3783-2. Available under: doi: 10.1109/BCI.2009.40

@inproceedings{Grigoras2009-09Autom-46032, title={Automated Proving of the Behavioral Attributes}, year={2009}, doi={10.1109/BCI.2009.40}, isbn={978-0-7695-3783-2}, address={New York, NY}, publisher={IEEE}, booktitle={Fourth Balkan Conference in Informatics 2009}, pages={33--38}, author={Grigoras, Gheorghe and Lucanu, Dorel and Caltais, Georgiana and Goriac, Eugen-Ioan} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:contributor>Lucanu, Dorel</dc:contributor> <dc:creator>Lucanu, Dorel</dc:creator> <dc:creator>Caltais, Georgiana</dc:creator> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:isPartOf rdf:resource=""/> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:abstract xml:lang="eng">Behavioral equivalence is indistinguishably under experiments: two elements are behavioral equivalent iff each experiment returns the same value for the two elements. Behavioral equivalence can be proved by coinduction. CIRC is a theorem prover which implements circular coinduction, an efficient coinductive technique. Equational attributes refer properties like associativity, commutativity, unity, etc. If these attributes are behaviorally satisfied, then we refer them as behavioral attributes. Two problems regarding these properties are important: expressing the commutativity as a rewrite rule leads to non-termination and their use as attributes requires a careful handling in the proving process. In this paper we present how these attributes are automatically checked in CIRC and we prove that this extension is sound.</dcterms:abstract> <bibo:uri rdf:resource=""/> <dc:language>eng</dc:language> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Caltais, Georgiana</dc:contributor> <dc:creator>Goriac, Eugen-Ioan</dc:creator> <dc:creator>Grigoras, Gheorghe</dc:creator> <dcterms:issued>2009-09</dcterms:issued> <dc:contributor>Grigoras, Gheorghe</dc:contributor> <dcterms:title>Automated Proving of the Behavioral Attributes</dcterms:title> <dcterms:available rdf:datatype="">2019-06-18T11:31:02Z</dcterms:available> <dc:contributor>Goriac, Eugen-Ioan</dc:contributor> <dc:date rdf:datatype="">2019-06-18T11:31:02Z</dc:date> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account