Bjørner, N. S., Stickel, M. E., and Uribe, T. E. A practical integration of first-order reasoning and decision procedures. In Proc. of the 14 th Intl. Conference on Automated Deduction (July 1997), vol. 1249 of LNCS, Springer-Verlag, pp. 101-- 115.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....they use instances that can be provided by the decision procedures themselves. Accordingly, an integration of first order reasoning and decision procedures was developed that can automatically discharge many verification conditions that would otherwise require the use of the interactive prover [12]. To enable symbolic manipulation of first order formulas in the theory of real closed fields, we are planning to integrate STeP with redlog [13] a package that forms a front end to the computer algebra system reduce [14] Some of the verification conditions generated by the case studies reported ....

Bjørner, N. S., Stickel, M. E., and Uribe, T. E. A practical integration of first-order reasoning and decision procedures. In Proc. of the 14 th Intl. Conference on Automated Deduction (July 1997), vol. 1249 of LNCS, Springer-Verlag, pp. 101-- 115.

....Prover, STeP [2] a system that supports the computer aided verification of reactive, real time and hybrid systems based on temporal specification. The integration of our decision procedure with STeP First Order Reasoning and STeP s other decision procedures is done using the method described in [3]. Work partially supported by the C.N.R. of Italy, coordinated project SETA, by M.U.R.S.T. Project Tecniche speciali per la specifica, l analisi, la verifica, la sintesi e la trasformazione di programmi , and by project Deduction in Set Theory: A Tool for Software Verification under the 1998 ....

....that if a literal t 6 ; occurs in a branch , then it is enough to require that x Gamma t occurs in for some x, thus obtaining the linear fulfilling rule t 6 ; x Gamma t (x new parameter) This improvement will be used in Example 1. More generally, one can maintain a transitivity graph [3] whose nodes are labeled with terms in P [ T and edges are labeled with v, 6 or 6 . Then, if a literal t 1 6 t 2 occurs in a branch , we may check whether there exists a path from t 1 to t 2 (or from t 2 to t 1 ) with edges labeled with v, and the fulfilling rule would then be: t 1 6 t 2 ....

Nikolaj S. Bjørner, Mark E. Stickel, and Tom'as E. Uribe. A practical integration of firstorder reasoning and decision procedures. In Proc. of the 14 th Intl. Conference on Automated Deduction, volume 1249 of LNCS, pages 101--115. Springer-Verlag, July 1997.

....above decision procedures check validity of ground formulas, where no first order quantification is present. STeP extends this combination of ground decision procedures to include theory specific unification algorithms, which find quantifier instantiations needed for first order validity checking [BSU97] As mentioned in Section 3.2, an interactive Gentzen style theorem prover is available as part of the Proof Editor to establish verification conditions that are not proved automatically. 6 Case Study: Steam boiler The incorporation of modularity and abstraction in STeP has enabled us to analyze ....

N.S. Bjørner, M.E. Stickel, and T.E. Uribe. A practical integration of first-order reasoning and decision procedures. In Proc. of the 14 th Intl. Conference on Automated Deduction, vol. 1249 of LNCS, pages 101--115. Springer-Verlag, July 1997.

....finite state and parameterized systems. STeP even supports a diagram based deductive model checking procedure [SUM96] which can verify infinite state systems using STeP s deductive tools. The deductive verification methods are based on checking the validity of first order verification conditions [BSU97] which arise from applications of proof rules. To verify industrial hardware designs, we are developing a compiler from the Verilog hardware description language to fair transition systems, which are STeP s computational model. Since bit vectors are pervasive in Verilog we have found it useful to ....

Nikolaj S. Bjørner, Mark E. Stickel, and Tom'as E. Uribe. A practical integration of first-order reasoning and decision procedures. In Proc. of the 14 th Intl. Conference on Automated Deduction, volume 1249 of LNCS, pages 101--115. Springer-Verlag, July 1997.

....decision procedures for datatypes, partial orders, linear arithmetic, congruence closure and bit vectors. They are integrated into a general validity checker that is complete for ground formulas, relative to the power of the decision procedures, and can be applied to first order formulas as well [BSU97] STeP also includes explicit state and symbolic LTL model checking for fair transition systems. We have tested our implementation on a few examples, including two mutual exclusion algorithms and two data communication protocols. All of these examples are infinite state: they contain variables ....

N.S. Bjørner, M.E. Stickel, and T.E. Uribe. A practical integration of firstorder reasoning and decision procedures. In 14 th Intl. Conf. on Automated Deduction, vol. 1249 of LNCS, pages 101--115. Springer-Verlag, July 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC