Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

IPPS
1998
IEEE

favoriteEmaildiscussreport

128views Distributed And Parallel Com...» more IPPS 1998»

On the Automatic Validation of Parameterized Unity Programs

14 years 3 months ago

On the Automatic Validation of Parameterized Unity Programs

Download ipdps.cc.gatech.edu

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.

Jean-Paul Bodeveix, Mamoun Filali

Real-time Traffic

Distributed And Parallel Computing | Formulas Expressing Invariants | IPPS 1998 | Paper Presents Methods | Parameterized State Space |

claim paper

Related Content

» Characterization and Parameterized Random Generation of Digital Circuits

» Aspect Validation Using Model Checking

» Lazy Abstraction with Interpolants for Arrays

» The RAW benchmark suite computation structures for general purpose computing

» Simultaneous Checking of Completeness and Ground Confluence

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Jean-Paul Bodeveix, Mamoun Filali

Comments (0)