• People
• Events
• Research

LFCS reports by Author: B

Barber, Andrew

• Dual Intuitionistic Linear Logic
  Andrew Barber
  LFCS report ECS-LFCS-96-347
  
• Linear Type Theories, Semantics and Action Calculi
  Andrew Barber
  LFCS report ECS-LFCS-97-371
  

Ballarini, Paolo

• Towards compositional CSL model-checking
  Paolo Ballarini
  

Beringer, Lennart

• Asynchronous Queue Machines with Explicit Forwarding
  Lennart Beringer
  

Barnett, M

• A Systolizing Compilation Scheme
  C. Lengauer and M. Barnett
  LFCS report ECS-LFCS-91-134
  
• Loop Parallelization and Unimodularity
  C. Lengauer and M. Barnett
  LFCS report ECS-LFCS-92-197
  

Bellin, Gianluigi

• Proof Nets for Multiplicative and Additive Linear Logic
  G Bellin
  LFCS report ECS-LFCS-91-161
  
• Mechanizing Proof Theory: Resource-Aware Logics and Proof-Transformations to extract implicit information
  G. Bellin
  LFCS report ECS-LFCS-91-165 (also published as CST-80-91)
  
• A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementations
  G Bellin and J Ketonen
  LFCS report ECS-LFCS-91-167
  
• On the pi-Calculus and Linear Logic
  G Bellin and P J Scott
  LFCS report ECS-LFCS-92-232
  

Berry, Dave

• The Edinburgh SML Library
  Dave Berry
  LFCS report ECS-LFCS-91-148
  
• Generating Program Animators from Programming Language Semantics
  D. Berry
  LFCS report ECS-LFCS-91-163 (also published as CST-79-91)
  

Berthomieu, Bernard

• Balancing Load under Large and Fast Load Changes in Distributed Computing Systems
  Thierry Le Sergent and Bernard Berthomieu
  LFCS report ECS-LFCS-94-305
  

Bertot, Yves

• Implementing Proof by Pointing without a Structure Editor
  Yves Bertot, Thomas Kleymann-Schreiber and Dilip Sequeira
  LFCS report ECS-LFCS-97-368
  

Bidoit, Michel

• Architectural Specifications in CASL
  Michel Bidoit, Donald Sannella and Andrzej Tarlecki
  LFCS report ECS-LFCS-99-407
  

Boreale, Michele

• A fully abstract semantics for causality in the pi-calculus
  Michele Boreale and Davide Sangiorgi
  LFCS report ECS-LFCS-94-297
  

Bradfield, Julian C

• Local Model Checking for Infinite State Spaces
  Julian Bradfield and Colin Stirling
  LFCS report ECS-LFCS-90-115
  
• Verifying Temporal Properties of Systems with Applications to Petri Nets
  Julian C Bradfield
  LFCS report ECS-LFCS-91-172 (also published as CST-83-91)
  
• A Proof Assistant for Symbolic Model-Checking
  J C Bradfield
  LFCS report ECS-LFCS-92-199
  
• An effective tableau system for the linear time mu-calculus
  Julian Bradfield, Javier Esparza and Angelika Mader
  LFCS report ECS-LFCS-95-337
  
• On the expressivity of the modal mu-calculus
  Julian Bradfield
  LFCS report ECS-LFCS-95-338
  
• The modal mu-calculus alternation hierarchy is strict
  J.C. Bradfield
  LFCS report ECS-LFCS-97-367
  
• Simplifying the modal mu-calculus alternation hierarchy
  Julian C. Bradfield
  LFCS report ECS-LFCS-98-385
  

Brown, Carolyn

• Relating Petri Nets to Formulae of Linear Logic
  Carolyn Brown
  LFCS report ECS-LFCS-89-87
  
• Petri Nets as Quantales
  Carolyn Brown
  LFCS report ECS-LFCS-89-96
  
• Linear Logic and Petri Nets: Categories, Algebra and Proof
  Carolyn Brown
  LFCS report ECS-LFCS-91-129 (also published as CST-71-91)
  

Bruns, Glenn

• The Formalization and Analysis of a Commmunications Protocol
  G. Bruns and S. Anderson
  LFCS report ECS-LFCS-91-137
  
• A Language for value-passing CCS
  Glenn Bruns
  LFCS report ECS-LFCS-91-175
  
• A Case Study in Safety-Critical Design
  Glenn Bruns
  LFCS report ECS-LFCS-92-239
  
• Applying Process Refinement to a Safety-Relevant System
  Glenn Bruns
  LFCS report ECS-LFCS-94-287
  
• Trapping Mutual Exclusion in the Box Calculus
  Javier Esparza and Glenn Bruns
  LFCS report ECS-LFCS-94-295
  
• Process Abstraction in the Verification of Temporal Properties
  Glenn R. Bruns
  LFCS report ECS-LFCS-98-380
  

Bubley, Russ

• A New Approach to Polynomial-time Generation of Random Points in Convex Bodies
  Russ Bubley, Martin Dyer and Mark Jerrum
  LFCS report ECS-LFCS-96-343
  

Burkart, Olaf

• Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
  Olaf Burkart and Bernhard Steffen
  LFCS report ECS-LFCS-97-355
  

Burstall, Rod M

• Computing with Categories
  R.Burstall and D.Rydeheard
  LFCS report ECS-LFCS-86-9
  
• A Study in the Foundations of Programming Methodology: Specifications, Institutions, Charters and Parchments
  R.Burstall and J.Goguen
  LFCS report ECS-LFCS-86-10
  
• Research in Interactive Theorem Proving at Edinburgh University
  R.Burstall
  LFCS report ECS-LFCS-86-12
  
• Inductively Defined Functions in Functional Programming Languages
  R. Burstall
  LFCS report ECS-LFCS-87-25
  
• Some Fundamental Algebraic Tools for the Semantics of Computation - Part III: Indexed Categories
  A Tarlecki, R M Burstall and J A Goguen
  LFCS report ECS-LFCS-88-60
  
• A Natural Deduction treatment of Operational Semantics
  R Burstall and F. Honsell
  LFCS report ECS-LFCS-88-69
  
• Some Fundamental Algebraic Tools for the Semantics of Computation. Part 3. Indexed Categories
  R. Burstall, J. Goguen and A. Tarlecki
  LFCS report ECS-LFCS-89-90
  
• INSTITUTIONS: Abstract Model Theory for Specification and Programming
  R. Burstall and J. Goguen
  LFCS report ECS-LFCS-90-106
  
• Computer Assisted Proof for Mathematics: an Introduction using the LEGO Proof System
  R. Burstall
  LFCS report ECS-LFCS-91-132
  
• Deliverables: an approach to program development in the Calculus of Constructions
  Rod Burstall and James McKinna
  LFCS report ECS-LFCS-91-133
  
• A Set-theoretic Setting for Structuring Theories in Proof Development
  Z. Luo and R. Burstall
  LFCS report ECS-LFCS-92-206
  
• Deliverables: a categorical approach to program development in type theory
  Rod Burstall and James McKinna
  LFCS report ECS-LFCS-92-242
  
• Hiding and Behaviour: An Institutional Approach
  Rod Burstall and Razvan Diaconescu
  LFCS report ECS-LFCS-92-253