A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs

Abstract

In this paper we address the problem of deciding may- and must-equivalence and termination of nondeterministic finite programs from second-order recursion-free Erratic Idealized Algol. We use game semantics to compositionally extract finite models of programs, and the CSP process algebra as a concrete formalism for representation of models and their efficient verification. Observational may- and must-equivalence and liveness properties, such as divergence and termination, are decided by checking traces renements and divergence-freedom of CSP processes using the FDR tool. The practicality of the approach is evaluated on several examples.
No file

Dates and versions

inria-00525129 , version 1 (11-10-2010)

Identifiers

  • HAL Id : inria-00525129 , version 1

Cite

Alexksandar Dimovski. A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs. Integrated Formal Methods - IFM 2010, INRIA Nancy Grand Est, Oct 2010, Nancy, France. pp.121-135. ⟨inria-00525129⟩
13 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More