Towards Abstractions for Distributed Systems

See this document in CiteSeerX!

Towards Abstractions for Distributed Systems (2004) (Make Corrections) (11 citations)
Martin Berger

View or download:
dcs.qmul.ac.uk/~ma...ttooboring.ps.gz
Cached: PS.gz PS PDF Image Update Help

From: dcs.qmul.ac.uk/%7Emartinb...tafds (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: For historical, sociological and technical reasons, -calculi have been the dominant theoretical paradigm in the study of functional computation. Similarly, but to a lesser degree, -calculi dominate advanced mathematical accounts of concurrency. Alas, and despite its ever increasing ubiquity, an equally convincing formal foundation for distributed computing has not been forthcoming. This thesis seeks to contribute towards ameliorating that omission. To this end, guided by the assumption that... (Update)

Cited by: More
Modelling Dynamic Web Data - Gardner, Maffeis (Correct)
Electronic Notes in Theoretical Computer Science 39 No. 1 (2000) - Url Http Www (Correct)
Genericity and the π-Calculus - Berger, Honda, Yoshida (Correct)

Active bibliography (related documents): More All
11.9: Towards Abstractions for Distributed Systems - Berger (2000) (Correct)
0.7: Basic Theory of Reduction Congruence for Two Timed Asynchronous.. - Berger (2004) (Correct)
0.5: The Church-Turing Thesis and Timed Computations - Berger (2002) (Correct)

Similar documents based on text: More All
0.1: Typed Concurrent Programs: Specification & Verification - Nagarajan (1998) (Correct)
0.1: Twisted Systems - Errington (1999) (Correct)
0.0: SUEDE: A Wizard of Oz Prototyping Tool for Speech.. - Klemmer, Sinha.. (2000) (Correct)

Related documents from co-citation: More All
8: Pict: A programming language based on the pi-calculus - Pierce, Turner - 1997
7: On reduction-based process semantics - Honda, Yoshida - 1995
7: Game-theoretic Analysis of Call-by-value Computation - Honda, Yoshida - 1997

BibTeX entry: (Update)

Martin Berger. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2000. To appear. http://citeseer.ist.psu.edu/berger04towards.html More

@misc{ berger00towards,
  author = "M. Berger",
  title = "Towards Abstractions for Distributed Systems",
  text = "Martin Berger. Towards Abstractions for Distributed Systems. PhD thesis,
    Imperial College, Department of Computing, 2000. To appear.",
  year = "2000",
  url = "citeseer.ist.psu.edu/berger04towards.html" }

Citations (may not include all citations):
2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
906 A structural approach to operational semantics - Plotkin - 1981
901 Transaction processing: concepts and techniques (context) - Gray, Reuter - 1993
828 Model Checking - Clarke, Grumberg et al. - 2000
718 Distributed Algorithms (context) - Lynch - 1996
666 Theoretical Computer Science (context) - Alur, Dill et al. - 1994
410 Mobile ambients - Cardelli, Gordon - 2000
357 Algebraic Laws for Non-Determinism and Concurrency (context) - Hennessy, Milner - 1985
297 A calculus of mobile processes (context) - Milner, Parrow et al. - 1992
294 An object calculus for asynchronous communication - Honda, Tokoro - 1991
291 A Calculus of Mobile Agents - edric, Georges et al. - 1996
265 The Design of the Unix Operating System (context) - Bach - 1986
248 Expressing Mobility (context) - Sangiorgi - 1992
242 Linear logic (context) - Girard - 1987
200 Pict: A programming language based on the pi-calculus - Pierce, Turner - 2000
197 Barbed bisimulation - Milner, Sangiorgi - 1992
194 The formal semantics of programming languages (context) - Winskel - 1993
194 Functions as processes (context) - Milner - 1992
185 Distributed Systems (context) - Mullender - 1993
178 Communicating and Mobile Systems: the -Calculus (context) - Milner - 1999
167 Resource access control in systems of mobile agents - Riely, Hennessy - 1998
159 The Chemical Abstract Machine (context) - erard, erard - 1992
152 Semantics of Programming Languages (context) - Gunter - 1995
144 Models for concurrency - Winskel, Nielsen - 1995
140 On reduction-based process semantics - Honda, Yoshida - 1995
134 Concrete Mathematics: A Foundation for Computer Science (context) - Graham, Patashnik et al. - 1994
125 Event structures (context) - Winskel - 1986
116 A typed language for distributed mobile processes - Riely, Hennessy - 1998
115 An asynchronous model of locality (context) - Amadio - 1997
114 The Polymorphic Pi-Calculus: Theory and Implementation - Turner - 1996
99 Typed concurrent objects - Vasconcelos - 1994
94 Seal: A Framework for Secure Mobile Computations - Vitek, Castagna - 1999
89 The Lambda Calculus (context) - Barendregt - 1985
81 Calculus: a Theory of Mobile Processes (context) - Sangiorgi, Walker - 2001
77 Computer Networks (context) - Tannenbaum - 1996
76 Real-time behaviour of asynchronous agents (context) - Yi - 1990
75 Concurrency Control and Recovery in Database Systems (context) - Bernstein, Hadzilacos et al. - 1987
75 Trust and partial typing in open systems of mobile agents - Riely, Hennessy - 1999
75 A Tutorial on EMPA: A Theory of Concurrent Processes with No.. - Bernardo, Gorrieri - 1998
73 Comparing the expressive power of the synchronous and the as.. - Palamidessi - 1997
70 On asynchronous communication semantics - Honda, Tokoro - 1995
66 Graph Types for Monadic Mobile Processes - Yoshida - 1996
61 Localities and failures - Amadio, Prasad - 1994
60 Decoding choice encodings - Nestmann, Pierce - 1996
60 On asynchrony in name-passing calculi - Merro, Sangiorgi - 1998
56 Nomadic Pict: Language and Infrastructure Design for Mobile .. - Wojciechowski - 2000
54 Handbook of Process Algebra (context) - Bergstra, Ponse et al. - 2001
53 Lectures on Petri Nets I: Basic Models (context) - Reisig, Rozenberg - 1998
50 From rewrite rules to bisimulation congruences - Sewell - 1998
49 Petri Nets (context) - Reisig - 1985
48 Types for dyadic interaction - Honda - 1993
44 event structures and domains (context) - Nielsen, Plotkin et al. - 1981
44 Internal mobility and agent passing calculi (context) - Sangiorgi - 1995
43 Classical Recursion Theory (context) - Odifreddi - 1989
42 Distributed processes and location failures - Riely, Hennessy
42 Deriving bisimulation congruences for reactive systems - Leifer, Milner - 2000
42 Globallocal subtyping and capability inference distributed p.. - Global, subtyping et al. - 1998
40 Elements of interaction (context) - Milner - 1993
38 The Join-Calculus: a Calculus for Distributed Mobile Program.. (context) - edric - 1998
36 Verifying programs with unreliable channels - Abdulla, Jonsson - 1996
36 The pi-calculus in direct style - erard - 1997
35 Set Theory: An Introduction to Independence Proofs (context) - Kunen - 1980
35 Plain CHOCS: A Second Generation Calculus for Higher Order P.. (context) - Thomsen - 1993
31 and Languages (context) - Davis, Weyuker et al. - 1983
30 A Calculus for Cryptographic Protocols: The Spi Calculus (context) - Abadi, Gordon - 1997
25 Secrecy Types for Asymmetric Communication - Abadi, Blanchet - 2001
23 Process algebras with localities (context) - Castellani - 2001
22 Game semantics - Abramsky, McCusker - 1997
22 A small calculus for concurrent objects (context) - Honda, Tokoro - 1991
19 A hierarchy of equivalences for asynchronous calculi (context) - edric, Georges - 1998
19 good' encoding of guarded choice (context) - Nestmann - 1997
18 First-order axioms for asynchrony - Selinger - 1997
17 Timed process algebras: a tutorial (context) - Hennessy - 1992
16 ects for asymmetric cryptographic protocols (context) - Gordon, Je et al. - 2002
15 The Universal Turing Machine: a Half-Century Survey (context) - Herken - 1995
13 A uniform type structure for secure information ow (context) - Honda, Yoshida - 2002
13 Semantics for a real-time object-oriented programming langua.. - Satoh, Tokoro - 1994
13 Locus solum: From the rules of logic to the logic of rules (context) - Girard - 2001
12 Secure information ow as typed process behaviour (context) - Honda, Vasconcelos et al. - 2000
12 Department of Computer Science (context) - Honda, in et al. - 1992
11 Asynchrony and the pi-calculus - Boudol - 1992
11 and Davide Sangiorgi (context) - Amadio, Castellani - 1996
11 A sort inference algorithm for the polyadic pi-calculus (context) - Gay - 1993
10 Principal typing scheme for polyadic -calculus (context) - Vasconcelos, Honda - 1993
10 Language-based information- ow security (context) - Myers, Sabelfeld - 2002
10 Notes on Set Theory (context) - Moschovakis - 1994
9 and Yde Venema (context) - Blackburn, de Rijke - 2001
8 A Broadcast-Based Calculus for Communicating Systems - Ene, Muntean - 2001
8 The Two-Phase Commit Protocol in an Extended -calculus (context) - Berger, Honda
8 The Two-Phase Commit Protocol in an Extended -Calculus (context) - Berger, Honda - 2000
7 Elementary Structures for Process Theory (context) - Honda - 2001
7 Bialgebraic Modelling of Timed Processes (context) - Kick - 2002
7 The Geometry of Concurrency (context) - Goubault - 1995
6 Beyond the universal turing machine - Copeland, Sylvan - 1998
6 Mobile processes with local clocks - Degano, Loddo et al. - 1996
6 the expressive power of polyadic synchronisation in pi-calcu.. - Carbone, Ma et al. - 2002
5 A symmetric calculus based on internal mobility (context) - Sangiorgi - 1995
5 Geometry and concurrency: A user's guide - Goubault - 2000
5 Concepts and Design (context) - Couloris, Dollimore et al. - 2001
5 A survey of rollback-recovery protocols in message-passing s.. - Elnozahy, Johnson et al. - 1996
4 Type Systems and Programming Languages (context) - Pierce - 2002
4 Complexity and Self-Organization in Time Series and Cellular.. (context) - Shalizi, Architecture - 2001
4 Rule Formats for Timed Processes (context) - Kick - 2002
4 Expressiveness of point-to-point versus broadcast communicat.. - Ene, Muntean - 1999
4 and Nobuko Yoshida (context) - Berger, Honda - 2001
4 and Nobuko Yoshida (context) - Berger, Honda - 2001
3 Discovering Modern Set Theory (context) - Just, Weese - 1996
3 erence between clocks and turing machines (context) - Longo - 1999
3 Imperial College (context) - Errington, PhD - 1999
3 the Design and Implementation of a Virtual Machine for Proce.. (context) - Barros, On - 1999
3 Communication errors in the picalculus are undecidable - Vasconcelos, onio - 1999
2 Complexity Theory (context) - Papadimitriou - 1994
2 Some results on barbed equivalences in pi-calculus (context) - Sangiorgi, Walker - 2001
2 Rewriting Logic: Roadmap and Bibliography - Mart, Jos et al. - 2001
2 Algorithmic veri cation of lossy channel systems (context) - Abdulla, Annichini et al. - 1999
2 Every Process Algebra has a Fully-Abstract and Compositional.. (context) - Berger - 2000
2 Every two elementary equivalent models have isometric ultrap.. (context) - Shelah - 1971
2 and Kohei Honda (context) - Yoshida, Berger - 2001
http://www.dcs.qmul.ac.uk/~kohei
http://plato.stanford.edu/entries/church-turing/
http://www.eecis.udel.edu/~ntp/

The graph only includes citing articles where the year of publication is known.

Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback

CiteSeer.IST - Copyright Penn State and NEC