Results 1  10
of
159
Experience with Predicate Abstraction
 IN COMPUTER AIDED VERIFICATION
, 1999
"... This reports some experiences with a recentlyimplemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version o ..."
Abstract

Cited by 144 (6 self)
 Add to MetaCart
This reports some experiences with a recentlyimplemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version of our MurOE protocol description language). The system makes use of two libraries: SVC [1] (an efficient decision procedure for quantifierfree firstorder logic) and the CMU BDD library. The use of these libraries increases the scope of problems that can be handled by predicate abstraction through increased efficiency, especially in SVC, which is typically called thousands of times. The verification system also provides limited support for quantifiers in formulas. The system ...
Inductive Decidability Using Implicit Induction
"... Abstract. Decision procedures are widely used in automated reasoning tools in order to reason about data structures. In applications, many conjectures fall outside the theory handled by a decision procedure. Often, reasoning about userdefined functions on those data structures is needed. For this, ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
in this paper significantly extends the results of Kapur & Subramaniam (CADE, 2000) [15], which were obtained using explicit induction schemes. Firstly, nonlinear conjectures can be decided automatically. Secondly, function definitions can use other defined functions in their definitions, thus allowing
Predicting Failures of and Repairing Inductive Proof Attempts ∗
"... Abstract Inductive reasoning is critical for ensuring reliability of computational descriptions, especially of algorithms defined on recursive data structures. Despite advances made in automating inductive reasoning, proof attempts by theorem provers frequently fail while performing inductive reason ..."
Abstract
 Add to MetaCart
Abstract Inductive reasoning is critical for ensuring reliability of computational descriptions, especially of algorithms defined on recursive data structures. Despite advances made in automating inductive reasoning, proof attempts by theorem provers frequently fail while performing inductive reasoning. A user of such a system must scrutinize a failed proof attempt and do intensive debugging to understand the cause of failure, and then provide additional information to make a failed proof attempt succeed. A method for predicting a priori failure of proof attempts by induction is proposed. It is based on analyzing the definitions of function symbols appearing in a conjecture. Further, failure analysis is shown to provide information that can be used to make those proof attempts succeed for valid conjectures. The failure of proof attempts could be because of a number of reasons even when a conjecture is believed to be valid. It might be that an induction scheme used in a proof attempt is not powerful enough to yield useful induction hypotheses which can be applied effectively. Or, even when induction hypotheses are applicable, the proof attempt might not succeed because of missing lemmas. A method for speculating intermediate lemmas which can make induction hypotheses applicable and/or lead to simplification obtaining validity is proposed. The analysis can be automated and is illustrated on several examples. A preliminary implementation demonstrates the effectiveness of the proposed approach. 1
SCDBR: An Automated Reasoner for Specifications of Database Updates
, 1998
"... In this paper we describe SCDBR, a system that is able to reason automatically from specifications of database updates written in the situation calculus, a firstorder language originally proposed by John McCarthy for reasoning about actions and change. The specifications handled by the system are ..."
Abstract

Cited by 17 (11 self)
 Add to MetaCart
In this paper we describe SCDBR, a system that is able to reason automatically from specifications of database updates written in the situation calculus, a firstorder language originally proposed by John McCarthy for reasoning about actions and change. The specifications handled by the system are written in the formalism proposed by Ray Reiter for solving the frame problem that appears when one expresses the effects on the database predicates of the execution of atomic transactions. SCDBR is written in PROLOG, and can solve several reasoning tasks, among others, it is able to derive the final specification from effect axioms, to answer queries to virtually updated databases, to check legality of transactions, to prove integrity constraints from the specification, to modify the specification in order to embed a desired integrity constraint, and to answer historical queries. For some of these tasks SCDBR can call other systems, like relational database systems, automated theorem provers, and constraint solvers.
[] or SUCCESS is Not Enough: Current Technology and Future Directions in Proof Presentation (Extended Abstract)
, 2001
"... Johann Schumann, RIACS / NASA Ames Peter Robinson, QSS / NASA Ames M/S 2692, Moffett Field 94035, CA, U.S.A. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Johann Schumann, RIACS / NASA Ames Peter Robinson, QSS / NASA Ames M/S 2692, Moffett Field 94035, CA, U.S.A.
Solving Linear Equations Over Polynomial Semirings
 RUTGER UNIVERSITY (NJ
"... We consider the problem of solving linear equations over various semirings. In particular, solving of linear equations over polynomial rings with the additional restriction that the solutions must have only nonnegative coefficients is shown to be undecidable. Applications to undecidability proofs o ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We consider the problem of solving linear equations over various semirings. In particular, solving of linear equations over polynomial rings with the additional restriction that the solutions must have only nonnegative coefficients is shown to be undecidable. Applications to undecidability proofs of several unification problems are illustrated, one of which, unification modulo one associativecommutative function and one endomorphism, has been a longstanding open problem. The problem of solving multiset constraints is also shown to be undecidable.
Automating Proofs of Integrity Constraints in Situation Calculus
 In Foundations of Intelligent Systems. Proc. Ninth International Symposium on Methodologies for Intelligent Systems (ISMIS'96
, 1996
"... . Automated support for proving integrity constraints (ICs) on deductive database update specifications is developed using an induction theorem prover, Rewrite Rule Laboratory (RRL) [6]. The approach proposed by Reiter [9, 11, 10] for solving the frame problem for such applications in a language of ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
. Automated support for proving integrity constraints (ICs) on deductive database update specifications is developed using an induction theorem prover, Rewrite Rule Laboratory (RRL) [6]. The approach proposed by Reiter [9, 11, 10] for solving the frame problem for such applications in a language of the situation calculus is used as a basic framework. Integrity constraints are propositions that are expected to be true in every accessible state of a database, and they should be provable from the specification of the evolution of the database. Accessible states are defined by induction [12] as those reachable from the initial state by update actions whose execution is possible. Induction theorem provers can only reason about quantifierfree formulas (i.e., universally quantified formulas) whereas in order to express integrity constraints, quantifiers may be used. It is shown that by making use of the fact that in relational data base applications, domain of objects under consideration is ...
An Overview of the Tecton Proof System
, 1992
"... The Tecton Proof System is an experimental tool for constructing proofs of first order logic formulas and of program specifications expressed using formulas in Hoare's axiomatic proof formalism. It is designed to make interactive proof construction easier than with previous proof tools, by m ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
The Tecton Proof System is an experimental tool for constructing proofs of first order logic formulas and of program specifications expressed using formulas in Hoare's axiomatic proof formalism. It is designed to make interactive proof construction easier than with previous proof tools, by maintaining multiple proof attempts internally in a structured form called a proof forest; displaying them in an easy to comprehend form, using a combination of tabular formats, graphical representations, and hypertext links; and automating substantial parts of proofs through rewriting, induction, case analysis, and generalization inference mechanisms, along with a linear arithmetic decision procedure. Further development of the system is planned as part of an overall framework aimed at supporting the kind of abstractions and specializations necessary for building libraries of generic software and hardware components. Partially supported by National Science Foundation Grants CCR8906678...
Interaction with the BoyerMoore Theorem Prover: A Tutorial Study Using the ArithmeticGeometric Mean Theorem
, 1994
"... ..."
Summarizing Developer Work History Using Time Series Segmentation ABSTRACT [Challenge Report]
"... Temporal segmentation partitions time series data with the intent of producing more homogeneous segments. It is a technique used to preprocess data so that subsequent time series analysis on individual segments can detect trends that may not be evident when performing time series analysis on the ent ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Temporal segmentation partitions time series data with the intent of producing more homogeneous segments. It is a technique used to preprocess data so that subsequent time series analysis on individual segments can detect trends that may not be evident when performing time series analysis on the entire dataset. This technique allows data miners to partition a large dataset without making any assumption of periodicity or any other a priori knowledge of the dataset’s features. We investigate the insights that can be gained from the application of time series segmentation to software version repositories. Software version repositories from large projects contain on the order of hundreds of thousands of timestamped entries or more. It is a continuing challenge to aggregate such data so that noise is reduced and important characteristics are brought out. In this paper, we present a way to summarize developer work history in terms of the files they have modified over time by segmenting the CVS change data of individual Eclipse developers. We show that the files they modify tends to change significantly over time though most of them tend to work within the same directories.
Results 1  10
of
159