Foto del docente

Cosimo Laneve

Professore ordinario

Dipartimento di Informatica - Scienza e Ingegneria

Settore scientifico disciplinare: INF/01 INFORMATICA

Pubblicazioni

vai alle Pubblicazioni

Pubblicazioni antecedenti il 2004

  • A Calculus for Long Running Transactions, by L. Bocchi, C. Laneve, G. Zavattaro, in 6th Int. Conference on Formal Methods for Open Object based Distributed Systems (FMOODS'03)}, LNCS n. 2884, pp. 124 -- 138, 2003.   

  • Linear Forwarders, by P. Gardner, C. Laneve, L. Wishick, to appear in Information and Computation. An extended abstract appeared in CONCUR'03, LNCS n. 2761, pp. 415 -- 430, 2003.   

  • Formal Molecular Biology, by V. Danos, C. Laneve. In Theoretical Computer Science, Volume 325(1), pp. 69 -- 110, 2004.  

  • Solos in Concert , by C. Laneve, B. Victor. In Mathematical Structures in Computer Science, Volume 13(5), pp. 657 -- 683, 2003.  

  • A Type System for JVM Threads , by C. Laneve. In TCS 290, pp. 741-778, 2003. Preliminary results (with G. Bigliardi) appeared at The Third ACM SIGPLAN Workshop on Types in Compilation (TIC 2000), Montreal, Canada, September 21, 2000.   

  • The Fusion Machine (extended abstract), by P. Gardner, C. Laneve, L. Wischik. In CONCUR'02, LNCS 2421, pp. 418 - 433, 2002.   

  • Orchestrating Transactions in Join Calculus, by R. Bruni, C. Laneve, U. Montanari. In CONCUR'02, LNCS 2421, pp. 321 - 337, 2002.  

  • Inheritance in Concurrent Objects, by C. Laneve. In Formal Methods for Distributed Processing, An Object Oriented Approach. Edited by H. Bowman and J. Derrick. Cambridge University Press. 2001.   

  • Solo Diagrams, by C. Laneve, J. Parrow, B. Victor: in Proc. 4th Theoretical Aspects of Computer Science, TACS'01, LNCS 2215, pp. 127--144, Springer-Verlag, 2001.

  • Inheritance in the join-calculus , by C. Fournet, C. Laneve, L. Maranget, D. Remy. In the Journal of Logic and Algebraic Programming.

  • A Reduction Semantics for Java , by S. Cimato, C. Laneve, P. Ciancarini. September 1998.   

  • Bisimulations in the Join-Calculus , by C. Fournet, C. Laneve. In TCS 266 (1-2), pp. 569-603, 2001. The extended abstract (with M. Boreale) appeared in PROCOMET '98 is here.  

  • Implicit typing a la ML for the join-calculus , by C. Fournet, C. Laneve, L. Maranget, D. Remy. In CONCUR '97, LNCS 1243.   

  • Lambda-Calculus, Multiplicities and the Pi-Calculus , by G. Boudol, C. Laneve. To appear in Process Calculus: Essays in Honour of Robin Milner, Volume 2, edited by G. Plotkin, C. Stirling e M. Tofte. 1997.   

  • On the Dynamics of Sharing Graphs , by A. Asperti, C. Laneve. Extended abstract in Automata, Languages and Programming, ICALP'97, LNCS 1256, pp. 259 -- 269.   

  • May and Must Testing in the Join-Calculus , by C. Laneve. Technical Report UBLCS 96-04, March 1996.   

  • The Discriminating Power of Multiplicities in Lambda-Calculus , by G. Boudol, C. Laneve. In Information and Computation, Volume 126(1), pp. 83 --102, April 1996. An extended abstract is appeared in 11th Conference on the Mathematical Foundations of Programming Semantics, MFPS'95.   

  • Axiomatizing Permutation Equivalence , by C. Laneve, U. Montanari. Mathematical Structures in Computer Science, Volume 6(3), pp. 219 -- 250, June 1996. An extended abstract is appeared in 3rd Intern. Conf. on Algebraic and Logic Programming, ALP'92, LNCS 632.   

  • An Investigation on the Optimal Implementation of Processes , by C. Laneve. In Fifth Italian Conference on Theoretical Computer Science, 1996. The full paper is a Technical Report UBLCS 96-01 , January 1996.   

  • Interaction Systems II: the practice of optimal reductions , by A. Asperti, C. Laneve. In Theoretical Computer Science, Volume 159(2), pp. 191 -- 244, 1996. An extended abstract is appeared in Colloquium on Trees in Algebra and Programming, CAAP'93, LNCS 668.   

  • Comparing lambda-calculus translations in Sharing Graphs , by A. Asperti, C. Laneve. In International Conference on Typed Lambda Calculi and Applications, TLCA'95. LNCS 902.   

  • Two Semantics for a Language of Reactive Objects , by F. Boussinot, C. Laneve. RR 2511 INRIA Sophia-Antipolis, March 1995.   

  • Paths, Computations and Labels in the lambda-calculus , by A. Asperti, C. Laneve. In Theoretical Computer Science, Volume 142(2), pp. 277 -- 297, 1995. An extended abstract is appeared in Rewriting Techniques and Applications, RTA'93, LNCS 690.   

  • Split and ST Bisimulation Semantics , by R. Gorrieri, C. Laneve. In Information and Computation, Volume 118(2), pp. 272 - 288, May 1995. An extended abstract is appeared in Mathematical Foundations of Computer Science, MFCS'91 , LNCS 520.   

  • Interaction Systems I: the theory of optimal reductions , by A. Asperti, C. Laneve. In Mathematical Structures in Computer Science, Volume 4(4), pp. 457 - 504, 1995. An extended abstract is appeared in Theoretical Aspects of Computer Science, TACS'94, LNCS 789.   

  • Paths in the lambda-calculus , by A. Asperti, V. Danos, C. Laneve, L. Regnier. In Logic in Computer Science 1994.   

  • Distributive Evaluations of Lambda-Calculus , by C. Laneve. Fundamenta Informaticae, Volume 20(4), pp. 333 -- 352, June 1994.  

  • Interaction Systems , by A. Asperti, C. Laneve. In International Workshop on Higher Order Algebras, Logic and Term Rewriting, HOA'93, LNCS 816.   

  • An Extensional Formulation of ST Bisimulation Semantics , by R. Gorrieri, C. Laneve. In 4th Italian Conference on Theoretical Computer Science, 1992.   

  • Mobility in the cc-paradigm , by C. Laneve, U. Montanari. Revised version of the paper in Mathematical Foundations of Computer Science, MFCS'92, LNCS 629.