Fate and free will in error traces

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

Volumn 2280 LNCS, Issue , 2002, Pages 445-459

  Jin, Hoonsang ^a   Ravi, Kavita ^b   Somenzi, Fabio ^a  

^a UNIVERSITY OF COLORADO   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING;

FREE WILL;

ERRORS;

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

References (14)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In In Proceedings of the IEEE Symposium on the Foundations of Computer Science, pages 100-109, 1997.
2. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In O. Grumberg, editor, Ninth Conference on Computer Aided Verification (CAV'97), pages 279-290. Springer-Verlag, Berlin, 1997. LNCS 1254.
3. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings Workshop on Logics of Programs, pages 52-71, Berlin, 1981. Springer-Verlag. LNCS 131.
4. E. Clarke, O. Grumberg, K. McMillan, and X. Zhao. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proceedings of the Design Automation Conference, pages 427-432, San Francisco, CA, June 1995.
5. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, Cambridge, MA, 1999.
6. L. de Alfaro, T. A. Henzinger, and F.Y. C. Mang. Detecting errors before reaching them. In E. A. Emerson and A. P. Sistla, editors, Twelfth Conference on Computer Aided Verification (CAV'00), pages 186-201. Springer-Verlag, Berlin, July 2000. LNCS 1855.
7. E.A. Emerson and J.Y. Halpern. 'Sometimes'and'notnever'revisited: Onbranching time versus linear time temporal logic. Journal of the Association for Computing Machinery, 33(1):151-178, 1986.
8. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. 32nd IEEE Symposium on Foundations of Computer Science, pages 368-377, October 1991.
9. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994.
10. O. Kupferman and M. Y. Vardi. Vacuity detection in temporal model checking. In Correct Hardware Design and Verification Methods (CHARME'99), pages 82-96, Berlin, September 1999. Springer-Verlag. LNCS 1703.
11. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
12. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1994.
13. K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 143-160. Springer-Verlag, November 2000. LNCS 1954.
14. P. Wolper, M.Y. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 185-194, 1983.