Sciweavers

30 search results - page 4 / 6
» Predicate Abstraction with Under-approximation Refinement
Sort
View
CAV
2006
Springer
116views Hardware» more  CAV 2006»
14 years 8 days ago
Lazy Shape Analysis
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
Dirk Beyer, Thomas A. Henzinger, Grégory Th...
ICALP
2010
Springer
13 years 10 months ago
Example-Guided Abstraction Simplification
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
Roberto Giacobazzi, Francesco Ranzato
ATVA
2008
Springer
144views Hardware» more  ATVA 2008»
13 years 10 months ago
Tests, Proofs and Refinements
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
Sriram K. Rajamani
VMCAI
2010
Springer
14 years 5 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
ASM
2008
ASM
13 years 10 months ago
A First Attempt to Express KAOS Refinement Patterns with Event B
anguage (Event B), hence staying at the same abstraction level. Thus we take advantage from the Event B method: (i) it is possible to use the method during the whole development pr...
Abderrahman Matoussi, Frédéric Gerva...