LFCS reports by Author: S

Sangiorgi, Davide

• An Improved Systolic Array for String Correction
  C Lengauer and D Sangiorgi
  LFCS report ECS-LFCS-91-153
  
• Classes of Systolic Y-Tree Automata and a Comparison with Systolic trellis Automata
  Sangiorgi, Fachini and Schettina
  LFCS report ECS-LFCS-91-166
  
• The Lazy Lambda Calculus in a Concurrency Scenario
  D Sangiorgi
  LFCS report ECS-LFCS-91-189
  
• Algebraic Theories for Name-Passing Calculi
  Joachim Parrow and Davide Sangiorgi
  LFCS report ECS-LFCS-93-262
  
• Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms
  Davide Sangiorgi
  LFCS report ECS-LFCS-93-266 (also published as CST-99-93)
  
• A Theory of Bisimulation for the pi-calculus
  Davide Sangiorgi
  LFCS report ECS-LFCS-93-270
  
• Locality and Non-interleaving Semantics in calculi for mobile processes
  Davide Sangiorgi
  LFCS report ECS-LFCS-94-282
  
• A fully abstract semantics for causality in the pi-calculus
  Michele Boreale and Davide Sangiorgi
  LFCS report ECS-LFCS-94-297
  
• On the Bisimulation Proof Method
  Davide Sangiorgi
  LFCS report ECS-LFCS-94-299
  

Sannella, Donald T

• Formal Specification of ML Programs
  D.Sannella
  LFCS report ECS-LFCS-86-15
  
• Extended ML: An institution-independent framework for formal program development
  D.Sannella and A.Tarlecki
  LFCS report ECS-LFCS-86-16
  
• Toward formal development of programs from algebraic specifications: implementations revisited
  D.Sannella and A.Tarlecki
  LFCS report ECS-LFCS-86-17
  
• Some thoughts on algebraic specification
  D.Sannella and A.Tarlecki
  LFCS report ECS-LFCS-86-21
  
• Fifth Workshop on Specification of Abstract Data Types
  D. Sannella
  LFCS report ECS-LFCS-87-41
  
• A Survey of Formal Software Development Methods
  D. Sannella
  LFCS report ECS-LFCS-88-56
  
• E.U. Postgraduate Exam Questions in Computation Theory
  D. Sannella
  LFCS report ECS-LFCS-88-64
  
• Towards formal development of ML programs, foundations and methodology
  Donald Sannella and Andrzej Tarlecki
  LFCS report ECS-LFCS-89-71
  
• Structure and Representation in LF
  Harper, Sannella and Tarlecki
  LFCS report ECS-LFCS-89-75
  
• Syntax, typechecking and Dynamic Semantics for Extended ML
  D. Sannella and F. da Silva
  LFCS report ECS-LFCS-89-101
  
• Formal program development in Extended ML for the working programmer
  D. Sannella
  LFCS report ECS-LFCS-89-102
  
• Structuring Specifications in-the-Large and in-the-Small: Higher-Order Functions, Dependent Types and Inheritance in SPECTRAL
  D. Sannella and B. Kreig-Bruckner
  LFCS report ECS-LFCS-91-135
  
• Extended ML: Past, present and future
  D. Sannella and A Tarlecki
  LFCS report ECS-LFCS-91-138
  
• A kernel specification formalism with higher-order parameterisation
  D. Sannella and A Tarlecki
  LFCS report ECS-LFCS-91-139
  
• Toward Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations
  D. Sannella and A Tarlecki
  LFCS report ECS-LFCS-92-204
  
• Toward formal development of programs from algebraic specifications: parameterisation revisited
  Donald Sannella, Stefan Sokolowski and Andrzej Tarlecki
  LFCS report ECS-LFCS-92-222
  
• Interfaces and Extended ML
  Stefan Kahrs, Donald Sannella and Andrzej Tarlecki
  LFCS report ECS-LFCS-94-283
  
• The Definition of Extended ML
  Stefan Kahrs, Donald Sannella, Andrzej Tarlecki
  LFCS report ECS-LFCS-94-300
  
• On behavioural abstraction and behavioural satisfaction in higher-order logic
  Martin Hofmann and Donald Sannella
  LFCS report ECS-LFCS-95-318
  
• The definition of Extended ML: a gentle introduction
  Stefan Kahrs, Donald Sannella and Andrzej Tarlecki
  LFCS report ECS-LFCS-95-322
  
• Pre-logical Relations
  Furio Honsell and Donald Sannella
  LFCS report ECS-LFCS-99-405
  
• Architectural Specifications in CASL
  Michel Bidoit, Donald Sannella and Andrzej Tarlecki
  LFCS report ECS-LFCS-99-407
  

Schettina, _

• Classes of Systolic Y-Tree Automata and a Comparison with Systolic trellis Automata
  Sangiorgi, Fachini and Schettina
  LFCS report ECS-LFCS-91-166
  

Schoett, Oliver

• Data Abstraction and the Correctness of Modular Programming
  O.Schoett
  LFCS report ECS-LFCS-86-19 (also published as CST-42-87)
  

Scott, Philip J

• On the pi-Calculus and Linear Logic
  G Bellin and P J Scott
  LFCS report ECS-LFCS-92-232
  

Sequeira, Dilip

• Implementing Proof by Pointing without a Structure Editor
  Yves Bertot, Thomas Kleymann-Schreiber and Dilip Sequeira
  LFCS report ECS-LFCS-97-368
  
• Type Inference with Bounded Quantification
  Dilip Sequeira
  LFCS report ECS-LFCS-98-403
  

Le Sergent, Thierry

• Balancing Load under Large and Fast Load Changes in Distributed Computing Systems
  Thierry Le Sergent and Bernard Berthomieu
  LFCS report ECS-LFCS-94-305
  
• Adaptive selection of protocols for strict coherency in distributed shared memory
  Thierry Le Sergent and David C J Matthews
  LFCS report ECS-LFCS-94-306
  
• LEMMA Interface Definition
  David C J Matthews and Thierry Le Sergent
  LFCS report ECS-LFCS-95-316
  
• LEMMA: A Distributed Shared Memory with Global and Local Garbage Collection
  David C J Matthews and Thierry Le Sergent
  LFCS report ECS-LFCS-95-325
  

Sewell, Peter Michael

• The Algebra of Finite State Processes
  Peter Michael Sewell
  LFCS report ECS-LFCS-95-328
  

da Silva, Fabio Q B

• Syntax, typechecking and Dynamic Semantics for Extended ML
  D. Sannella and F. da Silva
  LFCS report ECS-LFCS-89-101
  
• Towards a Formal Framework for Evaluation of Operational Semantics Specifications
  Fabio da Silva
  LFCS report ECS-LFCS-90-126
  
• Correctness Proofs of Compilers and Debuggers: an Overview of an Approach Based on Structural Operational Semantics
  Fabio Q B da Silva
  LFCS report ECS-LFCS-92-233
  
• Observational Equivaalence and Compiler Correctness
  Fabio Q B da Silva
  LFCS report ECS-LFCS-92-240
  
• Correctness Proofs of Compilers and Debuggers: an Approach Based on Structural Operational Semantics
  Fabio Q B da Silva
  LFCS report ECS-LFCS-92-241 (also published as CST-95-92)
  

Simpson, Alex K

• The Proof Theory and Semantics of Intuitionistic Modal Logic
  Alex K. Simpson
  LFCS report ECS-LFCS-94-308
  

Sinclair, Alistair

• Improved bounds for mixing rates of Markov chains and multicommodity flow
  Alistair Sinclair
  LFCS report ECS-LFCS-91-178
  

Sokolowski, Stefan

• Toward formal development of programs from algebraic specifications: parameterisation revisited
  Donald Sannella, Stefan Sokolowski and Andrzej Tarlecki
  LFCS report ECS-LFCS-92-222
  

Sorkin, Gregory B

• Simulated Annealing for Graph Bisection
  Mark Jerrum and Gregory Sorkin
  LFCS report ECS-LFCS-93-260
  

Steckler, Paul

• Correct Separate and Selective Closure Conversion
  Paul Steckler
  LFCS report ECS-LFCS-95-315
  
• Detecting Local Channels in Distributed Poly/ML
  Paul Steckler
  LFCS report ECS-LFCS-96-340
  

Steffen, Bernhard

• Characteristic Formulae for CCS with Divergence
  B. Steffen
  LFCS report ECS-LFCS-89-76
  
• Finite Constants: Characterizations of a new decidable set of constants
  B. Steffen and J. Knoop
  LFCS report ECS-LFCS-89-79
  
• Optimal Data Flow Analysis via Observational Equivalence
  Bernhard Steffen
  LFCS report ECS-LFCS-89-82
  
• 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
  
• Compositional Characterization of observable Program Properties
  B. Steffen, C.B. Jay, M. Mendler
  LFCS report ECS-LFCS-89-99
  
• Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
  Olaf Burkart and Bernhard Steffen
  LFCS report ECS-LFCS-97-355
  

Steffen, Martin

• Higher-Order Subtyping
  Martin Steffen and Benjamin Pierce
  LFCS report ECS-LFCS-94-280
  

Stirling, Colin P

• Comparing Linear and Branching Time Temporal Logics
  C. Stirling
  LFCS report ECS-LFCS-87-24
  
• Local Model Checking in the Modal Mu-Calculus
  C. Stirling and D. Walker
  LFCS report ECS-LFCS-89-78
  
• Local Model Checking for Infinite State Spaces
  Julian Bradfield and Colin Stirling
  LFCS report ECS-LFCS-90-115
  
• Actions speak louder than words: Proving Bisimilarity for Context-free Processes
  H Huttel and C Stirling
  LFCS report ECS-LFCS-91-145
  
• Modal and Temporal Logics
  Colin Stirling
  LFCS report ECS-LFCS-91-157
  
• Bisimulation Equivalence is Decidable for all Context-Free Processes
  Soren Christensen, Hans Hüttel, Colin Stirling
  LFCS report ECS-LFCS-92-218
  
• Modal and Temporal Logics for Processes
  Colin Stirling
  LFCS report ECS-LFCS-92-221
  
• Decidability of Bisimulation Equivalence for Normed Pushdown Processes
  Colin Stirling
  LFCS report ECS-LFCS-97-352
  
• Diluting ACID
  Tim Kempster, Colin Stirling and Peter Thanisch
  LFCS report ECS-LFCS-99-404
  
• Decidability of DPDA equivalence
  Colin Stirling
  LFCS report ECS-LFCS-99-411
  

Stríbrná, Jitka

• Decidability and complexity of equivalences for simple process algebras
  Jitka Stríbrná
  LFCS report ECS-LFCS-99-408
  

Stroup, Terry

• Newtonian Arbiters Cannot be Proven Correct
  Michael Mendler and Terry Stroup
  LFCS report ECS-LFCS-92-252