Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
暂无分享,去创建一个
[1] Rajeev Alur,et al. Model-Checking in Dense Real-time , 1993, Inf. Comput..
[2] Edmund M. Clarke,et al. Model Checking , 1999, Handbook of Automated Reasoning.
[3] Teodor C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..
[4] Stavros Tripakis,et al. Model Checking of Real-Time Reachability Properties Using Abstractions , 1998, TACAS.
[5] C. R. Ramakrishnan,et al. Efficient Model Checking Using Tabled Resolution , 1997, CAV.
[6] Peter J. Stuckey,et al. Constructive negation for constraint logic programming , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.
[7] Enrico Pontelli,et al. A constraint-based approach for specification and verification of real-time systems , 1997, Proceedings Real-Time Systems Symposium.
[8] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[9] Stavros Tripakis,et al. Verifying Progress in Timed Systems , 1999, ARTS.
[10] Thomas A. Henzinger,et al. MOCHA: Modularity in Model Checking , 1998, CAV.
[11] C. R. Ramakrishnan,et al. Logic Programming and Model Checking , 1998, PLILP/ALP.
[12] Supratik Mukhopadhyay,et al. Model Checking for Timed Logic Processes , 2000, Computational Logic.
[13] Georg Gottlob,et al. Linear time datalog and branching time logic , 2000 .
[14] Peter J. Stuckey,et al. Programming with Constraints: An Introduction , 1998 .
[15] Thomas A. Henzinger,et al. Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.
[16] Ulf Nilsson,et al. Constraint Logic Programming for Local and Symbolic Model-Checking , 2000, Computational Logic.
[17] Peter J. Stuckey,et al. Negation and Constraint Logic Programming , 1995, Inf. Comput..
[18] François Fages,et al. Constructive Negation by Pruning , 1997, J. Log. Program..
[19] Thomas A. Henzinger,et al. Modularity for Timed and Hybrid Systems , 1997, CONCUR.
[20] Hubert Comon-Lundh,et al. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.
[21] Hidenori Itoh,et al. A Query Evaluation Method for Stratified Programs Under the Extended CWA , 1988, ICLP/SLP.
[22] Laurent Fribourg,et al. Symbolic Verification with Gap-Order Constraints , 1996, LOPSTR.
[23] David Chan,et al. Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.
[24] C. R. Ramakrishnan,et al. Tabled resolution + constraints: a recipe for model checking real-time systems , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.
[25] Javier Esparza,et al. Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.
[26] Thomas A. Henzinger,et al. Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..
[27] C. Ramakrishnan,et al. Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints , 2002, ICLP.
[28] Andreas Podelski,et al. Set-Based Analysis of Reactive Infinite-State Systems , 1998, TACAS.
[29] Giorgio Delzanno,et al. Model Checking in CLP , 1999, TACAS.
[30] Hisao Tamaki,et al. OLD Resolution with Tabulation , 1986, ICLP.
[31] David Toman,et al. Top-Down beats Bottom-Up for Constraint Based Extensions of Datalog , 1995, ILPS.
[32] David Scott Warren,et al. Tabled evaluation with delaying for general logic programs , 1996, JACM.
[33] Wang Yi,et al. UPPAAL in 1995 , 1996, TACAS.
[34] Supratik Mukhopadhyay,et al. Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata , 1999, FSTTCS.
[35] Andreas Podelski,et al. The Horn mu-calculus , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).
[36] Zohar Manna,et al. Verifying Clocked Transition Systems , 1995, Hybrid Systems.
[37] Laurent Fribourg,et al. Concurrent Constraint Automata , 1993, ILPS.
[38] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..