The Bedwyr system for model checking over syntactic expressions

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

Volumn 4603 LNAI, Issue , 2007, Pages 391-397

  Baelde, David ^a   Gacek, Andrew ^b   Miller, Dale ^a   Nadathur, Gopalan ^b   Tiu, Alwen ^c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF MINNESOTA   (United States)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35148871781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73595-3_28     Document Type: Conference Paper

References (14)

1. Baelde, D., Gacek, A., Miller, D., Nadathur, G., Tiu, A.: A User Guide to Bedwyr (November 2006)
2. Elliott, C., Pfenning, F.: A semi-functional implementation of a higher-order logic programming language. In: Lee, P. (ed.) Topics in Advanced Language Implementation, pp. 289-325. MIT Press, Cambridge (1991)
3. Girard, J.-Y.: A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu (February 1992)
4. McDowell, R., Miller, D.: A logic for reasoning with higher-order abstract syntax. In: Proc. LICS 1997, pp. 434-445. IEEE Comp. Soc. Press, Los Alamitos (1997)
5. McDowell, R., Miller, D., Palamidessi, C.: Encoding transition systems in sequent calculus. Theoretical Computer Science 294(3), 411-437 (2003)
6. Miller, D.: Abstract syntax for variable binders: An overview. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 239-253. Springer, Heidelberg (2000)
7. Miller, D., Tiu, A.: A proof theory for generic judgments. ACM Trans. on Computational Logic 6(4), 749-783 (2005)
8. Nadathur, G., Linnell, N.: Practical higher-order pattern unification with on-the-fly raising. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 371-386. Springer, Heidelberg (2005)
9. Pfenning, F., Elliott, C.: Higher-order abstract syntax. In: Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation, pp. 199-208. ACM Press, New York (1988)
10. Sagonas, K., Swift, T., Warren, D.S., Freire, J., Rao, P., Cui, B., Johnson, E., de Castro, L., Marques, R.F., Dawson, S., Kifer, M.: The XSB Version 3.0, vol. 1: Programmer's Manual (2006)
11. Schroeder-Heister, P.: Rules of definitional reflection. In: Proc. LICS 1993, pp. 222-232. IEEE Comp. Soc. Press, Los Alamitos (1993)
12. Tiu, A.: A Logical Framework for Reasoning about Logical Specifications. PhD thesis, Pennsylvania State University (May 2004)
13. Tiu, A.: Model checking for π-calculus using proof search. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 36-50. Springer, Heidelberg (2005)
14. Tiu, A., Nadathur, G., Miller, D.: Mixing finite success and finite failure in an automated prover. In: Proc. of ESHOL'05: Empirically Successful Automated Reasoning in Higher-Order Logics, pp. 79-98 (December 2005)