Sciweavers

127
Voted
CADE
2005
Springer
16 years 20 days ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
59
Voted
CADE
2005
Springer
16 years 20 days ago
Proving Properties of Incremental Merkle Trees
Mizuhito Ogawa, Eiichi Horita, Satoshi Ono
CADE
2005
Springer
16 years 20 days ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
91
Voted
CADE
2005
Springer
16 years 20 days ago
Well-Nested Context Unification
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Jordi Levy, Joachim Niehren, Mateu Villaret
92
Voted
CADE
2005
Springer
16 years 20 days ago
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures
Greta Yorsh, Neil Immerman, Shmuel Sagiv, Siddhart...
CADE
2005
Springer
16 years 20 days ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
99
Voted
CADE
2005
Springer
16 years 20 days ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
105
Voted
CADE
2005
Springer
16 years 20 days ago
Deciding Monodic Fragments by Temporal Resolution
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
Ullrich Hustadt, Boris Konev, Renate A. Schmidt
CADE
2005
Springer
16 years 20 days ago
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
Kaustuv Chaudhuri, Frank Pfenning
CADE
2005
Springer
16 years 20 days ago
Privacy-Sensitive Information Flow with JML
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
Guillaume Dufay, Amy P. Felty, Stan Matwin