Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs
- Weitere Titel
-
Methoden für die automatische Komplexitäts- und Terminierungsanalyse von (probabilistischen) Programmen und ihre Vollständigkeit
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Dissertation, 2021
- Schlagwort
-
Programs
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2021
- Urheber
- Beteiligte Personen und Organisationen
-
Giesl, Jürgen
Kovács, Laura
- DOI
-
10.18154/RWTH-2021-06073
- URN
-
urn:nbn:de:101:1-2021081806153418964312
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:41 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Hark, Marcel
- Giesl, Jürgen
- Kovács, Laura
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2021
Ähnliche Objekte (12)
Automated Termination Analysis of Polynomial Probabilistic Programs
Automatic termination analysis for functional and imperative programs
Proving termination of probabilistic recursive programs via SMT-solving
The probabilistic termination tool amber
The Termination and Complexity Competition
Termination proofs for logic programs
Termination proofs for logic programs
Automated termination analysis of C programs
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Proving Termination of C Programs with Lists
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)
Verification of Reachability Properties and Termination for Probabilistic Systems
Automated Termination Analysis of Polynomial Probabilistic Programs
Automatic termination analysis for functional and imperative programs
Proving termination of probabilistic recursive programs via SMT-solving
The probabilistic termination tool amber
The Termination and Complexity Competition
Termination proofs for logic programs
Termination proofs for logic programs
Automated termination analysis of C programs
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Proving Termination of C Programs with Lists
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)
Verification of Reachability Properties and Termination for Probabilistic Systems
Automated Termination Analysis of Polynomial Probabilistic Programs
Automatic termination analysis for functional and imperative programs
Proving termination of probabilistic recursive programs via SMT-solving
The probabilistic termination tool amber
The Termination and Complexity Competition
Termination proofs for logic programs
Termination proofs for logic programs
Automated termination analysis of C programs
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Proving Termination of C Programs with Lists
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper)