Advertisement

The Temporal Logic Sugar

  • Ilan Beer
  • Shoham Ben-David
  • Cindy Eisner
  • Dana Fisman
  • Anna Gringauze
  • Yoav Rodeh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2102)

Abstract

Since the introduction of temporal logic for the specification of computer programs [5], usability has been an issue, because a difficult-to-use formalism is a barrier to the wide adoption of formal methods. Our solution is Sugar, the temporal logic used by the RuleBase formal verification tool [2]. Sugar adds the power of regular expressions to CTL [4], as well as an extensive set of operators which provide syntactic sugar. That is, while these operators do not add expressive power, they allow properties to be expressed more succinctly than in the basic language. Experience shows that Sugar allows hardware engineers to easily and intuitively specify their designs. The full language is used for model checking, and a significant portion can be model checked on-the-fly [3]. The automatic generation of simulation checkers from the same portion of Sugar is described in [1]. While previous papers have described various features of the language, this paper presents the first complete description of Sugar.

Keywords

Model Check Temporal Logic Atomic Proposition Boolean Expression Basic Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Y. Abarbanel and I. Beer et al. FoCs — automatic generation of simulation checkers from formal specifications. In CAV’ 00, LNCS 1855. Springer-Verlag, 2000.Google Scholar
  2. 2.
    I. Beer, S. Ben-David, C Eisner, and A. Landver. RuleBase: an industry-oriented formal verification tool. In DAC’ 96, pages 655–660, June 1996.Google Scholar
  3. 3.
    I. Beer, S. Ben-David, and A. Landver. On-the-fly model checking of RCTL formulas. In CAV’ 98, LNCS 1427, pages 184–194. Springer-Verlag, 1998.Google Scholar
  4. 4.
    E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logics of Programs, LNCS 131, pages 52–71. Springer-Verlag, 1981.CrossRefGoogle Scholar
  5. 5.
    A. Pnueli. The temporal logic of programs. In Proc. 18th Annual IEEE Symposium on Foundations of Computer Science, pages 46–57, 1977.Google Scholar
  6. 6.
    A. Pnueli. A temporal logic of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ilan Beer
    • 1
  • Shoham Ben-David
    • 1
  • Cindy Eisner
    • 1
  • Dana Fisman
    • 1
    • 2
  • Anna Gringauze
    • 1
  • Yoav Rodeh
    • 1
    • 2
  1. 1.IBM Haifa Research LaboratoryIsrael
  2. 2.Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations