Last update: Thu Jun 20 02:00:37 MDT 2019
@Article{Haynes:1987:ATP,
author = "Christopher T. Haynes and Daniel P. Friedman",
title = "Abstracting Timed Preemption with Engines",
journal = j-COMP-LANGS,
volume = "12",
number = "2",
pages = "109--121",
month = "????",
year = "1987",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliationaddress = "Indiana Univ, Bloomington, IN, USA",
classcodes = "C6115 (Programming support); C6120 (File
organisation)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN,
USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "abstracting timed preemption; bounded computation;
computer metatheory; computer programming languages;
data structures; engine nesting; engines; hiaton
streams; hiatons; preemption; process abstraction;
programming language abstraction; software tools;
Theory; time-sharing; timed",
treatment = "P Practical",
}