Nipkow, Tobias - Institut für Informatik, Technische Universität München

• J. Functional Programming 1 (1): 1--000, January 1998. Printed in the United Kingdom fl 1998 Cambridge University Press
• Hoare Logic for NanoJava: Auxiliary Variables, Side Effects and Virtual Methods revisited
• Proof Pearl: Defining Functions over Finite Sets Tobias Nipkow1
• Winskel is (almost) Right Towards a Mechanized Semantics Textbook
• Random testing in Isabelle/HOL Stefan Berghofer and Tobias Nipkow
• Java: Embedding a Programming Language in a Theorem Prover
• Proof of the Schorr-Waite algorithm Farhad Mehta and Tobias Nipkow
• Proving Pointer Programs in HigherOrder Logic
• CONCURRENCY---PRACTICE AND EXPERIENCE Concurrency: Pract. Exper. 2001; 13:1 Prepared using cpeauth.cls [Version: 2000/05/12 v2.0]
• Formal Aspects of Computing (1998) 3: 1--000 fl 1998 BCS
• Veri ed Bytecode Veri ers Tobias Nipkow
• Nominal Verification of Algorithm W Christian Urban and Tobias Nipkow
• Generic Proof Synthesis for Presburger Arithmetic Amine Chaieb and Tobias Nipkow
• Type Inference Verified: Algorithm W in Isabelle/HOL ?
• Hoare Logic for NanoJava: Auxiliary Variables, Side E ects and Virtual Methods revisited
• Structured Proofs in Isar/HOL Tobias Nipkow
• Flyspeck I: Tame Graphs Tobias Nipkow and Gertrud Bauer and Paula Schultz +
• Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism
• Journal of Automated Reasoning manuscript No. (will be inserted by the editor)
• Flyspeck I: Tame Graphs Tobias Nipkow and Gertrud Bauer and Paula Schultz
• I/O Automata in Isabelle/HOL Tobias Nipkow ? and Konrad Slind ??
• Proof Pearl: Regular Expression Equivalence and Relation Algebra
• Jinja: Towards a Comprehensive Formal Semantics for a Java-like Language
• Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
• Structured Proofs in Isar/HOL Tobias Nipkow
• Certifying Machine Code Safety: Shallow versus Deep Embedding
• Verifying and reflecting quantifier elimination for Presburger arithmetic
• Tame Plane Graphs Gertrud Bauer and Tobias Nipkow
• An Operational Semantics and Type Safety Proof for Multiple Inheritance in C++
• Reflecting Quantifier Elimination for Linear Arithmetic
• Proof Synthesis and Reflection for Linear Arithmetic
• Linear Quantifier Elimination Tobias Nipkow
• HigherOrder Rewrite Systems and their Confluence Richard Mayr & Tobias Nipkow \Lambda
• Hoare Logics for Recursive Procedures and Unbounded Nondeterminism
• Owicki/Gries in Isabelle/HOL Tobias Nipkow and Leonor Prensa Nieto
• HOARE LOGICS IN ISABELLE/HOL TOBIAS NIPKOW
• The 5 Colour Theorem in Isabelle/Isar Gertrud Bauer and Tobias Nipkow
• Verifying a Hotel Key Card System Tobias Nipkow
• The Isabelle Framework Makarius Wenzel1
• Executing Higher Order Logic Stefan Berghofer ? and Tobias Nipkow
• is TypeSafe ---Definitely Tobias Nipkow and David von Oheimb \Lambda
• TOBIAS NIPKOW AND CHRISTIAN PREHOFER HIGHER-ORDER REWRITING
• Type Inference Verified: Algorithm W in Isabelle/HOL ?
• Winskel is (almost) Right Towards a Mechanized Semantics Textbook
• Java`ightis Type-Safe _ Definitely Tobias Nipkow and David von Oheimb*
• Proof Transformations For Equational Theories Tobias Nipkow
• Orthogonal Higher-Order Rewrite Systems are Confluent* Tobias Nipkowy
• Formal Verification of Data Type Refinement Theory and Practice*
• Proof terms for simply typed higher order logic Stefan Berghofer ? and Tobias Nipkow
• Proving Pointer Programs in Higher-Order Logic Farhad Mehta and Tobias Nipkow
• More ChurchRosser Proofs (in Isabelle/HOL)
• OrderSorted Polymorphism in Isabelle \Lambda Tobias Nipkow y
• TOBIAS NIPKOW AND CHRISTIAN PREHOFER HIGHERORDER REWRITING
• Verified Lexical Analysis Tobias Nipkow
• HOARE LOGICS IN ISABELLE/HOL TOBIAS NIPKOW
• Sledgehammer: Judgement Day Sascha Bohme and Tobias Nipkow
• Code Generation via Higher-Order Rewrite Systems
• Higher-Order Unification, Polymorphism, and Subsorts (Extended Abstract)
• Ordered Rewriting and Confluence Ursula Martin* and Tobias Nipkowy
• Formal Aspects of Computing (1998) 3: 1-000 Oc 1998 BCS
• Verified Lexical Analysis Tobias Nipkow
• More Church-Rosser Proofs (in Isabelle/HOL) Tobias Nipkow?
• Formal Verification of Algorithm W : The Monomorphic Case
• More Church-Rosser Proofs (in Isabelle/HOL)
• J. Functional Programming 1 (1): 1-000, January 1993 Oc1993 Cambridge Universit* *y Press 1
• Boolean Unification -The Story So Far* Ursula Martiny and Tobias Nipkow
• Functional Unification of Higher-Order Patterns* Tobias Nipkowy
• Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
• Traces of I/OAutomata in Isabelle/HOLCF Olaf Muller ? and Tobias Nipkow ??
• Tame Plane Graphs Gertrud Bauer and Tobias Nipkow
• Journal of Automated Reasoning manuscript No. (will be inserted by the editor)
• Veri ed Bytecode Veri ers Gerwin Klein, Tobias Nipkow
• ~Java: Embedding a Programming Language in a Theorem Prover
• Order-Sorted Polymorphism in Isabelle* Tobias Nipkowy
• Owicki/Gries in Isabelle/HOL Tobias Nipkow and Leonor Prensa Nieto
• Proof terms for simply typed higher order logic Stefan Berghofer? and Tobias Nipkow
• Combining Model Checking and Deduction for I/O-Automata Olaf M"uller and Tobias Nipkow*
• Verified Bytecode Verifiers Tobias Nipkow
• Automating Squiggol Ursula Martin* and Tobias Nipkowy
• Higher-Order Rewrite Systems and their Confluence Richard Mayr & Tobias Nipkow*
• Interpreter Verification for a Functional Language
• Extending Hindley-Milner Type Inference with Coercive Subtyping (long version)
• Extending Hindley-Milner Type Inference with Coercive Subtyping
• Majority Vote Algorithm Revisited Again Tobias Nipkow
• Proof Pearl: The Marriage Theorem Dongchen Jiang12
• Teaching Semantics with a Proof Assistant: No more LSD Trip Proofs
• ZU064-05-FPR root 11 November 2011 16:42 Under consideration for publication in J. Functional Programming 1
• Extending Hindley-Milner Type Inference with Coercive Structural Subtyping
• Verifying pCTL Model Checking Johannes Hlzl and Tobias Nipkow