Demo Data from EDBT 2026 / reviewers in the wild / expert
Werner Damm
dblp:d/WernerDamm
· DBLP profile ↗
43ranked-venue papers
33as first author
3since 2021 · last 2024
0000-0002-7277-1803ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 21 · 17 first-authorSoftware engineering, systems software and programming languages · 18 · 13 first-authorSystems, architecture and hardware · 5 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
6 papers |
Automated reasoning and model checking · 96% Automata and formal languages · 3% Logic in computer science · 1% | |
| Computer architecture, parallel and distributed computing, and storage systems
4 papers |
Distributed systems · 68% Electronic design automation · 31% Processor architecture and microarchitecture · 2% | |
| Software engineering, system software, and programming languages
3 papers |
Program verification · 99% Programming languages and type systems · 1% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 14 heaviest of 18, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automated reasoning and model checking › synthesis
distributed synthesis |
0.2 | 1 | 2014 | Automatic Compositional Synthesis of Distributed Systems · FM 2014 |
Automated reasoning and model checking
synthesis |
0.2 | 1 | 2014 | Automatic Compositional Synthesis of Distributed Systems · FM 2014 |
Machine learning › Reinforcement learning › model-based reinforcement learning
world model |
0.1 | 1 | 2011 | Does It Pay to Extend the Perimeter of a World Model? · FM 2011 |
Electronic design automation › hardware verification and test › hardware verification
complex system verification |
0.1 | 1 | 2015 | AVACS: Automatic Verification and Analysis of Complex Systems Highlights and Lessons Learned · FM 2015 |
Automated reasoning and model checking
model checking |
0.0 | 1 | 2000 | The STATEMATE Verification Environment - Making It Real · CAV 2000 |
Electronic design automation › hardware verification and test
hardware verification |
0.0 | 1 | 1993 | Verification of timing Properties of VHDL · CAV 1993 |
Electronic design automation › hardware verification and test
timing verification |
0.0 | 1 | 1993 | Verification of timing Properties of VHDL · CAV 1993 |
Automata and formal languages › automata-based reasoning
automata-theoretic characterization |
0.0 | 2 | 1986 | An Automata-Theoretical Characterization of the OI-Hierarchy · Inf. Control. 1986 An Automata-Theoretic Characterization of the OI-Hierarchy · ICALP 1982 |
Automata and formal languages › formal grammars › macro grammars
OI-hierarchy |
0.0 | 2 | 1986 | An Automata-Theoretical Characterization of the OI-Hierarchy · Inf. Control. 1986 An Automata-Theoretic Characterization of the OI-Hierarchy · ICALP 1982 |
Program verification › deductive verification
axiomatic verification |
0.0 | 1 | 1988 | A Microprogramming Logic · IEEE Trans. Software Eng. 1988 |
Processor architecture and microarchitecture
microprogramming |
0.0 | 1 | 1988 | A Microprogramming Logic · IEEE Trans. Software Eng. 1988 |
Program verification
temporal logic verification |
0.0 | 1 | 1993 | Verification of timing Properties of VHDL · CAV 1993 |
Programming languages and type systems › language semantics › formal semantics
axiomatic semantics |
0.0 | 1 | 1988 | A Microprogramming Logic · IEEE Trans. Software Eng. 1988 |
Logic in computer science
program schemas |
0.0 | 1 | 1977 | Languages Defined by Higher Type Program Schemes · ICALP 1977 |
Methods — techniques the papers use, named apart from their topics
hoare-style proof system · 0.0syntax-directed proof systems · 0.0syntax-directed proof system · 0.0automata theory · 0.0type recursion · 0.0higher-type recursion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A References Architecture for Human Cyber Physical Systems, Part II: Fundamental Design Principles for Human-CPS InteractionabstractAs automation increases qualitatively and quantitatively in safety-critical human cyber-physical systems, it is becoming more and more challenging to increase the probability or ensure that human operators still perceive key artifacts and comprehend their roles in the system. In the companion paper, we proposed an abstract reference architecture capable of expressing all classes of system-level interactions in human cyber-physical systems. Here we demonstrate how this reference architecture supports the analysis of levels of communication between agents and helps to identify the potential for misunderstandings and misconceptions. We then develop a metamodel for safe human machine interaction. Therefore, we ask what type of information exchange must be supported on what level so that humans and systems can cooperate as a team, what is the criticality of exchanged information, what are timing requirements for such interactions, and how can we communicate highly critical information in a limited time frame in spite of the many sources of a distorted perception. We highlight shared stumbling blocks and illustrate shared design principles, which rest on established ontologies specific to particular application classes. In order to overcome the partial opacity of internal states of agents, we anticipate a key role of virtual twins of both human and technical cooperation partners for designing a suitable communication. Klaus Bengler, Werner Damm, Andreas Lüdtke, Jochem W. Rieger, Benedikt Austel, Bianca Biebl, Martin Fränzle, Willem Hagemann, Moritz Held, David Hess, Klas Ihme, Severin Kacianka, Alyssa J. Kerscher, Forrest Laine, Sebastian Lehnhoff, Alexander Pretschner, Astrid Rakow, Daniel Sonntag, Janos Sztipanovits, Maike Schwammberger, Mark Schweda, Anirudh Unni, Eric M. S. P. Veith |
ACM Trans. Cyber Phys. Syst. | 2 |
| 2024 | A Reference Architecture of Human Cyber-Physical Systems - Part III: Semantic FoundationsabstractThe design and analysis of multi-agent human cyber-physical systems in safety-critical or industry-critical domains calls for an adequate semantic foundation capable of exhaustively and rigorously describing all emergent effects in the joint dynamic behavior of the agents that are relevant to their safety and well-behavior. We present such a semantic foundation. This framework extends beyond previous approaches by extending the agent-local dynamic state beyond state components under direct control of the agent and belief about other agents (as previously suggested for understanding cooperative as well as rational behavior) to agent-local evidence and belief about the overall cooperative, competitive, or coopetitive game structure. We argue that this extension is necessary for rigorously analyzing systems of human cyber-physical systems because humans are known to employ cognitive replacement models of system dynamics that are both non-stationary and potentially incongruent. These replacement models induce visible and potentially harmful effects on their joint emergent behavior and the interaction with cyber-physical system components. Werner Damm, Martin Fränzle, Alyssa J. Kerscher, Forrest Laine, Klaus Bengler, Bianca Biebl, Willem Hagemann, Moritz Held, David Hess, Klas Ihme, Severin Kacianka, Sebastian Lehnhoff, Andreas Lüdtke, Alexander Pretschner, Astrid Rakow, Jochem W. Rieger, Daniel Sonntag, Janos Sztipanovits, Maike Schwammberger, Mark Schweda, Alexander Trende, Anirudh Unni, Eric M. S. P. Veith |
ACM Trans. Cyber Phys. Syst. | 1 |
| 2024 | A Reference Architecture of Human Cyber-Physical Systems - Part I: Fundamental ConceptsabstractWe propose a reference architecture of safety-critical or industry-critical human cyber-physical systems (CPSs) capable of expressing essential classes of system-level interactions between CPS and humans relevant for the societal acceptance of such systems. To reach this quality gate, the expressivity of the model must go beyond classical viewpoints such as operational, functional, and architectural views and views used for safety and security analysis. The model does so by incorporating elements of such systems for mutual introspections in situational awareness, capabilities, and intentions to enable a synergetic, trusted relation in the interaction of humans and CPSs, which we see as a prerequisite for their societal acceptance. The reference architecture is represented as a metamodel incorporating conceptual and behavioral semantic aspects. We illustrate the key concepts of the metamodel with examples from cooperative autonomous driving, the operating room of the future, cockpit-tower interaction, and crisis management. Werner Damm, David Hess, Mark Schweda, Janos Sztipanovits, Klaus Bengler, Bianca Biebl, Martin Fränzle, Willem Hagemann, Moritz Held, Klas Ihme, Severin Kacianka, Alyssa J. Kerscher, Sebastian Lehnhoff, Andreas Lüdtke, Alexander Pretschner, Astrid Rakow, Jochem W. Rieger, Daniel Sonntag, Maike Schwammberger, Benedikt Austel, Anirudh Unni, Eric M. S. P. Veith |
ACM Trans. Cyber Phys. Syst. | 1 |
| 2019 | Integrating Neurophysiological Sensors and Driver Models for Safe and Performant Automated Vehicle Control in Mixed TrafficabstractIn future mixed traffic Highly Automated Vehicles (HAV) will have to resolve interactions with human operated traffic. A particular problem for HAVs is detection of human states influencing safety critical decisions and driving behavior of humans. We demonstrate the value proposition of neurophysiological sensors and driver models for optimizing performance of HAVs under safety constraints in mixed traffic applications. Werner Damm, Martin Fränzle, Andreas Lüdtke, Jochem W. Rieger, Alexander Trende, Anirudh Unni |
IV | 1 |
| 2017 | Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement
Ernst Althaus, Björn Beber, Werner Damm, Stefan Disch, Willem Hagemann, Astrid Rakow, Christoph Scholl 0001, Uwe Waldmann, Boris Wirtz |
Sci. Comput. Program. | 3 |
| 2015 | AVACS: Automatic Verification and Analysis of Complex Systems Highlights and Lessons Learned
Werner Damm |
FM | 1 |
| 2014 | Automatic Compositional Synthesis of Distributed Systems
Werner Damm, Bernd Finkbeiner |
FM | 1 |
| 2014 | Component based design of hybrid systems: a case study on concurrency and couplingabstractIn the search of design principles that allow compositional reasoning about safety and stability properties of hybrid controllers we examine a case study on a simplified driver assistance system for lane keeping and velocity control. We thereby target loosely coupled systems: the composed system has to accomplish a task that may depend on several of its subcomponents while little coordination between them is necessary. Our assistance system has to accomplish a comfortable centrifugal force, lane keeping and velocity control. This leads to an architecture composed of a velocity controller and a steering controller, where each controller has its local objectives and together they maintain a global objective. The steering controller makes time bounded promises about its steering, which the velocity controller uses for optimization. For this system, we deductively prove from the components' properties that the objectives of the composed system are accomplished. Werner Damm, Eike Möhlmann, Astrid Rakow |
HSCC | 1 |
| 2013 | Can we build it: formal synthesis of control strategies for cooperative driver assistance systemsabstractWe propose a design and verification methodology supporting the early phases of system design for cooperative driver assistance systems, focusing on the realisability of new automotive functions. Specifically, we focus on applications where drivers are supported in complex driving tasks by safe strategies involving the coordinated movements of multiple vehicles to complete the driving task successfully. We propose a divide and conquer approach for formally verifying timed probabilistic requirements on successful completion of the driving task and collision freedom based on formal specifications of a set of given manoeuvring and communication capabilities of the car. In particular, this allows an assessment of whether they are sufficient to implement strategies for successful completion of the driving task. Werner Damm, Hans-Jörg Peter, Jan-Hendrik Rakow, Bernd Westphal |
Math. Struct. Comput. Sci. | 1 |
| 2012 | Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Werner Damm, Henning Dierks, Stefan Disch, Willem Hagemann, Florian Pigorsch, Christoph Scholl 0001, Uwe Waldmann, Boris Wirtz |
Sci. Comput. Program. | 1 |
| 2011 | Using contract-based component specifications for virtual integration testing and architecture designabstractWe elaborate on the theoretical foundation and practical application of the contract-based specification method originally developed in the Integrated Project SPEEDS [11], [9] for two key use cases in embedded systems design. We demonstrate how formal contract-based component specifications for functional, safety, and real-time aspects of components can be expressed using the pattern-based requirement specification language RSL developed in the Artemis Project CESAR, and develop a formal approach for virtual integration testing of composed systems based on such contract-specifications of subsystems. We then present a methodology for multi-criteria architecture evaluation developed in the German Innovation Alliance SPES on Embedded Systems. Werner Damm, Hardi Hungar, Bernhard Josko, Thomas Peikenkamp, Ingo Stierand |
DATE | 1 |
| 2011 | Does It Pay to Extend the Perimeter of a World Model?
Werner Damm, Bernd Finkbeiner |
FM | 1 |
| 2011 | An Automated Semantic-Based Approach for Creating Tasks from Matlab Simulink Models
Matthias Büker, Werner Damm, Günter Ehmen, Ingo Stierand |
FMICS | 2 |
| 2011 | Decidability and complexity for the verification of safety properties of reasonable linear hybrid automataabstractThis paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of safety properties with exhaustive entry conditions can be done in polynomial time and time-bounded reachability with exhaustive entry conditions can be decided in nondeterministic polynomial time for non-parametric verification and in exponential time for parametric verification. Deciding whether an LHA is reasonable is shown to be decidable in polynomial time. Werner Damm, Carsten Ihlemann, Viorica Sofronie-Stokkermans |
HSCC | 1 |
| 2008 | Software Components for Reliable Automotive SystemsabstractSystem-level integration requires an overall understanding of the interplay of the sub-systems to enable component-based development with portability, reconfigurability and extensibility, together with guaranteed reliability and performance levels. Integration by simple interfaces and plug-and-play of sub-systems, which is the main objective of AUTOSAR, requires solving essential technical problems. We discuss to what degree the existing AUTOSAR standard can support the development of safety- and time-critical software and what is required to move toward the desirable goal of timing isolation when integrating multiple applications into the same execution platform. Harald Heinecke, Werner Damm, Bernhard Josko, Alexander Metzner, Hermann Kopetz, Alberto L. Sangiovanni-Vincentelli, Marco Di Natale |
DATE | 2 |
| 2008 | Contract-Based Analysis of Automotive and Avionics Applications: The SPEEDS Approach
Werner Damm |
FMICS | 1 |
| 2007 | Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space
Werner Damm, Stefan Disch, Hardi Hungar, Swen Jacobs, Jun Pang 0001, Florian Pigorsch, Christoph Scholl 0001, Uwe Waldmann, Boris Wirtz |
ATVA | 1 |
| 2006 | Automatic Verification of Hybrid Systems with Large Discrete State Space
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang 0001, Florian Pigorsch, Christoph Scholl 0001, Uwe Waldmann, Boris Wirtz |
ATVA | 1 |
| 2006 | Embedded system development for automotive applications: trends and challengesabstractThis talk reports on findings gained during roadmapping activities for automotive embedded systems development, conducted in the broader environment of the Artemis Technology Platform (http://www.artemis-office.org/). It discusses key trends in the distributed development of embedded automotive applications, and the challenges arising towards implementing such new development processes. Topics covered range from impact on real-time analysis, safety analysis, distributed control, and human-in-the-loop analysis. The talk will point out resulting research directions and research priorities. Werner Damm |
EMSOFT | 1 |
| 2006 | Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and OptimalityabstractWe consider the problem of scheduling a number of periodic tasks T on a real-time architecture composed of a set of identical processors P connected by a common bus. Each processor p \in P has a certain amount of memory \mu (p). In our setting, a task \tau \in¸ T is specified by the period t(\tau), the memory requirement \mu (\tau), the execution time c(\tau), and the deadline d(\tau). We always assume d (\tau) \leqslant t(\tau). Tasks may communicate with each other by sending messages. We denote the set of messages by M, and for each m \in M, src(m) is the source task of m, dst(m) is the target task of m, l(m) is the length of m, and d(m) is the deadline for m. The problem is to find a mapping \prod\limits_{}{} : T \in P representing an assignment of the tasks to the processors that satisfies timing and resource requirements for both tasks and messages. The problem is known to be NP-hard even if tasks do not communicate with each other [9]. Werner Damm, Alexander Metzner, Friedrich Eisenbrand, Gennady Shmonin, Reinhard Wilhelm, Sebastian Winkel |
RTCSA | 1 |
| 2005 | Guaranteed Termination in the Verification of LTL Properties of Non-linear Robust Discrete Time Hybrid Systems
Werner Damm, Guilherme Pinto, Stefan Ratschan |
ATVA | 1 |
| 2005 | A discrete-time UML semantics for concurrency and communication in safety-critical applications
Werner Damm, Bernhard Josko, Amir Pnueli, Anjelika Votintseva |
Sci. Comput. Program. | 1 |
| 2005 | Live and let die: LSC based verification of UML models
Werner Damm, Bernd Westphal |
Sci. Comput. Program. | 1 |
| 2005 | Guidelines for a graduate curriculum on embedded software and systemsabstractThe design of embedded real-time systems requires skills from multiple specific disciplines, including, but not limited to, control, computer science, and electronics. This often involves experts from differing backgrounds, who do not recognize that they address similar, if not identical, issues from complementary angles. Design methodologies are lacking in rigor and discipline so that demonstrating correctness of an embedded design, if at all possible, is a very expensive proposition that may delay significantly the introduction of a critical product. While the economic importance of embedded systems is widely acknowledged, academia has not paid enough attention to the education of a community of high-quality embedded system designers, an obvious difficulty being the need of interdisciplinarity in a period where specialization has been the target of most education systems. This paper presents the reflections that took place in the European Network of Excellence Artist leading us to propose principles and structured contents for building curricula on embedded software and systems. Paul Caspi, Alberto L. Sangiovanni-Vincentelli, Luís Almeida 0001, Albert Benveniste, Bruno Bouyssounouse, Giorgio C. Buttazzo, Ivica Crnkovic, Werner Damm, Jakob Engblom, Gerhard Fohler, Marisol García-Valls, Hermann Kopetz, Yassine Lakhnech, François Laroussinie, Luciano Lavagno, Giuseppe Lipari, Florence Maraninchi, Philipp Peti, Juan Antonio de la Puente, Norman Scaife, Joseph Sifakis, Robert de Simone, Martin Törngren, Paulo Veríssimo, Andy J. Wellings, Reinhard Wilhelm, Tim A. C. Willemse, Wang Yi 0001 |
ACM Trans. Embed. Comput. Syst. | 8 |
| 2003 | A Semantics for Distributed Execution of StatemateabstractAbstract. We present a semantics for the statechart variant implemented in the Statemate product of i-Logix. Our semantics enables distributed code generation for Statemate models in the context of rapid prototyping for embedded control applications. We argue that it seems impossible to efficiently generate distributed code using the original Statemate semantics. The new, distributed semantics has the advantages that, first, it enables the generation of efficient distributed code, second, it preserves many aspects of the original semantics for those parts of a model that are not distributed, and third, the changes made regarding the interaction of distributed model parts are similar to the interaction between the model and its environment in the original semantics, thus giving designers a familiar execution model. The semantics has been implemented in Grace, a framework for rapid prototyping code generation for embedded control applications. Martin Fränzle, Jürgen Niehaus, Alexander Metzner, Werner Damm |
Formal Aspects Comput. | 4 |
| 2001 | LSCs: Breathing Life into Message Sequence Charts
Werner Damm, David Harel |
Formal Methods Syst. Des. | 1 |
| 2001 | Verification of a Radio-Based Signaling System Using the STATEMATE Verification Environment
Werner Damm, Jochen Klose |
Formal Methods Syst. Des. | 1 |
| 2000 | The STATEMATE Verification Environment - Making It Real
Tom Bienmüller, Werner Damm, Hartmut Wittke |
CAV | 2 |
| 2000 | Offering Formal Verification Capabilities for Industry Standard Case Tools: Challenges and Results
Werner Damm |
ICFEM | 1 |
| 1998 | Herbrand Automata for Hardware Verification
Werner Damm, Amir Pnueli, Sitvanit Ruah |
CONCUR | 1 |
| 1998 | First-Order-CTL Model Checking
Jürgen Bohn 0002, Werner Damm, Orna Grumberg, Hardi Hungar, Karen Yorav |
FSTTCS | 2 |
| 1993 | Verification of timing Properties of VHDL
Costas Courcoubetis, Werner Damm, Bernhard Josko |
CAV | 2 |
| 1993 | VHDL/S - integrating statecharts, timing diagrams, and VHDL
Johannes Helbig, Rainer Schlör, Werner Damm, Gert Döhmen, Peter Kelb |
Microprocess. Microprogramming | 3 |
| 1989 | Specifying distributed computer architectures in AADL
Werner Damm, Gert Döhmen |
Parallel Comput. | 1 |
| 1988 | A Microprogramming LogicabstractA universal syntax-directed proof system is presented for the verification of horizontal computer architectures. The system is based on the axiomatic architecture description language AADL, which is sufficiently rich to allow the specification of target architectures while providing a concise model for clocked microarchitectures. For each description A epsilon AADL of a host, it is shown how to construct systematically a (Hoare-style) axiomatic definition of an A-dependent high-level microprogramming language based on S*. The axiomatization of A's microoperations together with a powerful proof-rule dealing with the inherent low-level parallelism of horizontal architectures allow a complete axiomatic treatment of the timing behavior and dynamic conflicts of microprograms written in S*(A).> Werner Damm |
IEEE Trans. Software Eng. | 1 |
| 1986 | An Automata-Theoretical Characterization of the OI-Hierarchy
Werner Damm, Andreas Goerdt |
Inf. Control. | 1 |
| 1983 | A Sound and Relatively * Complete Hoare-Logic for a Language With Higher Type Procedures
Werner Damm, Bernhard Josko |
Acta Informatica | 1 |
| 1982 | An Automata-Theoretic Characterization of the OI-Hierarchy
Werner Damm, Andreas Goerdt |
ICALP | 1 |
| 1982 | The IO- and OI-Hierarchies
Werner Damm |
Theor. Comput. Sci. | 1 |
| 1981 | Combining T and level-N
Werner Damm, Irène Guessarian |
MFCS | 1 |
| 1979 | An Algebraic Extension of the Chomsky-Hierarchy
Werner Damm |
MFCS | 1 |
| 1978 | On the Power of Self-Application and Higher Type-Recursion
Werner Damm, Elfriede Fehr |
ICALP | 1 |
| 1977 | Languages Defined by Higher Type Program Schemes
Werner Damm |
ICALP | 1 |