798 search results - page 23 / 160 » Proving More Properties with Bounded Model Checking |
POPL
2012
ACM
12 years 4 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
CHARME
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
DAC
2005
ACM
14 years 9 months ago
2005
ACM
We present several improvements to general-purpose sequential redundancy removal. First, we propose using a robust variety of synergistic transformation and verification algorithm...
ECCC
2007
13 years 8 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
FMSD
2006
13 years 8 months ago
2006
A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL. Interactio...