scientific article; zbMATH DE number 7407789
From MaRDI portal
Publication:5155678
Stéphane P. Demri, Alessio Mansutti, Etienne Lozes
Publication date: 8 October 2021
Full work available at URL: https://arxiv.org/abs/2006.05156
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the almighty wand
- On axiomatizations of public announcement logic
- Reasoning about sequences of memory states
- Quantitative separation logic and programs with lists
- Dynamic epistemic logic
- Modular tableaux calculi for separation theories
- The effects of adding reachability predicates in propositional separation logic
- Display logic
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Bunched logics displayed
- A decision procedure for separation logic in SMT
- Introspection as an action in relational models
- The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains
- Axiomatising logics with separating conjunction and modalities
- Complete axiomatization and decidability of alternating-time temporal logic
- Separation logic with one quantified variable
- The semantics and proof theory of the logic of bunched implications
- Axiomatizations of team logics
- Hybrid logics: characterization, interpolation and complexity
- An axiomatization of full Computation Tree Logic
- A theorem prover for Boolean BI
- Nondeterministic Phase Semantics and the Undecidability of Boolean BI
- Logical Dynamics of Information and Interaction
- Undecidability of Propositional Separation Logic and Its Neighbours
- Tableaux and Resource Graphs for Separation Logic
- Automated Theorem Proving for Assertions in Separation Logic with All Connectives
- Flat Coalgebraic Fixed Point Logics
- The Logic of Bunched Implications
- Modular Labelled Sequent Calculi for Abstract Separation Logics
- Separation logics and modalities: a survey
- BI as an assertion language for mutable data structures
- The power of modal separation logics
- Characterizing Provability in BI’s Pointer Logic Through Resource Graphs
- Parametric completeness for separation theories
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Foundations of Software Science and Computational Structures
- Internal Calculi for Separation Logic
- On the complexity of pointer arithmetic in separation logic
This page was built for publication:
