Resource separation in dynamic logic of propositional assignments

DOI10.1007/978-3-030-38808-9_10zbMath1496.03124arXiv2104.14884OpenAlexW2999871955MaRDI QIDQ5896086

Nicolas Troquard, Joseph Boudou, Andreas Herzig

Publication date: 8 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.14884

zbMATH Keywords

dynamic logicseparation logicparallel compositionpropositional assignments

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Resource separation in dynamic logic of propositional assignments

This page was built for publication: Resource separation in dynamic logic of propositional assignments