- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.1007/978-3-030-99336-8_3
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2022
- Urheber
-
Batz, Kevin
Fesefeldt, Ira Justus
Jansen, Marvin
Katoen, Joost-Pieter
Keßler, Florian
Matheja, Christoph
Noll, Thomas
- DOI
-
10.18154/RWTH-2022-03408
- URN
-
urn:nbn:de:101:1-2022050304183817573927
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:26 MESZ
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
- Batz, Kevin
- Fesefeldt, Ira Justus
- Jansen, Marvin
- Katoen, Joost-Pieter
- Keßler, Florian
- Matheja, Christoph
- Noll, Thomas
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2022
Ähnliche Objekte (12)
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Automata-based model checking of recursive systems
Model checking pPDA vs unambiguous automata
Compositional control-flow reduction for probabilistic model checking
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
Quantitative Analysis of Counterexample Generation for Automata Learning
Synthesizing FDIR recovery strategies for space systems
Learning probabilistic automata with SMT solving
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Automata-based model checking of recursive systems
Model checking pPDA vs unambiguous automata
Compositional control-flow reduction for probabilistic model checking
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
Quantitative Analysis of Counterexample Generation for Automata Learning
Synthesizing FDIR recovery strategies for space systems
Learning probabilistic automata with SMT solving
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Automata-based model checking of recursive systems
Model checking pPDA vs unambiguous automata
Compositional control-flow reduction for probabilistic model checking
Static Analysis of Pointer Programs - Linking Graph Grammars and Separation Logic
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Quantitative separation logic: a logic for reasoning about probabilistic pointer programs
Quantitative Analysis of Counterexample Generation for Automata Learning
Synthesizing FDIR recovery strategies for space systems