Results 1 - 10 of 113

A Fresh Calculus for Name Management

by D. Ancona, E. Moggi, D. Ancona E. Moggi - In Karsai and Visser [KV04
"... We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (as in FreshML), computational types (to allow computational e#ects, including generation of fresh names). The calculus supports the ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
We define a basic calculus for name management, which is obtained by an appropriate combination of three ingredients: extensible records (in a simplified form), names (as in FreshML), computational types (to allow computational e#ects, including generation of fresh names). The calculus supports

A fresh calculus for name management

by D. Ancona E. Moggi - In Proceedings of the International Conference on Generative Programming and Component Engineering , 2004
"... Abstract. We define a basic calculus for name management, which com-bines three ingredients: extensible records (in a simplified form), names (as in FreshML), computational types (to allow computational effects, including generation of fresh names). The calculus supports the use of symbolic names fo ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. We define a basic calculus for name management, which com-bines three ingredients: extensible records (in a simplified form), names (as in FreshML), computational types (to allow computational effects, including generation of fresh names). The calculus supports the use of symbolic names

Modeling Fresh Names in the π-calculus Using Abstractions

by Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan , 2004
"... In this paper, we model fresh names in the #-calculus using abstractions with respect to a new binding operator #. Both the theory and the metatheory of the #-calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
In this paper, we model fresh names in the #-calculus using abstractions with respect to a new binding operator #. Both the theory and the metatheory of the #-calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given

A Sequent Calculus for Nominal Logic

by Murdoch Gabbay, James Cheney - IN PROC. LICS’04 , 2004
"... Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N - (or "new")-quantifier, originally presented as a Hilbert-style axiom system extending first-order logic. We present a sequent calculus for nominal logic called Fre ..."
Abstract - Cited by 32 (16 self) - Add to MetaCart
Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual N - (or "new")-quantifier, originally presented as a Hilbert-style axiom system extending first-order logic. We present a sequent calculus for nominal logic called

The do-calculus revisited

by Judea Pearl , 2012
"... The do-calculus was developed in 1995 to facilitate the identification of causal effects in non-parametric models. The completeness proofs of [Huang and Valtorta, 2006] and [Shpitser and Pearl, 2006] and the graphical criteria of [Tian and Shpitser, 2010] have laid this identification problem to res ..."
Abstract - Cited by 17 (2 self) - Add to MetaCart
to rest. Recent explorations unveil the usefulness of the do-calculus in three additional areas: mediation analysis [Pearl, 2012], transportability [Pearl and Bareinboim, 2011] and metasynthesis. Meta-synthesis (freshly coined) is the task of fusing empirical results from several diverse studies

Fresh-register automata

by Nikos Tzevelekos - In Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’11 , 2011
"... What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names wi ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
What is a basic automata-theoretic model of computation with names and fresh-name generation? We introduce Fresh-Register Automata (FRA), a new class of automata which operate on an infinite alphabet of names and use a finite number of registers to store fresh names, and to compare incoming names

Ambient Calculus and its Logic in the Calculus of Inductive Constructions

by Ivan Scagnetto, Marino Miculan - In Proc. of LFM, ENTCS 70.2, 2002. 161 , 2002
"... The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of the theory and metatheory of Ambient Calculus and its modal logic in the Calculus of Inductive Constructions. We take full ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of the theory and metatheory of Ambient Calculus and its modal logic in the Calculus of Inductive Constructions. We take

Freshness Analysis in Authentication Protocols

by Chiara Braghin, Agostino Cortesi, Riccardo Focardi, Università Ca, Foscari Venezia
"... Freshness of messages in authentication protocols is a key issue to prevent replay attacks. In this paper, we show how to model cryptographic protocols in the Mobile Ambient calculus, and how, in this setting, a suitable control-flow analysis can be applied in order to statically detect possible lac ..."
Abstract - Add to MetaCart
Freshness of messages in authentication protocols is a key issue to prevent replay attacks. In this paper, we show how to model cryptographic protocols in the Mobile Ambient calculus, and how, in this setting, a suitable control-flow analysis can be applied in order to statically detect possible

1. What is π-calculus? FAQ on π-Calculus

by Jeannette M. Wing , 2002
"... π-calculus is a model of computation for concurrent systems. The syntax of π-calculus lets you represent processes, parallel composition of processes, synchronous communication between processes through channels, creation of fresh channels, replication of processes, and nondeterminism. That’s it! 2. ..."
Abstract - Add to MetaCart
π-calculus is a model of computation for concurrent systems. The syntax of π-calculus lets you represent processes, parallel composition of processes, synchronous communication between processes through channels, creation of fresh channels, replication of processes, and nondeterminism. That’s it! 2

A Fresh Look at Separation Algebras and Share Accounting ⋆

by Robert Dockins, Aquinas Hobor
"... Abstract. Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Concurrent Separation Logic and in mechanizing proofs of its soundness, we found previous axiomatizations of separ ..."
Abstract - Cited by 44 (8 self) - Add to MetaCart
of separation algebras and previous systems of share accounting to be useful but imperfect. We adjust the axioms of separation algebras; we demonstrate an operator calculus for constructing new separation algebras; we present a more powerful system of share accounting with a new, simple model; and we provide a
Results 1 - 10 of 113