Advertisement

Designing Correct Circuits

Workshop jointly organised by the Universities of Oxford and Glasgow, 26–28 September 1990, Oxford

  • Geraint Jones
  • Mary Sheeran

Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Jeffrey J. Joyce
    Pages 68-91
  3. John Hughes
    Pages 92-98
  4. Venkatesh Akella, Ganesh Gopalakrishnan
    Pages 99-119
  5. Mark B. Josephs, Jan Tijmen Udding
    Pages 132-152
  6. Mark Aagaard, Miriam Leeser
    Pages 171-195
  7. Carlos Delgado Kloos, Walter Dosch
    Pages 212-230
  8. Paolo Camurati, Tiziana Margaria, Paolo Prinetto
    Pages 253-270
  9. Lars Rossen
    Pages 297-312
  10. Ghislaine Thuau, Daniel Pilaud
    Pages 313-331
  11. Wayne Luk
    Pages 332-354
  12. Back Matter
    Pages 355-355

About these proceedings

Introduction

These proceedings contain the papers presented at a workshop on Designing Correct Circuits, jointly organised by the Universities of Oxford and Glasgow, and held in Oxford on 26-28 September 1990. There is a growing interest in the application to hardware design of the techniques of software engineering. As the complexity of hardware systems grows, and as the cost both in money and time of making design errors becomes more apparent, so there is an eagerness to build on the success of mathematical techniques in program develop­ ment. The harsher constraints on hardware designers mean both that there is a greater need for good abstractions and rigorous assurances of the trustworthyness of designs, and also that there is greater reason to expect that these benefits can be realised. The papers presented at this workshop consider the application of mathematics to hardware design at several different levels of abstraction. At the lowest level of this spectrum, Zhou and Hoare show how to describe and reason about synchronous switching circuits using UNilY, a formalism that was developed for reasoning about parallel programs. Aagaard and Leeser use standard mathematical tech­ niques to prove correct their implementation of an algorithm for Boolean simplification. The circuits generated by their formal synthesis system are thus correct by construction. Thuau and Pilaud show how the declarative language LUSTRE, which was designed for program­ ming real-time systems, can be used to specify synchronous circuits.

Keywords

Digital systems Formal methods Hardware Mathematica Specification driven design algebra algorithms complexity formal method formal verification mathematics parallelism process algebra processor verification

Editors and affiliations

  • Geraint Jones
    • 1
  • Mary Sheeran
    • 2
  1. 1.Oxford University Computing LaboratoryOxfordEngland
  2. 2.Department of Computing ScienceUniversity of GlasgowGlasgowScotland

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4471-3544-9
  • Copyright Information Springer-Verlag London 1991
  • Publisher Name Springer, London
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-19659-4
  • Online ISBN 978-1-4471-3544-9
  • Series Print ISSN 1431-1682
  • Buy this book on publisher's site