Combining integer programs and graph grammars: Theory and implementation in Attestor
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Bachelorarbeit, 2023
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2024
- Urheber
-
Ferber, Alexander
Fesefeldt, Ira Justus
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2024-00784
- URN
-
urn:nbn:de:101:1-2024022301335072210245
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:56 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
- Ferber, Alexander
- Fesefeldt, Ira Justus
- Noll, Thomas
- Katoen, Joost-Pieter
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2024
Ähnliche Objekte (12)
Termination analysis of procedural pointer programs modelled by graph grammars
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Verification of pointer programs
Concepts, algorithms, and tools for model checking
Advanced weakest precondition calculi for probabilistic programs
Invariant-based strategy synthesis for nondeterministic 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
Analyzing memory accesses for performance and correctness of parallel programs
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs
Proving termination of probabilistic recursive programs via SMT-solving
Termination analysis of procedural pointer programs modelled by graph grammars
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Verification of pointer programs
Concepts, algorithms, and tools for model checking
Advanced weakest precondition calculi for probabilistic programs
Invariant-based strategy synthesis for nondeterministic 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
Analyzing memory accesses for performance and correctness of parallel programs
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs
Proving termination of probabilistic recursive programs via SMT-solving
Termination analysis of procedural pointer programs modelled by graph grammars
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Verification of pointer programs
Concepts, algorithms, and tools for model checking
Advanced weakest precondition calculi for probabilistic programs
Invariant-based strategy synthesis for nondeterministic 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
Analyzing memory accesses for performance and correctness of parallel programs
Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs