Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2009 | |
---|---|---|

47 | EE | Bernard Stepien, Amy P. Felty, Stan Matwin: A Non-technical User-Oriented Display Notation for XACML Conditions. MCETECH 2009: 53-64 |

46 | EE | Amy P. Felty, Alberto Momigliano: Reasoning with hypothetical judgments and open terms in hybrid. PPDP 2009: 83-92 |

2008 | ||

45 | EE | Franck Binard, Amy P. Felty: Genetic programming with polymorphic types and higher-order functions. GECCO 2008: 1187-1194 |

44 | EE | Amy P. Felty, Alberto Momigliano: Hybrid: A Definitional Two-Level Approach to Reasoning with Higher-Order Abstract Syntax CoRR abs/0811.4367: (2008) |

43 | EE | Alberto Momigliano, Alan J. Martin, Amy P. Felty: Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax. Electr. Notes Theor. Comput. Sci. 196: 85-93 (2008) |

2007 | ||

42 | EE | Venanzio Capretta, Bernard Stepien, Amy P. Felty, Stan Matwin: Formal correctness of conflict detection for firewalls. FMSE 2007: 22-30 |

41 | EE | Franck Binard, Amy P. Felty: An abstraction-based genetic programming system. GECCO (Companion) 2007: 2415-2422 |

40 | EE | Amy P. Felty: Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code. Fundam. Inform. 77(4): 303-330 (2007) |

2006 | ||

39 | EE | Venanzio Capretta, Amy P. Felty: Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq. TYPES 2006: 63-77 |

2005 | ||

38 | Pedro Barahona, Amy P. Felty: Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 11-13 2005, Lisbon, Portugal ACM 2005 | |

37 | EE | Guillaume Dufay, Amy P. Felty, Stan Matwin: Privacy-Sensitive Information Flow with JML. CADE 2005: 116-130 |

36 | EE | Amy P. Felty: A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code. RTA 2005: 394-406 |

35 | EE | Amy P. Felty: A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code: Abstract. TLCA 2005: 10-10 |

34 | EE | Stan Matwin, Amy P. Felty, István T. Hernádvölgyi, Venanzio Capretta: Privacy in Data Mining Using Formal Methods. TLCA 2005: 278-292 |

2004 | ||

33 | EE | Andrew W. Appel, Amy P. Felty: Polymorphic lemmas and definitions in Lambda Prolog and Twelf CoRR cs.LO/0403010: (2004) |

32 | EE | Andrew W. Appel, Amy P. Felty: Dependent types ensure partial correctness of theorem provers. J. Funct. Program. 14(1): 3-19 (2004) |

31 | Andrew W. Appel, Amy P. Felty: Polymorphic Lemmas and Definitions in lambda-Prolog and Twelf. TPLP 4(1-2): 1-39 (2004) | |

2003 | ||

30 | EE | Amy P. Felty, Kedar S. Namjoshi: Feature specification and automated conflict detection. ACM Trans. Softw. Eng. Methodol. 12(1): 3-27 (2003) |

29 | EE | Amy P. Felty: Preface. J. Autom. Reasoning 31(3-4): 189-190 (2003) |

2002 | ||

28 | EE | Amy P. Felty, Stan Matwin: Privacy-Oriented Data Mining by Proof Checking. PKDD 2002: 138-149 |

27 | EE | Amy P. Felty: Two-Level Meta-reasoning in Coq. TPHOLs 2002: 198-213 |

2001 | ||

26 | David A. Basin, Amy P. Felty: Current Trends in Logical Frameworks and Metalanguages. J. Autom. Reasoning 27(1): 1-2 (2001) | |

2000 | ||

25 | Amy P. Felty, Kedar S. Namjoshi: Feature Specification and Automatic Conflict Detection. FIW 2000: 179-192 | |

24 | EE | Andrew W. Appel, Amy P. Felty: A Semantic Model of Types and Machine Instuctions for Proof-Carrying Code. POPL 2000: 243-253 |

23 | EE | Amy P. Felty: The calculus of constructions as a framework for proof search with set variable instantiation. Theor. Comput. Sci. 232(1-2): 187-229 (2000) |

1999 | ||

22 | EE | Amy P. Felty, Douglas J. Howe, Abhik Roychoudhury: Formal Metatheory using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems. CADE 1999: 237-251 |

21 | Andrew W. Appel, Amy P. Felty: Lightweight Lemmas in lambda-Prolog. ICLP 1999: 411-425 | |

20 | EE | Amy P. Felty, Frank A. Stomp: Cache Coherency in SCI: Specification and a Sketch of Correctness. Formal Asp. Comput. 11(5): 475-497 (1999) |

1998 | ||

19 | EE | Amy P. Felty, Douglas J. Howe, Frank A. Stomp: Protocol Verification in Nuprl. CAV 1998: 428-439 |

1997 | ||

18 | Elsa L. Gunter, Amy P. Felty: Theorem Proving in Higher Order Logics, 10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings Springer 1997 | |

17 | EE | Amy P. Felty, Douglas J. Howe: Hybrid Interactive Theorem Proving Using Nuprl and HOL. CADE 1997: 351-365 |

16 | Amy P. Felty, Laurent Théry: Interactive Theorem Proving with Temporal Logic. J. Symb. Comput. 23(4): 367-397 (1997) | |

1996 | ||

15 | EE | Amy P. Felty: Proof Search with Set Variable Instantiation in the Calculus of Constructions. CADE 1996: 658-672 |

1995 | ||

14 | Ramesh Bharadwaj, Amy P. Felty, Frank A. Stomp: Formalizing Inductive Proofs of Network Algorithms. ASIAN 1995: 335-349 | |

13 | Joëlle Despeyroux, Amy P. Felty, André Hirschowitz: Higher-Order Abstract Syntax in Coq. TLCA 1995: 124-138 | |

1994 | ||

12 | EE | Amy P. Felty, Douglas J. Howe: Tactic Theorem Proving with Refinement-Tree Proofs and Metavariables. CADE 1994: 605-619 |

11 | EE | Amy P. Felty, Douglas J. Howe: Generalization and Reuse of Tactic Proofs. LPAR 1994: 1-15 |

1993 | ||

10 | Amy P. Felty: Definite Clause Grammars for Parsing Higher-Order Syntax. ILPS 1993: 668 | |

9 | Amy P. Felty: Encoding the Calculus of Constructions in a Higher-Order Logic LICS 1993: 233-244 | |

8 | Amy P. Felty: Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language. J. Autom. Reasoning 11(1): 41-81 (1993) | |

1991 | ||

7 | EE | Amy P. Felty: A Logic Programming Approach to Implementing Higher-Order Term Rewriting. ELP 1991: 135-161 |

1990 | ||

6 | EE | Amy P. Felty, Dale Miller: Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language. CADE 1990: 221-235 |

5 | EE | Amy P. Felty, Elsa L. Gunter, Dale Miller, Frank Pfenning: Tutorial on Lambda-Prolog. CADE 1990: 682 |

1989 | ||

4 | EE | Amy P. Felty: A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs. ELP 1989: 157-178 |

1988 | ||

3 | EE | Amy P. Felty, Dale Miller: Specifying Theorem Provers in a Higher-Order Logic Programming Language. CADE 1988: 61-80 |

2 | EE | Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov: Lambda-Prolog: An Extended Logic Programming Language. CADE 1988: 754-755 |

1986 | ||

1 | Dale Miller, Amy P. Felty: An Integration of Resolution and Natural Deduction Theorem Proving. AAAI 1986: 198-202 |

1 | Andrew W. Appel | [21] [24] [31] [32] [33] |

2 | Pedro Barahona | [38] |

3 | David A. Basin | [26] |

4 | Ramesh Bharadwaj | [14] |

5 | Franck Binard | [41] [45] |

6 | Venanzio Capretta | [34] [39] [42] |

7 | Joëlle Despeyroux | [13] |

8 | Guillaume Dufay | [37] |

9 | Elsa L. Gunter | [2] [5] [18] |

10 | John Hannan | [2] |

11 | István T. Hernádvölgyi | [34] |

12 | André Hirschowitz | [13] |

13 | Douglas J. Howe | [11] [12] [17] [19] [22] |

14 | Alan J. Martin | [43] |

15 | Stan Matwin | [28] [34] [37] [42] [47] |

16 | Dale Miller | [1] [2] [3] [5] [6] |

17 | Alberto Momigliano | [43] [44] [46] |

18 | Gopalan Nadathur | [2] |

19 | Kedar S. Namjoshi | [25] [30] |

20 | Frank Pfenning | [5] |

21 | Abhik Roychoudhury | [22] |

22 | Andre Scedrov | [2] |

23 | Bernard Stepien | [42] [47] |

24 | Frank A. Stomp | [14] [19] [20] |

25 | Laurent Théry | [16] |