2007 |
42 | EE | Thomas Raths,
Jens Otten,
Christoph Kreitz:
The ILTP Problem Library for Intuitionistic Logic.
J. Autom. Reasoning 38(1-3): 261-271 (2007) |
2006 |
41 | EE | Dexter Kozen,
Christoph Kreitz,
Eva Richter:
Automating Proofs in Category Theory.
IJCAR 2006: 392-407 |
40 | EE | Stuart F. Allen,
Mark Bickford,
Robert L. Constable,
Richard Eaton,
Christoph Kreitz,
Lori Lorigo,
E. Moran:
Innovations in computational type theory using Nuprl.
J. Applied Logic 4(4): 428-469 (2006) |
2005 |
39 | EE | Thomas Raths,
Jens Otten,
Christoph Kreitz:
The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic.
TABLEAUX 2005: 333-337 |
2004 |
38 | EE | Christoph Kreitz,
Heiko Mantel:
A Matrix Characterization for Multiplicative Exponential Linear Logic.
J. Autom. Reasoning 32(2): 121-166 (2004) |
37 | EE | Christoph Kreitz:
Building reliable, high-performance networks with the Nuprl proof development system.
J. Funct. Program. 14(1): 21-68 (2004) |
2003 |
36 | EE | Jason Hickey,
Aleksey Nogin,
Robert L. Constable,
Brian E. Aydemir,
Eli Barzilay,
Yegor Bryukhov,
Richard Eaton,
Adam Granicz,
Alexei Kopylov,
Christoph Kreitz,
Vladimir Krupski,
Lori Lorigo,
Stephan Schmitt,
Carl Witty,
Xin Yu:
MetaPRL - A Modular Logical Environment.
TPHOLs 2003: 287-303 |
2001 |
35 | EE | Xiaoming Liu,
Robbert van Renesse,
Mark Bickford,
Christoph Kreitz,
Robert L. Constable:
Protocol Switching: Exploiting Meta-Properties.
ICDCS Workshops 2001: 37-42 |
34 | EE | Stephan Schmitt,
Lori Lorigo,
Christoph Kreitz,
Aleksey Nogin:
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants.
IJCAR 2001: 421-426 |
33 | EE | Mark Bickford,
Christoph Kreitz,
Robbert van Renesse,
Xiaoming Liu:
Proving Hybrid Protocols Correct.
TPHOLs 2001: 105-120 |
32 | | Christoph Kreitz,
Brigitte Pientka:
Connection-Driven Inductive Theorem Proving.
Studia Logica 69(2): 293-326 (2001) |
2000 |
31 | | Stuart F. Allen,
Robert L. Constable,
Richard Eaton,
Christoph Kreitz,
Lori Lorigo:
The Nuprl Open Logical Environment.
CADE 2000: 170-176 |
30 | | Christoph Kreitz:
Prologue.
Intellectics and Computational Logic 2000: 1-2 |
29 | | Christoph Kreitz,
Jens Otten,
Stephan Schmitt,
Brigitte Pientka:
Matrix-based Constructive Theorem Proving.
Intellectics and Computational Logic 2000: 189-205 |
28 | | Christoph Kreitz:
Epilogue.
Intellectics and Computational Logic 2000: 387 |
27 | | Christoph Kreitz,
Brigitte Pientka:
Matrix-Based Inductive Theorem Proving.
TABLEAUX 2000: 294-308 |
26 | | Christoph Kreitz,
Stephan Schmitt:
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems.
Inf. Comput. 162(1-2): 226-254 (2000) |
1999 |
25 | EE | Xiaoming Liu,
Christoph Kreitz,
Robbert van Renesse,
Jason Hickey,
Mark Hayden,
Kenneth P. Birman,
Robert L. Constable:
Building reliable, high-performance communication systems from components.
SOSP 1999: 80-92 |
24 | EE | Christoph Kreitz:
Automated Fast-Track Reconfiguration of Group Communication Systems.
TACAS 1999: 104-118 |
23 | | Brigitte Pientka,
Christoph Kreitz:
Automating Inductive Specification Proofs.
Fundam. Inform. 39(1-2): 189-209 (1999) |
22 | EE | Christoph Kreitz,
Jens Otten:
Connection-based Theorem Proving in Classical and Non-classical Logics.
J. UCS 5(3): 88-112 (1999) |
1998 |
21 | EE | Brigitte Pientka,
Christoph Kreitz:
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs.
AISC 1998: 247-258 |
20 | EE | Christoph Kreitz,
Mark Hayden,
Jason Hickey:
A Proof Environment for the Development of Group Communication Systems.
CADE 1998: 317-332 |
19 | EE | Heiko Mantel,
Christoph Kreitz:
A Matrix Characterization for MELL.
JELIA 1998: 169-183 |
18 | EE | Stephan Schmitt,
Christoph Kreitz:
Deleting Redundancy in Proof Reconstruction.
TABLEAUX 1998: 262-276 |
1997 |
17 | | Daniel S. Korn,
Christoph Kreitz:
Deciding Intuitionistic Propositional Logic via Translation into Classical Logic.
CADE 1997: 131-145 |
16 | | Christoph Kreitz,
Heiko Mantel,
Jens Otten,
Stephan Schmitt:
Connection-Based Proof Construction in Linear Logic.
CADE 1997: 207-221 |
15 | EE | Wolfgang Bibel,
Daniel S. Korn,
Christoph Kreitz,
F. Kurucz,
Jens Otten,
Stephen Schmitt,
G. Stolpmann:
A Multi-level Approach to Program Synthesis.
LOPSTR 1997: 1-27 |
1996 |
14 | | Stephan Schmitt,
Christoph Kreitz:
Converting Non-Classical Matrix Proofs into Sequent-Style Systems.
CADE 1996: 418-432 |
13 | | Wolfgang Bibel,
Daniel S. Korn,
Christoph Kreitz,
Stephen Schmitt:
Problem-Oriented Applications of Automated Theorem Proving.
DISCO 1996: 1-21 |
12 | | Christoph Kreitz,
Kung-Kiu Lau,
Mario Ornaghi:
Formal Reasoning about Modules, Reuse and their Correctness.
FAPR 1996: 384-398 |
11 | | Jens Otten,
Christoph Kreitz:
A Uniform Proof Procedure for Classical and Non-Classical Logics.
KI 1996: 307-319 |
10 | | Jens Otten,
Christoph Kreitz:
T-String Unification: Unifying Prefixes in Non-classical Proof Methods.
TABLEAUX 1996: 244-260 |
9 | EE | Christoph Kreitz:
Formal Mathematics for Verifiably Correct Program Synthesis.
Logic Journal of the IGPL 4(1): 75-94 (1996) |
1995 |
8 | | Christoph Kreitz,
Jens Otten,
Stephan Schmitt:
Guiding Program Development Systems by a Connection Based Proof Strategy.
LOPSTR 1995: 137-151 |
7 | | Stephan Schmitt,
Christoph Kreitz:
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs.
TABLEAUX 1995: 106-121 |
1992 |
6 | | Thierry Boy de la Tour,
Christoph Kreitz:
Building Proofs by Analogy via the Curry-Horward Isomorphism.
LPAR 1992: 202-213 |
1991 |
5 | | Klaus Weihrauch,
Christoph Kreitz:
Type 2 Computational Complexity of Functions on Cantor's Space.
Theor. Comput. Sci. 82(1): 1-18 (1991) |
1990 |
4 | | Christoph Kreitz:
The Representation of Program Synthesis in Higher Order Logic.
GWAI 1990: 171-180 |
1989 |
3 | | Gerd Neugebauer,
Bertram Fronhöfer,
Christoph Kreitz:
XPRTS - An Implementation Tool for Program Synthesis.
GWAI 1989: 348-357 |
1985 |
2 | | Christoph Kreitz,
Klaus Weihrauch:
Theory of Representations.
Theor. Comput. Sci. 38: 35-53 (1985) |
1983 |
1 | | Christoph Kreitz,
Klaus Weihrauch:
Complexity theory on real numbers and functions.
Theoretical Computer Science 1983: 165-174 |