| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| Matthews92a | Matthews, Seán | 1992 | | Reflection in a Logical System
In: Proc.~IMSA '92 Workshop on Reflection and Meta-Level Architecture, 178-183 | Proceedings Article |
| Matthews94b | Matthews, Seán | 1994 | | A Theory and its Metatheory in $FS_0$
In: What is a logical system?, 329-354 | Part of a Book |
| Matthews96b | Matthews, Seán | 1996 | | Implementing $\textrm FS_0$ in Isabelle: Adding Structure at the Metalevel
In: Design and Implementation of Symbolic Computation Systems (DISCO'96), 228-239 | Proceedings Article |
| Matthews97a | Matthews, Seán | 1997 | | A practical implementation of simple consequence relations using inductive definitions
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 306-320 | Proceedings Article |
| Matthews97b | Matthews, Seán | 1997 | | Extending a logical framework with a modal connective for validity
In: Proceedings of the 3rd Symposium on Theoretical Aspects of Computer Software (TACS-97), 491-514 | Proceedings Article |
| MatthewsSimpson96a | Matthews, Seán
Simpson, Alex | 1996 | | Reflection using the derivability conditions
In: Logic and Algebra, 603-616 | Part of a Book |
| MatthewsSmaillBasin93a | Matthews, Seán
Smaill, Alan
Basin, David A. | 1993 | | Experience with $FS_0$ as a Framework Theory
In: Logical Environments, 61-82 | Part of a Book |
| Meter2009 | Meter, Peter | 2009 | | Just a test entry
In: Booktitle, 1001-1010 | Proceedings Article |
| Meyer-Diplom96 | Meyer, Christoph | 1996 |  | Parallel Unit Resulting Resolution
Universität des Saarlandes | Thesis - Masters thesis |
| Meyer-Diss | Meyer, Christoph | 1999 | | Soft Typing for Clausal Inference Systems
Universität des Saarlandes | Thesis - PhD thesis |
| MNP-Ines | Müller, Martin
Niehren, Joachim
Podelski, Andreas | 1997 | | Inclusion Constraints over Non-empty Sets of Trees
In: Proceedings of the 7th International Joint Conference CAAP/FASE: Theory and practice of software development (TAPSOFT-97), 345-356 | Proceedings Article |
| MNP:Constraints99 | Müller, Martin
Niehren, Joachim
Podelski, Andreas | 2000 | | Ordering Constraints over Feature Trees
In: Constraints [5], 7-41 | Journal Article |
| mod-modal | Basin, David A.
Krieg-Brückner, Bernd | 1999 | | Formalization of the Development Process
In: Algebraic foundations of systems specification, 521-562 | Part of a Book |
| Mohr95 | Mohr, Erik | 1995 | | Resolution-Based Calculi for Modal Logics
Universität des Saarlandes | Thesis - Masters thesis |
| MP-SARA02 | Mukhopadhyay, Supratik
Podelski, Andreas | 2002 | | An Algebraic Framework for Abstract Model Checking
In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, 152-169 | Proceedings Article |
| MuellerNiehrenPodelski97a | Müller, Martin
Niehren, Joachim
Podelski, Andreas | 1997 | | Ordering Constraints over Feature Trees
In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), 549-562 | Proceedings Article |
| Mukhopadhyay-Thesis-2001 | Mukhopadhyay, Supratik | 2001 | | A Uniform Constraint-based Framework for the Verification of Infinite State Systems
Universität des Saarlandes | Thesis - PhD thesis |
| Mukhopadhyay2000 | Mukhopadhyay, Supratik
Podelski, Andreas | 2000 | | Model Checking for Timed Logic Processes
In: Proceedings of the 1st International Conference on Computational Logic, 598-612 | Proceedings Article |
| MukhopadhyayPodelski2001 | Mukhopadhyay, Supratik
Podelski, Andreas | 2001 | | Constraint Database Models Characterizing Timed Bisimilarity
In: Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages, 245-258 | Proceedings Article |
| MukhopadhyayPodelskiErshov2001 | Mukhopadhyay, Supratik
Podelski, Andreas | 2001 | | Accurate Widenings and Boundedness Properties of Timed Systems
In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, 79-94 | Proceedings Article |
| MukhopadhyayPodelskiFSTTCS1999 | Mukhopadhyay, Supratik
Podelski, Andreas | 1999 | | Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS-99), 232-244 | Proceedings Article |
| Naumann-Diplom97 | Naumann, Stefan | 1997 | | Integration des automatischen Beweisers SPASS in die mathematische Assistenzumgebung OMEGA
Universität des Saarlandes | Thesis - Masters thesis |
| NiehrenMuellerTalbot_LICS1999 | Talbot, Jean-Marc
Niehren, Joachim
Müller, Martin | 1999 | | Entailment of Atomic Set Constraints is PSPACE-Complete
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 285-294 | Proceedings Article |
| NieuwenhuisHillenbrandRiazanovVoronkov2001 | Nieuwenhuis, Robert
Hillenbrand, Thomas
Riazanov, Alexandre
Voronkov, Andrei | 2001 | | On the Evaluation of Indexing Techniques for Theorem Proving
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 257-271 | Proceedings Article |
| NiSe01esop | Nielson, Flemming
Seidl, Helmut | 2001 | | Control-Flow Analysis in Cubic Time
In: Proceedings of the 10th European Symposium on Programming (ESOP-01) held as part of the Joint European Conferences on Theory and Practice of Software (ETAPS-01), 252-268 | Proceedings Article |
| NivatPodelski97 | Nivat, Maurice
Podelski, Andreas | 1997 | | Minimal Ascending and Descending Tree Automata
In: SIAM Journal on Computing [26], 39-58 | Journal Article |
| NivelleYevgeny2004 | de Nivelle, Hans
Kazakov, Yevgeny | 2004 | | Resolution Decision Procedures for the Guarded Fragment with
Transitive Guards | Report |
| Nonnengart-Dissertation | Nonnengart, Andreas | 1995 | | A Resolution-Based Calculus for Temporal Logics
Universität des Saarlandes | Thesis - PhD thesis |
| Nonnengart1998 | Nonnengart, Andreas | 1998 | | Modal Frame Characterization by Way of Auxiliary Modalities
In: Logic Journal of the IGPL [6], 875-899 | Journal Article |
| nonnengart93a | Nonnengart, Andreas | 1993 | | First-Order Modal Logic Theorem Proving and Functional Simulation
In: Proc.~13th Intern.~Joint Conference on Artificial Intelligence (IJCAI '93), 80-85 | Proceedings Article |
