Dominic Steinhöfel
Dominic Steinhöfel
Computer Science Researcher (PostDoc), Technische Universität Darmstadt
Bestätigte E-Mail-Adresse bei cs.tu-darmstadt.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Verifying openjdk’s sort method for generic collections
S de Gouw, FS de Boer, R Bubel, R Hähnle, J Rot, D Steinhöfel
Journal of automated reasoning 62 (1), 93-126, 2019
152019
A general lattice model for merging symbolic execution branches
D Scheurer, R Hähnle, R Bubel
International Conference on Formal Engineering Methods, 57-73, 2016
122016
A new invariant rule for the analysis of loops with non-standard control flows
D Steinhöfel, N Wasser
International Conference on Integrated Formal Methods, 279-294, 2017
82017
Abstract execution
D Steinhöfel, R Hähnle
International Symposium on Formal Methods, 319-336, 2019
42019
Modular, correct compilation with automatic soundness proofs
D Steinhöfel, R Hähnle
International Symposium on Leveraging Applications of Formal Methods, 424-447, 2018
42018
From trees to DAGs: a general lattice model for symbolic execution
D Scheurer
32015
Enforcing Datalog Policies with Service Automata on Distributed Version Control Systems
D Scheurer
22013
Treating for-Loops as First-Class Citizens in Proofs
N Wasser, D Steinhöfel
arXiv preprint arXiv:2002.00776, 2020
12020
The Trace Modality
D Steinhöfel, R Hähnle
International Workshop on Dynamic Logic, 124-140, 2019
12019
Technical Report: Using Loop Scopes with for-Loops
N Wasser, D Steinhöfel
arXiv preprint arXiv:1901.06839, 2019
12019
Abstract Execution: Automatically Proving Infinitely Many Programs
D Steinhöfel
Technical University of Darmstadt, Department of Computer Science, 2020
2020
Assessing the Coverage of Formal Specifications
D Steinhöfel, N Wasser, S de Gouw, F de Boer, R Bubel, R Hähnle, J Rot, ...
Journal of Automated Reasoning, 2017
2017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–12