BibTeX cite key | Author/Editor | Year | | Title | Type |
Madden-1992 | Madden, Peter | 1992 | | Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460 | Proceedings Article |
Madden-93a | Madden, Peter
Bundy, Alan | 1993 | | General Proof Theoretic Techniques for Automatic
Programing
In: Proceedings of the EAST-WEST AI CONFERENCE: From
Theory to Practice - EWAIC'93, | Proceedings Article |
Madden-95a | Madden, Peter | 1995 | | Program improvement by proof planning
In: Proceedings of British Colloquium on Theoretical Computer Science (BCTCS 11), | Proceedings Article |
Madden-JAR | Madden, Peter
Bundy, Alan
Smaill, Alan | 1999 | | Recursive Program Optimization Through Inductive Synthesis Proof Transformation
In: Journal of Automated Reasoning [22], 65-115 | Journal Article |
Madden94a-djki | Madden, Peter | 1994 | | Formal Methods for Automated Program Improvement
In: KI-94: Advances in Artificial Intelligence. Proceedings of the 18th German Annual Conference on Artificial Intelligence, 367-378 | Proceedings Article |
MaddenGreen94b-aismc2 | Madden, Peter
Green, Ian | 1995 | | A General Technique for Automatic Optimization by Proof Planning
In: Proceedings of the 2nd International Conference on Artificial Intelligence and Symbolic Mathematical Computing (AISMC-2), 80-96 | Proceedings Article |
Maier2001 | Maier, Patrick | 2001 | | A Set-Theoretic Framework for Assume-Guarantee Reasoning
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-2001), 821-834 | Proceedings Article |
Maier2002 | Maier, Patrick | 2002 | | A Framework for Circular Assume-Guarantee Rules
In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, 55-58 | Proceedings Article |
Maier2003 | Maier, Patrick | 2003 | | A Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes | Thesis - PhD thesis |
Maier2003a | Maier, Patrick | 2003 | | Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete
In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, 343-357 | Proceedings Article |
Maier2004 | Maier, Patrick | 2004 | | Intuitionistic LTL and a New Characterization of Safety and Liveness | Report |
Maier2004 | Maier, Patrick | 2004 | | Intuitionistic LTL and a New Characterization of Safety and Liveness
In: Computer science logic : 18th International Workshop CSL 2004, 13th Annual Conference of the EACSL, 295-309 | Proceedings Article |
makinson99 | Makinson, David
van der Torre, Leendert W. N. | 2000 | | Input-output logics
In: Journal of Philosophical Logic [29], 383-408 | Journal Article |
makinson99b | Makinson, David
van der Torre, Leendert W. N. | 2001 | | Input-output logics
In: Proceedings of the 5th International Workshop on Deontic Logic in Computer Science (Deon-00),, 29 | Proceedings Article |
malkis2006 | Malkis, Alexander
Podelski, Andreas
Rybalchenko, Andrey | 2006 | | Thread-Modular Verification is Cartesian Abstract Interpretation
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 183-197 | Proceedings Article |
malkis2006a | Malkis, Alexander
Podelski, Andreas
Rybalchenko, Andrey | 2006 | | Thread-Modular Verification and Cartesian Abstraction | Unpublished/Draft |
MalkisPodelskiRybalchenkoSAS2007 | Rybalchenko, Andrey | 2007 | | Precise Thread-Modular Verification
In: 14th International Static Analysis Symposium (SAS 2007), ? | Proceedings Article |
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 |