Mechanized metatheory model-checking

PPDP'07: Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn , Issue , 2007, Pages 75-86

  Cheney, James ^a   Momigliano, Alberto ^a,b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

Counterexample search; Model checking; Nominal logic

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; MODEL CHECKING; PROBLEM SOLVING; SEMANTICS; USER INTERFACES;

COUNTEREXAMPLE SEARCH; METATHEORETIC PROPERTIES; NOMINAL LOGIC;

LOGIC PROGRAMMING;

EID: 34548059252     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273920.1273931     Document Type: Conference Paper

References (50)

1. M. Abadi and B. Blanchet. Analyzing Security Protocols with Secrecy Types and Logic Programs. Journal of the ACM, 52(1):102-146, Jan. 2005.
2. B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce, P. Sewell, D. Vytiniotis, G. Washburn, S. Weirich, and S. Zdancewic. Mechanized metatheory for the masses: The POPLMARK CHALLENGE. In J. Hurd and T. F. Melham, editors, TPHOLs, volume 3603 of Lecture Notes in Computer Science, pages 50-65. Springer, 2005.
3. R. Barbuti, P. Mancarella, D. Pedreschi, and F. Turini. A transformational approach to negation in logic programming. Journal of Logic Programming, 8:201-228, 1990.
4. S. Berghofer and T. Nipkow. Random testing in Isabelle/HOL. In SEFM '04: Proceedings of the Software Engineering and Formal Methods, Second International Conference on (SEFM'04), pages 230-239, Washington, DC, USA, 2004. IEEE Computer Society.
5. A. Brogi, P. Mancarella, D. Pedreschi, and F. Turini. Universal quantification by case analysis. In Proc. ECAI-90, pages 111-116, 1990.
6. P. Bruscoli, F. Levi, G. Levi, and M. C. Meo. Compilative constructive negation in constraint logic programs. In S. Tison, editor, Proc. Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, volume 787, pages 52-76. Springer, 1994.
7. J. Cheney. Equivariant unification. In Proceedings of the 2005 Conference on Rewriting Techniques and Applications (RTA 2005), number 3467 in LNCS, pages 74-89, Nara, Japan, 2005. Springer-Verlag.
8. J. Cheney. Scrap your nameplate (functional pearl). In B. Pierce, editor, Proceedings of the 10th International Conference on Functional Programming (ICFP 2005), pages 180-191, Tallinn, Estonia, 2005. ACM.
9. J. Cheney. A simpler proof theory for nominal logic. In FOSSACS 2005, number 3441 in LNCS, pages 379-394. Springer-Verlag, 2005.
10. J. Cheney. The semantics of nominal logic programs. In ICLP 2006, volume 4079 of LNCS, pages 361-375, 2006.
11. J. Cheney and C. Urban. Alpha-Prolog: A logic programming language with names, binding and alpha-equivalence. In ICLP 2004, number 3132 in LNCS, pages 269-283, 2004.
12. J. Cheney and C. Urban.. Nominal logic programming. Technical Report cs.PL/0609062, arXiv e-print, 2006. Submitted.
13. J. R. Cheney. Nominal Logic Programming. PhD thesis, Cornell University, Ithaca, NY, August 2004.
14. K. Claessen and J. Hughes. QuickCheck: a lightweight tool for random, testing of Haskell programs. In Proceedings of the 2000 ACM SIGPLAN International Conference on Functional Programming (ICFP 2000), pages 268-279. ACM, 2000.
15. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000.
16. H. Comon. Disunification: a survey. In J.-L. Lassez and G.Plotkin, editors, Computational Logic. MIT Press, Cambridge,MA, 1991.
17. M. Fairbairn. Solution to part 3 of the POPLMark Challenge. Available at the POPLMark Wiki, http://fling-1.seas.upenn.edu/~plclub/cgi-bin/poplmark.
18. M. Fernández and M. Gabbay. Nominal rewriting with name generation: abstraction vs. locality. In P. Barahona and A. P. Felty, editors, PPDP, pages 47-58. ACM, 2005.
19. M. Fitting. Fixpoint semantics for logic programming: a survey. Theor. Comput. Sci., 278(1-2):25-51, 2002.
20. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13:341-363, 2002.
21. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19-20:583-628, 1994.
22. J. Harland. Success and failure for hereditary Harrop formulae. J. Log. Program., 17(1):1-29, 1993.
23. R. Harper and F. Pfenning. On equivalence and canonical forms in the LF type theory. ACM Trans. Comput. Logic, 6(1):61-101, 2005.
24. K. Kunen. Negation in logic programming. Journal of Logic Progmmming, 4:289-308, 1987.
25. J.-L. Lassez and K. Marriott. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning, 3(3):301-318, Sept. 1987.
26. P. Mancarella and D. Pedreschi. An algebra of logic programs. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1006-1023, Seatle, 1988. ALP, IEEE, The MIT Press.
27. R. C. McDowell and D. A. Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Trans. on Computational Logic (TOCL), 3(1):80-136, 2002.
28. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
29. D. Miller and A. Tiu. A proof theory for generic judgments. ACM Trans. Comput. Logic, 6(4):749-783, 2005.
30. A. Momigliano. Elimination of negation, in a logical framework. In P. Clote and H. Schwichtenberg, editors, CSL, volume 1862 of Lecture Notes in Computer Science, pages 411-426. Springer, 2000.
31. A. Momigliano and F. Pfenning. Higher-order pattern complement and the strict lambda-calculus. ACM Trans. Comput. Log., 4(4):493-529, 2003.
32. J. J. Moreno-Navarro and S. Muñoz-Hernández. How to incorporate negation in a Prolog compiler. In E. Pontelli and V. S. Costa, editors, PADL 2000, volume 1753 of LNCS, pages 124-140. Springer, 2000.
33. S. Muñoz-Hernández, J. Marino, and J. J. Moreno-Navarro. Constructive intensional negation. In. Y. Kameyama and P. J. Stuckey, editors, FLOPS, volume 2998 of Lecture Notes in Computer Science, pages 39-54. Springer, 2004.
34. L. Naish. A declarative debugging scheme. Journal of Functional and Logic Programming, 1997(3), 1997.
35. I. Niemelä. Answer set programming: A declarative approach to solving search problems. In M. Fisher, W. van der Hoek, B. Konev, and A. Lisitsa, editors, JELIA, volume 4160 of Lecture Notes in Computer Science, pages 15-18. Springer, 2006.
36. F. Pfenning. Logical frameworks. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science Publishers, 2000. In preparation.
37. F. Pfenning and C. Schürmann. System description: Twelf - A metalogical framework, for deductive systems. In. H. Ganzinger, editor, Pmc. 16th Int. Conf. on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, 1999. Springer-Verlag LNAI 1632.
38. B. Pientka. Verifying termination, and reduction properties about higher-order logic programs. J. Autom. Reasoning, 34(2): 179-207, 2005.
39. B. C. Pierce. Types and Progmmming Languages. MIT Press, 2002.
40. A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 183:165-193, 2003.
41. G. Puebla, F. Bueno, and M. V. Hermenegildo. Combined static and dynamic assertion-based debugging of constraint logic programs. In Logic Program Synthesis and Transformation, pages 273-292, 1999.
42. Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabled resolution. In CAV 1997, pages 143-154. Springer-Verlag, 1997.
43. C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V. N. Venkatakrishnan. XMC: A logic-programming-based verification toolset. In CAV 2000, pages 576-580, London, UK, 2000. Springer-Verlag.
44. P. Schroeder-Heister. Definitional reflection and the completion. In R. Dyckhoff, editor, Proceedings of the 4th International Workshop on Extensions of Logic Programming, pages 333-347. Springer-Verlag LNAI 798, 1993.
45. P. Schroeder-Heister. Rules of definitional reflection. In M. Vardi, editor, Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 222-232, Montreal, Canada, June 1993.
46. P. J. Stuckey. Negation and constraint logic programming. Information and Computation, 118(1): 12-33, 1995.
47. A. F. Tiu. Model checking for π-calculus using proof search. In M. Abadi and L. de Alfaro, editors, CONCUR, volume 3653 of Lecture Notes in Computer Science, pages 36-50. Springer, 2005.
48. C. Urban and J. Cheney. Avoiding equivariant unification. In Pmceedings of the 2005 Conference on Typed Lambda Calculus and Applications (TLCA 2005), number 3461 in LNCS, pages 74-89, Nara, Japan, 2005. Springer-Verlag.
49. C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323(1-3):473-497, 2004.
50. D. Walker, L. Mackey, J. Ligatti, G. A. Reis, and D. I. August. Static typing for a faulty lambda calculus. In ICFP '06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, pages 38-49, New York, NY, USA, 2006. ACM Press.