topic.hardware_model_abstraction.bib

@comment{{This file has been generated by bib2bib 1.96}}
@comment{{Command line: /usr/bin/bib2bib -c topic:"hardware_model_abstraction" -ob topic.hardware_model_abstraction.bib sewellbib2.bib}}
@inproceedings{Sew96b,
  optnote = {Sew96-brief},
  author = {Peter Sewell},
  title = {Design Rules and Abstractions (from branching and
		  real time)},
  conf = {DCC96},
  booktitle = {Proceedings of the 
3rd Workshop on Designing Correct Circuits
		  (B{\aa}stad, Sweden)},
  optcrossref = {},
  optkey = {},
  editor = {S. Singh and M. Sheeran},
  optvolume = {},
  optnumber = {},
  series = {Electronic Workshops in Computing},
  year = {1996},
  optorganization = {},
  publisher = {Springer-Verlag},
  optaddress = {},
  month = sep,
  optpages = {},
  note = {ISBN 3--540--76102--0. The links are to an extended version},
  optannote = {},
  pdf = {http://www.cl.cam.ac.uk/users/pes20/ab.pdf},
  ps = {http://www.cl.cam.ac.uk/users/pes20/ab.ps},
  abstract = {Three simple models of synchronous hardware are given; using linear discrete, branching discrete and branching real time. A simple notion of abstraction is introduced, motivated by the need to ultimately view such models as scientific theories that make empirical predictions. It makes the significance of design rules explicit.

Two abstractions from the branching discrete to the linear discrete model are given. They shed some light on the roles of consistency, deadlock and determinacy. The stronger of the two depends on a notion of dynamic type for processes which ensures deadlock freedom.

A reasonably strong abstraction from the branching real to the branching discrete model is given. This depends on a finer notion of type which is a reasonably physically plausible formalisation of the timing properties of certain real components.},
  topic = {hardware_model_abstraction}
}