M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In TACAS'03, volume 2619 of LNCS, pages 18--33. Springer, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Specifying and Analyzing Early Requirements: Some.. - Fuxman, Liu.. (2003) (1 citation) (Correct)
....current state. To construct the model, IL2SMV adopts the synthesis algorithm for LTL specification provided by NUSMV. To handle the different facets of an FT specification, NUSMV has also been extended with new functionalities: for instance, the BMC engine has been extended with past operators [2], and a new more flexible interactive simulator has been added. 3.3. Heuristics for model construction and property verification The T Tool needs to build a finite state model from an infinite state specification. An upper bound of the number of class instances has to be specified in the FT ....
M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. In the 89;: Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
Hybrid Logics on Linear Structures: Expressivity and Complexity - Franceschet (2003) (3 citations) (Correct)
....PSPACE, on the contrary, cannot be reduced to SAT, unless NP = PSPACE. Techniques for embedding the model checking (and satisfiability) problem for linear time logics into SAT are described and implemented in [5, 9] These techniques have been recently extended to cope with past temporal operators [4]. 3.3 The linear time model checking problem Model checking is a generic term for a class of algorithms which determine whether a given formula holds in a given model or class of models. Often a Kripke structure denotes some computational system, and paths through the system denote computations. ....
M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
Shortest Counterexamples for Symbolic Model Checking of LTL.. - Schuppan, Biere (2005) (2 citations) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In TACAS'03, volume 2619 of LNCS, pages 18--33. Springer, 2003.
Shortest Counterexamples for Symbolic Model Checking of LTL.. - Schuppan, Biere (2005) (1 citation) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In TACAS'03, volume 2619 of LNCS, pages 18--33. Springer, 2003.
Incremental and Complete Bounded Model Checking for Full.. - Heljanko, Junttila, Latvala (2005) (Correct)
No context found.
Benedetti, M., Cimatti, A.: Bounded model checking for past LTL. In: Tools and Algorithms for Construction and Analysis of Systems. Volume 2619 of LNCS., Springer (2003) 18--33
Specifying and Analyzing Early Requirements: Some.. - Fuxman, Liu.. (2003) (1 citation) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. In the 9 Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
Specifying and Analyzing Early Requirements in Tropos - Fuxman, Liu, Mylopoulos.. (2003) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. In Proceedings of the on Tools and Algorithms for the Construction and Analysis of Systems, number 2619 in Lecture Notes in Computer Science, pages 18--33, Warsaw, Poland, April 2003. Springer.
Specifying and Analyzing Early Requirements in Tropos - Fuxman (2003) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. In Proceedings of the ### on Tools and Algorithms for the Construction and Analysis of Systems, number 2619 in Lecture Notes in Computer Science, pages 18--33, Warsaw, Poland, April 2003. Springer.
Specifying and Analyzing Early Requirements: Some.. - Ariel Fuxman Lin (2003) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. In the Int. Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2003.
Representing and Reasoning about Temporal Granularities - Combi, Franceschet, Peron (2004) (Correct)
No context found.
M. Benedetti and A. Cimatti. Bounded model checking for past LTL. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2619 of Lecture Notes in Computer Science, pp. 18--33. Springer, 2003.
Past is for Free: on the Complexity of Verifying Linear Temporal.. - Markey (2004) (5 citations) (Correct)
No context found.
Marco Benedetti and Alessandro Cimati. Bounded model checking for past LTL. In Proc. 9th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems (TACAS'2003) Warsaw, Poland, Apr. 2003, volume 2619 of Lecture Notes in Computer Science, pages 1833. Springer, 2003.
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