Communicating sequential processes
Communicating sequential processes
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Transition predicate abstraction and fair termination
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantics for concurrent separation logic
Theoretical Computer Science
Resources, concurrency, and local reasoning
Theoretical Computer Science
Local Action and Abstract Separation Logic
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Separation Logic Semantics for Communicating Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
From separation logic to first-order logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Hi-index | 0.00 |
Separation logic has two spatial connectives *** and *** *** . It is known that *** and *** *** are not dual each other, like `and' and `or', `for all' and `there exists', `necessarily' and `possibly', etc. To define the dual connectives of *** and *** *** there are two choices: one is to take *** and *** *** as special logical connectives; another is to take *** and *** *** as binary modalities. Correspondingly, the dual modalities of *** and *** *** are represented as the dual connectives of *** and *** *** , and as the dual modalities of *** and *** *** , where the latter can be represented by unary modalities in the case that the formulas are defined in a special form.