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.
Chapter PDF
Similar content being viewed by others
Keywords
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
Y. Abarbanel and I. Beer et al. FoCs — automatic generation of simulation checkers from formal specifications. In CAV’ 00, LNCS 1855. Springer-Verlag, 2000.
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.
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.
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.
A. Pnueli. The temporal logic of programs. In Proc. 18th Annual IEEE Symposium on Foundations of Computer Science, pages 46–57, 1977.
A. Pnueli. A temporal logic of concurrent programs. Theoretical Computer Science, 13:45–60, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beer, I., Ben-David, S., Eisner, C., Fisman, D., Gringauze, A., Rodeh, Y. (2001). The Temporal Logic Sugar. In: Berry, G., Comon, H., Finkel, A. (eds) Computer Aided Verification. CAV 2001. Lecture Notes in Computer Science, vol 2102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44585-4_33
Download citation
DOI: https://doi.org/10.1007/3-540-44585-4_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42345-4
Online ISBN: 978-3-540-44585-2
eBook Packages: Springer Book Archive