337 search results - page 13 / 68 » Predicate abstraction for software verification |
89
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
193
Voted
POPL
2005
ACM
16 years 22 days ago
2005
ACM
While a typical software component has a clearly specified (static) interface in terms of the methods and the input/output types they support, information about the correct sequen...
120
click to vote
TII
2010
14 years 7 months ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
120
Voted
ICCD
2004
IEEE
15 years 9 months ago
2004
IEEE
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
120
Voted
FASE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a new method for automatic generation of loop invariants for programs containing arrays. Unlike all previously known methods, our method allows one to generate...