Klara J. Meyer

Orcid: 0000-0003-1334-9079

Affiliations:
  • Technical University Munich, Germany


According to our database1, Klara J. Meyer authored at least 17 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021.
Int. J. Softw. Tools Technol. Transf., October, 2024

2022
Practical Applications of the Alternating Cycle Decomposition.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

2021
Constraint-based Analysis of Distributed Systems.
PhD thesis, 2021

Towards efficient verification of population protocols.
Formal Methods Syst. Des., 2021

2020
Practical synthesis of reactive systems from LTL specifications via parity games.
Acta Informatica, 2020

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs.
Proceedings of the Automated Technology for Verification and Analysis, 2020

2019
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results.
CoRR, 2019

Computing the Expected Execution Time of Probabilistic Workflow Nets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

2018
Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Strix: Explicit Reactive Synthesis Strikes Back!
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Quantitative Implementation Strategies for Safety Controllers.
CoRR, 2017

2016
Solving Mean-Payoff Games on the GPU.
Proceedings of the Automated Technology for Verification and Analysis, 2016

2015
An SMT-based Approach to Fair Termination Analysis.
Proceedings of the Formal Methods in Computer-Aided Design, 2015

2014
Infinite probability computation by cyclic explanation graphs.
Theory Pract. Log. Program., 2014

An SMT-Based Approach to Coverability Analysis.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2012
Tabling for infinite probability computation.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012


  Loading...