Model checking and evidence exploration

Proceedings - 10th IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, ECBS 2003

Volumn , Issue , 2003, Pages 214-223

  Dong, Yifei ^a   Ramakrishnan, C R ^a   Smolka, S A ^a  

^a Stony Brook University   (United States)

Author keywords

Algebra; Computer science; Electronic mail; Formal verification; Java; Logic; Navigation; Switches; Usability; Virtual machining

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; ELECTRIC SWITCHES; ELECTRONIC MAIL; FORMAL VERIFICATION; JAVA PROGRAMMING LANGUAGE; LOCKS (FASTENERS); NAVIGATION; SPECIFICATIONS; SWITCHES;

EXPLORATION METHODS; JAVA; JAVA VIRTUAL MACHINES; LOGIC; SYSTEM SPECIFICATION; TEMPORAL LOGIC PROPERTIES; USABILITY; VIRTUAL MACHINING;

MODEL CHECKING;

EID: 35248892210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ECBS.2003.1194802     Document Type: Conference Paper

References (29)

1. International Workshop on User Interfaces for Theorem Provers (UITP). 1995-1998.
2. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y. S. Ramakrishna, and D. White. An efficient meta-lock for implementing ubiquitous synchronization. ACM SIGPLAN Notices, 34(10):207-222, 1999.
3. D. H. Ballard and C. M. Brown. Computer Vision. Prentice Hall, 1982.
4. S. Basu and S. A. Smolka. Model checking the Java Meta-Locking algorithm. 2002. submitted.
5. S. Basu, S. A. Smolka, and O. R. Ward. Model checking the Java Meta-Locking algorithm. In Proceedings of 7th IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ECBS 2000), pages 342-350, Edinburgh, Scotland, Apr. 2000.
6. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in temporal model checking. Formal Methods in System Design, 18(2):141-163, Mar. 2001.
7. G. Bhat and R. Cleaveland. Efficient local model-checking for fragments of the modal mu-calculus. In TACAS 1996, LNCS 1055, pages 107-126, 1996.
8. F. Buccafurri, T. Eiter, G. Gottlob, and N. Leone. On ACTL formulas having linear counterexamples. Journal of Computer and System Sciences, 62(3):463-515, May 2001.
9. E. Clarke, S. Jha, Y. Lu, and H. Veith. Tree-like counterexamples in model checking. In Symposium on Logic in Computer Science (LICS'2002), Copenhagen, Denmark, July 2002.
10. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, LNCS 131, pages 52-71. Springer Verlag, 1981.
11. R. Cleaveland. Tableau-based model checking in the propositional mu-calculus. Acta Informatica, 27:725-747, 1990.
12. C. J. Date. An Introduction to Database Systems. Addison-Wesley, 7 edition, 2000.
13. M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
14. J. A. Goguen. Social and semiotic analyses for theorem prover user interface design 1. Formal Aspects of Computing, 11(3):272-301, 1999.
15. H.-F. Guo, C. R. Ramakrishnan, and I. V. Ramakrishnan. Speculative beats conservative justification. In ICLP 2001, LNCS 2237, pages 150-165, 2001.
16. A. Gutiérrez, P. Pucheral, H. Steffen, and J.-M. Thévenin. Database Graph Views: A Practical Model to Manage Persistent Graphs. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 391-402, Santiago, Chile, 1994.
17. M. Kaufmann and D. Wagner, editors. Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer Verlag, 2001.
18. A. Kick. Generation of witnesses for global μ-calculus model checking. Available at http://liinwww.ira.uka.de/~kick/cavf.ps, 1995.
19. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
20. K. S. Namjoshi. Certifying model checkers. In CAV 2001, LNCS 2102, pages 2-13, 2001.
21. D. Peled, A. Pnueli, and L. Zuck. From falsification to verification. In FSTTCS 2001, LNCS 2245, pages 292-304, 2001.
22. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, LNCS 137, Berlin, 1982.
23. A. Roychoudhury, C. Ramakrishnan, and I. Ramakrishnan. Justifying proofs using memo tables. In Proc. of Second International Conference on Principles and Practice of Declarative Programming (PPDP 2000), pages 178-189, Sept. 2000.
24. R. Spence. Information Visualization. ACM Press, 2001.
25. C. Stirling. Modal and temporal logics for processes. In F. Moller and G. Birtwistle, editors, Logics for concurrency: structure versus automata, LNCS 1055, pages 149-237. Springer, 1996.
26. C. Stirling and D. Walker. Local model checking in the modal mu-calculus. Theoretical Computer Science, 89(1):161-177, 1991.
27. R. S. Streett and E. A. Emerson. An automata theoretic decision procedure for the propositional mucalculus. Information and Computation, 81(3):249-342, 1989.
28. L. Tan and R. Cleaveland. Evidence-based model checking. In CAV 2002, LNCS 2404, pages 455-470, 2002.
29. G. Winskel. A note on model checking the modal ν-calculus. Theoretical Computer Science, 83:157-167, 1991.