Combining integer programs and graph grammars: Theory and implementation in Attestor
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
RWTH Aachen University, Bachelorarbeit, 2023
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2024
- Creator
-
Ferber, Alexander
Fesefeldt, Ira Justus
- Contributor
- DOI
-
10.18154/RWTH-2024-00784
- URN
-
urn:nbn:de:101:1-2024022301335072210245
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:56 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ferber, Alexander
- Fesefeldt, Ira Justus
- Noll, Thomas
- Katoen, Joost-Pieter
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2024
Other Objects (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