Results 1 - 10 of 383

Simplify: A theorem prover for program checking

by David Detlefs, Greg Nelson, James B. Saxe - J. ACM , 2003
"... This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify uses the Nelson-Oppen method to combine decision procedures for several important theories, and also employs a matcher to ..."
Abstract - Cited by 431 (2 self) - Add to MetaCart
This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula-3. Simplify uses the Nelson-Oppen method to combine decision procedures for several important theories, and also employs a matcher

How to eliminate illusions in quantified reasoning

by Yingrui Yang, P. N. Johnson-laird - Memory & Cognition , 2000
"... The mental model theory postulates that reasoners build models of situations described in premises. These models normally make explicit only what is true according to the premises. The theory has an unexpected consequence. It predicts the existence of illusions in inferences: Certain inferences shou ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
The mental model theory postulates that reasoners build models of situations described in premises. These models normally make explicit only what is true according to the premises. The theory has an unexpected consequence. It predicts the existence of illusions in inferences: Certain inferences

Random Walks in Peer-to-Peer Networks

by Christos Gkantsidis , Milena Mihail, Amin Saberi , 2004
"... We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. For searching, we argue that random walks achieve improvement over flooding in the case of clustered overlay topologies and in the case of re-issuing the same request several tim ..."
Abstract - Cited by 226 (3 self) - Add to MetaCart
properties similar to independent sampling (if the second eigenvalue of the transition matrix is bounded away from 1, which translates to good expansion of the network; such connectivity is desired, and believed to hold, in every reasonable network and network model). This property has been previously used

Reasoning about Noisy Sensors and Effectors in the Situation Calculus

by Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque , 2008
"... Agents interacting with an incompletely known world need to be able to reason about the effects of their actions, and to gain further information about that world they need to use sensors of some sort. Unfortunately, both the effects of actions and the information returned from sensors are subject t ..."
Abstract - Cited by 81 (5 self) - Add to MetaCart
Agents interacting with an incompletely known world need to be able to reason about the effects of their actions, and to gain further information about that world they need to use sensors of some sort. Unfortunately, both the effects of actions and the information returned from sensors are subject

Binary clause reasoning in QBF

by Horst Samulowitz, Fahiem Bacchus - In Proc. of SAT , 2006
"... Abstract. Binary clause reasoning has found some successful applications in SAT, and it is natural to investigate its use in various extensions of SAT. In this paper we investigate the use of binary clause reasoning in the context of solving Quantified Boolean Formulas (QBF). We develop a DPLL based ..."
Abstract - Cited by 23 (2 self) - Add to MetaCart
Abstract. Binary clause reasoning has found some successful applications in SAT, and it is natural to investigate its use in various extensions of SAT. In this paper we investigate the use of binary clause reasoning in the context of solving Quantified Boolean Formulas (QBF). We develop a DPLL

The HORNE Reasoning System

by Alan M. Frisch , 1984
"... HORNE is a programming system that offers a set of tools for building automated reasoning systems. It offers three major modes of inference:--a horn clause theorem prover (backwards chaining mechanism):-- a forward chaining mechanism; and-- a mechanism for restricting the range of variables with arb ..."
Abstract - Add to MetaCart
theory that allows-intersecting types; 2) full reasoning about equality between ground terms, and limited equality reasoning for quantified terms; and 3) escapes into LISP for use as necessary. This paper contains an introduction to each of these

A New Approach to Abstract Syntax Involving Binders

by Murdoch Gabbay, Andrew Pitts - In 14th Annual Symposium on Logic in Computer Science , 1999
"... Syntax Involving Binders Murdoch Gabbay Cambridge University DPMMS Cambridge CB2 1SB, UK M.J.Gabbay@cantab.com Andrew Pitts Cambridge University Computer Laboratory Cambridge CB2 3QG, UK ap@cl.cam.ac.uk Abstract The Fraenkel-Mostowski permutation model of set theory with atoms (FM-sets) ..."
Abstract - Cited by 177 (20 self) - Add to MetaCart
-sets) can serve as the semantic basis of meta-logics for specifying and reasoning about formal systems involving name binding, ff-conversion, capture avoiding substitution, and so on. We show that in FM-set theory one can express statements quantifying over `fresh' names and we use this to give a novel

Complete instantiation for quantified formulas in Satisfiabiliby Modulo Theories

by Yeting Ge, Leonardo De Moura
"... Abstract. Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas based on heuristics, which is not refutationally complete even for pure first-order logic. We present several ..."
Abstract - Cited by 50 (2 self) - Add to MetaCart
Abstract. Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas based on heuristics, which is not refutationally complete even for pure first-order logic. We present

On Complete Reasoning about Axiomatic Specifications

by Swen Jacobs, Viktor Kuncak
"... Automated software verification tools typically accept specifications of functions in terms of pre- and postconditions. However, many properties of functional programs can be more naturally specified using a more general form of universally quantified properties. Such general specifications may rel ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
relate multiple user-defined functions, and compare multiple invocations of a function on different arguments. We present new decision procedures for complete and terminating reasoning about such universally quantified properties of functional programs. Our results use local theory extension methodology

Solving quantified verification conditions using satisfiability modulo theories

by Yeting Ge, Clark Barrett, Cesare Tinelli - In CADE , 2007
"... 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 order automated theorem proving (ATP) and automated theorem proving based on satisfiability modulo theories (SMT). Trad ..."
Abstract - Cited by 51 (7 self) - Add to MetaCart
). Traditional ATP systems are designed to handle quantifiers easily, but often have difficulty reasoning with respect to theories. SMT systems, on the other hand, have built-in support for many useful theories, but have a much more difficult time with quantifiers. One clue on how to get the best of both worlds
Results 1 - 10 of 383