31 search results - page 1 / 7 » Analysis of invariants for efficient bounded verification |
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
CAV
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
SIGSOFT
2004
ACM
14 years 7 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
HYBRID
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...