- A Theorem Proving Approach to Analysis of Secure Information Flow
- ATP Grad Course 2003/04 Normal Form Normal Form Cont'd
- HATS--A Formal Software Product Line Engineering Methodology Dave Clarke, Nikolay Diakov, Reiner Hahnle,
- A Visual Interactive Debugger Based on Symbolic Execution
- Specifying Imperative ML-like Programs Using Dynamic Logic
- Integrated and Tool-Supported Teaching of Testing, Debugging, and Verification
- Integration of a Security Type System into a Program Logic
- Verifying Object-Oriented Programs with KeY: Wolfgang Ahrendt1
- Verification by Parallelization of Parametric Code Tobias Gedell and Reiner Hhnle
- KeY-C: A Tool for Verification of C Programs Oleg Murk, Daniel Larsson, and Reiner Hahnle
- List of Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .XXIII List of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .XXV
- Pattern-Driven Formal Specification Richard Bubel
- Many-Valued Logic, Partiality, and Abstraction in Formal Specification
- Normal Forms for Knowledge Compilation Reiner Hahnle1
- Verification of Safety Properties in the Presence of Transactions
- Rule-Based Simplification of OCL Constraints Martin Giese, Reiner Hahnle, and Daniel Larsson
- Fair Constraint Merging Tableaux in Lazy Functional Programming Style
- Fair Constraint Merging Tableaux in Lazy Functional Programming Style
- ATP Grad Course 2003/04 Meta Results Meta Results
- ATP Grad Course 2003/04 Meta Results Meta Results
- ATP Grad Course 2003/04 Overview Part 1: Prerequisites
- ATP Grad Course 2003/04 Soundness Soundness Cont'd
- Automated Theorem Proving Reiner Hahnle
- Automated Theorem Proving Reiner Hahnle
- Automated Theorem Proving Reiner Hahnle
- Automated Theorem Proving Reiner Hahnle
- Interleaving Symbolic Execution and Partial Evaluation
- A Theorem Proving Approach to Analysis of Secure Information Flow
- Transformations between Signed and Classical Clause Logic \Lambda Bernhard Beckert Reiner Hahnle
- Deductive Verification of C Programs with KeY-C Oleg Murk, Daniel Larsson, and Reiner Hahnle
- Part I History Chapter 1. The Early History of Automated Deduction 3
- Automated Theorem Proving in Multiple Valued Logics
- Ordered Resolution vs. Connection Graph Reiner Hahnle 1 , Neil V. Murray 2 , Erik Rosenthal 3
- The Approach: Integrating Object Oriented Design and Formal Veri cation
- Linearity and Regularity with Negation Normal Form Reiner Hahnle
- ATP Grad Course 2003/04 Formalisation Formalisation of IMV Theorem
- The Approach: Integrating Design and Formal Verification of Java Card Programs
- Exploiting Data Dependencies in ManyValued Logics Reiner Hahnle
- Resolution Theorem Proving Leo Bachmair
- ATP Grad Course 2004/05 Completeness Regular Connection Tableaux
- Tableaux + Constraints Martin Giese and Reiner Hahnle
- Commodious Axiomatization of Quantifiers in MultipleValued Logic \Lambda Reiner Hahnle
- Abstract Interpretation of Symbolic Execution with Explicit State Updates
- ATP Grad Course 2003/04 Unification Unification Cont'd
- An Integrated Metamodel for OCL Types Thomas Baar 1 and Reiner Hahnle 2
- Model Generation Theorem Proving with Interval Constraints \Lambda
- Fast Subsumption Checks Using AntiLinks
- Automated Theorem Proving Reiner Hahnle #
- Using a Software Testing Technique to Improve Theorem Proving
- ATP Grad Course 2003/04 Formalisation Formalisation of IMV Theorem
- A New Look at Formal Methods for Software Construction
- Connecting OCL with the Rest of the World Reiner Hahnle and Aarne Ranta
- Generating Unit Tests from Formal Proofs Christian Engel and Reiner Hhnle
- Program Specialization Via a Software Verification Tool
- Automated Theorem Proving Reiner Hahnle
- Software Tools for Technology Transfer manuscript No. (will be inserted by the editor)
- Restart Tableaux with Selection Function Christian Pape and Reiner Hahnle
- Efficient Deduction in ManyValued Logics Reiner Hahnle
- Tutorial: Complexity of ManyValued Logics Reiner Hahnle
- ATP Grad Course 2001/02 Overview Part 1: Prerequisites
- Verification of Hardware Systems with First-Order Logic
- COMMODIOUS AXIOMATIZATION OF QUANTIFIERS IN MULTIPLEVALUED LOGIC
- ATP Grad Course 2004/05 From Calculus to Proof Procedure From Calculus to Proof Procedure
- Modeling Spatial and Temporal Variability with the HATS
- Verified Resource Guarantees using COSTA and KeY Elvira Albert
- Automating Verification of Loops by Parallelization Tobias Gedell and Reiner Hhnle
- ATP Grad Course 2003/04 Soundness Soundness Cont'd
- A Hoare-Style Calculus with Explicit State Updates
- Task Forces in the EternalS Coordination Action Reiner Hahnle
- The KeY System 1.0 (Deduction Component)
- Some Remarks on Completeness, Connection Graph Resolution and Link Deletion \Lambda
- Improving Temporal Logic Tableaux using Integer Constraints
- ATP Grad Course 2003/04 Overview Part 1: Prerequisites
- Automated Theorem Proving Reiner Hahnle
- ATP Grad Course 2003/04 Normal Form Normal Form Cont'd
- Integration of a Security Type System into a Program Logic
- ATP Grad Course 2004/05 From Calculus to Proof Procedure From Calculus to Proof Procedure
- A New Translation from Deduction into Integer Programming Reiner H"ahnle*
- Ordered Tableaux: Extensions and Applications ? Reiner Hahnle and Christian Pape
- The 2SAT Problem of Regular Signed CNF Formulas Bernhard Beckert
- Verification of Variable Software: An Experience Report
- Semantic Semantic Tableaux Reiner Hahnle
- HATS: Highly Adaptable and Trustworthy Software using Formal Methods
- Long Version of Paper in: Proceedings Interational Symposium on Multipl* *e-Valued Logic, Victoria 1991, IEEE Press, pp. 238 -245
- Many-Valued Logic and Mixed Integer Programming
- The Tableau-Based Theorem Prover 3TAP for Multiple-Valued Logics*
- A Modular Reduction of Regular Logic to Classical Logic Ramon Bejar
- Simplification of ManyValued Logic Formulas Using AntiLinks \Lambda
- ATP Grad Course 2003/04 Unification Unification Cont'd
- ATP Grad Course 2001/02 Overview Part 1: Prerequisites
- Automated Theorem Proving Reiner Hahnle
- Automated Theorem Proving Reiner Hahnle
- To appear in Jornal of Logic and Computation, 1994 Short Conjunctive Normal Forms in Finitely-Valued
- The Liberalized ffi-Rule in Free Variable Semantic Tableaux Reiner H"ahnle Peter H. Schmitt
- Short CNF in Finitely#Valued Logics Reiner H"ahnle?
- An Improved Method for Adding Equality to Free Variable Semantic Tableaux*
- In Proceedings Workshop Computer Science Logic, Heidelberg 1990, S* *pringer LNCS 533, pp. 248 -260
- ATPGradCourse2004/05Completeness RegularConnectionTableaux
