A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “termination proofs” 4

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
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
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
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

4 results