1914 search results - page 107 / 383 » Verification by Abstract Interpretation |
113
click to vote
FAC
2000
15 years 14 days ago
2000
Formal approaches to the design of interactive systems rely on reasoning about properties of the t a very high level of abstraction. Specifications to support such an approach typi...
102
click to vote
CAV
2010
Springer
15 years 25 days ago
2010
Springer
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
127
click to vote
HYBRID
1998
Springer
15 years 4 months ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
144
click to vote
CHARME
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
111
Voted
SIGSOFT
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...