- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Dissertation, 2023
- Schlagwort
-
Automatisches Beweisverfahren
Programmverifikation
Terminierung
Softwareentwicklung
Korrektheit
Softwarespezifikation
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2023
- Urheber
- Beteiligte Personen und Organisationen
-
Giesl, Jürgen
David, Cristina
- DOI
-
10.18154/RWTH-2023-10177
- URN
-
urn:nbn:de:101:1-2024012702065678728346
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 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
- Hensel, Jera
- Giesl, Jürgen
- David, Cristina
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2023
Ähnliche Objekte (12)
Automated Termination Analysis of Polynomial Probabilistic Programs
Automated termination proofs
Automatic termination analysis for functional and imperative programs
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Termination analysis of procedural pointer programs modelled by graph grammars
Termination proofs for logic programs
Termination proofs for logic programs
Termination analysis for imperative programs operating on the heap
Proving Termination of C Programs with Lists
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs
Proving termination of probabilistic recursive programs via SMT-solving
Proving termination of pointer programs on top of symbolic execution
Automated Termination Analysis of Polynomial Probabilistic Programs
Automated termination proofs
Automatic termination analysis for functional and imperative programs
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Termination analysis of procedural pointer programs modelled by graph grammars
Termination proofs for logic programs
Termination proofs for logic programs
Termination analysis for imperative programs operating on the heap
Proving Termination of C Programs with Lists
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs
Proving termination of probabilistic recursive programs via SMT-solving
Proving termination of pointer programs on top of symbolic execution
Automated Termination Analysis of Polynomial Probabilistic Programs
Automated termination proofs
Automatic termination analysis for functional and imperative programs
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Termination analysis of procedural pointer programs modelled by graph grammars
Termination proofs for logic programs
Termination proofs for logic programs
Termination analysis for imperative programs operating on the heap
Proving Termination of C Programs with Lists
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs
Proving termination of probabilistic recursive programs via SMT-solving