From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “proof rules” 32

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Sound and complete proof rules for almost-sure termination: from probabilistic control-flow graphs to program-level reasoning
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Jonas Seidel

0

citations
Ten (mostly) simple rules to future‐proof trait data in ecological and evolutionary sciences
2022 Methods in Ecology and Evolution article Computer Science Research Data Management Practices Open access

Alexander Keller, Markus Johannes Ankenbrand, Helge Bruelheide, Stefanie Dekeyzer, Brian Joseph Enquist, Mohammad Bagher Erfanian, +15 more

43

citations
Analysis and formal specification of OpenJDK's BitSet: Proof files
2024 Science of Computer Programming article Computer Science Logic, programming, and type systems

Andy S. Tatman, Hans-Dieter A. Hiep, Stijn de Gouw

0

citations
Formal Specification and Analysis of OpenJDK's BitSet class: Proof files
2023 Zenodo (CERN European Organization for Nuclear Research) dissertation Computer Science Logic, programming, and type systems Open access

Andy S. Tatman

0

citations
Formal Specification and Analysis of OpenJDK's BitSet class: Proof files
2023 Zenodo (CERN European Organization for Nuclear Research) dissertation Computer Science Logic, programming, and type systems Open access

Andy S. Tatman

0

citations
Formal Specification and Analysis of OpenJDK's BitSet class: Proof files
2023 Zenodo (CERN European Organization for Nuclear Research) dissertation Computer Science Logic, programming, and type systems Open access

Andy S. Tatman

0

citations
A note on the computational complexity of chain rule differentiation
2023 Optimization methods & software article Computer Science Complexity and Algorithms in Graphs

Uwe Naumann

0

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács

0

citations
Caesar: A Deductive Verifier for Probabilistic Programs
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Philipp Schröer, Kevin Batz, Umut Yiğit Dural, Darion Haase, Benjamin Lucien Kaminski, Joost-Pieter Katoen, +1 more

0

citations
Caesar: A Deductive Verifier for Probabilistic Programs
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Philipp Schröer, Kevin Batz, Umut Yiğit Dural, Darion Haase, Benjamin Lucien Kaminski, Joost-Pieter Katoen, +1 more

0

citations
Lower Bounds for Possibly Divergent Probabilistic Programs
2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Shenghua Feng, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Naijun Zhan

14

citations
Compositional Reasoning for Parametric Probabilistic Automata
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Formal Methods in Verification Open access

1

citations
Scalable Probabilistic Program Verification via Typed Extended Decision Diagrams
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Daniel Basgöze, Kevin Batz, Sebastian Junges, Joost-Pieter Katoen

0

citations
Investigations on neural networks, discriminative training criteria and error bounds
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Speech Recognition and Synthesis Open access

Markus Nußbaum-Thom

0

citations
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Extended Version)
2025 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Philipp Schröer, Darion Haase, Joost-Pieter Katoen

0

citations
Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

0

citations
Automated Termination Analysis of Polynomial Probabilistic Programs
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács

31

citations
Compositional Reasoning for Probabilistic Automata with Uncertainty
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen

0

citations
A First-Order Logic with Frames
2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan

6

citations
A First-order Logic with Frames
2023 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access

Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan

2

citations
Deductive reasoning about concurrent probabilistic programs
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Ira Fesefeldt

0

citations
A Calculus for Amortized Expected Runtimes
2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht

22

citations
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
2020 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs Open access

Toni Böhnlein, Stefan Kratsch, Oliver Schaudt

11

citations
Cylindrical algebraic decomposition for nonlinear arithmetic problems
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Polynomial and algebraic computation Open access

Gereon Kremer

5

citations
Methoden für die automatische Komplexitäts- und Terminierungsanalyse von (probabilistischen) Programmen und ihre Vollständigkeit
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Marcel Hark

1

citations