Sciweavers

CADE
2012
Springer
12 years 1 months ago
Playing Hybrid Games with KeYmaera
We propose a new logic, called differential dynamic game logic (dDGL), that adds several game constructs on top of differential dynamic logic (dL) so that it can be used for hybr...
Jan-David Quesel, André Platzer
CADE
2012
Springer
12 years 1 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...
CADE
2012
Springer
12 years 1 months ago
EPR-Based Bounded Model Checking at Word Level
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
CADE
2012
Springer
12 years 1 months ago
Proving Non-looping Non-termination Automatically
We introduce a technique to prove non-termination of term rewrite systems automatically. Our technique improves over previous approaches substantially, as it can also detect non-lo...
Fabian Emmes, Tim Enger, Jürgen Giesl
CADE
2012
Springer
12 years 1 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur
CADE
2012
Springer
12 years 1 months ago
SPARQL Query Containment under RDFS Entailment Regime
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
Melisachew Wudage Chekol, Jérôme Euze...
CADE
2012
Springer
12 years 1 months ago
Taming Past LTL and Flat Counter Systems
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...
CADE
2012
Springer
12 years 1 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...