A calculus of mobile processes, I
Information and Computation
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th 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 (part I)
Information and Computation - TACS 2001
A Calculus and logic of resources and processes
Formal Aspects of Computing
Expressiveness and complexity of graph logic
Information and Computation
A Logical Characterisation of Static Equivalence
Electronic Notes in Theoretical Computer Science (ENTCS)
Observing distributed computation: a dynamic-epistemic approach
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
From separation logic to first-order logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
| Hi-index | 0.00 |
Spatial logics have been proposed to reason locally andmodularly on algebraic models of distributed systems. In this paperwe define the spatial equational logic AΠL whosemodels are processes of the applied Π-calculus. Thisextension of the Π-calculus allows term manipulationand records communications as active substitutions in a frame, thusaugmenting the underlying predefined equational theory. Our logicallows one to reason locally either on frames or on processes,thanks to static and dynamic spatial operators. We study thelogical equivalences induced by various relevant fragments ofAΠL, and show in particular that the whole logicinduces a coarser equivalence than structural congruence. We givecharacteristic formulae for some of these equivalences and forstatic equivalence. Going further into the exploration ofAΠL's expressivity, we also show that it can eliminatestandard term quantification.