Bernd E. Finkbeiner, Ph.D.
Affiliations: | 2003 | Stanford University, Palo Alto, CA |
Area:
Computer ScienceGoogle:
"Bernd Finkbeiner"Parents
Sign in to add mentorZohar Manna | grad student | 2003 | Stanford | |
(Verification algorithms based on alternating automata.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Finkbeiner B, Hahn C, Lukert P, et al. (2020) Synthesis from hyperproperties. Acta Informatica. 57: 137-163 |
Finkbeiner B, Hahn C, Stenger M, et al. (2020) Efficient monitoring of hyperproperties using prefix trees International Journal On Software Tools For Technology Transfer. 1-12 |
Finkbeiner B, Hahn C, Stenger M, et al. (2019) Monitoring hyperproperties. Formal Methods in System Design. 54: 336-363 |
Finkbeiner B, Klein F, Piskac R, et al. (2017) Vehicle Platooning Simulations with Functional Reactive Programming Arxiv: Programming Languages. 43-47 |
Finkbeiner B, Sanchez C. (2016) Special issue on Rich Models, EU-COST Action IC0901 Rich-Model Toolkit Acta Informatica. 1-2 |
Finkbeiner B, Tentrup L. (2015) Detecting Unrealizability of Distributed Fault-tolerant Systems Logical Methods in Computer Science. 11 |
Kuhtz L, Finkbeiner B. (2012) Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds Logical Methods in Computer Science. 8 |
Finkbeiner B, Peter H, Schewe S. (2010) Synthesising certificates in networks of timed automata Iet Software. 4: 222-235 |
Schewe S, Finkbeiner B. (2007) Semi-Automatic Distributed Synthesis International Journal of Foundations of Computer Science. 18: 113-138 |
Finkbeiner B, Sankaranarayanan S, Sipma H. (2002) Collecting Statistics over Runtime Executions Electronic Notes in Theoretical Computer Science. 70: 36-54 |