Constraint logic programming for local and symbolic model-checking

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 384-398

  Nilsson, Ulf ^a   Lübcke, Johan ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINING TECHNIQUES; COMPLEMENTATION; CONSTRAINT LOGIC PROGRAMMING; CONSTRUCTIVE NEGATION; EXECUTION MODEL; FINITE CONSTRAINTS; LOCAL MODEL CHECKING; PARAMETERIZED; SYMBOLIC MODEL CHECKING; TABLED RESOLUTION;

ENCODING (SYMBOLS); LOGIC PROGRAMMING; MODEL CHECKING;

AUTOMATA THEORY;

EID: 84867783140     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_26     Document Type: Conference Paper

References (22)

1. K. Apt,R. Bol Logic Programming and Negation: A Survey J. Logic Pro-gramming, 19/20 9-71, 1994.
2. J. R. Burch, E. M. Clarke, D. E. Long, K. I. McMillan, and D. L. Dill. Symbolic Model Checking for Se quential Circuit Verification. IEEE Trans on Computer-Aided Design of Integrated Circuits, 13(4):401-424, 1994.
3. W. Charatonik and A. Podelski. Set-Based Analysis of Reactive Infinite-State Sy stems. In Proc. of TACAS'98, Lecture Notes in Computer Science 1384, pages 358-375. Springer-Verlag, 1998.
4. W. Chen and D. S. Warren. Tabled Evaluation With Delaying for General Logic Programs. J. ACM, 43(1):20-74, 1996.
5. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
6. L. Degerstedt. Tabulation-based Logic Programming. PhD thesis, Linköping studies in Science and Technology, dissertation no 462, 1996.
7. G. Delzanno and A. Podelski. Model Checking Infinite-State Systems using CLP. Technical report MPI-I-98-2-012, Max-Planck-Institut für Informatik, 1998.
8. G. Delzanno and A. Podelski. Model Checking in CLP. In Proc of TACAS'99, Amsterdam, Lecture Notes in Computer Science 1579. Springer Verlag, 1999.
9. Y. Dong, X. Du, Y.Ramakrishna, I. Ramakrishnan, S. Smolka, O. Sokolsky, E. Stark, and D. Warren. Fighting Livelock in the i-Protocol: A Comparative Study of Verification Tools. In Proc of TACAS'99, Am sterdam, Lecture Notes in Computer Science 1579. Springer Verlag, 1999.
10. E. A. Emerson. Temporal and Modal Logics. In Jan van Leeuwen, editor, Handbook on Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science, 1990.
11. G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991.
12. J. Jaar and J-L. Lassez. Constraint Logic Programming. In Conf. Record of 14th Annual ACM Symp. on POPL, pages 111-119, 1987.
13. J. Jaar and M. Maher. Constraint Logic Programming: A Survey. J. Logi c Programming, 19/20:503-581, 1994.
14. J. Lübcke and U. Nilsson. On-the-fly CTL Model-checking using Constraint Logic Programming. In Intl Workshop on Constraint Programming for Time-Critical Applications, COTIC99, 1999.
15. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
16. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. Smolka, T. Swift, and D. S. Warren. Efficient Model Checking using Tabled Resolution. In Proc of Computer Aided Verification (CAV), Lecture Notes in Computer Science 1254. Springer Verlag, 1997.
17. A. Rauzy. Toupie = Mu-calculus + Constraints. In Proc. of Computer Aided Verification 1995, Lecture Notes in Computer Science 939, pages 114-126. Springer Verlag, 1995.
18. K. Sagonas et al. The XSB Programmer's Manual Version 2.0, 1999.
19. C. Stirling and D. Walker. Local Model Checking in the Modal Mu-calculus. Theoretical Computer Science, 89(1):161-177, 1991.
20. P. Stuckey. Constructive N egation for Constraint Logic Programming. In Proc of Logic in Computer Science (LICS'91), 1991.
21. D. Toman. Memoing Evaluation for Constraint Extensions of Datalog. J. Con-straints, 2:337-359, 1997.
22. D. S. Warren. Memoing for Logic Programs. CACM, 35(3):93-111, 1992.