default search action
Rayna Dimitrova
Person information
- affiliation: CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
- affiliation: University of Leicester, Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Philippe Heim, Rayna Dimitrova:
Solving Infinite-State Games via Acceleration. Proc. ACM Program. Lang. 8(POPL): 1696-1726 (2024) - [c29]Anne-Kathrin Schmuck, Philippe Heim, Rayna Dimitrova, Satya Prakash Nayak:
Localized Attractor Computations for Infinite-State Games. CAV (3) 2024: 135-158 - [e4]Rayna Dimitrova, Ori Lahav, Sebastian Wolff:
Verification, Model Checking, and Abstract Interpretation - 25th International Conference, VMCAI 2024, London, United Kingdom, January 15-16, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14499, Springer 2024, ISBN 978-3-031-50523-2 [contents] - [e3]Rayna Dimitrova, Ori Lahav, Sebastian Wolff:
Verification, Model Checking, and Abstract Interpretation - 25th International Conference, VMCAI 2024, London, United Kingdom, January 15-16, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14500, Springer 2024, ISBN 978-3-031-50520-1 [contents] - [i15]Anne-Kathrin Schmuck, Philippe Heim, Rayna Dimitrova, Satya Prakash Nayak:
Localized Attractor Computations for Infinite-State Games (Full Version). CoRR abs/2405.09281 (2024) - 2023
- [c28]Rafael Dewes, Rayna Dimitrova:
Compositional High-Quality Synthesis. ATVA (1) 2023: 334-354 - [c27]Philippe Heim, Rayna Dimitrova:
Taming Large Bounds in Synthesis from Bounded-Liveness Specifications. TACAS (2) 2023: 251-269 - [i14]Philippe Heim, Rayna Dimitrova:
Taming Large Bounds in Synthesis from Bounded-Liveness Specifications (Full Version). CoRR abs/2301.10032 (2023) - [i13]Philippe Heim, Rayna Dimitrova:
Solving Infinite-State Games via Acceleration. CoRR abs/2305.16118 (2023) - 2022
- [j5]Sebastian Biewer, Rayna Dimitrova, Michael Fries, Maciej Gazda, Thomas Heinze, Holger Hermanns, Mohammad Reza Mousavi:
Conformance Relations and Hyperproperties for Doping Detection in Time and Space. Log. Methods Comput. Sci. 18(1) (2022) - [j4]Suda Bharadwaj, Rayna Dimitrova, Jesse Quattrociocchi, Ufuk Topcu:
Synthesis of strategies for autonomous surveillance on adversarial targets. Robotics Auton. Syst. 153: 104084 (2022) - [e2]Roderick Bloem, Rayna Dimitrova, Chuchu Fan, Natasha Sharygina:
Software Verification - 13th International Conference, VSTTE 2021, New Haven, CT, USA, October 18-19, 2021, and 14th International Workshop, NSV 2021, Los Angeles, CA, USA, July 18-19, 2021, Revised Selected Papers. Lecture Notes in Computer Science 13124, Springer 2022, ISBN 978-3-030-95560-1 [contents] - 2021
- [c26]Rayna Dimitrova:
Reactive Synthesis Beyond Realizability. FMCAD 2021: 1 - 2020
- [j3]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Reactive synthesis with maximum realizability of linear temporal logic specifications. Acta Informatica 57(1-2): 107-135 (2020) - [c25]Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah:
Probabilistic Hyperproperties of Markov Decision Processes. ATVA 2020: 484-500 - [c24]Rayna Dimitrova, Maciej Gazda, Mohammad Reza Mousavi, Sebastian Biewer, Holger Hermanns:
Conformance-Based Doping Detection for Cyber-Physical Systems. FORTE 2020: 59-77 - [c23]Suda Bharadwaj, Abraham P. Vinod, Rayna Dimitrova, Ufuk Topcu:
Near-Optimal Reactive Synthesis Incorporating Runtime Information. ICRA 2020: 10342-10348 - [i12]Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah:
Probabilistic Hyperproperties of Markov Decision Processes. CoRR abs/2005.03362 (2020) - [i11]Suda Bharadwaj, Abraham P. Vinod, Rayna Dimitrova, Ufuk Topcu:
Near-Optimal Reactive Synthesis Incorporating Runtime Information. CoRR abs/2007.16107 (2020) - [i10]Sebastian Biewer, Rayna Dimitrova, Michael Fries, Maciej Gazda, Thomas Heinze, Holger Hermanns, Mohammad Reza Mousavi:
Conformance Relations and Hyperproperties for Doping Detection in Time and Space. CoRR abs/2012.03910 (2020) - [i9]Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah:
Approximate Automata for Omega-Regular Languages. CoRR abs/2012.14590 (2020) - [i8]Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah:
Synthesizing Approximate Implementations for Unrealizable Specifications. CoRR abs/2012.14592 (2020)
2010 – 2019
- 2019
- [c22]Suda Bharadwaj, Roderick Bloem, Rayna Dimitrova, Bettina Könighofer, Ufuk Topcu:
Synthesis of Minimum-Cost Shields for Multi-agent Systems. ACC 2019: 1048-1055 - [c21]Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah:
Approximate Automata for Omega-Regular Languages. ATVA 2019: 334-349 - [c20]Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah:
Synthesizing Approximate Implementations for Unrealizable Specifications. CAV (1) 2019: 241-258 - [i7]Suda Bharadwaj, Rayna Dimitrova, Ufuk Topcu:
Distributed Synthesis of Surveillance Strategies for Mobile Sensors. CoRR abs/1902.02393 (2019) - [i6]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Reactive Synthesis with Maximum Realizability of Linear Temporal Logic Specifications. CoRR abs/1910.02561 (2019) - 2018
- [j2]Rayna Dimitrova, Rupak Majumdar:
Reachability analysis of reversal-bounded automata on series-parallel graphs. Acta Informatica 55(2): 153-189 (2018) - [c19]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Maximum Realizability for Linear Temporal Logic Specifications. ATVA 2018: 458-475 - [c18]Suda Bharadwaj, Rayna Dimitrova, Ufuk Topcu:
Distributed Synthesis of Surveillance Strategies for Mobile Sensors. CDC 2018: 3335-3342 - [c17]Suda Bharadwaj, Rayna Dimitrova, Ufuk Topcu:
Synthesis of Surveillance Strategies via Belief Abstraction. CDC 2018: 4159-4166 - [c16]Rayna Dimitrova, Rupak Majumdar, Vinayak S. Prabhu:
Causality Analysis for Concurrent Reactive Systems (Extended Abstract). CREST@ETAPS 2018: 31-33 - [i5]Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu:
Maximum Realizability for Linear Temporal Logic Specifications. CoRR abs/1804.00415 (2018) - 2017
- [j1]Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate counting in SMT and value estimation for probabilistic programs. Acta Informatica 54(8): 729-764 (2017) - [c15]Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani:
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. CONCUR 2017: 13:1-13:17 - [i4]Rayna Dimitrova, Ivan Gavran, Rupak Majumdar, Vinayak S. Prabhu, Sadegh Esmaeil Zadeh Soudjani:
The Robot Routing Problem for Collecting Aggregate Stochastic Rewards. CoRR abs/1704.05303 (2017) - [i3]Suda Bharadwaj, Rayna Dimitrova, Ufuk Topcu:
Synthesis of surveillance strategies via belief abstraction. CoRR abs/1709.05363 (2017) - 2016
- [c14]David Deininger, Rayna Dimitrova, Rupak Majumdar:
Symbolic Model Checking for Factored Probabilistic Models. ATVA 2016: 444-460 - [c13]Rayna Dimitrova, Jie Fu, Ufuk Topcu:
Robust optimal policies for Markov decision processes with safety-threshold constraints. CDC 2016: 7081-7086 - [c12]Rayna Dimitrova, Luis María Ferrer Fioriti, Holger Hermanns, Rupak Majumdar:
Probabilistic CTL*: The Deductive Way. TACAS 2016: 280-296 - [e1]Ruzica Piskac, Rayna Dimitrova:
Proceedings Fifth Workshop on Synthesis, SYNT@CAV 2016, Toronto, Canada, July 17-18, 2016. EPTCS 229, 2016 [contents] - 2015
- [c11]Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate Counting in SMT and Value Estimation for Probabilistic Programs. TACAS 2015: 320-334 - [c10]Rayna Dimitrova, Rupak Majumdar:
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs. GandALF 2015: 100-114 - 2014
- [b1]Rayna Dimitrova:
Synthesis and control of infinite-state systems with partial observability. Saarland University, 2014 - [c9]Jie Fu, Rayna Dimitrova, Ufuk Topcu:
Abstractions and sensor design in partial-information, reactive controller synthesis. ACC 2014: 2297-2304 - [c8]Rayna Dimitrova, Rupak Majumdar:
Deductive control synthesis for alternating-time logics. EMSOFT 2014: 14:1-14:10 - [i2]Jie Fu, Rayna Dimitrova, Ufuk Topcu:
Abstractions and sensor design in partial-information, reactive controller synthesis. CoRR abs/1405.1630 (2014) - [i1]Dmitry Chistikov, Rayna Dimitrova, Rupak Majumdar:
Approximate Counting in SMT and Value Estimation for Probabilistic Programs. CoRR abs/1411.0659 (2014) - 2013
- [c7]Rayna Dimitrova, Bernd Finkbeiner:
Lossy Channel Games under Incomplete Information. SR 2013: 43-51 - 2012
- [c6]Rayna Dimitrova, Bernd Finkbeiner:
Counterexample-Guided Synthesis of Observation Predicates. FORMATS 2012: 107-122 - [c5]Rayna Dimitrova, Bernd Finkbeiner, Markus N. Rabe:
Monitoring Temporal Information Flow. ISoLA (1) 2012: 342-357 - [c4]Rayna Dimitrova, Bernd Finkbeiner, Máté Kovács, Markus N. Rabe, Helmut Seidl:
Model Checking Information Flow in Reactive Systems. VMCAI 2012: 169-185
2000 – 2009
- 2009
- [c3]Rayna Dimitrova, Bernd Finkbeiner:
Synthesis of Fault-Tolerant Distributed Systems. ATVA 2009: 321-336 - 2008
- [c2]Rayna Dimitrova, Bernd Finkbeiner:
Abstraction Refinement for Games with Incomplete Information. FSTTCS 2008: 175-186 - [c1]Rayna Dimitrova, Andreas Podelski:
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? VMCAI 2008: 98-111
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-09-22 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint