Sciweavers

5 search results - page 1 / 1
» SMT Techniques for Fast Predicate Abstraction
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 8 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
ENTCS
2008
110views more  ENTCS 2008»
13 years 4 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
FORTE
2008
13 years 5 months ago
Model Generation for Horn Logic with Stratified Negation
Abstract. Model generation is an important formal technique for finding interesting instances of computationally hard problems. In this paper we study model generation over Horn lo...
Ethan K. Jackson, Wolfram Schulte
APLAS
2010
ACM
13 years 4 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
LPAR
2005
Springer
13 years 9 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...