Trace matching in a concurrent logical framework

Authors:
Iliano Cervesato;Frank Pfenning;Jorge Luis Sacchini;Carsten Schürmann;Robert J. Simmons
Affiliations:
Carnegie Mellon University, Doha, Qatar;Carnegie Mellon University, Pittsburgh, PA, USA;Carnegie Mellon University, Doha, Qatar;IT University of Copenhagen, Copenhagen, Denmark;Carnegie Mellon University, Pittsburgh, PA, USA
Venue:
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Year:
2012

Citing 15
Cited 0

Coloured Petri nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Programming by multiset transformation

Communications of the ACM
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
&pgr;-calculus in (Co)inductive-type theory

Theoretical Computer Science - Special issues on models and paradigms for concurrency
The Book of Traces

The Book of Traces
Pattern Matching in Trace Monoids (Extended Abstract)

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
System Description: Twelf - A Meta-Logical Framework for Deductive Systems

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
A Meta-Notation for Protocol Analysis

CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Typing correspondence assertions for communication protocols

Theoretical Computer Science
A Semantic Model for Authentication Protocols

SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Specifying Properties of Concurrent Computations in CLF

Electronic Notes in Theoretical Computer Science (ENTCS)
Contextual modal type theory

ACM Transactions on Computational Logic (TOCL)
Celf --- A Logical Framework for Deductive and Concurrent Systems (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The Isabelle Framework

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
The maude 2.0 system

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Matching and unification play an important role in implementations of proof assistants, logical frameworks, and logic programming languages. In particular, matching is at the heart of many reasoning tasks and underlies the operational semantic for well-moded logic programs. In this paper, we study the problem of matching on concurrent traces in the CLF logical framework, an extension of LF that supports the specification of concurrent and distributed systems. A concurrent trace is a sequence of computations where independent steps can be permuted. We give a sound and complete algorithm for matching traces with one variable standing for an unknown subtrace. Extending the result to general traces and to unification is left to future work.