Towards a Theory of Bisimulation for Local Names

Towards a Theory of Bisimulation for Local Names (1999)

Cached

Download Links

[klee.cs.depaul.edu]

Other Repositories/Bibliography

DBLP

by Alan Jeffrey , Julian Rathke

Venue:	In 14th Annual Symposium on Logic in Computer Science
Citations:	22 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Towards a Theory of Bisimulation for Local Names	user correction - Legacy Corrections
AUTHOR NAME	Alan Jeffrey	user correction - Legacy Corrections
AUTHOR AFFIL	CTI, DePaul University	user correction - Legacy Corrections
AUTHOR ADDR	243 South Wabash Ave; Chicago IL 60604, USA	user correction - Legacy Corrections
AUTHOR NAME	Julian Rathke	user correction - Legacy Corrections
AUTHOR AFFIL	COGS, University of Sussex	user correction - Legacy Corrections
AUTHOR ADDR	Brighton BN1 9QH, UK	user correction - Legacy Corrections
ABSTRACT	Pitts and Stark have proposed the n-calculus as a language for investigating the interaction of unique name generation and higherorder functions. They developed a sound model based on logical relations, but left completeness as an open problem. In this paper, we develop a complete model based on bisimulation for a labelled transition system semantics. We show that bisimulation is complete, but not sound, for the n-calculus. We also show that by adding assignment to the n-calculus, bisimulation becomes sound and complete. The analysis used to obtain this result illuminates the difficulties involved in finding fully abstract models for n-calculus proper. Keywords: semantics, bisimulation, nominal calculi. 1 Introduction The use of localised information in computing is endemic. In a workplace, where the prevalence of networks and mobile agents is increasing, the concepts of private and public data are of great importance, and the question of how secrecy can be maintained is a significan...	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	In 14th Annual Symposium on Logic in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	56--66	INFERENCE
VOLUME	2	INFERENCE
CITATIONS	1 found	ParsCit 1.0