Theoretical Computer Science
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
Programming by multiset transformation
Communications of the ACM
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
ACL—a concurrent linear logic programming paradigm
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
On proof normalization in linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
First-order linear logic without modalities is NEXPTIME-hard
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
A calculus for cryptographic protocols
Information and Computation
A linear logic view of object petri nets
Fundamenta Informaticae - Special issue on Petri nets
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Communicating sequential processes
Communications of the ACM
Using encryption for authentication in large networks of computers
Communications of the ACM
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Event-State Duality: The Enriched Case
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Petri Nets as Models of Linear Logic
CAAP '90 Proceedings of the 15th Colloquium on Trees in Algebra and Programming
Focussing Proof-Net Construction as a Middleware Paradigm
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
From Petri Nets to Linear Logic
Category Theory and Computer Science
Encoding transition systems in sequent calculus
Theoretical Computer Science - Linear logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Phase Semantics and Verification of Concurrent Constraint Programs
LICS '98 Proceedings of the 13th 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
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Relating Strands and Multiset Rewriting for Security Protocol Analysis
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Towards Linear Logic Petri Nets - From P/T-Nets to Object Systems
Towards Linear Logic Petri Nets - From P/T-Nets to Object Systems
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Transition and cancellation in concurrency and branching time
Mathematical Structures in Computer Science
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Relating multiset rewriting and process algebras for security protocol analysis
Journal of Computer Security - Special issue on WITS'03
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Collaborative Planning with Confidentiality
Journal of Automated Reasoning
Logical approximation for program analysis
Higher-Order and Symbolic Computation
On the Complexity of Linear Authorization Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Modeling datalog fact assertion and retraction in linear logic
Proceedings of the 14th symposium on Principles and practice of declarative programming
Linear logical voting protocols
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Higher-Order processes, functions, and sessions: a monadic integration
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Hi-index | 0.00 |
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are notoriously hard to get right. Therefore, following an approach that has proved highly beneficial for sequential programs, much effort has been invested in tracing the foundations of concurrency in logic. The starting points of such investigations have been various idealized languages of concurrent and distributed programming, in particular the well established state-transformation model inspired by Petri nets and multiset rewriting, and the prolific process-based models such as the @p-calculus and other process algebras. In nearly all cases, the target of these investigations has been linear logic, a formal language that supports a view of formulas as consumable resources. In the first part of this paper, we review some of these interpretations of concurrent languages into linear logic and observe that, possibly modulo duality, they invariably target a small semantic fragment of linear logic that we call LV^o^b^s. In the second part of the paper, we propose a new approach to understanding concurrent and distributed programming as a manifestation of logic, which yields a language that merges those two main paradigms of concurrency. Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic and specifically LV^o^b^s. The resulting interpretation is extended with a majority of linear connectives into the language of @w-multisets. This interpretation drops the distinction between multiset elements and rewrite rules, and considerably enriches the expressive power of standard multiset rewriting with embedded rules, choice, replication, and more. Derivations are now primarily viewed as open objects, and are closed only to examine intermediate rewriting states. The resulting language can also be interpreted as a process algebra. For example, a simple translation maps process constructors of the asynchronous @p-calculus to rewrite operators. The language of @w-multisets forms the basis for the security protocol specification language MSR 3. With relations to both multiset rewriting and process algebra, it supports specifications that are process-based, state-based, or of a mixed nature, with the potential of combining verification techniques from both worlds. Additionally, its logical underpinning makes it an ideal common ground for systematically comparing protocol specification languages.