Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: CAV. (2001) Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Interface Compatibility Checking for Software Modules - Chakrabarti, de Alfaro.. (2002) (6 citations) (Correct)
....state transitions. An interface program is an abstraction of the code implementing a method and must be provided by the software designer. We represent interface programs by ow graphs, whose nodes represent control locations and whose edges are labeled with instructions, including method calls [10]. Nondeterministic branching is allowed and can be the result of abstraction. More formally, for a set X of typed variables and a set M of methods, an interface program P = L; E; a; over X and M is a labeled graph, consisting of the following: A nite set L of program locations. Every ....
.... the choice, when an external method is called, to call back any sequence of local methods; the interface has the choice, when executing a local method l, to pursue any path in the nondeterministic interface program P (l) As mutually recursive procedures are naturally modeled as pushdown systems [10], we need pushdown games, with the two players Interface and Environment. Given a stateful SM interface F = X; M ; P ; A; B) a local method m 0 2 M , and an interface state s 0 2 S, we de ne the following pushdown game G(F; m 0 ; s 0 ) Q; c 0 ; 7 First, for every ....
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Computer-Aided Veri cation, LNCS 2102, pp. 324-336. Springer, 2001.
Pushdown Timed Automata: a Binary Reachability Characterization.. - Dang (2003) (Correct)
....real time programs containing finite state variables against safety properties containing linear constraints over dense clocks and stack word counts. This tool will be a good complement to available tools for recursive finite state programs (for regular safety properties, e.g. termination) [7, 23]. On the other hand, the pattern technique is not intended to replace the traditional region based technique used in the existing tools analyzing realtime systems (such as UPPAAL [30] and its extensions [31] TREX [31] HyTECH [26] Kronos [11] In fact, the pattern technique is also a good ....
J. Esparza and S. Schwoon, "A BDD-based model-checker for recursive programs," CAV'01,
The Existence of omega-Chains for Transitive Mixed Linear.. - Dang, Ibarra (Correct)
....from Theorem 5, that the system, a discrete timed automaton augmented with two monotonic (and hence reversal bounded) counters t 1 and t 2 , is a mixed linear counter system. 6.2. Timed pushdown systems There has been much interesting work on various veri cation problems for pushdown systems [4, 5, 6, 9, 10, 11, 13, 14]. Studying pushdown systems is important, since they are directly related to recursive programs and processes. In this subsection, we will study pushdown systems with discrete clocks and reversal bounded counters. Safety veri cation for these systems is discussed in [10] Here, we investigate the ....
J. Esparza and S. Schwoon, \A BDD-based model-checker for recursive programs," in CAV'01, Proc. 13th Intl. Conf. on Computer Aided Veri cation, eds. G. Berry, H. Comon and A. Finkel (Springer, Berlin, 2001) pp. 324-336.
Model-Checking LTL with Regular Valuations for Pushdown.. - Schwoon, Esparza, Kucera (2001) (Correct)
.... location (which stores global information about the program) and stack content (which keeps the track of activation records, i.e. previously called procedures and their local variables) Previous research has established applications of pushdown systems for the analysis of Boolean Programs [1, 8] and certain data now analysis problems [7] The model checking problem has been considered for various logics, and quite efEcient algorithms have emerged for linear time logics [2, 6, 9] In this paper we revisit the model checking problem for LTL and pushdown systems. Generally speaking, the ....
....representing the regular predicates used in the formula. Since both take the same asymptotic time it would be interesting to compare their efiency in practice (for cases where both techniques can be used) The solution can be seamlessly combined with the concept of symbolic pushdown systems in [8]. These are used to achieve a succinct representation of Boolean Programs, i.e. programs with (recursive) procedures in which all variables are boolean. The ability to represent data is a distinct advantage over the approaches hitherto made in our areas of application, namely data ow analysis ....
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV'01, LNCS 2102, pages 324-336. Springer, 2001.
Pushdown Timed Automata: a Binary Reachability Characterization.. - Dang (2003) (Correct)
....real time programs containing finite state variables against safety properties containing linear constraints over dense clocks and stack word counts. This tool will be a good complement to available tools for recursive finite state programs (for regular safety properties, e.g. termination) [22, 7]. On the other hand, for the existing tools analyzing real time systems (such as UPPAAL [30] and its extensions [31] TREX [31] HyTECH [26] Kronos [11] the traditional region based technique used in the tools may be enhanced with the pattern technique. Doing this makes it possible for the ....
J. Esparza and S. Schwoon, "A BDD-based model-checker for recursive programs," CAV'01, LNCS 2102, pp. 324-336
Model-Checking LTL with Regular Valuations for Pushdown.. - Esparza, Kucera, Schwoon (5 citations) Self-citation (Esparza Schwoon) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV'01, LNCS 2102, pages 324--336. Springer, 2001.
Model-Checking LTL with Regular Valuations for Pushdown.. - Esparza, Kucera, Schwoon (2002) (5 citations) Self-citation (Esparza Schwoon) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV'01, LNCS 2102, pages 324--336. Springer, 2001. 23
Model-Checking LTL with Regular Valuations for Pushdown.. - Schwoon, Esparza, Kucera (2001) Self-citation (Esparza Schwoon) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV'01, LNCS 2102, pages 324--336. Springer, 2001.
Formal verification of Sequential Systems with Infinitely Many.. - Obdrzalek (2001) Self-citation (Schwoon) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In CAV: International Conference on Computer Aided Verification, 2001. (to appear).
Verifying Concurrent Message-Passing - Programs With Recursive (Correct)
No context found.
Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: CAV. (2001)
Improving Pushdown System Model Checking - Akash Lal And (Correct)
No context found.
Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: CAV. (2001)
Improving Pushdown System Model Checking - Akash Lal And (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In CAV, pages 324--336, 2001.
Extended Weighted Pushdown Systems - Akash Lal Thomas (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Proc. CAV'01, LNCS 2102, pages 324--336. Springer-Verlag, 2001.
Over-Approximating Boolean Programs with Unbounded Thread.. - Cook, Kroening, al. (Correct)
No context found.
J. Esparza and S. Schwoon, "A BDD-based model checker for recursive programs," in CAV, ser. LNCS 2102. Springer, 2001, pp. 324--336.
Symbolic Model Checking for Asynchronous Boolean Programs - Cook, Kroening, Sharygina (2005) (Correct)
No context found.
Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: CAV. LNCS 2102, Springer-Verlag (2001) 324--336
Liveness Checking as Safety Checking for Infinite State Spaces - Schuppan, Biere (2005) (1 citation) (Correct)
No context found.
Esparza, J. and S. Schwoon, A BDD-based model checker for recursive programs, in: G. Berry, H. Comon and A. Finkel, editors, CAV'01, LNCS 2102 (2001), pp. 324--336.
Liveness Checking as Safety Checking for Infinite State Spaces - Schuppan, Biere (2005) (1 citation) (Correct)
No context found.
Esparza, J. and S. Schwoon, A BDD-based model checker for recursive programs, in: G. Berry, H. Comon and A. Finkel, editors, CAV'01, LNCS 2102 (2001), pp. 324--336.
Formal Methods Research at SICS and KTH: An Overview - Dam, Fredlund, Gurov (2003) (Correct)
No context found.
Esparza, J. and S. Schwoon, A BDD-based model checker for recursive programs, in: Proc. of CAV'01, Lecture Notes in Computer Science 2102 (2001), pp. 324--336.
Summarizing Procedures in Concurrent Programs - Qadeer, Rajamani, Rehof (2004) (2 citations) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In CAV 01: Computer Aided Verficiation, LNCS 2102, pages 324--336. Springer-Verlag, 2001.
Model Checking Java Using Pushdown Systems - Obdrzálek (2002) (1 citation) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In CAV: International Conference on Computer Aided Veri cation, volume 2102 of Lecture Notes in Computer Science, pages 324-336. Springer-Verlag, 2001.
Generation of All Counter-Examples for Push-Down Systems - Basu, Saha, Lin, Smolka (2003) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In 13th International ConferenceComputer Aided Verification, pages 324--336.Springer-Verlag, 2001.
Model Checking of Multi-Applet JavaCard Applications - Chugunov, Fredlund, Gurov (2002) (3 citations) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Lecture Notes in Computer Science, 2102:324-336, 2001.
Guaranteeing Correctness Properties of a Java Card Applet - Fredlund (2003) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Lecture Notes in Computer Science, 2102:324--336, 2001.
Global Model-Checking of Infinite-State Systems - Piterman, Vardi (Correct)
No context found.
J. Esparza and S. Schwoon. A bdd-based model checker for recursive programs. In 13th CAV, LNCS 2102, 324--336, 2001. Springer.
Interface Compatibility Checking for Software Modules - Chakrabarti, de Alfaro.. (2002) (6 citations) (Correct)
No context found.
J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. Computer-Aided Verification, LNCS 2102, pp. 324--336. Springer, 2001.
First 50 documents
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