| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Madden
(Ed: Kapur)
[-] | 1992 | | Automated Program Transformation Through Proof Transformation
In: Proceedings of the 11th International Conference on Automated Deduction (CADE-11), 446-460 | Proceedings Article |
Madden
(Ed: Nebel, Dreschler-Fischer)
[-] | 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 |
Madden
[-] | 1995 | | Program improvement by proof planning
In: Proceedings of British Colloquium on Theoretical Computer Science (BCTCS 11), | Proceedings Article |
Madden, Bundy
[Bundy] | 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, Bundy, Smaill
[Bundy, Smaill] | 1999 | | Recursive Program Optimization Through Inductive Synthesis Proof Transformation
In: Journal of Automated Reasoning [22], 65-115 | Journal Article |
Madden, Green
(Ed: Calmet, Campbell)
[Green] | 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 |
Maier
(Ed: Charatonik, Ganzinger)
[-] | 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 |
Maier
(Ed: Gordon)
[-] | 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 |
Maier
(Ed: Marcinkowski, Tarlecki)
[-] | 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 |
Maier
(Ed: Orejas, Spirakis, van Leeuwen)
[Orejas, Spirakis, van Leeuwen] | 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 |
Maier
[-] | 2004 |  | Intuitionistic LTL and a New Characterization of Safety and Liveness | Report |
Maier
[-] | 2003 | | A Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning
Universität des Saarlandes | Thesis - PhD thesis |
Makinson, van der Torre
[Makinson] | 2001 | | Input-output logics
In: Proceedings of the 5th International Workshop on Deontic Logic in Computer Science (Deon-00),, 29 | Proceedings Article |
Makinson, van der Torre
[Makinson] | 2000 | | Input-output logics
In: Journal of Philosophical Logic [29], 383-408 | Journal Article |
Malkis, Podelski, Rybalchenko
(Ed: Barkaoui, Cavalcanti, Cerone)
[-] | 2006 | | Thread-Modular Verification is Cartesian Abstract Interpretation
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 183-197 | Proceedings Article |
Malkis, Podelski, Rybalchenko
(Ed: Gopalakrishnan, O'Leary)
[-] | 2006 | | Thread-Modular Verification and Cartesian Abstraction | Unpublished/Draft |
Matthews
(Ed: Abadi, Ito)
[-] | 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 |
Matthews
(Ed: Gabbay)
[-] | 1994 | | A Theory and its Metatheory in $FS_0$
In: What is a logical system?, 329-354 | Part of a Book |
Matthews
(Ed: McCune)
[-] | 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 |
Matthews
(Ed: Paulson)
[-] | 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 |
Matthews
(Ed: Yonezawa, Smith)
[-] | 1992 | | Reflection in a Logical System
In: Proc.~IMSA '92 Workshop on Reflection and Meta-Level Architecture, 178-183 | Proceedings Article |
Matthews, Basin
[Basin] | 2000 | | Structuring Metatheory on Inductive Definitions
In: Information and Computation [162], 80-95 | Journal Article |
Matthews, Basin
[Basin] | 1998 | | Scoped Metatheorems
In: Electronic Notes in Computer Science [15], 1-14 | Journal Article |
Matthews, Simpson
(Ed: Ursini, Agilanò)
[Simpson] | 1996 | | Reflection using the derivability conditions
In: Logic and Algebra, 603-616 | Part of a Book |
Matthews, Smaill, Basin
(Ed: Huet, Plotkin)
[-] | 1993 | | Experience with $FS_0$ as a Framework Theory
In: Logical Environments, 61-82 | Part of a Book |
Meter
(Ed: Blubber, Bla)
[-] | 2009 | | Just a test entry
In: Booktitle, 1001-1010 | Proceedings Article |
Meyer
[-] | 1999 | | Soft Typing for Clausal Inference Systems
Universität des Saarlandes | Thesis - PhD thesis |
Meyer
[-] | 1996 | | Parallel Unit Resulting Resolution
Universität des Saarlandes | Thesis - Masters thesis |
Meyer, Faber, Rybalchenko
(Ed: Barkaoui, Cavalcanti, Cerone)
[-] | 2006 | | Model checking Duration Calculus: a practical approach
In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, 332-346 | Proceedings Article |
Mohr
[-] | 1995 | | Resolution-Based Calculi for Modal Logics
Universität des Saarlandes | Thesis - Masters thesis |
