A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Analyzing security protocols with secrecy types and logic programs
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Strong Normalisation in Higher-Order Action Calculi
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Fibrational Control Structures
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Secrecy types for asymmetric communication
Theoretical Computer Science - Foundations of software science and computation structures
The Curry-Howard Correspondence in Set Theory
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Typing correspondence assertions for communication protocols
Theoretical Computer Science
The implementation of procedurally reflective languages
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
A Sequent Calculus for Nominal Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A spatial logic for concurrency--II
Theoretical Computer Science - Special issue: Foundations of wide area network computing
| Hi-index | 0.00 |
In [19] it was observed that a theory like the π-calculus, dependent on a theory of names, can be closed, through a mechanism of quoting, so that (quoted) processes provide the necessary notion of names. Here we expand on this theme by examining a construction for a Hennessy-Milner logic corresponding to an asynchronous messagepassing calculus built on a notion of quoting. Like standard Hennessy-Milner logics, the logic exhibits formulae corresponding to sets of processes, but a new class of formulae, corresponding to sets of names, also emerges. This feature provides for a number of interesting possible applications from security to data manipulation. Specifically, we illustrate formulae for controlling process response on ranges of names reminiscent of a (static) constraint on port access in a firewall configuration. Likewise, we exhibit formulae in a names-as-data paradigm corresponding to validation for fragment of XML Schema.