Model Checking as Static Analysis: Revisited

  • Fuyuan Zhang
  • Flemming Nielson
  • Hanne Riis Nielson
Conference paper

DOI: 10.1007/978-3-642-30729-4_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7321)
Cite this paper as:
Zhang F., Nielson F., Nielson H.R. (2012) Model Checking as Static Analysis: Revisited. In: Derrick J., Gnesi S., Latella D., Treharne H. (eds) Integrated Formal Methods. IFM 2012. Lecture Notes in Computer Science, vol 7321. Springer, Berlin, Heidelberg

Abstract

We show that the model checking problem of the μ-calculus can be viewed as an instance of static analysis. We propose Succinct Fixed Point Logic (SFP) within our logical approach to static analysis as an extension of Alternation-free Least Fixed Logic (ALFP). We generalize the notion of stratification to weak stratification and establish a Moore Family result for the new logic as well. The semantics of the μ-calculus is encoded as the intended model of weakly stratified clause sequences in SFP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Fuyuan Zhang
    • 1
  • Flemming Nielson
    • 1
  • Hanne Riis Nielson
    • 1
  1. 1.DTU InformaticsTechnical University of DenmarkLyngbyDenmark

Personalised recommendations