A model checker for value-passing mu-calculus using logic programming

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

Volumn 1990, Issue , 2001, Pages 1-13

  Ramakrishnan, C R ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL METHODS; LOGIC PROGRAMMING; MODEL CHECKING; SEMANTICS; TEMPORAL LOGIC;

DATA VARIABLES; FORMAL SEMANTICS; IMPLEMENTATION SUPPORT; LOGIC PROGRAMS; MODAL MU CALCULUS; MODEL CHECKER; PROPERTY SPECIFICATION; VALUE PASSING PROCESS;

COMPUTER CIRCUITS;

EID: 84871949948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45241-9_1     Document Type: Conference Paper

References (14)

1. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.
2. William Chan. Temporal logic queries. In Computer Aided Verification (CAV), 2000.
3. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20–74, January 1996.
4. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP (CAESAR/ALDEBERAN development package): A protocol validation and verification toolbox. In Computer Aided Verification (CAV), volume 1102 of Lecture Notes in Computer Science, pages 437–440, 1996.
5. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In International Conference on Logic Programming, pages 1070–1080, 1988.
6. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333–354, 1983.
7. R. Mateescu. Local model checking of an alternation-free value-based modal mu-calculus. In Workshop on Verification, Model Checking, and Abstract Interpretation (VMCAI), 1998.
8. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
9. M. Mukund, C. R. Ramakrishnan, I. V. Ramakrishnan, and R. Verma. Symbolic bisimulation using tabled constraint logic programming. In International Workshop on Tabulation in Parsing and Deduction (TAPD), 2000.
10. J. Rathke and M. Hennessy. Local model checking for value-passing processes. In International Symposium on Theoretical Aspects of Computer Software, 1997.
11. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. L. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV ’97), Haifa, Israel, July 1997. Springer-Verlag.
12. C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V.N. Venkatakrishnan. XMC: A logicprogramming-based verification toolset. In Computer Aided Verification (CAV), 2000. XMC is available from http://www.cs.sunysb.edu/$\sim$lmc.
13. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3), 1991.
14. XSB. The XSB logic programming system. Available from http://xsb.sourceforge.net.