Sciweavers

138 search results - page 24 / 28
» Linear Encodings of Bounded LTL Model Checking
Sort
View
SAT
2004
Springer
97views Hardware» more  SAT 2004»
14 years 25 days ago
Incremental Compilation-to-SAT Procedures
We focus on incremental compilation-to-SAT procedures (iCTS), a promising way to push the standard CTS approaches beyond their limits. We propose the first comprehensive framework...
Marco Benedetti, Sara Bernardini
ICTAC
2009
Springer
14 years 2 months ago
Input-Output Model Programs
Abstract. Model programs are used as high-level behavioral specifications typically representing abstract state machines. For modeling reactive systems, one uses input-output mode...
Margus Veanes, Nikolaj Bjørner
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
CAV
2009
Springer
209views Hardware» more  CAV 2009»
14 years 8 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 10 months ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...