| 2013 | ||
|---|---|---|
| c30 | Reinhard von Hanxleden, Michael Mendler, Joaquin Aguado, Björn Duderstadt, Insa Fuhrmann, Christian Motika, Stephen Mercer, Owen O'Brien: Sequentially constructive concurrency: a conservative extension of the synchronous model of computation. DATE 2013: 581-586 | |
| 2012 | ||
| j22 | Michael Mendler, Thomas R. Shiple, Gérard Berry: Constructive Boolean circuits and the exactness of timed ternary simulation. Formal Methods in System Design 40(3): 283-329 (2012) | |
| 2011 | ||
| j21 | Michael Mendler, Stephan Scheele: Cut-free Gentzen calculus for multimodal CK. Inf. Comput. 209(12): 1465-1490 (2011) | |
| j20 | Joaquin Aguado, Michael Mendler: Constructive semantics for instantaneous reactions. Theor. Comput. Sci. 412(11): 931-961 (2011) | |
| c29 | ||
| 2010 | ||
| j19 | Michael Mendler, Gerald Lüttgen: Is observational congruence on µ-expressions axiomatisable in equational Horn logic? Inf. Comput. 208(6): 634-651 (2010) | |
| j18 | Michael Mendler, Stephan Scheele: Towards Constructive DL for Abstraction and Refinement. J. Autom. Reasoning 44(3): 207-243 (2010) | |
| c28 | Willem-Paul de Roever, Gerald Lüttgen, Michael Mendler: What Is in a Step: New Perspectives on a Classical Question. Essays in Memory of Amir Pnueli 2010: 370-399 | |
| c27 | ||
| 2009 | ||
| c26 | Michael Mendler, Reinhard von Hanxleden, Claus Traulsen: WCRT algebra and interfaces for esterel-style synchronous processing. DATE 2009: 93-98 | |
| c25 | Michael Mendler, Stephan Scheele: Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics. Description Logics 2009 | |
| 2008 | ||
| j17 | Florence Maraninchi, Michael Mendler, Marc Pouzet, Alain Girault, Éric Rutten: Selected Papers from SLA++P 07 and 08 Model-Driven High-Level Programming of Embedded Systems. EURASIP J. Emb. Sys. 2008 (2008) | |
| j16 | ||
| c24 | Michael Mendler, Stephan Scheele: Towards Constructive DL for Abstraction and Refinement. Description Logics 2008 | |
| 2007 | ||
| c23 | Michael Mendler, Gerald Lüttgen: Is Observational Congruence Axiomatisable in Equational Horn Logic? CONCUR 2007: 197-211 | |
| 2005 | ||
| j15 | Gerald Lüttgen, Natividad Martínez Madrid, Michael Mendler: Preface. Electr. Notes Theor. Comput. Sci. 115: 1-2 (2005) | |
| c22 | Joaquin Aguado, Michael Mendler: Constructive semantics for instantaneous reactions. GALOP 2005: 16-31 | |
| 2004 | ||
| j14 | Joaquin Aguado, Michael Mendler, Gerald Lüttgen: A-maze-ing Esterel. Electr. Notes Theor. Comput. Sci. 88: 21-37 (2004) | |
| j13 | ||
| j12 | ||
| j11 | Valeria de Paiva, Rajeev Goré, Michael Mendler: Forthcoming Papers. J. Log. Comput. 14(4): 621-622 (2004) | |
| 2003 | ||
| j10 | Manfred Broy, Gerald Lüttgen, Michael Mendler: Editorial: Where Theory and Practice Meet. Formal Asp. Comput. 15(4): 297-298 (2003) | |
| j9 | Matt Fairtlough, Michael Mendler: Intensional Completeness in an Extension of Gödel/Dummett Logic. Studia Logica 73(1): 51-80 (2003) | |
| c21 | Barry Norton, Gerald Lüttgen, Michael Mendler: A Compositional Semantic Theory for Synchronous Component-based Design. CONCUR 2003: 453-467 | |
| 2002 | ||
| j8 | Gerald Lüttgen, Michael Mendler: Towards a Model-Theory for Esterel. Electr. Notes Theor. Comput. Sci. 65(5): 95-109 (2002) | |
| j7 | Gerald Lüttgen, Michael Mendler: The intuitionism behind Statecharts steps. ACM Trans. Comput. Log. 3(1): 1-41 (2002) | |
| c20 | Gerald Lüttgen, Michael Mendler: Axiomatizing an Algebra of Step Reactions for Synchronous Languages. CONCUR 2002: 386-401 | |
| 2001 | ||
| j6 | Matt Fairtlough, Michael Mendler, Eugenio Moggi: Special issue: Modalities in type theory. Mathematical Structures in Computer Science 11(4): 507-509 (2001) | |
| c19 | Natasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter: Categorical and Kripke Semantics for Constructive S4 Modal Logic. CSL 2001: 292-307 | |
| c18 | Gerald Lüttgen, Michael Mendler: Statecharts: From Visual Syntax to Model-Theoretic Semantics. GI Jahrestagung (1) 2001: 615-621 | |
| c17 | Matt Fairtlough, Michael Mendler, Xiaochun Cheng: Abstraction and Refinement in Higher Order Logic. TPHOLs 2001: 201-216 | |
| 2000 | ||
| j5 | Michael Mendler: Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic. Formal Methods in System Design 17(1): 5-37 (2000) | |
| j4 | Michael Mendler: Characterising Combinational Timing Analyses in Intuitionistic Modal Logic. Logic Journal of the IGPL 8(6): 821-852 (2000) | |
| c16 | Gerald Lüttgen, Michael Mendler: Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models. ICALP 2000: 163-174 | |
| c15 | Matt Fairtlough, Michael Mendler: On the Logical Content of Computational Type Theory: A Solution to Curry's Problem. TYPES 2000: 63-78 | |
| 1999 | ||
| c14 | Thomas Lock, Michael Mendler: Äquivalenz von annotierten Kontrollflussgraphen zur Darstellung von HLS-Ein-und Ausgaben bei Verwendung pfadbasierter Einplanungsverfahren. MBMV 1999: 51-60 | |
| 1998 | ||
| c13 | Thomas Lock, Michael Mendler, Matthias Mutz: Combined Formal Post- and Presynthesis Verification in High Level Synthesis. FMCAD 1998: 222-236 | |
| c12 | Thomas Lock, Michael Mendler: Formale Modellierung von kontrollflussdominierten High-Level-Synthese-Eingabebeschreibungen zur Verifikation von Ergebnissen kontrollflussgesteuerter Einplanungsverfahren. MBMV 1998: 75-84 | |
| 1997 | ||
| j3 | ||
| c11 | Peter Kelb, Tiziana Margaria, Michael Mendler, Claudia Gsottberger: MOSEL: A Sound and Efficient Tool for M2L(Str). CAV 1997: 448-451 | |
| c10 | Rance Cleaveland, Gerald Lüttgen, Michael Mendler: An Algebraic Theory of Multiple Clocks. CONCUR 1997: 166-180 | |
| c9 | Peter Kelb, Tiziana Margaria, Michael Mendler, Claudia Gsottberger: MOSEL: A FLexible Toolset for Monadic Second-Order Logic. TACAS 1997: 183-202 | |
| 1996 | ||
| c8 | Michael Mendler: A Timing Refinement of Intuitionistic Proofs and its Application to the Timing Analysis of Combinational Circuits. TABLEAUX 1996: 261-277 | |
| 1995 | ||
| c7 | ||
| c6 | ||
| c5 | Henrik Reif Andersen, Michael Mendler: Describing a Signal Analyzer in the Process Algebra PMC - A Case Study. TAPSOFT 1995: 620-635 | |
| 1994 | ||
| c4 | Matt Fairtlough, Michael Mendler: An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware. CSL 1994: 354-368 | |
| c3 | Henrik Reif Andersen, Michael Mendler: An Asynchronous Algebra with Multiple Clocks. ESOP 1994: 58-73 | |
| 1993 | ||
| j2 | Michael Mendler, Terry Stroup: Newtonian Arbiters Cannot be Proven Correct. Formal Methods in System Design 3(3): 233-257 (1993) | |
| 1992 | ||
| j1 | Bernhard Steffen, C. Barry Jay, Michael Mendler: Compositional characterization of observable program properties. ITA 26: 403-424 (1992) | |
| c2 | Michael Mendler, Terry Stroup: Newtonian Arbiters Cannot be Proven Correct. Designing Correct Circuits 1992: 47-66 | |
| 1989 | ||
| c1 | Terry Stroup, Norbert Götz, Michael Mendler: Stepwise Refinement of Layered Protocols by Formal Program Development. PSTV 1989: 71-85 | |
Colors in the list of coauthors
Last update Mon May 20 10:31:35 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page