Temporal-logic queries

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

Volumn 1855, Issue , 2000, Pages 450-463

  Chan, William ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; COMPUTER CIRCUITS; MODEL CHECKING; SEMANTICS;

LINEAR TIME; MODEL UNDERSTANDING; SYSTEM BEHAVIORS; TEMPORAL LOGIC FORMULA;

TEMPORAL LOGIC;

EID: 84944404064     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_34     Document Type: Conference Paper

References (12)

1. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In O. Grumberg, editor, Computer Aided Verification, 9th International Conference, CAV’97 Proceedings, volume 1254 of Lecture Notes in Computer Science, pages 279–290, Haifa, Israel, June 1997. Springer-Verlag.
2. S. Bensalem and Y. Lakhnech. Automatic generation of invariants. Formal Methods in System Design, 15(1):75–92, July 1999.
3. E. M. Clarke, E.A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACMTransactions on Programming Languages and Systems, 8(2):244–263, April 1986.
4. O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines based on symbolic execution. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems: International Workshop Proceedings, volume 407 of Lecture Notes in Computer Science, pages 365–373, Grenoble, France, June 1989. Springer-Verlag.
5. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and Systems Sciences, 30:1–21, 1985.
6. M. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. In ICSE99, editor, Proceedings of the 1999 International Conference on Software Engineering: ICSE 99, pages 213–224, Los Angeles, USA, May 1999. ACM.
7. M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and Systems Sciences, 18:194–211, 1979.
8. S. G. Govindaraju, D. L. Dill, A. J. Hu, and M. A. Horowitz. Approximate reachability with BDDs using overlapping projections. In 35th Design Automation Conference, Proceedings 1998, pages 451–456, San Francisco, USA, June 1998. ACM.
9. O. Grumberg and D. E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3):843–871, May 1994.
10. R. Jeffords and C. Heitmeyer. Automatic generation of state invariants from requirements specifications. In FSE6, editor, Proceedings of the ACM SIGSOFT 6th International Symposium on the Foundations of Software Engineering: FSE-6, pages 56–69, Lake Buena Vista, Florida, USA, November 1998.
11. K. Ravi, K. L. McMillan, T. R. Shiple, and F. Somenzi. Approximation and decomposition of binary decision diagrams. In 35th Design Automation Conference, Proceedings 1998, pages 445–450, San Francisco, USA, June 1998. ACM.
12. M. Vaziri and G. Holzmann. Automatic invariant deduction in Spin. In J.-C. Gregoire, G. J. Holzmann, and D. A. Peled, editors, The SPIN Verification System: The 4th International Workshop, Paris, France, November 1998.