337 search results - page 36 / 68 » Predicate abstraction for software verification |
95
Voted
KBSE
1995
IEEE
15 years 4 months ago
1995
IEEE
cation at some level of abstraction, abandoning the semantic information provided by the specification. In this paper, we propose a methodology that ships the overhead of formal re...
82
Voted
VMCAI
2007
Springer
15 years 6 months ago
2007
Springer
We define the class of single-parent heap systems, which rely on a singly-linked heap in order to model destructive updates on tree structures. This encoding has the advantage of ...
91
Voted
WADT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framewo...
110
Voted
BIRTHDAY
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
ESORICS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. As the number and scope of government regulations and rules mandating trustworthy retention of data keep growing, businesses today are facing a higher degree of regulatio...