Sciweavers

Share
SIGSOFT
2010
ACM
8 years 1 months ago
Scalable SMT-based verification of GPU kernel functions
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
Guodong Li, Ganesh Gopalakrishnan
MEMOCODE
2010
IEEE
8 years 1 months ago
A flexible schema for generating explanations in lazy theory propagation
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
Roberto Bruttomesso, Edgar Pek, Natasha Sharygina
CODES
2010
IEEE
8 years 1 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
ENTCS
2008
108views more  ENTCS 2008»
8 years 3 months ago
E-matching for Fun and Profit
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
Michal Moskal, Jakub Lopuszanski, Joseph R. Kiniry
CADE
2010
Springer
8 years 4 months ago
Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development
Abstract. Symbolic reasoning is in the core of many software development tools such as: bug-finders, test-case generators, and verifiers. Of renewed interest is the use of symbolic...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
CADE
2010
Springer
8 years 4 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
CADE
2007
Springer
9 years 3 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
CADE
2007
Springer
9 years 3 months ago
T-Decision by Decomposition
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
Maria Paola Bonacina, Mnacho Echenim
CADE
2008
Springer
9 years 3 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CADE
2008
Springer
9 years 3 months ago
Engineering DPLL(T) + Saturation
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
books