30 search results - page 2 / 6 » Predicate Abstraction with Under-approximation Refinement |
TACAS
2010
Springer
13 years 3 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
CAV
2008
Springer
13 years 7 months ago
2008
Springer
Counterexample-guided abstraction refinement (CEGAR) has been en vogue for the automatic verification of very large systems in the past years. When trying to apply CEGAR to the ver...
ETRICS
2006
13 years 9 months ago
2006
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
POPL
2004
ACM
14 years 5 months ago
2004
ACM
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
ESOP
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...