Termination analysis of procedural pointer programs modelled by graph grammars
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Masterarbeit, 2022
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2022
- Urheber
-
Khalifa, Mohamed
Fesefeldt, Ira Justus
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2022-09096
- URN
-
urn:nbn:de:101:1-2022101301355124232406
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 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
- Khalifa, Mohamed
- Fesefeldt, Ira Justus
- Noll, Thomas
- Katoen, Joost-Pieter
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2022
Ähnliche Objekte (12)
Proving termination of probabilistic recursive programs via SMT-solving
Proving termination of pointer programs on top of symbolic execution
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Combining integer programs and graph grammars: Theory and implementation in Attestor
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Verification of pointer programs
The probabilistic termination tool amber
Concepts, algorithms, and tools for model checking
Advanced weakest precondition calculi for probabilistic programs
Model Checking Temporal Properties of Recursive Probabilistic Programs
Model Checking Temporal Properties of Recursive Probabilistic Programs
Semantics and loop invariant synthesis for probabilistic programs
Proving termination of probabilistic recursive programs via SMT-solving
Proving termination of pointer programs on top of symbolic execution
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Combining integer programs and graph grammars: Theory and implementation in Attestor
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Verification of pointer programs
The probabilistic termination tool amber
Concepts, algorithms, and tools for model checking
Advanced weakest precondition calculi for probabilistic programs
Model Checking Temporal Properties of Recursive Probabilistic Programs
Model Checking Temporal Properties of Recursive Probabilistic Programs
Semantics and loop invariant synthesis for probabilistic programs
Proving termination of probabilistic recursive programs via SMT-solving
Proving termination of pointer programs on top of symbolic execution
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Combining integer programs and graph grammars: Theory and implementation in Attestor
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Verification of pointer programs
The probabilistic termination tool amber
Concepts, algorithms, and tools for model checking
Advanced weakest precondition calculi for probabilistic programs
Model Checking Temporal Properties of Recursive Probabilistic Programs
Model Checking Temporal Properties of Recursive Probabilistic Programs