• DocumentCode
    3107184
  • Title

    Using CTL formulae as component abstraction in a design and verification flow

  • Author

    Braunstein, C. ; Encrenaz, Emmanuelle

  • Author_Institution
    Univ. Paris 6, Paris
  • fYear
    2007
  • fDate
    10-13 July 2007
  • Firstpage
    80
  • Lastpage
    89
  • Abstract
    In the context of component-based design, the verification of global properties (involving several components) is difficult to achieve, due to combinatorial explosion problem, while the verification of each component is easier to perform. Following the idea of [24], we propose to build an abstraction of a component already verified, starting from a subset of its specification described as CTL formulae. This abstraction replaces the concrete component and alleviates the state-space explosion problem for checking global properties expressed in ACTL.
  • Keywords
    program verification; CTL formulae; combinatorial explosion problem; component abstraction; component verification; component-based design; state-space explosion problem; Automata; Concrete; Concurrent computing; Context modeling; Explosions; Hardware; Logic; Protocols; Software engineering; State-space methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application of Concurrency to System Design, 2007. ACSD 2007. Seventh International Conference on
  • Conference_Location
    Bratislava
  • ISSN
    1550-4808
  • Print_ISBN
    0-7695-2902-X
  • Type

    conf

  • DOI
    10.1109/ACSD.2007.76
  • Filename
    4276267