EDBT 2026 Demo / reviewers in the wild / expert
Johan Lidén Eddeland
dblp:213/0638
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-1253-6705ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-authorTheory of computation · 1 · 1 first-author · 1 since 2021
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
1 paper |
Automated reasoning and model checking · 50% Logic in computer science · 50% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems
cyber-physical systems |
0.4 | 1 | 2020 | Enhancing Temporal Logic Falsification With Specification Transformation and Valued Booleans · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020 |
Automated reasoning and model checking
falsification |
0.4 | 1 | 2020 | Enhancing Temporal Logic Falsification With Specification Transformation and Valued Booleans · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020 |
Logic in computer science › temporal logic
signal temporal logic |
0.4 | 1 | 2020 | Enhancing Temporal Logic Falsification With Specification Transformation and Valued Booleans · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2020 |
Methods — techniques the papers use, named apart from their topics
valued booleans · 0.9specification transformation · 0.9robust semantics · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Multi-Requirement Testing Using Focused FalsificationabstractTesting of Cyber-Physical Systems (CPS) deals with the problem of finding input traces to the systems such that given requirements do not hold. Requirements can be formalized in many different ways; in this work requirements are modeled using Signal Temporal Logic (STL) for which a quantitative measure, or robustness value, can be computed given a requirement together with input and output traces. This value is a measure of how far away the requirement is from not holding and is used to guide falsification procedures for deciding on new input traces to simulate one after the other. When the system under test has multiple requirements, standard approaches are to falsify them one-by-one, or as a conjunction of all requirements, but these approaches do not scale well for industrial-sized problems. In this work we consider testing of systems with multiple requirements by proposing focused multi-requirement falsification. This is a multi-stage approach where the solver tries to sequentially falsify the requirements one-by-one, but for every simulation also evaluate the robustness value for all requirements. After one requirement has been focused long enough, the next requirement to focus is selected by considering the robustness values and trajectory history calculated thus far. Each falsification attempt makes use of a prior sensitivity analysis, which for each requirement estimates the parameters that are unlikely to affect the robustness value, in order to reduce the number of parameters that are used by the optimization solver. The proposed approach is evaluated on a public benchmark example containing a large number of requirements, and includes a comparison of the proposed algorithm against a new suggested baseline method. Johan Lidén Eddeland, Alexandre Donzé, Knut Åkesson |
HSCC | 1 |
| 2020 | Enhancing Temporal Logic Falsification With Specification Transformation and Valued BooleansabstractCyber-physical systems (CPSs) are systems with both physical and software components, for example, cars and industrial robots. Since these systems exhibit both discrete and continuous dynamics, they are complex and it is thus difficult to verify that they behave as expected. Falsification of temporal logic properties is an approach to find counterexamples to CPSs by means of simulation. In this article, we propose two additions to enhance the capability of falsification and make it more viable in a large-scale industrial setting. The first addition is a framework for transforming specifications from a signal-based model into signal temporal logic. The second addition is the use of valued Booleans and an additive robust semantics in the falsification process. We evaluate the performance of the additive robust semantics on a set of benchmark models, and we can see that which semantics are preferable depend both on the model and on the specification. Johan Lidén Eddeland, Koen Claessen, Nicholas Smallbone, Zahra Ramezani, Sajed Miremadi, Knut Åkesson |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |