Michael Mendler

According to our database1, Michael Mendler authored at least 67 papers between 1989 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


SCEst: Sequentially Constructive Esterel.
ACM Trans. Embedded Comput. Syst., 2018

Logical Analysis of Distributed Systems: The Importance of Being Constructive (Invited Talk).
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach.
Proceedings of the Programming Languages and Systems, 2018

Logic Meets Algebra: Compositional Timing Analysis for Synchronous Reactive Multithreading.
Proceedings of the Models, Mindsets, 2018

On Reconciling Concurrency, Sequentiality and Determinacy for Reactive Systems - A Sequentially Constructive Circuit Semantics for Esterel.
Proceedings of the 18th International Conference on Application of Concurrency to System Design, 2018

Timing Analysis of Synchronous Programs using WCRT Algebra: Scalability through Abstraction.
ACM Trans. Embedded Comput. Syst., 2017

Modular Compilation of Hybrid Systems for Emulation and Large Scale Simulation.
ACM Trans. Embedded Comput. Syst., 2017

Compositional timing-aware semantics for synchronous programming.
Proceedings of the 2017 Forum on Specification and Design Languages, 2017

A Novel WCET Semantics of Synchronous Programs.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

Denotational fixed-point semantics for constructive scheduling of synchronous concurrency.
Acta Inf., 2015

Sequential Constructiveness, SCCharts for Safety-Critical Applications.
Proceedings of the Software Engineering & Management 2015, Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW, 17. März, 2015

SCEst: Sequentially constructive esterel.
Proceedings of the 13. ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2015

Sequentially Constructive Concurrency - A Conservative Extension of the Synchronous Model of Computation.
ACM Trans. Embedded Comput. Syst., 2014

On the Computational Interpretation of CKn for Contextual Information Processing.
Fundam. Inform., 2014

SCCharts: sequentially constructive statecharts for safety-critical applications: HW/SW-synthesis for a conservative extension of synchronous statecharts.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2014

Grounding Synchronous Deterministic Concurrency in Sequential Programming.
Proceedings of the Programming Languages and Systems, 2014

Sequentially constructive concurrency: a conservative extension of the synchronous model of computation.
Proceedings of the Design, Automation and Test in Europe, 2013

Constructive Boolean circuits and the exactness of timed ternary simulation.
Formal Methods in System Design, 2012

Cut-free Gentzen calculus for multimodal CK.
Inf. Comput., 2011

Computing with streams.
Proceedings of the POPL 2011 Workshop on Declarative Aspects of Multicore Programming, 2011

Is observational congruence on µ-expressions axiomatisable in equational Horn logic?
Inf. Comput., 2010

An Algebra of Synchronous Scheduling Interfaces
Proceedings of the Proceedings Foundations for Interface Technologies, 2010

Towards a Simply Typed CALculus for Semantic Knowledge Bases.
Proceedings of the 3rd International Workshop on Logics, Agents, and Mobility, 2010

What Is in a Step: New Perspectives on a Classical Question.
Proceedings of the Time for Verification, 2010

Exponential Speedup in UL Subsumption Checking relative to general TBoxes for the Constructive Semantics.
Proceedings of the 22nd International Workshop on Description Logics (DL 2009), 2009

WCRT algebra and interfaces for esterel-style synchronous processing.
Proceedings of the Design, Automation and Test in Europe, 2009

Electr. Notes Theor. Comput. Sci., 2008

Selected Papers from SLA++P 07 and 08 Model-Driven High-Level Programming of Embedded Systems.
EURASIP J. Emb. Sys., 2008

Towards Constructive DL for Abstraction and Refinement.
Proceedings of the 21st International Workshop on Description Logics (DL2008), 2008

Is Observational Congruence Axiomatisable in Equational Horn Logic?
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

Electr. Notes Theor. Comput. Sci., 2005

Constructive semantics for instantaneous reactions.
Proceedings of the Games for Logic and Programming Languages (GALOP 2005), 2005

Forthcoming Papers.
J. Log. Comput., 2004

J. Log. Comput., 2004

Formal Asp. Comput., 2004

A-maze-ing Esterel.
Electr. Notes Theor. Comput. Sci., 2004

Intensional Completeness in an Extension of Gödel/Dummett Logic.
Studia Logica, 2003

Editorial: Where Theory and Practice Meet.
Formal Asp. Comput., 2003

A Compositional Semantic Theory for Synchronous Component-based Design.
Proceedings of the CONCUR 2003, 2003

The intuitionism behind Statecharts steps.
ACM Trans. Comput. Log., 2002

Towards a Model-Theory for Esterel.
Electr. Notes Theor. Comput. Sci., 2002

Axiomatizing an Algebra of Step Reactions for Synchronous Languages.
Proceedings of the CONCUR 2002, 2002

Special issue: Modalities in type theory.
Mathematical Structures in Computer Science, 2001

Abstraction and Refinement in Higher Order Logic.
Proceedings of the Theorem Proving in Higher Order Logics, 14th International Conference, 2001

Statecharts: From Visual Syntax to Model-Theoretic Semantics.
Proceedings of the Informatik 2001: Wirtschaft und Wissenschaft in der Network Economy, 2001

Categorical and Kripke Semantics for Constructive S4 Modal Logic.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

Characterising Combinational Timing Analyses in Intuitionistic Modal Logic.
Logic Journal of the IGPL, 2000

Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic.
Formal Methods in System Design, 2000

On the Logical Content of Computational Type Theory: A Solution to Curry's Problem.
Proceedings of the Types for Proofs and Programs, International Workshop, 2000

Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Äquivalenz von annotierten Kontrollflussgraphen zur Darstellung von HLS-Ein-und Ausgaben bei Verwendung pfadbasierter Einplanungsverfahren.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 1999

Formale Modellierung von kontrollflussdominierten High-Level-Synthese-Eingabebeschreibungen zur Verifikation von Ergebnissen kontrollflussgesteuerter Einplanungsverfahren.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 1998

Combined Formal Post- and Presynthesis Verification in High Level Synthesis.
Proceedings of the Formal Methods in Computer-Aided Design, 1998

Propositional Lax Logic.
Inf. Comput., 1997

MOSEL: A FLexible Toolset for Monadic Second-Order Logic.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1997

An Algebraic Theory of Multiple Clocks.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

MOSEL: A Sound and Efficient Tool for M2L(Str).
Proceedings of the Computer Aided Verification, 9th International Conference, 1997

A Timing Refinement of Intuitionistic Proofs and its Application to the Timing Analysis of Combinational Circuits.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

Describing a Signal Analyzer in the Process Algebra PMC - A Case Study.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Abstraction of Hardware Construction.
Proceedings of the Higher-Order Algebra, 1995

Formal design of a class of computers.
Proceedings of the Correct Hardware Design and Verification Methods, 1995

An Asynchronous Algebra with Multiple Clocks.
Proceedings of the Programming Languages and Systems, 1994

An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

A modal logic for handling behavioural constraints in formal hardware verification.
PhD thesis, 1993

Compositional characterization of observable program properties.
ITA, 1992

Newtonian Arbiters Cannot be Proven Correct.
Proceedings of the Designing Correct Circuits, 1992

Stepwise Refinement of Layered Protocols by Formal Program Development.
Proceedings of the Protocol Specification, 1989