Bjørner, N. S., Browne, A., Chang, E. S., Col' on, M., Kapur, A., Manna, Z., Sipma, H. B., and Uribe, T. E. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [4], pp. 415--418.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... the symbolic model checker HyTech and inferred, fully automatically, a more efficient timing of the protocol than the one used by Philips [HW95] Also in 1995, Daws and Yovine used the verification tool Kronos [DY95] to check automatically all the properties stated and handproved by Bosscher et al. In 1996, Bengtsson and his colleagues model checked the entire protocol, thus completing the quest of fully automating a human proof that as little as two years ago was considered far out of reach for algorithmic methods [BGK 96] ffl ISDN ISUP. The NewCoRe Project was the first full scale ....

....Computational Logic, Inc. Kestrel Institute, and ORA) that specialize in the use of formal methods and do contract work for industry and government agencies. Some companies, such as Praxis, use formal methods as a routine part of their development process. Finally, for further reading, see the April 1996 issue of IEEE Computer, which contains a roundtable discussion on formal methods, and the June 1996 issue of IEEE Spectrum, which gives an overview of model checking. On line forums include the net newsgroup, comp.specification, and its subnewgroups for specific methods; and the formal methods ....

N. Bjørner et al. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. of the 8th International Conference on Computer-Aided Verification, number 1102 in Lecture Notes in Computer Science, pages 415--418. Springer-Verlag, July 1996.

....p holds initially and is preserved by every transition) If these verification conditions can be proved assuming a set of properties S, we say that p is inductive relative to S. 3 STeP The Stanford Temporal Prover, STeP, is a tool for the deductive and algorithmic verification of reactive systems [8, 9, 11]. STeP implements verification rules and verification diagrams for deductive verification. A collection of decision procedures for built in theories, including integers, reals, datatypes and equality is combined with propositional and firstorder reasoning to simplify verification conditions, ....

Bjørner, N. S., Browne, A., Chang, E. S., Col' on, M., Kapur, A., Manna, Z., Sipma, H. B., and Uribe, T. E. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [4], pp. 415--418.

....Another property of this program is 1 bounded overtaking , namely, that each process can enter its critical section at most once before the other process does. The STeP (Stanford Temporal Prover) verification system translates programs such as bakery into the corresponding fair transition systems (Bj rner et al. 1996). To each process corresponds a control variable, which ranges over its distinct locations. The assertions i and m j indicate that control resides at locations i and j for each of the two processes. In Section 5, we show how accessibility can be checked for this program. local y 1 ; y 2 : ....

....decidable, verifying temporal properties of infinite state systems is undecidable in general. Other verification rules can be used to verify different classes of temporal formulas, ranging from safety to progress properties. These rules are implemented, for example, in the STeP verification system (Bj rner et al. 1996). Fix and Grumberg (1996) present a complete deductive system for the temporal verification of branching time temporal properties. Bradfield (1992) presents a deductive proof system for the modal calculus. These deductive methods are relatively complete and yield a direct proof of any valid ....

[Article contains additional citation context not shown here]

Bjørner, N., A. Browne, E. Chang, M. Col'on, A. Kapur, Z. Manna, H. Sipma, and T. Uribe. 1996. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification, Vol. 1102 of LNCS, 415--418. Springer-Verlag, July.

....are just, except for m 0 and 0 , which have no fairness requirements. Accessibility can be expressed in LTL by the formula : 0 ( 1 1 3 ) i.e. always if control is at 1 it will eventually reach 3 . The following describes the output of our DMC implementation based on the STeP system [ 2 ] . The splits are chosen by the user, but the underlying simplification and pruning are performed automatically. local y1 ; y2 : integer where y1 = y2 = 0 2 6 6 6 6 6 4 loop forever do 2 6 6 6 4 0 : noncritical 1 : y1 : y2 1 2 : await (y2 = 0 y1 y2) 3 : critical 4 : y1 : 0 3 7 7 ....

Bjørner, N., Browne, A., Chang, E., Col' on, M., Kapur, A., Manna, Z., Sipma, H., and Uribe, T. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification (July 1996), Springer-Verlag.

....verification conditions. 1 Introduction We present a procedure for proving the validity of first order formulas in the presence of decision procedures. Our procedure is motivated by formal verification, and shaped by the requirements of this problem domain. The Stanford Temporal Prover (STeP) [ 6 ] is a tool for the formal verification of reactive systems, including both hardware and software. Given a system description S, and a temporal specification to be proved for S, the deductive component of STeP generates verification conditions, first order formulas that, if valid, establish the ....

Bjørner, N. S., Browne, A., Chang, E. S., Col' on, M., Kapur, A., Manna, Z., Sipma, H. B., and Uribe, T. E. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 415--418.

No context found.

N.S. Bjørner, A. Browne, E. Chang, M. Col'on, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification, volume 1102 of LNCS, pages 415--418. Springer-Verlag, July 1996.

No context found.

N. S. Bjørner, A. Browne, E. Chang, M. Col'on, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification, volume 1102 of LNCS, pages 415--418. Springer-Verlag, July 1996.

....O( N kN ) N ) states. The state explosion problem limited the model checking verification in [ 9 ] to N = 3 stations with only k = 1 messages in a link. Contrary to model checking methods, deductive methods can handle infinitestate and parameterized systems. The Stanford Temporal Prover, STeP [ 3, 2 ] , provides a mechanized deductive framework for verifying linear time temporal properties of reactive and concurrent systems. We argue that the use of transition systems for system modeling, linear time temporal logic for requirements This research was supported in part by the National ....

Bjørner, N., Browne, A., Chang, E., Col' on, M., Kapur, A., Manna, Z., Sipma, H., and Uribe, T. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification (July 1996), vol. 1102 of LNCS, Springer-Verlag, pp. 415--418.

No context found.

N.S. Bjørner, A. Browne, E.S. Chang, M. Col'on, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [AH96], pages 415--418.

No context found.

N. Bjørner, A. Browne, E. Chang, M. Col'on, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Intl. Conference on Computer Aided Verification. Springer-Verlag, July 1996.

.... formulas, ranging from safety properties such as the mutual exclusion and bounded overtaking properties shown earlier, to progress properties, such as accessibility (Manna and Pnueli 1995) These rules are implemented, for example, in the STeP (Stanford Temporal Prover) verification system (Bj rner et al. 1996). Fix and Grumberg (1996) present a complete deductive system for the temporal verification of branching time temporal properties. Bradfield (1992) presents a deductive proof system for the modal calculus. These deductive methods are relatively complete and yield a direct proof of any valid ....

....to obtain subgoals that can be model checked, while the correctness of the abstraction is proved deductively. The PVS system (Owre et al. 1996) includes a decision procedure to model check propositional calculus expressions, which can appear as subgoals in a verification effort. The STeP system (Bj rner et al. 1996) uses deductive verification rules, but can also model check subgoals over the given system specification whenever possible. Pnueli and Shahar (1996) show how deductively obtained invariants can be used to constrain the BDD based symbolic model checking process. Finally, Graf and Saidi (1997) show ....

Bjørner, N. S., A. Browne, E. S. Chang, M. Col'on, A. Kapur, Z. Manna, H. B. Sipma, and T. E. Uribe. 1996. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger (Alur and Henzinger 1996), 415--418.

No context found.

N. Bjørner, A. Browne, E. Chang, M. Col'on, A. Kapur, Z. Manna, H. Sipma, and T. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Proc. 8 th Conference on Computer Aided Verification, 1996.

No context found.

N. Bjørner, A. Browne, E. Chang, M. Col'on, A. Kapur, Z. Manna, H. B. Sipma, and T. E. Uribe. STeP: Deductive-algorithmic verification of reactive and real-time systems. In Alur and Henzinger [AH96], pages 415--418.

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