Sciweavers

CADE
2012
Springer
12 years 2 months ago
Combination of Disjoint Theories: Beyond Decidability
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...
Pascal Fontaine, Stephan Merz, Christoph Weidenbac...
ICTAC
2009
Springer
13 years 10 months ago
GSPeeDI - A Verification Tool for Generalized Polygonal Hybrid Systems
The GSPeeDI tool implements a decision procedure for the reachability analysis of GSPDIs, planar hybrid systems whose dynamics is given by differential inclusions, and that are not...
Hallstein Asheim Hansen, Gerardo Schneider
KBSE
2010
IEEE
13 years 11 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
CONCUR
2010
Springer
13 years 11 months ago
On the Use of Non-deterministic Automata for Presburger Arithmetic
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
Antoine Durand-Gasselin, Peter Habermehl
DKE
2007
136views more  DKE 2007»
14 years 15 days ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda
ENTCS
2006
124views more  ENTCS 2006»
14 years 16 days ago
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
Shuvendu K. Lahiri, Madanlal Musuvathi
ENTCS
2006
161views more  ENTCS 2006»
14 years 16 days ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...
IANDC
2008
116views more  IANDC 2008»
14 years 17 days ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
IJCAI
2001
14 years 1 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
CSL
2008
Springer
14 years 2 months ago
Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
Ruzica Piskac, Viktor Kuncak