CSR-2-77: Concurrent processes and their syntax
CSR-5-77: Flowgraphs and flow algebras
CSR-7-77: Probabilistic nondeterminism
CSR-9-77: A theory of type polymorphism in programming
CSR-11-77: Edinburgh LCF.
CSR-13-77: Graph theoretic arguments in low-level complexity
CSR-14-77: The complexity of computing the permanent
CSR-16-77: A metalanguage for interactive proof in LCF.
CSR-17-77: Fast probabilistic algorithms for Hamiltonian circuits and matchings
CSR-20-78: Augmented transition network grammars and semantic processing
CSR-25-78: Algebras for communicating systems
CSR-35-78: High level proof in LCF.
CSR-37-79: Probabilistic CPO's for nondeterminism
CSR-38-79: Negative results on counting
CSR-39-79: Negation can be exponentially powerful
CSR-40-79: Completeness classes in algebra
CSR-41-79: LCF: a way of doing proofs with a machine
CSR-43-79: Database systems
CSR-47-79: Petri nets, event structures and domains. Part 1.
CSR-49-79: LEGOS user reference manual
CSR-50-80: An experiment with "Edinburgh LCF.".
CSR-54-80: Universality considerations in VLSI circuits
CSR-61-80: Theory of FP systems in Edinburgh LCF.
CSR-62-80: Hope: an experimental applicative language
CSR-63-80: A fast parallel algorithm for routing in permutation networks
CSR-64-80: Reducibility by algebraic projections
CSR-65-80: The semantics of clear, a specification language
CSR-69-80: On observing nondeterminism and concurrency
CSR-74-80: The Edwin user's guide
CSR-76-81: The equivalence of two semantic definitions: a case study in LCF.
CSR-78-81: Call-by-need = call-by-value + conditional
CSR-79-81: A new semantics for Clear
CSR-80-81: S-ALGOL: reference manual
CSR-83-81: Nondeterministic partial logic: isotonic and guarded truth-functions
CSR-86-81: Inductive inference in reflexive domains
CSR-87-81: An LCF-system for automatic creation of theories for 1-constructable data types
CSR-89-81: GOTOs: a study in the algebraic specification of programming languages
CSR-90-81: The new Edinburgh persistent algorithmic language
CSR-92-81: On the non-sequential behaviour of systems possessing a generalised free choice property
CSR-94-81: PS-algol: an Algol with a persistent heap
CSR-95-81: Size bounds for superconcentrators
CSR-96-81: On the Blum Sakoda 7 pebble searching algorithm
CSR-97-82: A complexity theory based on boolean algebra
CSR-98-82: Countable nondeterminism and random assignment
CSR-99-82: An operational semantics of tasking and exception handling in ADA.
CSR-101-82: Algebras, theories and freeness: an introduction for computer scientists
CSR-102-82: The category theoretic solution of recursive domain equations
CSR-104-82: Calculi for synchrony and asynchrony
CSR-105-82: Future branching time logics and fairness
CSR-109-82: Algorithms for a persistent heap
CSR-110-82: CMS - a chunk management system
CSR-111-82: A complete inference system for a class of regular behaviours
CSR-112-82: Syntactic type checking using Scott retraction maps
CSR-114-82: An operational semantics for CSP.
CSR-115-82: Two dimensional syntax for functional languages
CSR-116-82: A finite delay operator in synchronous CCS.
CSR-118-82: Intensional analysis of functions and types
CSR-119-82: Concurrency, correctness, proof and undecidability in SDL like systems
CSR-120-82: Non sequential behaviour: 1.
CSR-121-82: Families of fixed degree graphs for processor interconnection
CSR-122-82: CIRCAL: a calculus for circuit description
CSR-123-82: Testing equivalences for processes
CSR-124-82: Axiomatising finite delay operators
CSR-125-82: Synchronous and asynchronous experiments of processes
CSR-126-83: Power domains and predicate transformers: a topological view
CSR-127-83: The correctness of a simple Silicon computer
CSR-128-83: Complete modal theories for verifying communicating agents behaviour in recursive equations programs
CSR-129-83: Structured theories in LCF.
CSR-130-83: Specification and proof of a regular language recogniser in synchronous CCS.
CSR-131-83: A kernel language for algebraic specification and implementation
CSR-132-83: A proof theoretic characterization of observational equivalence
CSR-133-83: Algebraic laws for nondeterminism and concurrency
CSR-134-83: Counting paths: nondeterminism as linear algebra
CSR-135-83: A model for nondeterministic machines
CSR-136-83: A CCS specification of the OSI network service
CSR-137-83: A fair calculus of communicating systems
CSR-138-83: A formal basis for the analysis of circuit timing
CSR-139-83: The complexity of finding minimum length generator sequences
CSR-140-83: A note on tactics in LCF.
CSR-141-83: A programming notation for tactical reasoning
CSR-142-83: Natural deduction theorem proving in set theory
CSR-143-83: Detecting global variables in denotational specifications
CSR-146-83: An LCF proof of soundness of Hoare's logic - a paper without a happy ending
CSR-148-83: A language of specified programs
CSR-149-83: Free constructions in algebraic institutions
CSR-152-83: A LISP based Circal environment
CSR-153-83: Modelling finite delay operators
CSR-154-83: Two complete axiom systems for a theory of communicating sequential processes
CSR-155-83: A theory of program modules, their specification and implementation (extended abstract)
CSR-156-83: The power of the future perfect in program logics
CSR-157-83: A proposal for standard ML.
CSR-158-84: Scale: a language for VLSI design
CSR-159-84: A case study of the F.I.R.S.T. silicon compiler
CSR-160-84: Completeness of proof systems for equational specifications
CSR-161-84: A syntax directed approach for implementing the rendezvous mechanism in Ada.
CSR-162-84: Proving systolic systems correct
CSR-163-84: A sticks front end for scale
CSR-164-84: Towards verifiably correct VLSI design
CSR-165-84: Abstract algebraic institutions which strongly admit initial semantics
CSR-166-84: Partitioning programmable logic arrays
CSR-168-84: The standard ML core language
CSR-169-84: A metric characterization of fair computations in CCS.
CSR-170-84: I.F.: an Idiomatic Floorplanner
CSR-171-84: An algebraic theory of fair asynchronous communication processes
CSR-172-84: On observational equivalence and algebraic specification
CSR-173-84: Quasi-varieties in abstract algebraic institutions
CSR-174-84: Simulation and verification: related techniques for hardware analysis
CSR-175-84: ECCE: Edinburgh Compatible Context Editor. Video version
CSR-176-84: Recursively defined domains and their induction principles
CSR-177-84: On proving limiting completeness
CSR-178-84: Specification and proof of a simple fault tolerant system in CCS.
CSR-179-84: Inferring surface shape by specular stereo
CSR-167-85: Weak and strong fairness in CCS.
CSR-181-85: An investigation into stretchable cells for scale
CSR-184-85: Specifications in an arbitrary institution
CSR-185-85: Behavioral correctness of data representations
CSR-186-85: Using weak continuity constraints - what they are, and how they do it.
CSR-187-85: Random generation of combinatorial structures from a uniform distribution
CSR-188-85: Raquel user manual
CSR-189-85: A compositional reformulation of Owicki-Gries's partial correctness for a parallel while language
CSR-190-85: Complementary partial orders and rectangle packing
CSR-191-85: The Edinburgh node of the Proteus distributed database system
CSR-192-85: The unification of terms: a category-theoretic algorithm
CSR-193-85: Modal logics for communicating systems
CSR-194-85: IE reference manual
CSR-196-85: LAYOUT formatting language reference manual
CSR-197-86: Weak continuity constraints in computer vision
CSR-198-86: Hardware description languages: some recent developments
CSR-199-86: The role of behaviour in VLSI design languages
CSR-200-86: Parallel parsing on an array of processors
CSR-201-86: OC: a portable occam compiler first pass
CSR-202-86: Markov's principle, isols, and Dedekind finite sets
CSR-203-86: Constructive validity is nonarithmetic
CSR-204-86: Graphical display of a concurrent device simulation using CIRCAL
CSR-205-86: On the geometric information obtainable from simultaneous observation of stereo contour and shading
CSR-206-86: SILVER -- the language and its implementation
CSR-207-86: A silicon pre-compiler
CSR-234-87: Configurable logic: an approach to the rapid implementation of ASIC's.
CSR-239-87: A data structure for systems of orthogonal, non-overlapping rectangles
CSR-241-87: Approximate counting, uniform generation and rapidly mixing Markov chains
CSR-245-87: Variations on a thesis: intuitionism and computability
CSR-246-87: The evolution of the Fred machine
CSR-247-87: On the design and performance of pipelined architectures
CSR-251-87: Behavioral abstraction and circuit verification using Circal
CSR-253-88: Improved methods for performance engineering. SIMMER II, Edinburgh report
CSR-254-88: A diagramming paradigm for hierarchical process oriented discrete event simulation
CSR-255-88: Chromatic idioms for automated VLSI floorplanning
CSR-263-88: XHDL: a development of CIRCAL, its graphical representation and simulation
CSR-267-88: An attempt at translating VHDL into CIRCAL
CSR-275-88: Approximating the permanent
CSR-277-88: An experimenter tool for an integrated modelling support environment - its role and design
CSR-281-88: Fast uniform generation of regular graphs
CSR-284-88: A modelling system for Posie
CSR-284-88: A short end of year report on the Posie project
CSR-284-88: A structural mapping for parallel digital logic simulation
CSR-284-88: Process migration in parallel computations
CSR-284-88: The Posie processor board design
CSR-284-88: The travelling salesman problem on MEIKO parallel computer
CSR-284-88: Virtual channels on the Meiko Computing Surface
CSR-287-89: Turing degrees and the word and conjugacy problems for finitely presented groups
CSR-293-89: Virtual objects: hiding the distribution in distributed systems
CSR-309-89: When is a graphical sequence stable?
CSR-319-89: Awareness Initiative in Object Oriented Computing: report of the second workshop, held in the James Clerk Maxwell Building, King's Buildings, Edinburgh, on the 14th of September, 1989
CSR-1-90: Polynomial-time approximation algorithms for the Ising model
CSR-2-90: On context streams and the boundedness of context flow graphs
CSR-3-90: The qsum plot
CSR-4-90: On context stream tuples and higher-order context flow graphs
CSR-7-90: Efficient algorithms for listing unlabeled graphs
CSR-8-90: Automating Polya theory: the computational complexity of the cycle index polynomial
CSR-9-90: The elusiveness of large cliques in a random graph
CSR-12-91: Simple translation-invariant concepts are hard to learn
CSR-13-91: A comparison of hardware description languages
CSR-15-91: The role of logic synthesis in high-level synthesis
CSR-16-91: Configurable array logic circuits for computing network error detection codes
CSR-17-91: A CCS-based investigation of deadlock in a multi-process electronic mail system
CSR-18-91: Graph reduction and pipelined parallel algorithms
CSR-19-92: Design of a bit-sliced network for a shared-memory multiprocessor system
CSR-20-92: A tool to enhance model exploitation
CSR-21-92: Final report on the DTI-funded awareness initiative in object oriented computing
CSR-22-92: Pointers and multi-dimensional arrays
CSR-23-92: A survey of PRAM simulation techniques
CSR-24-93: PEPA: Performance Enhanced Process Algebra
CSR-25-93: Parallel programming, list homomorphisms and the maximum segment sum problem
CSR-26-93: Proceedings of workshop on process algebra and performance modelling, University of Edinburgh, May 21, 1993
CSR-27-93: The performance of Barnes-Hut N-body simulation in the abstract
CSR-28-93: Models of parallelism
CSR-29-93: List homomorphic parallel algorithms for bracket matching
CSR-30-94: The performance of SCI memory hierarchies