A co-induction principle for recursively defined domains
Theoretical Computer Science
Algebraic theories for name-passing calculi
Information and Computation
Handbook of logic in computer science (vol. 4)
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Locality and True-concurrency in Calculi for Mobile Processes
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Internal Mobility and Agent-Passing Calculi
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Internal Mobility and Agent-Passing Calculi
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Toward a Modal Theory of Types for the pi-Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
A Fully-Abstract Model for the p-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A domain equation for bisimulation
Information and Computation
Combinatory formulations of concurrent languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fully abstract denotational semantics for the π-calculus
Theoretical Computer Science
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Possible World Semantics for General Storage in Call-By-Value
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A fully abstract model for the π-calculus
Information and Computation
Models for Name-Passing Processes: Interleaving and Causal
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A semantic theory for value-passing processes based on the late approach
Information and Computation
Term rewriting with variable binding: an initial algebra approach
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A filter model for mobile processes
Mathematical Structures in Computer Science
Models for name-passing processes: interleaving and causal
Information and Computation
Types and full abstraction for polyadic π-calculus
Information and Computation
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Consistency of the theory of contexts
Journal of Functional Programming
ACM SIGACT News
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
An initial algebra approach to term rewriting systems with variable binders
Higher-Order and Symbolic Computation
About permutation algebras, (pre)sheaves and named sets
Higher-Order and Symbolic Computation
Structured coalgebras and minimal HD-automata for the π-calculus
Theoretical Computer Science - Mathematical foundations of computer science 2000
Free-algebra models for the π -calculus
Theoretical Computer Science
A Category of Explicit Fusions
Concurrency, Graphs and Models
A Categorical Model of the Fusion Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
Theoretical Computer Science
Comparing Operational Models of Name-Passing Process Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Characterization Results for Permutation Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Denotational Approach to the Static Analysis of Cryptographic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
A Semiring-based Quantitative Analysis of Mobile Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Types and full abstraction for polyadic π-calculus
Information and Computation
Comparing operational models of name-passing process calculi
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Weak bisimilarity coalgebraically
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Relating computational effects by ⊤⊤-lifting
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A Resource Analysis of the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Free-algebra models for the π-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A unifying model of variables and names
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Measuring the speed of information leakage in mobile processes
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
A Denotational Semantics for the π-Calculus
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A Presheaf Environment for the Explicit Fusion Calculus
Journal of Automated Reasoning
Relating computational effects by ττ-lifting
Information and Computation
| Hi-index | 0.00 |
Abramsky' s domain equation for bisimulation and the author' s categorical models for names combine to give a domain-theoretic model for the p-calculus. This is set in a functor category which provides a syntax-free interpretation of fresh names, privacy, visibility and non-inteference between processes. The model is fully abstract for strong late bisimilarity and equivalence (bisimilarity under all name substitutions).