• DocumentCode
    2879516
  • Title

    Bounded Model Checking of ACTL Formulae

  • Author

    Chen, Wei ; Zhang, Wenhui

  • Author_Institution
    Inst. of Software, Chinese Acad. of Sci., Beijing, China
  • fYear
    2009
  • fDate
    29-31 July 2009
  • Firstpage
    90
  • Lastpage
    99
  • Abstract
    In this paper, we give a new and improved Bounded Model Checking encoding method for the universal fragment of CTL (ACTL). More specifically, the new encoding method works for verification of ACTL properties, instead of error-hunting. Combine our verification encoding and bug-hunting encoding proposed before, we get a Bounded Model Checking procedure that works for both valid and invalid ACTL properties. The underlying idea and intuition are summarized in this paper and we implement our tool BMV (Bounded Model Verification) on top of the well-known model checker NuSMV 2, and conduct experiments that show the strength and weakness of ACTL Bounded Model Checking compared to traditional BDD-based model checking procedure.
  • Keywords
    encoding; formal logic; formal verification; program debugging; tree data structures; bounded model checking encoding method; bounded model verification; computation tree logic; error-hunting; Boolean functions; Data structures; Encoding; Erbium; Gold; Labeling; Logic; Software engineering; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Theoretical Aspects of Software Engineering, 2009. TASE 2009. Third IEEE International Symposium on
  • Conference_Location
    Tianjin
  • Print_ISBN
    978-0-7695-3757-3
  • Type

    conf

  • DOI
    10.1109/TASE.2009.15
  • Filename
    5198491