The ForSpec temporal logic: A new temporal property-specification language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2280 LNCS, Issue , 2002, Pages 296-311

  Armoni, Roy ^a   Fix, Limor ^a   Flaisher, Alon ^a   Gerth, Rob ^b   Ginsburg, Boris ^a   Kanza, Tomer ^a   Landver, Avner ^a   Mador Haim, Sela ^a   Singerman, Eli ^a   Tiemeyer, Andreas ^a   Vardi, Moshe Y ^c   Zbar, Yael ^a  

^a INTEL RESEARCH   (United States)

^b Intel Israel Development Center   (United States)

^c RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL SPECIFICATION; SPECIFICATION LANGUAGES;

ARITHMETICAL OPERATIONS; BIT VECTOR; HARDWARE DESIGN; KEY FEATURE; LINEAR TEMPORAL LOGIC; RESET SIGNALS; TEMPORAL PROPERTY; TIME WINDOWS;

TEMPORAL LOGIC;

EID: 84888210118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_21     Document Type: Conference Paper

References (26)

1. R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In J.W. de Bakker, K. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Real Time: Theory in Practice, Lecture Notes in Computer Science 600, pages 74-106. Springer-Verlag, 1992.
2. B. Banieqbal and H. Barringer. Temporal logic with fixed points. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Temporal Logic in Specification, Volume 398 of Lecture Notes in Computer Science, pages 62-74. Springer-Verlag, 1987.
3. I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh. The temporal logic sugar. In Proc. Conf. on Computer-Aided Verification (CAV'00), Volume 2102 of Lecture Notes in Computer Science, pages 363-367. Springer-Verlag, 2001.
4. I. Beer, S. Ben-David, and A. Landver. On-the-fly model checking of RCTL formulas. In Computer Aided Verification, Proc. 10th International Conference, Volume 1427 of Lecture Notes in Computer Science, pages 184-194. Springer-Verlag, 1998.
5. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. Nusmv: a new symbolic model checker. It'l J. on Software Tools for Technology Transfer, 2(4):410-425, 2000.
6. R. Cleaveland, G. Luttgen, and M. Mendler. An algebraic theory of multiple clocks. In Proc. 8th Int'l Conf. on Concurrency Theory (CONCUR'97), Volume 1243 of Lecture Notes in Computer Science, pages 166-180. Springer-Verlag, 1998.
7. E.A. Emerson. Temporal and modal logic. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 997-1072. Elsevier, MIT press, 1990.
8. E.A. Emerson and R.J. Trefler. Generalized quantitative temporal reasoning: An automata theoretic. In Proc. Theory and Practice of Software Development (TAP-SOFT), Volume 1214 of Lecture Notes in Computer Science, pages 189-200. Springer-Verlag, 1997.
9. B. Finkbeiner. Symbolic refinement checking with nondeterministic BDDs. In Tools and algorithms for the construction and analysis of systems, Lecture Notes in Computer Science. Springer-Verlag, 2001.
10. M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194-211, 1979.
11. J.G. Henriksen and P.S. Thiagarajan. Dynamic linear time temporal logic. Annals of Pure and Applied Logic, 96(1-3):187-207, 1999.
12. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
13. O. Kupferman, N. Piterman, and M.Y. Vardi. Extended temporal logic revisited. In Proc. 12th International Conference on Concurrency Theory, Volume 2154 of Lecture Notes in Computer Science, pages 519-535, August 2001.
14. R.P. Kurshan. Formal verification in a commercial setting. In Proc. Conf. on Design Automation (DAC'97), volume 34, pages 258-262, 1997.
15. R.P. Kurshan. FormalCheck User's Manual. Cadence Design, Inc., 1998.
16. O. Kupferman and M.Y. Vardi. Model checkingofsafety properties. Formalmethods in System Design, 19(3):291-314, November 2001.
17. C. Liu and M.A. Orgun. Verification of reactive systems using temporal logics with clocks. Theoretical Computer Science, 220:377-408, 1999.
18. O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Logics of Programs, Volume 193 of Lecture Notes in Computer Science, pages 196-218, Brooklyn, June 1985. Springer-Verlag.
19. M.J. Morley. Semantics of temporal e. In T. F. Melham and F.G. Moller, editors, Banff'99 Higher Order Workshop (Formal Methods in Computation). University of Glasgow, Department of Computing Science Technic al Report, 1999.
20. A. Pnueli. In transition from global to modular temporal reasoning about programs. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 123-144. Springer-Verlag, 1985.
21. T. Schlipf, T. Buechner, R. Fritz, M. Helms, and J. Koehl. Formal verification made easy. IBM Journal of Research and Development, 41(4:5), 1997.
22. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
23. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, Volume 1043 of Lecture Notes in Computer Science, pages 238-266. Springer-Verlag, Berlin, 1996.
24. M.Y. Vardi. Branching vs. linear time: Final showdown. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Volume 2031 of Lecture Notes in Computer Science, pages 1-22. Springer-Verlag, 2001.
25. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.
26. P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2):72-99, 1983.