Formal Methods in Software Engineering

Automated Proving of the Behavioral Attributes

Year2009
TypeConference
StatusProceedings
AuthorsGheorghe Grigoras, Dorel Lucanu, Georgiana Caltais, Eugen Goriac

Links

Abstract

Behavioral equivalence is indistinguishably under experiments: two elements are behavioral equivalent iff eachexperiment returns the same value for the two elements. Behavioral equivalence can be proved by coinduction. CIRCis 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.

BibTeX

@inproceedings{DBLP:conf/bci/GrigorasLCG09, author = {Gheorghe Grigoras and Dorel Lucanu and Georgiana Caltais and Eugen-Ioan Goriac}, title = {Automated Proving of the Behavioral Attributes}, booktitle = {2009 Fourth Balkan Conference in Informatics, BCI 2009}, year = {2009}, pages = {33-38}, publisher ={IEEE Computer Society}, url = {http://www.bci-conferences.org/bci09/ [BCI]}, url_publisher = {http://www.computer.org/portal/web/csdl/doi/10.1109/BCI.2009.40} }