Program Equivalence by Circular Reasoning

The main results are a polynomial-time decidability for the equivalence problem in the considered case, and an explicit description of an equivalence-checking algorithm which

We also show here how reachability rules (based on matching logic) can be used to give operational semantics to programming languages2. In Section 3 we introduce the semantics of

This is then used in Section 7, which contains our proposed definition for program equivalence as the satisfiaction of certain LTL formulas over an execution of the transition

The question therefore arises as to what happens to familiar, decidable fragments of first-order logic under the assumption that a specified collection of binary predicates

While minimality could be easily related to set inclusion of the transition sets of two standard Petri nets, the diculty for extended Petri nets with priorities is that

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

To explore how sample size and equivalence inter- val size affect power in tests for a lack of correlation, standardized equivalence intervals for ρ were set to (−.05, .05), (−.1,

This proof may be generalize to prove (this result is also well known) the operationnely equiva- lence of two λ-terms where the B˝ohm tree are equal ` a η - infinite expansion