On the Automatic Validation of Parameterized Unity Programs

We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-order formulas expressing invariants into equivalent formulas expressed in a weaker but decidable logic. Two technics are considered: quantifier elimination and reduction to finite domain.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Jean-Paul Bodeveix, Mamoun Filali
• Keywords: Distributed And Parallel Computing, Formulas Expressing Invariants, IPPS 1998, Paper Presents Methods, Parameterized State Space