decision Procedure Research Papers - Academia.edu (original) (raw)

SAL (see http://sal.csl.sri.com) is an open suite of tools for analysis of state machines; it constitutes part of our vision for a Symbolic Analysis Laboratory that will eventually encompass SAL, the PVS verification system, the ICS... more

SAL (see http://sal.csl.sri.com) is an open suite of tools for analysis of state machines; it constitutes part of our vision for a Symbolic Analysis Laboratory that will eventually encompass SAL, the PVS verification system, the ICS decision procedures, and other tools developed in our group and elsewhere. SAL provides a language similar to that of PVS, but specialized for the specification of state machines; it was first released with an explicit-state model checker as SAL 1 in July 2002; SAL 2, which was released in December 2003, adds high-performance symbolic and bounded model checkers, and novel infinite bounded and witness model checkers. Both the bounded model checkers can additionally perform verification by k-induction, and the capabilities of all the model checkers and their components are available through an API that is scriptable in Scheme.

We present a unifying theory of fields with certain classes of analytic functions, called fields with analytic structure. Both real closed fields and Henselian valued fields are considered. For real closed fields with analytic structure,... more

We present a unifying theory of fields with certain classes of analytic functions, called fields with analytic structure. Both real closed fields and Henselian valued fields are considered. For real closed fields with analytic structure, o-minimality is shown. For Henselian valued fields, both the model theory and the analytic theory are developed. We give a list of examples that comprises,

We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines Boolean algebras of sets of uninterpreted elements (BA) and Presburger arithmetic operations (PA). BAPA can express the relationship between... more

We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines Boolean algebras of sets of uninterpreted elements (BA) and Presburger arithmetic operations (PA). BAPA can express the relationship between integer variables and ...

Effectively Propositional Logic (EPR), also known as the Bernays-Schoenfinkel class, allows encoding problems that are propositional in nature, but EPR encodings can be exponentially more succinct than purely propositional logic... more

Effectively Propositional Logic (EPR), also known as the Bernays-Schoenfinkel class, allows encoding problems that are propositional in nature, but EPR encodings can be exponentially more succinct than purely propositional logic encodings. We recently developed a DPLL-based decision procedure that builds on top of efficient SAT solving techniques to handle the propositional case efficiently while maintaining the succinctness offered by the

In a study of relocation decisions at seven different sites, procedural fairness was shown to be more sensitive to outcome fairness when respondents had less time to gather information about decision procedures. We interpret this finding... more

In a study of relocation decisions at seven different sites, procedural fairness was shown to be more sensitive to outcome fairness when respondents had less time to gather information about decision procedures. We interpret this finding to show that inaccessibility of information about decision procedures moderates the influence of outcome fairness judgments on procedural fairness judgments, such that outcome recipients

This article investigates the impact of the legislative powers of the European Parliament (EP), particularly the co-decision procedure. After explaining the development of the legislative procedures, the article analyses the extent to... more

This article investigates the impact of the legislative powers of the European Parliament (EP), particularly the co-decision procedure. After explaining the development of the legislative procedures, the article analyses the extent to which the different procedures have been used since their creation. It then considers how growing legislative power has affected the EP's internal development, how far the EP has been able to influence EU legislation, and whether EP involvement in legislation has enhanced or impeded the efficiency of the EU legislative process. The article concludes by considering possible areas for further reform of the EP's role in the EU's legislative system.

Two distinct extensions of temporal logic has been recently advocated in the literature. The first extension is the addition of fixpoint operators that enable the logic to make assertions about arbitrary regular events. The second... more

Two distinct extensions of temporal logic has been recently advocated in the literature. The first extension is the addition of fixpoint operators that enable the logic to make assertions about arbitrary regular events. The second extension is the addition of past temporal connectives that enables the logic to refer directly to the history of the computation. Both extensions are motivated by the desire to adapt temporal logic to modular, ie, compositional, verification (as opposed to global verification). We introduce and study ...

A central objective of the verifying compiler grand challenge is to develop a push-button verifier that generates proofs of correctness in a syntax-driven fashion similar to the way an ordinary compiler generates machine code. The... more

A central objective of the verifying compiler grand challenge is to develop a push-button verifier that generates proofs of correctness in a syntax-driven fashion similar to the way an ordinary compiler generates machine code. The software developer’s role is then to provide suitable specifications and annotated code, but otherwise to have no direct involvement in the verification step. However, the

We describe a formal specification and verification in PVS for the general theory of SRT division, and for the hardware design of a specific implementation. The specification demonstrates how attributes of the PVS language (in particular,... more

We describe a formal specification and verification in PVS for the general theory of SRT division, and for the hardware design of a specific implementation. The specification demonstrates how attributes of the PVS language (in particular, predicate subtypes) allow the general theory to be developed in a readable manner that is similar to textbook presentations, while the PVS table construct allows direct specification of the implementation's quotient look-up table. Verification of the derivations in the SRT theory and for the data path and look-up table of the implementation are highly automated and performed for arbitrary, but finite precision; in addition, the theory is verified for general radix, while the implementation is specialized to radix 4. The effectiveness of the automation derives from PVS's tight integration of rewriting with decision procedures for equality, linear arithmetic over integers and rationals, and propositional logic. This example demonstrates that the resources of an expressive specification language and of a general-purpose theorem prover are not inimical to highly automated verification in this domain, and can contribute to clarity, generality, and reuse.

This paper shows how to achieve, under certain conditions, abstract-interpretation algorithms that enjoy the best possible precision for a given abstraction. The key idea is a simple process of successive approximation that makes repeated... more

This paper shows how to achieve, under certain conditions, abstract-interpretation algorithms that enjoy the best possible precision for a given abstraction. The key idea is a simple process of successive approximation that makes repeated calls to a decision proce- dure, and obtains the best abstract value for a set of concrete stores that are represented symbolically, using a logical formula.