Model checking the full modal mu-calculus for infinite sequential processes

Burkart, Olaf; Steffen, Bernhard

doi:10.1007/3-540-63165-8_198

Cited by 38 publications

(25 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our program models can alternatively be cast in terms of contextfree processes; for these there exist algorithmic verification techniques w.r.t. modal µ-calculus specifications [4]. The development of our program model follows earlier work by Jensen et al [11] which addresses security properties expressible as stack invariants.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Compositional Verification of Secure Applet Interactions

Barthe

Gurov²,

Huisman

2002

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. Recent developments in mobile code and embedded systems have led to an increased interest in open platforms, i.e. platforms which enable different applications to interact in a dynamic environment. However, the flexibility of open platforms presents major difficulties for the (formal) verification of secure interaction between the different applications. To overcome these difficulties, compositional verification techniques are required. This paper presents a compositional approach to the specification and verification of secure applet interactions. This approach involves a compositional model of the interface behavior of applet interactions, a temporal logic property specification language, and a proof system for proving correctness of property decompositions. The usability of the approach is demonstrated on a realistic smartcard case study.

show abstract

Section: Discussionmentioning

confidence: 99%

“…The problem of verifying the local properties is not addressed here, since there are standard algorithmic techniques for this (see e.g. [4]). Our framework for compositional verification consists of:…”

Section: Introductionmentioning

confidence: 99%

Compositional Verification of Secure Applet Interactions

Barthe

Gurov²,

Huisman

2002

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…The most powerful result so far is an exponential-time algorithm by Burkart for model checking formulas of the -calculus with respect to prefix-recognizable graphs [Bur97b]. See also [BCMS00,BE96,BEM97,BS99b,Bur97a,FWW97].…”

Section: Introductionmentioning

confidence: 99%

An Automata-Theoretic Approach to Reasoning about Infinite-State Systems

Kupferman

Vardi

2000

Computer Aided Verification

View full text Add to dashboard Cite

Abstract.We develop an automata-theoretic framework for reasoning about infinitestate sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal property can then be done by an alternating two-way tree automaton that navigates through the tree. As has been the case with finite-state systems, the automatatheoretic framework is quite versatile. We demonstrate it by solving several versions of the model-checking problem for § -calculus specifications and prefixrecognizable systems, and by solving the realizability and synthesis problems for § -calculus specifications with respect to prefix-recognizable environments.

show abstract

“…Reversal does not increase the size, and due to the determinism of . The algorithm of Burkart and Steffen [3], applied to CTLB formulae which are in the second level of the alternation hierarchy, would yield an algorithm which is cubic in t¥ Ê t . On the other hand, the performance of our algorithm in terms of the formula is less clear.…”

Section: Model-checking Ctlmentioning

confidence: 99%

Model-Checking LTL with Regular Valuations for Pushdown Systems

Esparza

Kučera²,

Schwoon

2001

Lecture Notes in Computer Science

108

View full text Add to dashboard Cite

:Recent works have proposed pushdown systems as a tool for analyzing programs with (recursive) procedures. In particular, the model-checking problem for LTL has been studied. In this paper we examine an extension of this, namely model-checking with regular valuations. The problem is solved via two different techniques, with an eye on efficiency -both techniques can be shown to be essentially optimal. Our methods are applicable to problems in different areas, e.g., data-flow analysis, analysis of systems with checkpoints, etc., and provide a general, unifying and efficient framework for solving these problems. The authors and the University of Edinburgh retain the right to reproduce and publish this paper for non-commercial purposes.Permission is granted for this report to be reproduced by others for non-commercial purposes as long as this copyright notice is reprinted in full in any reproduction. Applications to make other use of the material should be addressed in the first instance to Copyright Permissions, Division of Informatics, The University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, Scotland. Abstract Recent works have proposed pushdown systems as a tool for analyzing programs with (recursive) procedures. In particular, the model-checking problem for LTL has been studied. In this paper we examine an extension of this, namely model-checking with regular valuations. The problem is solved via two different techniques, with an eye on ef£ciency -both techniques can be shown to be essentially optimal. Our methods are applicable to problems in different areas, e.g., data-¤ow analysis, analysis of systems with checkpoints, etc., and provide a general, unifying and ef£cient framework for solving these problems.

show abstract

Model checking the full modal mu-calculus for infinite sequential processes

Cited by 38 publications

References 10 publications

Compositional Verification of Secure Applet Interactions

Compositional Verification of Secure Applet Interactions

An Automata-Theoretic Approach to Reasoning about Infinite-State Systems

Model-Checking LTL with Regular Valuations for Pushdown Systems

Contact Info

Product

Resources

About