Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Basic proof theory
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th 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
Deciding validity in a spatial logic for trees
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Verifiable and Executable Logic Specifications of Concurrent Objects in Lpi
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Nominal Logic: A First Order Theory of Names and Binding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Compositionality via Cut-Elimination: Hennessy-Milner Logic for an Arbitrary GSOS
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proof systems for π-calculus logics
Logic for concurrency and synchronisation
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Manipulating Trees with Hidden Labels
Electronic Notes in Theoretical Computer Science (ENTCS)
Policy-based Coordination in PAGODA: A Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Spatial-behavioral types for concurrency and resource control in distributed systems
Theoretical Computer Science
Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
The Temporal Logic of Rewriting: A Gentle Introduction
Concurrency, Graphs and Models
Learning and detecting emergent behavior in networks of cardiac myocytes
Communications of the ACM - Being Human in the Digital Age
Graphical Verification of a Spatial Logic for the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Logical semantics of types for concurrency
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Spatial-behavioral types, distributed services, and resources
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
A spatial logical characterisation of context bisimulation
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
A logic for distributed higher order π-calculus
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Abstract interpretation based verification of temporal properties for BioAmbients
Information and Computation
Namespace logic: a logic for a reflective higher-order calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
MoMo: a modal logic for reasoning about mobility
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
A complete temporal and spatial logic for distributed systems
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Model checking for nominal calculi
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A simpler proof theory for nominal logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
From separation logic to first-order logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Spatial and epistemic modalities in constraint-based process calculi
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We present a modal logic for describing the spatial organization and the behavior of distributed systems. In addition to standard logical and temporal operators, our logic includes spatial operations corresponding to process composition and name hiding, and a fresh name quantifier. In Part I of this work we study the fundamental semantic properties of our logic; the focus of the present Part II is on proof theory. The main contributions are a sequent-based proof system for our logic, and a proof of cut-elimination for its first-order fragment.