• People
• Events
• Research

LFCS reports by Author: C

Castellani, I.

• Bisimulations for Concurrency
  I. Castellani
  LFCS report ECS-LFCS-88-51 (also published as CST-51-88)
  

Cenciarelli, Pietro

• Computational applications of calculi based on monads
  Pietro Cenciarelli
  LFCS report ECS-LFCS-96-346
  

Chen, Liang

• A Timed Calculus of Communicating Systems
  Liang Chen, Stuart Anderson and Faron Moller
  LFCS report ECS-LFCS-90-127
  
• An Interleaving Model for Real-Time Systems
  Chen Liang
  LFCS report ECS-LFCS-91-184
  
• Decidability and Completeness in Real-Time Processes
  Chen Liang
  LFCS report ECS-LFCS-91-185
  
• Timed Processes: Models, Axioms and Decidability
  Liang Chen
  LFCS report ECS-LFCS-93-271 (also published as CST-101-93)
  

Christensen, Søren

• Bisimulation Equivalence is Decidable for all Context-Free Processes
  Soren Christensen, Hans Hüttel, Colin Stirling
  LFCS report ECS-LFCS-92-218
  
• Decomposability, Decidability and Axiomatisability for Bisimulation Equivalence on Basic Parallel Processes
  S Christensen, Y Hirshfield and F Moller
  LFCS report ECS-LFCS-92-244
  
• Decidability and Decomposition in Process Algebras
  Soren Christensen
  LFCS report ECS-LFCS-93-278 (also published as CST-105-93)
  

Juliusz Chroboczek

• Game Semantics and Subtyping
  Juliusz Chroboczek
  

Clark, Graham

• The Verification of Asynchronous Circuits using CCS
  Graham Clark and George Taylor
  LFCS report ECS-LFCS-97-369
  
• Techniques for the Construction and Analysis of Algebraic Performance Models
  Graham Clark
  

Cleaveland, Rance

• The Concurrency Workbench: A Semantics-based Verification Tool for Finite-State Systems
  R. Cleaveland, J. Parrow and B. Steffen
  LFCS report ECS-LFCS-89-83
  

Collins, Graham

• Supporting Formal Reasoning about Standard ML
  Graham Collins and Stephen Gilmore
  LFCS report ECS-LFCS-94-310
  

Compagnoni, Adriana B

• Multiple Inheritance via Intersection Types
  Adriana B Compagnoni and Benjamin C Pierce
  LFCS report ECS-LFCS-93-275
  
• Subtyping in F-omega-Meet is decidable
  Adriana B Compagnoni
  LFCS report ECS-LFCS-94-281
  
• Typed Operational Semantics for Higher Order Subtyping
  Adriana Compagnoni and Healfdene Goguen
  LFCS report ECS-LFCS-97-361
  
• Subject Reduction and Minimal Types for Higher Order Subtyping
  Adriana Compagnoni
  LFCS report ECS-LFCS-97-363
  
• Decidable Higher Order Subtyping
  Adriana Compagnoni
  LFCS report ECS-LFCS-97-365
  
• Subtyping Dependent Types
  David Aspinall and Adriana Compagnoni
  LFCS report ECS-LFCS-97-370