Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: 10.1145/3290347
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2019
- Creator
- DOI
-
10.18154/RWTH-2019-00833
- URN
-
urn:nbn:de:101:1-2019091905570554555470
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:21 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.
Associated
- Batz, Kevin
- Kaminski, Benjamin Lucien
- Katoen, Joost-Pieter
- Matheja, Christoph
- Noll, Thomas
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2019
Other Objects (12)
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Proving termination of pointer programs on top of symbolic execution
Termination analysis of procedural pointer programs modelled by graph grammars
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Foundations for Entailment Checking in Quantitative Separation Logic
Automated reasoning and randomization in separation logic
Learning probabilistic automata with SMT solving
Synthesizing FDIR recovery strategies for space systems
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Proving termination of pointer programs on top of symbolic execution
Termination analysis of procedural pointer programs modelled by graph grammars
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Foundations for Entailment Checking in Quantitative Separation Logic
Automated reasoning and randomization in separation logic
Learning probabilistic automata with SMT solving
Synthesizing FDIR recovery strategies for space systems
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Proving termination of pointer programs on top of symbolic execution
Termination analysis of procedural pointer programs modelled by graph grammars
Implementation of a Predicate-Guided Termination Analysis for Pointer Programs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Foundations for Entailment Checking in Quantitative Separation Logic
Automated reasoning and randomization in separation logic
Learning probabilistic automata with SMT solving