Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. In Andrei Voronkov, editor, Computer-Aided Verification, CAV 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Preliminary Formal Analysis of TTA Startup - Rushby (2003) (Correct)
.... these can be encoded in PVS [ORSvH95] and formally verified by hand or with the aid of specialized libraries and strategies such as those of TAME [Arc00] or we could use a model checker for timed automata such as Kronos [BDM 98] or UP PAAL [LPY97] or an experimental encoding in SAL ICS [dMRS] Lonn [Lon99a,Lon99b] considers startup algorithms for TDMA systems similar to TTA and verifies one of them using UPPAAL [LP97] Lon99b, Chapter 9] Although a timed automaton model would be more realistic, we have chosen, in the interests of simplicity, to use a purely finite state model for ....
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. Submitted for publication.
Sal 2 - de Moura, Owre, Rueß, Rushby.. (2004) Self-citation (De moura Rue Sorea) (Correct)
No context found.
de Moura, L., Rue, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In Hunt, Jr., W.A., Somenzi, F., eds.: Computer-Aided Verification, CAV '2003. Volume 2725 of Lecture Notes in Computer Science., Boulder, CO, Springer-Verlag (2003) 14--26
The ICS Decision Procedures for Embedded Deduction - de Moura, Owre, Rueß.. (2004) (1 citation) Self-citation (De moura Rue) (Correct)
No context found.
L. de Moura, H. Rue, and M. Sorea. Bounded model checking and induction: From refutation to veri cation. LNCS, 2725:14-26, 2003.
Sal 2 - de Moura, Owre, Rueß, Rushby.. (2004) Self-citation (De moura Rue Sorea) (Correct)
No context found.
de Moura, L., Rue, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In Hunt, Jr., W.A., Somenzi, F., eds.: Computer-Aided Verification, CAV '2003. Volume 2725 of Lecture Notes in Computer Science., Boulder, CO, Springer-Verlag (2003) 14--26
Modeling and Verification of a Fault-Tolerant Real-time.. - Dutertre, Sorea (2004) (2 citations) Self-citation (Sorea) (Correct)
No context found.
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. In Andrei Voronkov, editor, Computer-Aided Verification, CAV 2003, volume 2725 of Lecture Notes in Computer Science, pages 14--26. SpringerVerlag, 2003.
Generating Efficient Test Sets with a Model Checker - Hamon, de Moura, Rushby (2004) Self-citation (De moura) (Correct)
No context found.
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. In Warren A. Hunt, Jr. and Fabio Somenzi, editors, Computer-Aided Verification, CAV '2003, pages 14--26, Boulder, CO, July 2003. Volume 2725 of Lecture Notes in Computer Science, Springer-Verlag.
Embedded Deduction with ICS - de Moura, Rue, Rushby, Shankar (2003) Self-citation (De moura Rue) (Correct)
....should be acyclic) k induction is a complete method for finite state systems. These results generalize from the finite to infinite state case when ICS is substituted for a SAT solver, and the method becomes complete for important classes of infinite state systems, such as timed automata [4]. Our Infinite BMC procedure built on ICS has been extended to perform k induction (with additional optimizations e.g. requiring that only the first state in a sequence may be an initial state) and to strengthen invariants (using the heuristic described earlier) Standard examples such as the ....
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. Submitted for publication.
Formal Verification of Time-Triggered Systems - Pike (2006) (Correct)
No context found.
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. In Andrei Voronkov, editor, Computer-Aided Verification, CAV 2003.
The Formal Verification of a Reintegration Protocol - Pike, Johnson (2005) (Correct)
No context found.
L. de Moura et al. Bounded model checking and induction: From refutation to verification. In CAV, volume 2725 of LNCS, 2003.
Incremental and Complete Bounded Model Checking for Full.. - Heljanko, Junttila, Latvala (2005) (Correct)
No context found.
de Moura, L.M., Rue, H., Sorea, M.: Bounded model checking and induction: From refutation to verification. In: CAV. Volume 2725 of LNCS., Springer (2003) 14--26
A Hints for Exercises - Exploring The Agreement (Correct)
No context found.
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. In Warren A. Hunt, Jr. and Fabio Somenzi, editors, Computer-Aided Verification, CAV '2003, volume 2725 of Lecture Notes in Computer Science, pages 14--26, Boulder, CO, July 2003. Springer-Verlag.
Technical Report SRI-CSL-03-05 - November Updated January (Correct)
No context found.
Leonardo de Moura, Harald Rue, and Maria Sorea. Bounded model checking and induction: From refutation to verification. In Warren A. Hunt, Jr. and Fabio Somenzi, editors, Computer-Aided Verification, 21 14--26, Boulder, CO, July 2003. Springer-Verlag.
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