Sciweavers

58 search results - page 8 / 12
» Abstract DPLL and Abstract DPLL Modulo Theories
Sort
View
CADE
2010
Springer
13 years 8 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...
RTA
2007
Springer
14 years 1 months ago
A Simple Proof That Super-Consistency Implies Cut Elimination
Abstract. We give a simple and direct proof that super-consistency implies cut elimination in deduction modulo. This proof can be seen as a simplification of the proof that super-...
Gilles Dowek, Olivier Hermant
WOLLIC
2010
Springer
14 years 5 days ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
ITP
2010
163views Mathematics» more  ITP 2010»
13 years 11 months ago
Fast LCF-Style Proof Reconstruction for Z3
Abstract. The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of unsatisfiability. We present independent reconstruction of these proofs in the theorem provers...
Sascha Böhme, Tjark Weber
TOCL
2008
128views more  TOCL 2008»
13 years 7 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...