Benedikt Maderbacher
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Benedikt Maderbacher has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Roderick Bloem
Graz University of Technology, Graz, Austria
6 shared publications - Felix Windisch
Graz University of Technology
2 shared publications - Alberto Larrauri
University of Oxford
1 shared publication - Anja F. Karl
Graz University of Technology
1 shared publication - Ayrat Khalimov
The Hebrew University
1 shared publication Bernhard K. Aichernig
Graz University of Technology
1 shared publication
Latest Publications
- Open Access
- 8 January 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (POPL) , 2439-2467
Parameterized Infinite-State Reactive Synthesis
We propose a method to synthesize a parameterized infinite-state system that can be instantiated for different parameter values. The specification is given in a parameterized temporal logic that allows for data variables as well as parameters that encode properties of the environment. Our synthesis method runs in a counterexample-guided loop consisting of four steps: (1) we synthesize concrete systems for some small parameter instantiations using existing techniques. (2) We generalize the concrete systems into a parameterized program. (3) We create a proof candidate consisting of an invariant and a ranking function. (4) We check the proof candidate for consistency with the program. If the proof succeeds, the parameterized program is valid. Otherwise, we identify a parameter value for which it fails and add a new concrete instance to step one. To generalize programs and create proof candidates, we use a combination of anti-unification and syntax-guided synthesis to express the differences between the programs as a function of the parameters. We evaluate our approach on new examples and examples from the literature that are manually parameterized.
- 8 January 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (POPL) , 2439-2467
Open AccessParameterized Infinite-State Reactive Synthesis
We propose a method to synthesize a parameterized infinite-state system that can be instantiated for different parameter values. The specification is given in a parameterized temporal logic that allows for data variables as well as parameters that encode properties of the environment. Our synthesis method runs in a counterexample-guided loop consisting of four steps: (1) we synthesize concrete systems for some small parameter instantiations using existing techniques. (2) We generalize the concrete systems into a parameterized program. (3) We create a proof candidate consisting of an invariant and a ranking function. (4) We check the proof candidate for consistency with the program. If the proof succeeds, the parameterized program is valid. Otherwise, we identify a parameter value for which it fails and add a new concrete instance to step one. To generalize programs and create proof candidates, we use a combination of anti-unification and syntax-guided synthesis to express the differences between the programs as a function of the parameters. We evaluate our approach on new examples and examples from the literature that are manually parameterized.
- 23 January 2025
- Published by Springer Nature
- p. 137-159
Synthesis of Controllers for Continuous Blackbox Systems
- 23 January 2025
- Published by Springer Nature
- p. 137-159
Synthesis of Controllers for Continuous Blackbox Systems
- 26 October 2024
- Published by Springer Nature
- p. 281-301
Synthesis from Infinite-State Generalized Reactivity(1) Specifications
- 26 October 2024
- Published by Springer Nature
- p. 281-301
Synthesis from Infinite-State Generalized Reactivity(1) Specifications
- 2 May 2023
- Published by Springer Nature
- p. 141-160
Provable Correct and Adaptive Simplex Architecture for Bounded-Liveness Properties
- 2 May 2023
- Published by Springer Nature
- p. 141-160
Provable Correct and Adaptive Simplex Architecture for Bounded-Liveness Properties
- Open Access
- 9 August 2022
- Published by Elsevier in Nonlinear Analysis: Hybrid Systems
- Vol. 46
Adaptive testing for specification coverage and refinement in CPS models
- 9 August 2022
- Published by Elsevier in Nonlinear Analysis: Hybrid Systems
- Vol. 46
Open AccessAdaptive testing for specification coverage and refinement in CPS models
- 29 October 2020
- Published by Springer Nature
- p. 426-448
Step-Wise Development of Provably Correct Actor Systems
- 29 October 2020
- Published by Springer Nature
- p. 426-448
Step-Wise Development of Provably Correct Actor Systems
- 2 October 2020
- Published by Springer Nature
- p. 241-258
Placement of Runtime Checks to Counteract Fault Injections
- 2 October 2020
- Published by Springer Nature
- p. 241-258
Placement of Runtime Checks to Counteract Fault Injections
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 52-60
Programming Behavioral Test Models for SMT Solving in Scala
We present a novel approach for modeling cyber-physical systems for analysis and test purposes. Instead of creating a new expressive specification language with sophisticated semantics and complex compilers, we rely on a lightweight version of Back's Action Systems, for which we provide a simple bounded model checker using the SMT solver Z3. In order to model industrial-sized embedded systems, we extend our simple specification language by using the powerful capa-bilities of the modern programming language Scala for creating Domain Specific Languages (DSL). This enables us to use the features of an expressive, object-oriented and functional generalpurpose language without the need to increase the complexity of the model checker. We demonstrate how to model a railway interlocking system with a configurable track layout and sketch the application to model-based testing.
- 1 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 52-60
Programming Behavioral Test Models for SMT Solving in Scala
We present a novel approach for modeling cyber-physical systems for analysis and test purposes. Instead of creating a new expressive specification language with sophisticated semantics and complex compilers, we rely on a lightweight version of Back's Action Systems, for which we provide a simple bounded model checker using the SMT solver Z3. In order to model industrial-sized embedded systems, we extend our simple specification language by using the powerful capa-bilities of the modern programming language Scala for creating Domain Specific Languages (DSL). This enables us to use the features of an expressive, object-oriented and functional generalpurpose language without the need to increase the complexity of the model checker. We demonstrate how to model a railway interlocking system with a configurable track layout and sketch the application to model-based testing.
- 30 September 2018
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 494-510
Bounded Synthesis of Register Transducers
- 30 September 2018
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 494-510
Bounded Synthesis of Register Transducers