Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Davide Sangiorgi's bibliography (Selection)
Davide Sangiorgi's bibliography (selection)
Warning: The versions of papers that you find
here do not necessarily correspond to the published
versions.
Not all papers are listed below.
Send me an email if you'd like to receive
a paper not listed.
SCC:
a Service Centered Calculus
M. Boreale,
R. Bruni,
L. Caires,
R. De Nicola,
I. Lanese,
M. Loreti,
F. Martins,
U. Montanari,
A. Ravara,
D. Sangiorgi,
V. Vasconcelos,
G. Zavattaro.
Proc. WS-FM 2006, LNCS.
Interpreting functions as pi-calculus processes: a tutorial ,
D. Sangiorgi. Draft, August 98, revised February 99.
Parts of it have appeared in J. of MSCS, 9,1999
(Special Issue on "Lambda-Calculus and Logic"
in Honour of Roger Hindley).
Asynchronous process calculi: the first-order and higher-order
paradigms (a tutorial) ,
D. Sangiorgi, April 99. Theoretical Computer Science, 253, 2001.
On asynchrony in name-passing calculi
[ Abstract ]
M. Merro and D. Sangiorgi, draft, February 1998.
A revised version has appeared in
Proc. ICALP '98, LNCS 1443, 1998.
The
full paper is the
Technical Report 2001:06, School of Cognitive and Computing Sciences,
University of Sussex, 2001.
Imperative Objects and Mobile Processes
[ Abstract ]
J. Kleist and D. Sangiorgi, draft, October 1997.
A revised version has appeared in the
Proc. PROCOMET '98
(IFIP Working Conference on
Programming Concepts and Methods),
June 1998, Shelter Island, New York, North-Holland, 1998.
Full version to appear in the journal of Science of Computer Programming.
pi-calculus, internal mobility and agent-passing calculi
[ Abstract ]
D. Sangiorgi,
A revised version has appeared in
Theoretical Computer Science
167(2), 1996.
Extracts
of parts of the material contained in this paper can be
found in the Proceedings of TAPSOFT'95 and ICALP'95.
Lazy functions and mobile processes
[ Abstract ]
D. Sangiorgi,
Tec.Rep. RR-2515, INRIA-Sophia Antipolis, 1995.
A revised version has appeared in
"Proof, Language and Interaction: Essays in Honour of
Robin Milner", MIT Press, 2000.
Bisimulation in higher-order calculi
[ Abstract ]
D. Sangiorgi,
A revised version has appeared in
Information and Computation, 131(2), 1996 (Some
corrections for the Information and Computation paper).
Preliminary version in proc. PROCOMET'94 (IFIP
Working Conference on Programming Concepts, Methods and
Calculi),
North Holland, 1994
Typing and subtyping for mobile processes
[ Abstract ]
B.Pierce and D. Sangiorgi.
In Proc. of eight annual IEEE Symposium on
Logic in Computer Science (LICS '93),
IEEE Computer Society Press.
A revised and extended version
has appeared in journal of MSCS 6(5),
409--454, 1996.
Barbed Bisimulation
[ Abstract ]
R.Milner and D. Sangiorgi.
In Proc. of 19-the International Colloquium on Automata,
Languages and Programming (ICALP '92), LNCS 623,
Springer Verlag, 1992.
The Lazy Lambda Calculus in a Concurrency
Scenario
[ Abstract ]
D. Sangiorgi,
Information and Computation, 111(1), 1994.
An extended abstract in: Proc. of seventh annual IEEE Symposium on
Logic in Computer Science (LICS '92),
IEEE Computer Society Press.
These papers below are not available electronically;
send me an email if you'd like to have a copy.
Comparison Among Classes of Y-tree Systolic Automata
E. Fachini, A. Maggiolo-Schettini and D. Sangiorgi.
Proc. Symposium on Mathematical Foundation of Computer
Science, LNCS 452, Springer Verlag, 1990.
[ Abstract ]
Using Systolic Automata to Derive
an Improved Systolic Array for String Correction
C. Lengauer and D. Sangiorgi
Revised version of the paper
"An Improved Systolic Array for String Correction"
appeared in Proc. Advanced Research Workshop on Correct
Hardware Design Methodologies, Elsevier, 1992.
Some Structural Properties of Systolic Tree Automata.
E. Fachini, A. Maggiolo-Schettini and G. Resta
and D. Sangiorgi.
Fundamenta Informaticae, XII 571--585, 1989.
Non Acceptability Criteria and Closure Properties for the Class of
Languages Accepted by Binary Systolic Tree Automata.
E. Fachini, A. Maggiolo-Schettini, G. Resta
and D. Sangiorgi.
Theoretical Computer Science, 83 249--260, 1991.
Simulation of Systolic Tree Automata on Trellis Automata.
E. Fachini, A. Maggiolo-Schettini, J. Gruska
and D. Sangiorgi.
International Journal of Foundations of Computer Science, 1
87--110, 1990.
Classes of
Y-Tree Systolic Automata and Regular Systolic Trellis Automata.
E. Fachini, A. Maggiolo-Schettini
and D. Sangiorgi.
Acta Informatica, 29 623--643, 1992.