default search action
Klara J. Meyer
Person information
- affiliation: Technical University Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Swen Jacobs, Guillermo A. Pérez
, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. Int. J. Softw. Tools Technol. Transf. 26(5): 551-567 (2024) - 2022
- [c11]Antonio Casares
Practical Applications of the Alternating Cycle Decomposition. TACAS (2) 2022: 99-117 - [i10]Swen Jacobs, Guillermo A. Pérez, Remco Abraham, Véronique Bruyère, Michaël Cadilhac, Maximilien Colange, Charly Delfosse, Tom van Dijk, Alexandre Duret-Lutz, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Klara J. Meyer, Thibaud Michaud, Adrien Pommellet, Florian Renkin, Philipp Schlehuber-Caissier, Mouhammad Sakr, Salomon Sickert, Gaëtan Staquet, Clément Tamines, Leander Tentrup, Adam Walker:
The Reactive Synthesis Competition (SYNTCOMP): 2018-2021. CoRR abs/2206.00251 (2022) - 2021
- [b1]Philipp J. Meyer:
Constraint-based Analysis of Distributed Systems. Technical University of Munich, Germany, 2021 - [j3]Michael Blondin
Towards efficient verification of population protocols. Formal Methods Syst. Des. 57(3): 305-342 (2021) - 2020
- [j2]Michael Luttenberger, Philipp J. Meyer
Practical synthesis of reactive systems from LTL specifications via parity games. Acta Informatica 57(1-2): 3-36 (2020) - [c10]Javier Esparza
Peregrine 2.0: Explaining Correctness of Population Protocols Through Stage Graphs. ATVA 2020: 550-556 - [c9]Michael Blondin
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CAV (2) 2020: 372-397 - [i9]Michael Blondin, Javier Esparza, Martin Helfrich, Antonín Kucera, Philipp J. Meyer:
Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling. CoRR abs/2005.03555 (2020) - [i8]Javier Esparza, Martin Helfrich, Stefan Jaax, Philipp J. Meyer:
Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs. CoRR abs/2007.07638 (2020)
2010 – 2019
- 2019
- [c8]Philipp J. Meyer
Computing the Expected Execution Time of Probabilistic Workflow Nets. TACAS (2) 2019: 154-171 - [i7]Michael Luttenberger, Philipp J. Meyer, Salomon Sickert:
Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games. CoRR abs/1903.12576 (2019) - [i6]Swen Jacobs, Roderick Bloem, Maximilien Colange, Peter Faymonville, Bernd Finkbeiner, Ayrat Khalimov, Felix Klein, Michael Luttenberger, Philipp J. Meyer, Thibaud Michaud, Mouhammad Sakr
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results. CoRR abs/1904.07736 (2019) - 2018
- [c7]Philipp J. Meyer
Strix: Explicit Reactive Synthesis Strikes Back! CAV (1) 2018: 578-586 - [c6]Philipp J. Meyer
Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets. TACAS (2) 2018: 3-19 - [i5]Philipp J. Meyer, Javier Esparza, Hagen Völzer:
Computing the concurrency threshold of sound free-choice workflow nets. CoRR abs/1802.08064 (2018) - [i4]Philipp J. Meyer, Javier Esparza, Philip Offtermatt:
Computing the Expected Execution Time of Probabilistic Workflow Nets. CoRR abs/1811.06961 (2018) - 2017
- [c5]Michael Blondin
Towards Efficient Verification of Population Protocols. PODC 2017: 423-430 - [i3]Michael Blondin, Stefan Jaax, Javier Esparza, Philipp J. Meyer:
Towards Efficient Verification of Population Protocols. CoRR abs/1703.04367 (2017) - [i2]Philipp J. Meyer, Matthias Rungger, Michael Luttenberger, Javier Esparza, Majid Zamani:
Quantitative Implementation Strategies for Safety Controllers. CoRR abs/1712.05278 (2017) - 2016
- [c4]Philipp J. Meyer
Solving Mean-Payoff Games on the GPU. ATVA 2016: 262-267 - 2015
- [c3]Javier Esparza
An SMT-based Approach to Fair Termination Analysis. FMCAD 2015: 49-56 - 2014
- [j1]Taisuke Sato
Infinite probability computation by cyclic explanation graphs. Theory Pract. Log. Program. 14(6): 909-937 (2014) - [c2]Javier Esparza
An SMT-Based Approach to Coverability Analysis. CAV 2014: 603-619 - 2013
- [i1]Taisuke Sato, Philipp J. Meyer:
Infinite probability computation by cyclic explanation graphs. CoRR abs/1309.0339 (2013) - 2012
- [c1]Taisuke Sato
Tabling for infinite probability computation. ICLP (Technical Communications) 2012: 348-358
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: