Hochschulschrift
Proving correctness of graph programs relative to recursively nested conditions
- Alternative title
-
Beweisverfahren für die Korrektheit von Graphprogrammen bezüglich rekursiv geschachtelter Bedingungen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Notes
-
Oldenburg, Universität Oldenburg, Dissertation, 2016
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Oldenburg
- (who)
-
BIS der Universität Oldenburg
- (when)
-
2016
- Creator
-
Flick, Nils Erik
- Contributor
-
Habel, Annegret
König, Barbara
- URN
-
urn:nbn:de:gbv:715-oops-29769
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
01.08.2025, 10:49 AM CEST
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.
Object type
- Hochschulschrift
Associated
- Flick, Nils Erik
- Habel, Annegret
- König, Barbara
- BIS der Universität Oldenburg
Time of origin
- 2016
Other Objects (12)
Models for software verification: Proving program correctness
Proving the Correctness of GNAT Light Runtime Library
Proving the correctness of algebraic implementations by the ISAR system
Proving Termination of C Programs with Lists
Abstract Execution: Automatically Proving Infinitely Many Programs
Proving the correctness of a code generator specification using term rewriting techniques
Proving termination of probabilistic recursive programs via SMT-solving
Piecewise execution of nested data-parallel programs
Proving termination of pointer programs on top of symbolic execution
Analyzing memory accesses for performance and correctness of parallel programs
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)
Correctness proofs and probabilistic tests for constructive specifications and functional programs
Models for software verification: Proving program correctness
Proving the Correctness of GNAT Light Runtime Library
Proving the correctness of algebraic implementations by the ISAR system
Proving Termination of C Programs with Lists
Abstract Execution: Automatically Proving Infinitely Many Programs
Proving the correctness of a code generator specification using term rewriting techniques
Proving termination of probabilistic recursive programs via SMT-solving
Piecewise execution of nested data-parallel programs
Proving termination of pointer programs on top of symbolic execution
Analyzing memory accesses for performance and correctness of parallel programs
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)
Correctness proofs and probabilistic tests for constructive specifications and functional programs
Models for software verification: Proving program correctness
Proving the Correctness of GNAT Light Runtime Library
Proving the correctness of algebraic implementations by the ISAR system
Proving Termination of C Programs with Lists
Abstract Execution: Automatically Proving Infinitely Many Programs
Proving the correctness of a code generator specification using term rewriting techniques
Proving termination of probabilistic recursive programs via SMT-solving
Piecewise execution of nested data-parallel programs
Proving termination of pointer programs on top of symbolic execution
Analyzing memory accesses for performance and correctness of parallel programs
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)