- Temporal Logic Theorem Proving and its Application to the Feature Interaction Problem
- Formalizing Inductive Proofs of Network Algorithms ?
- Tactic Theorem Proving with RefinementTree Proofs and Metavariables ?
- Hybrid Interactive Theorem Proving using Nuprl and HOL ?
- Privacy-Oriented Data Mining by Proof Checking ?
- Implementing Tactics and Tacticals in a HigherOrder Logic Programming Language
- A Tutorial Example of the Semantic Approach to Foundational Proof-Carrying Code
- Privacy-Sensitive Information Flow with JML ? Guillaume Dufay 1 , Amy Felty 1 , and Stan Matwin 1;2
- Fundamenta Informaticae 77 (2007) 128 1 Tutorial Examples of the Semantic Approach to Foundational
- Generalization and Reuse of Tactic Proofs Amy Felty and Douglas Howe ?
- de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
- In Theory and Practice of Logic Programming, 4(1&2): 1{39, 2004 1 Polymorphic Lemmas and De nitions in
- A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs ?
- J. Functional Programming, 14(1):3{19, January 2004 1 Dependent Types Ensure Partial Correctness of
- Encoding the Calculus of Constructions in a HigherOrder Logic \Lambda AT&T Bell Laboratories
- Two-Level Meta-Reasoning in Coq ? Amy P. Felty
- Formal Metatheory using Implicit Syntax, and an Application to Data Abstraction for
- de r eche r che INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE
- Proving Properties About a Lazy Functional Language with the Coq Proof Development System
- The Calculus of Constructions as a Framework for Proof Search with Set Variable Instantiation
- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison
- Feature Speci cation and Automatic Con ict Detection
- Reasoning with Hypothetical Judgments and Open Terms in Hybrid
- A Semantic Model of Types and Machine Instructions for ProofCarrying Code
- Feature Speci cation and Automated Con ict Detection
- Genetic Programming with Polymorphic Types and Higher-Order Functions
- Specifying and Implementing Theorem Provers in a Higher-Order
- Protocol Verification in Nuprl ? Amy P. Felty 1 , Douglas J. Howe 1 , and Frank A. Stomp 2
- Encoding Dependent Types in an Intuitionistic Logic \Lambda INRIA Rocquencourt
- A Correctness Proof of a Cache Coherence Protocol \Lambda Amy Felty and Frank Stomp
- In Proceedings of the Fifth International Conference on Availability, Reliability, and Security (ARES), February, 2010. Strategies for Reducing Risks of Inconsistencies
- Cache Coherency in SCI: Speci cation and a Sketch of Correctness
- PROOF EXPLANATION AND REVISION Amy Felty and Dale Miller
- Interactive Theorem Proving in Twelf School of Information Technology and Engineering
- A Logic Programming Approach to Implementing HigherOrder Term
- Lightweight Lemmas in Prolog 1 Andrew W. Appel
- HigherOrder Conditional Term Rewriting in the L Logic Programming Language
- Proof Search with Set Variable Instantiation in the Calculus of Constructions ?
- Journal of Automated Reasoning manuscript No. (will be inserted by the editor)
- A Non-technical User-Oriented Display Notation for XACML Conditions
- Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax
- Formal Correctness of Conflict Detection for Firewalls Venanzio Capretta
- Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq
- An Abstraction-Based Genetic Programming System Franck Binard
- Privacy in Data Mining Using Formal Methods Stan Matwin
- Advantages of a Non-Technical XACML Notation in Role-Based Models
- Preliminary Report. Final version to appear in: c Alan J. Martin & Amy P. Felty
- Privacy-Sensitive Information Flow with JML Guillaume Dufay1
- An Implementation of a Verification Condition Generator for Foundational Proof-Carrying Code