O. Burkart and J. Esparza. More infinite results. EATCS Bulletin, 62:138--159, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Infinite State Model Checking using Partial Evaluation and.. - Leuschel (Correct)
....should thus be covered by verification tools. 1 This probably explains why verification in general and model checking in particular has had little impact on standard software practice. For these reasons, there has recently been a considerable interest in enabling infinite model checking (e.g. [34, 35, 29, 30, 5, 16, 13, 31, 20]) This, by its very undecidable nature, is a daunting task, and no satisfactory solutions exist to that point. This research proposal aims at solving some of the intricate problems encountered during infinite model checking, by using technology that has been developed to tackle similar problems ....
....that abstract interpretation does not generally provide a decision procedure. Indeed, for infinite state systems in general, all non trivial properties are undecidable. So, either one has to try to find restricted classes of systems and properties for which decision procedures exist (see, e.g. [30, 5, 16]) and precise abstractions can be developed; or one has to accept that a model checker might be unable to establish a certain property or its negation. Anyway, this is the case in practice when using existing model checkers for complex finite state systems [35] Nonetheless, if a model checker ....
O. Burkart and J. Ezparza. More infinite results. In Proceedings of Infinity'96, 1996. Research Report MIP-9614, University of Passau.
A Taxonomy of Infinite State Processes - Moller (1998) (Correct)
....is that of model checking: determining if a property expressed in some temporal logic holds of a given automaton. Typically the logic in question is some subset of monadic second order logic, such as the modal calculus. To view the myriad of results, look to Burkart and Esparza s overview paper [6]. 17 ....
O. Burkart and Javier Esparza (1997). More infinite results. Proceedings of Infinity'97. Electronic Notes in Theoretical Computer Science 5.
An Algebra of Behavioural Types - Ravara, Resende, Vasconcelos (1999) (1 citation) (Correct)
....power comes from the substitution mechanisms (communication in this case) in calculi without communication it still makes sense to look for completeness. The study of image infinite (or infinite state) systems is a lively area of concurrency theory, with several important results established [4, 8, 12]. We focus our attention in two process algebras: BPA and BPP. BPA is the class of Basic Process Algebra of Bergstra and Klop [2] corresponding to the transition systems associated with Greibach Normal Form (GNF) contextfree grammars, in which only left most derivations are allowed. BPP is the ....
Olaf Burkart, and Javier Esparza. More infinite results. In Bulletin of the European Association for Theorectical Computer Science, volume 62, pages 138--159. 1997.
Completeness of Partial Deduction for Coverability Problems.. - Leuschel, Lehmann (2000) (Correct)
....systems cannot be modelled directly by a finite state system: as soon as some kind of recursion or sophisticated data structures come into play, an infinite number of states must be verified. For these reasons, there has recently been considerable interest in infinite model checking (e.g. [48, 51, 1, 37, 43, 6, 13, 9, 44, 24, 4, 12, 53]) This, by its very undecidable nature, is a daunting task, for which abstraction is a key issue [8] Indeed, abstraction allows one to approximate an infinite system by a finite one, and if proper care is taken the results obtained for the finite abstraction will be valid for the infinite ....
O. Burkart and J. Ezparza. More infinite results. In Proceedings of Infinity'96, 1996. Research Report MIP-9614, University of Passau.
Grammars as Processes - Esparza (2002) (2 citations) Self-citation (Esparza) (Correct)
No context found.
O. Burkart and J. Esparza. More infinite results. EATCS Bulletin, 62:138--159, 1997.
Global Model-Checking of Infinite-State Systems - Piterman, Vardi (Correct)
No context found.
O. Burkart and J. Esparza. More infinite results. ENTCS, 6, 1996.
Micro-Macro Stack Systems: A New Frontier of Elementary.. - Piterman, Vardi (Correct)
No context found.
O. Burkart and J. Esparza. More infinite results. In 1st Infinity, ENTCS, 6. Elsevier, 1996.
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