%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "3.37",
%%% date = "28 November 2007",
%%% time = "12:06:06 MST",
%%% filename = "sigplan1990.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "18513 71103 306990 3005481",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography, BibTeX, programming languages,
%%% SIGPLAN",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a bibliography of ACM SIGPLAN
%%% Notices, covering (incompletely) 1990--1999.
%%%
%%% The initial draft was extracted from the ACM
%%% Computing Archive CD ROM for the 1980s, with
%%% manual corrections and additions. Major
%%% additions were obtained from the huge
%%% Computer Science bibliography archive on
%%% ftp.ira.uka.de, in late 1995, from the OCLC
%%% Contents1st database, and in spring 1998,
%%% from the IEEE INSPEC database.
%%%
%%% There are World Wide Web sites for the
%%% journal at
%%%
%%% http://www.acm.org/sigplan/
%%%
%%% and
%%%
%%% http://www.rowan.edu/sigplan/
%%%
%%% and coverage of about a dozen volumes can be found at
%%%
%%% http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/index.html
%%%
%%% Several conference proceedings are published
%%% as volumes of SIGPLAN Notices. Many of them
%%% can also be found via the ACM proceedings Web
%%% sites:
%%%
%%% http://www.acm.org/pubs/contents/proceedings/
%%% http://www.acm.org/pubs/contents/proceedings/asplos/
%%% http://www.acm.org/pubs/contents/proceedings/plan/
%%% http://www.acm.org/pubs/contents/proceedings/pldi/
%%% http://www.acm.org/pubs/contents/proceedings/pldi/
%%%
%%% At version 3.37, the year coverage looks
%%% like this:
%%%
%%% 1980 ( 3) 1987 ( 0) 1994 ( 255)
%%% 1981 ( 0) 1988 ( 0) 1995 ( 299)
%%% 1982 ( 1) 1989 ( 0) 1996 ( 301)
%%% 1983 ( 0) 1990 ( 194) 1997 ( 340)
%%% 1984 ( 0) 1991 ( 285) 1998 ( 321)
%%% 1985 ( 0) 1992 ( 234) 1999 ( 321)
%%% 1986 ( 0) 1993 ( 343) 2000 ( 1)
%%%
%%% Article: 2444
%%% InProceedings: 403
%%% Proceedings: 51
%%%
%%% Total entries: 2898
%%%
%%% At version 1.17 [15-Dec-1995] of this
%%% bibliography, there were 1308 entries
%%% covering 28 years, an average of 47 per
%%% year. Examination of issues from recent
%%% years suggests an average of about 10 to 12
%%% articles per issue, or about 100 to 120
%%% yearly. The coverage by this bibliography
%%% is therefore only about 40%.
%%%
%%% At version 1.19 [31-Dec-1995], there were
%%% 1516 entries, representing about 45%
%%% coverage.
%%%
%%% At version 2.00 [25-Apr-1998], there were
%%% 3517 entries, which is about 95% coverage.
%%%
%%% At version 3.00 [03-May-1999], the original
%%% bibliography had reached more than 4000
%%% entries, and it was therefore split into
%%% decade-specific files, sigplan19xx.bib, where
%%% (xx = 60, 70, 80, 90).
%%%
%%% Besides missing entries for some articles,
%%% there are regrettably numerous issues that
%%% are missing entirely, including the following
%%% volume(number) pairs for these years:
%%%
%%% 1966: 1(all)
%%% 1967: 2(all)
%%% 1968: 3(all)
%%% 1969: 4(1) 4(2) 4(3) 4(4) 4(5) 4(6) 4(7) 4(8)
%%% 4(10) 4(11) 4(12)
%%% 1971: 6(1) 6(2) 6(3) 6(4) 6(5) 6(6) 6(7) 6(8)
%%% 6(10) 6(11) 6(12)
%%% 1972: 7(2) 7(3) 7(4) 7(5) 7(6) 7(7) 7(8) 7(9)
%%% 7(10) 7(11) 7(12)
%%% 1973: 8(1) 8(2) 8(3) 8(4) 8(5) 8(6) 8(7) 8(10)
%%% 8(11) 8(12)
%%% 1979: 14(2)
%%% 1981: 16(1)
%%% 1982: 17(4)
%%% 1987: 22(10)
%%% 1990: 25(3) 25(4) 25(7) 25(9) 25(11)
%%% 1991: 26(2) 26(3) 26(5) 26(9) 26(10) 26(11)
%%% 1992: 27(2) 27(4) 27(8)
%%%
%%% Some of the bibliography entries in this
%%% file contain abstracts. These are governed
%%% by the ACM Copyright Notice for ACM SIGPLAN
%%% Notices, which says:
%%%
%%% ``Permission to copy without fee all
%%% or part of this material is granted
%%% provided that the copies are not made
%%% or distributed for commercial
%%% advantage, the ACM copyright notice
%%% and the title of the publication and
%%% its date appear, and notice is given
%%% that copying is by permission of the
%%% Association for Computing Machinery.
%%% To copy otherwise, or to republish,
%%% requires a fee and/or specific
%%% permission.''
%%%
%%% Inasmuch as this bibliography, and its
%%% companion files in the master collection,
%%% is freely distributed without charge,
%%% inclusion of article abstracts clearly
%%% falls within the copyright permissions, and
%%% this author considers that ACM has given
%%% the required permission under the terms of
%%% the above Copyright Notice.
%%%
%%% BibTeX citation tags are uniformly chosen
%%% as name:year:abbrev, where name is the
%%% family name of the first author or editor,
%%% year is a 4-digit number, and abbrev is a
%%% 3-letter condensation of important title
%%% words. Citation tags were automatically
%%% generated by software developed for the
%%% BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order, using bibsort -byvolume.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{
"\input bibnames.sty " #
"\input path.sty " #
"\ifx \undefined \mathcal \def \mathcal #1{{\cal #1}}\fi" #
"\ifx \undefined \ocirc \def \ocirc #1{{\accent'27#1}}\fi" #
"\hyphenation{
Bie-li-ko-va
Common-Loops
DeMich-iel
Dober-kat
Er-vier
Fell-eisen
Gam-ma
Gem-Stone
Glan-ville
Gold-in
Goos-sens
Graph-Trace
Grim-shaw
Hoeks-ma
Hor-o-witz
Kam-i-ko
Kenn-e-dy
Kess-ler
Lisp-edit
Nich-o-las
Obern-dorf
Ohsen-doth
Para-sight
Par-log
Pega-Sys
Pren-tice
Ra-guid-eau
Rich-ard
Schee-vel
Schlotz-hauer
Schwartz-bach
Sieg-fried
SIG-OA
SIG-PLAN
SIG-SOFT
SMALL-TALK
Small-talk
Spring-er
Stroh-meier
Thing-Lab
Zhong-xiu
}"}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-js = "Joachim Schrod,
e-mail: \path|schrod@iti.informatik.th-darmstadt.de|"}
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-CACM = "Communications of the ACM"}
@String{j-OOPS-MESSENGER = "OOPS Messenger"}
@String{j-SIGMOD = "ACM SIG{\-}MOD Record"}
@String{j-SIGPLAN = "ACM SIG{\-}PLAN Notices"}
%%% ====================================================================
%%% Publisher abbreviations:
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY, USA"}
@String{pub-AW = "Ad{\-d}i{\-s}on-Wes{\-l}ey"}
@String{pub-AW:adr = "Reading, MA, USA"}
%%% ====================================================================
%%% Series abbreviations:
@String{ser-SIGPLAN = "ACM SIG{\-}PLAN Notices"}
%%% ====================================================================
%%% Cross-references from OOPS Messenger:
@Article{Stroustrup:1995:WCJ,
author = "B. Stroustrup",
title = "Why {C++} is not just an Object-Oriented Programming
Language",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "1--13",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Koenig:1995:ID,
author = "A. Koenig",
title = "Idiomatic Design",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "14--19",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Meyer:1995:ST,
author = "B. Meyer",
title = "Static Typing",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "20--29",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Goldberg:1995:WSW,
author = "A. Goldberg",
title = "What Should We Teach?",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "30--45",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Fraser:1995:ADA,
author = "Steven Fraser and Honna Segel and Jim Coplien and
Judith White",
title = "Application of Domain Analysis to Object-Oriented
Systems",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "46--49",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
URL = "http://www.acm.org/pubs/citations/proceedings/oops/260094/p46-fraser/",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Meadows:1995:BPT,
author = "Debbie Meadows and Charles R. Gardner",
title = "Building and Performance Tuning a Distributed
Reporting Application for an {OODBMS}",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "50--55",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Gardner:1995:POO,
author = "Charles R. Gardner",
title = "Performance of an {OODB} in an Online
{$7\times24\times365$} Manufacturing Operation",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "56--60",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Strom:1995:NTP,
author = "Stephen W. Strom and William F. Rich and Matthew T.
Verona",
title = "The {Navigation Toolkit Project} Revisited",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "61--66",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Marney:1995:UOM,
author = "Steven Marney and Mamdouh Ibrahim",
title = "Using Objects to Manage In-memory Data Intensive
Expert Systems",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "67--71",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Burgett:1995:AOS,
author = "Jeff L. Burgett and Sheryl J. Adam",
title = "Applying Object-Oriented Software Engineering Methods
to the Development of Call Center Software: Case
Study",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "72--76",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Radford:1995:IRE,
author = "J. Radford",
title = "Implementing a Real-Time, Embedded, Telecommunication
Switching System in {Smalltalk}",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "77--82",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Rosson:1995:ODS,
author = "M. B. Rosson",
title = "{OOPSLA '95 Doctoral Symposium}",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "83--84",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Fraser:1995:PCCa,
author = "S. Fraser",
title = "Patterns: Cult to Culture?",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "85--88",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Hill:1995:OPM,
author = "L. Hill",
title = "Object-Oriented Project Management",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "89--93",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Mancl:1995:TOA,
author = "D. Mancl",
title = "Tailoring {OO} Analysis and Design Methods",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "94--99",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Gangopadhyay:1995:FSD,
author = "Dipayan Gangopadhyay and Wolfgang Pree and Albert
Schappert",
title = "Framework-Centered Software Development",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "100--104",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Mili:1995:MO,
author = "Hafedh Y. Mili and Fran{\c{c}}ois Pachet and Ilham
Benyahia and Fred Eddy",
title = "Metamodeling in {OO}",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "105--110",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Kilov:1995:SIC,
author = "Haim Kilov and Bill Harvey and Kevin Tyson",
title = "Semantic Integration in Complex Systems: Collective
Behavior in Business Rules and Software Transactions",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "111--116",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Harrison:1995:SOS,
author = "William Harrison and Harold Ossher and Hafedh Mili",
title = "Subjectivity in Object-Oriented Systems",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "117--122",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Cummins:1995:OEF,
author = "Fred Cummins and Roman Cunis and Gail Harris",
title = "The Object Engine: Foundation for Next Generation
Architectures",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "123--127",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Kafura:1995:DPC,
author = "Dennis Kafura and Greg Lavender and Doug Schmidt",
title = "Design Patterns for Concurrent, Parallel, and
Distributed Object-Oriented Systems",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "128--131",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Meszaros:1995:PDM,
author = "G. Meszaros",
title = "Patterns for Decision Making in Architectural Design",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "132--137",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{deChampeaux:1995:OPM,
author = "Dennis {de Champeaux} and Simon Horner and Granville
Miller",
title = "{OO} Process and Metrics for Effort Estimation",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "138--142",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Yates:1995:TSA,
author = "B. Yates",
title = "Testing {Smalltalk} Applications",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "143--148",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Lieberherr:1995:AAS,
author = "K. Lieberherr",
title = "Adaptable and Adaptive Software",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "149--154",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Narayanaswamy:1995:OCF,
author = "K. Narayanaswamy and Adrian Blakey",
title = "Are Object-Oriented {CASE} Frameworks Ready for Prime
Time?",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "155--158",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Zorn:1995:ODB,
author = "Benjamin G. Zorn and Akmal B. Chaudhri",
title = "Object Database Behavior, Benchmarks, and
Performance",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "159--163",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Chung:1995:ORD,
author = "Jen-Yao Chung and Yi-Jing Lin and Daniel T. Chang",
title = "Objects and Relational Databases",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "164--169",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Sutherland:1995:BOD,
author = "J. Sutherland",
title = "Business Object Design and Implementation",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "170--175",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Jang:1995:LSO,
author = "Y. Jang",
title = "Legacy Systems and Object Technology",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "176--179",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Taivalsaari:1995:OLS,
author = "Antero Taivalsaari and Roland Trauter and Eduardo
Casais",
title = "Object-Oriented Legacy Systems and Software
Evolution",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "180--185",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Vaishnavi:1995:RCO,
author = "Vijay Vaishnavi and Timothy Korson",
title = "Role of a Corporate Object Technology Center",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "186--190",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Tiwary:1995:BLD,
author = "Ashutosh Tiwary and Rajendra K. Raj and Douglas S. Lea
and Christopher J. Bosch",
title = "Building Large Distributed Software Systems Using
Objects",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "191--195",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Brown:1995:DCL,
author = "G. Brown",
title = "Design and Construction of Large-scale Components",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "196--202",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Wilhelm:1995:ORS,
author = "Bob Wilhelm and John Gilbert and Mohamed Fayad",
title = "Object-Oriented Real-Time Systems",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "203--208",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Arora:1995:OTH,
author = "S. Arora",
title = "Object-Oriented Technology for Health Care and Medical
Information Systems",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "209--212",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
@Article{Laffra:1995:OTL,
author = "C. Laffra",
title = "{OO} Technology in Large Financial Institutions",
journal = j-OOPS-MESSENGER,
volume = "6",
number = "4",
pages = "213--217",
month = oct,
year = "1995",
CODEN = "OOMEEO",
ISSN = "1055-6400",
bibdate = "Fri Apr 30 12:33:10 MDT 1999",
acknowledgement = ack-nhfb,
keywords = "ACM; object-oriented programming systems; OOPSLA;
programming languages; SIGPLAN",
}
%%% ====================================================================
%%% Cross-references from SIGMOD:
@Article{Wong:1995:IRF,
author = "Limsoon Wong",
title = "An introduction to {Remy}'s fast polymorphic record
projection",
journal = j-SIGMOD,
volume = "24",
number = "3",
pages = "34--39",
month = sep,
year = "1995",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Apr 25 16:51:13 1998",
abstract = "Traditionally, a record projection is compiled when
all fields of the record are known in advance. The need
to know all fields in advance leads to very clumsy
programs, especially for querying external data
sources. D. Remy (Proc. ACM SIGPLAN Workshop on ML and
its Appls., pp. 12-16, 1992) presented, in programming
language context, a constant-time implementation of the
record projection operation that does not have such a
requirement. This paper introduces his technique and
suggests an improvement to his technique in the context
of database queries.",
acknowledgement = ack-nhfb,
affiliation = "Inst. of Syst. Sci. Lab., Singapore",
classification = "C4250 (Database theory)",
keywords = "Constant-time implementation; Database queries;
External data source querying; Fast polymorphic record
projection; ML; Programming language context; Record
projection compilation; Unknown fields",
thesaurus = "Database theory; Programming languages; Query
processing",
}
%%% ====================================================================
%%% Finally, SIGPLAN entries:
@Article{Cichelli:1980:MPH,
author = "R. J. Cichelli",
key = "Cichelli",
title = "Minimal Perfect Hash Functions Made Simple",
journal = j-CACM,
volume = "23",
number = "1",
pages = "17--19",
month = jan,
year = "1980",
CODEN = "CACMA2",
ISSN = "0001-0782",
bibdate = "Mon Apr 24 09:59:18 1995",
note = "See remarks in \cite{Jaeschke:1980:CMP}, and the
author's response in \cite{Cichelli:1980:CMP}. A simple
improvement giving dramatic speedups is described in
\cite{Trono:1995:CTS}.",
acknowledgement = ack-nhfb,
}
@Article{Cichelli:1980:CMP,
author = "R. J. Cichelli",
title = "On {Cichelli}'s Minimal Perfect Hash Functions
Method",
journal = j-CACM,
volume = "23",
number = "12",
pages = "728--729",
month = dec,
year = "1980",
CODEN = "CACMA2",
ISSN = "0001-0782",
bibdate = "Tue Jul 19 22:50:23 1994",
note = "This is the author's response to the comments in
\cite{Jaeschke:1980:CMP} about
\cite{Cichelli:1980:MPH}.",
acknowledgement = ack-nhfb,
}
@Article{Jaeschke:1980:CMP,
author = "G. Jaeschke and G. Osterburg",
title = "On {Cichelli}'s Minimal Perfect Hash Functions
Method",
journal = j-CACM,
volume = "23",
number = "12",
pages = "728--729",
month = dec,
year = "1980",
CODEN = "CACMA2",
ISSN = "0001-0782",
bibdate = "Tue Jul 19 22:51:08 1994",
note = "This letter to the editor contains comments on
\cite{Cichelli:1980:MPH}, together with a response from
R. J. Cichelli \cite{Cichelli:1980:CMP}.",
acknowledgement = ack-nhfb,
}
@Article{Cook:1982:LOM,
author = "Curtis R. Cook and R. R. Oldehoeft",
title = "A Letter Oriented Minimal Perfect Hashing Function",
journal = j-SIGPLAN,
volume = "17",
number = "9",
pages = "18--27",
month = sep,
year = "1982",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat Apr 25 11:46:37 MDT 1998",
note = "See \cite{Trono:1995:CTS} for significant speedup.",
acknowledgement = ack-nhfb,
classification = "C6130 (Data handling techniques)",
corpsource = "Computer Sci. Dept., Oregon State Univ., Corvallis,
OR, USA",
keywords = "algorithm; data handling; execution time; hash tables;
iteration; letter oriented; minimal perfect hashing
function; minimality requirement; partitioning data
sets; small static word sets",
treatment = "T Theoretical or Mathematical",
}
@Article{Caron:1990:BTD,
author = "J. M. Caron and P. A. Darnell",
title = "{Bugfind}: a tool for debugging optimizing compilers",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "17--22",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Srinivasan:1990:CDS,
author = "S. Srinivasan",
title = "Compiler design for sets in {Pascal}",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "23--24",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Boute:1990:HVT,
author = "R. T. Boute",
title = "A heretical view on type embedding",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "25--28",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wong:1990:TFV,
author = "L. Wong and B. C. Ooi",
title = "Treating failure as value",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "29--32",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Talia:1990:SCP,
author = "D. Talia",
title = "Survey and comparison of {PARLOG} and {Concurrent
Prolog}",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "33--42",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chiu:1990:GAU,
author = "P. P. K. Chiu and S. T. K. Fu",
title = "A generative approach to {Universal Cross Assembler}
design",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "43--51",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Avenarius:1990:FLP,
author = "Adrian Avenarius and Siegfried Oppermann",
title = "{\FWEB}: {A} Literate Programming System for {Fortran
8X}",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "52--58",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
abstract = "The new FWEB system applies the concept of literate
programming to the FORTRAN8X language. Its design and
implementation provided an opportunity to field-test
WEB's applicability and provoked some reflections on
its underlying concepts.",
acknowledgement = ack-nhfb,
affiliation = "Tech. Hochschule, Darmstadt, West Germany",
classification = "C6115 (Programming support); C6140D (High level
languages)",
keywords = "FORTRAN8X; FWEB; Literate programming system;
Programming tools; Structural documentation",
thesaurus = "FORTRAN; Software tools",
}
@Article{Payne:1990:PLC,
author = "M. Payne and C. Schaffert and B. Wichmann",
title = "Proposal for a language compatible arithmetic
standard",
journal = j-SIGPLAN,
volume = "25",
number = "1",
pages = "59--86",
month = jan,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:49 MST 2003",
bibsource = "http://portal.acm.org/",
abstract = "The proposal for an arithmetic standard has been
submitted to the American National Standard Institute
and the International Organization for Standardization.
The proposal covers both integer and floating point
arithmetic. The underlying goal is to expedite the
production of robust numerical software which is
portable among the diverse arithmetic implementations
currently in wide-spread use. The proposal requires
that a complying system provide error detection
capabilities beyond those currently required by many
language standards. The proposal requires that a
conforming system makes the values of certain
parameters known to users, although the method for
doing so is not specified. It also required a number of
useful operations, beyond those usually implemented. It
is acceptable to implement them by subroutine calls.",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp., Maynard, MA, USA",
classification = "C5230 (Digital arithmetic methods); C6140D (High
level languages)",
keywords = "American National Standard Institute; Error detection
capabilities; Floating point arithmetic; International
Organization for Standardization; Language compatible
arithmetic standard; Robust numerical software;
Subroutine calls",
thesaurus = "Digital arithmetic; High level languages; Standards",
}
@Article{Thomas:1990:BPS,
author = "Edward J. Thomas and Paul W. Oman",
title = "A Bibliography of Programming Style",
journal = j-SIGPLAN,
volume = "25",
number = "2",
pages = "7--16",
month = feb,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:50 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
annote = "An annotated bibliography of programming style",
keywords = "bibliography, design, programming, style",
}
@Article{Nordstrom:1990:TL,
author = "D. J. Nordstrom",
title = "Threading {Lisp}",
journal = j-SIGPLAN,
volume = "25",
number = "2",
pages = "17--24",
month = feb,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:50 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Radensky:1990:TII,
author = "A. Radensky",
title = "Toward integration of the imperative and logic
programming paradigms: {Horn-clause} programming in the
{Pascal} environment",
journal = j-SIGPLAN,
volume = "25",
number = "2",
pages = "25--34",
month = feb,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:50 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mehndiratta:1990:SME,
author = "B. Mehndiratta and P. S. Grover",
title = "Software metrics --- an experimental analysis",
journal = j-SIGPLAN,
volume = "25",
number = "2",
pages = "35--41",
month = feb,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:50 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dinning:1990:ECM,
author = "A. Dinning and E. Schonberg",
title = "An empirical comparison of monitoring algorithms for
access anomaly detection",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "1--10",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hseush:1990:MCP,
author = "W. Hseush and G. E. Kaiser",
title = "Modeling concurrency in parallel debugging",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "11--20",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Callahan:1990:AES,
author = "D. Callahan and K. Kennedy and J. Subhlok",
title = "Analysis of event synchronization in a parallel
programming tool",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "21--30",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Tick:1990:PTE,
author = "E. Tick and N. Ichiyoshi",
title = "Programming techniques for efficiently exploiting
parallelism in logic programming languages",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "31--39",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ambriola:1990:DDI,
author = "V. Ambriola and P. Ciancarini and M. Danelutto",
title = "Design and distributed implementation of the parallel
logic language shared {Prolog}",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "40--49",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Furuichi:1990:MLL,
author = "M. Furuichi and K. Taki and N. Ichiyoshi",
title = "A multi-level load balancing scheme for {OR}-parallel
exhaustive search programs on the multi-{PSI}",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "50--59",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Katseff:1990:EHV,
author = "H. P. Katseff and R. D. Gaglianello and B. S.
Robinson",
title = "The evolution of {HPC\slash VORX}",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "60--69",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Scott:1990:MMP,
author = "M. L. Scott and T. J. LeBlanc and B. D. Marsh",
title = "Multi-model parallel programming in psyche",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "70--78",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Li:1990:RTC,
author = "K. Li and J. F. Naughton and J. S. Plank",
title = "Real-time, concurrent checkpoint for parallel
programs",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "79--88",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nicol:1990:ASM,
author = "D. M. Nicol",
title = "Analysis of synchronization in massively parallel
discrete-event simulations",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "89--98",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ramkumar:1990:CKI,
author = "B. Ramkumar and L. V. Kale",
title = "A {Chare} kernel implementation of a parallel {Prolog}
compiler",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "99--108",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chang:1990:IBN,
author = "P. S. Chang and G. K. Egan",
title = "An implementation of a barotropic {Numerical Weather
Prediction} model in the functional language {SISAL}",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "109--117",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gupta:1990:ERC,
author = "R. Gupta",
title = "Employing register channels for the exploitation of
instruction level parallelism",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "118--127",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hieb:1990:CC,
author = "R. Hieb and R. Kent Dybvig",
title = "Continuations and concurrency",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "128--136",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Whitfield:1990:AOO,
author = "D. Whitfield and M. L. Soffa",
title = "An approach to ordering optimizing transformations",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "137--146",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Factor:1990:PTA,
author = "M. Factor",
title = "The process trellis architecture for real-time
monitors",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "147--155",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Harvey:1990:ETL,
author = "W. Harvey and D. Kalp and M. Tambe and D. McKeown and
A. Newell",
title = "The effectiveness of task-level parallelism for
high-level vision",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "156--167",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bennett:1990:MDS,
author = "J. K. Bennett and J. B. Carter and W. Zwaenepoel",
title = "{Munin}: distributed shared memory based on
type-specific memory coherence",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "168--176",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chien:1990:CACa,
author = "A. A. Chien and W. J. Dally",
title = "Concurrent aggregates {(CA)}",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "177--186",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Koelbel:1990:SSD,
author = "C. Koelbel and P. Mehrotra and J. Van Rosendale",
title = "Supporting shared data structures on distributed
memory architectures",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "177--186",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chien:1990:CACb,
author = "Andrew A. Chien and William J. Dally",
title = "Concurrent aggregates {(CA)}",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "187--196",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Herlihy:1990:MIH,
author = "M. Herlihy",
title = "A methodology for implementing highly concurrent data
structures",
journal = j-SIGPLAN,
volume = "25",
number = "3",
pages = "197--206",
month = mar,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:51 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bal:1990:OLD,
author = "Henri E. Bal",
title = "{Orca}: a language for distributed programming",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "17--24",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wells:1990:ISN,
author = "Mark B. Wells",
title = "Identifiers and static name abstraction",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "25--28",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Barnett:1990:PST,
author = "Michael P. Barnett",
title = "Primitive string transformations as reductions to
normal form",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "29--33",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Barnett:1990:IPC,
author = "Michael P. Barnett and Xu Rui",
title = "Infix to prefix conversion as a {PST} reduction",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "34--38",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jiang:1990:DES,
author = "Xinjie Jiang and Yongsen Xu",
title = "Diverse executable semantics definitions in {NUSL} and
an implementation of functional types",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "39--52",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Louden:1990:PCC,
author = "Kenneth Louden",
title = "{P}-code and compiler portability: experience with a
{Modula-2} optimizing compiler",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "53--59",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Horebeek:1990:CFS,
author = "Ivo Van Horebeek and Johan Lewi",
title = "Are constructive formal specifications less
abstract?",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "60--68",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sundaresan:1990:TNP,
author = "Neelakantan Sundaresan",
title = "Translation of nested {Pascal} routines to {C}",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "69--81",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dobler:1990:CNC,
author = "H. Dobler and K. Pirklbauer",
title = "Coco-2: a new compiler compiler",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "82--90",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kaiser:1990:GMM,
author = "Klaus Kaiser",
title = "Generating the minimal model in {Prolog}",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "91--94",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Keller:1990:GNN,
author = "Daniel Keller",
title = "A Guide to Natural Naming",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "95--102",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
annote = "A rationale for how to pick and structure names in a
program. Type names should be chosen first, and be made
short and simple. Procedure names should express the
action implied by the procedure by including an
imperative verb. Variables and function names should be
of the form ``adjective+type name''. Boolean function
names should state a fact that can be true or false",
keywords = "programming, design, style, naming",
}
@Article{Treadway:1990:USA,
author = "Peter L. Treadway",
title = "The use of sets as an application programming
technique",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "103--116",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Burshteyn:1990:MFG,
author = "Boris Burshteyn",
title = "On the modification of the formal grammar at parse
time",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "117--123",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{deChamplain:1990:SSE,
author = "Michel de Champlain",
title = "{Synapse}: a small and expressible object-based
real-time programming language",
journal = j-SIGPLAN,
volume = "25",
number = "5",
pages = "124--134",
month = may,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:52 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Giegerich:1990:SVC,
author = "Robert Giegerich",
title = "On the structure of verifiable code generator
specifications",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "1--8",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Fri Feb 14 18:40:11 MST 1997",
bibsource = "Compendex database",
abstract = "We propose an algebraic style of code generator
specification. Our specifications treat target machine
properties and related subtasks of code generation on a
very abstract, nonoperational level. Emphasis is on
separate description of different concerns, in order to
reduce complexity. On this level of abstraction,
desirable properties of a code generator can be
expressed in a formal way. For example, code generation
itself is naturally modelled by solving a certain set
of equations. We show how state-of-the-art techniques
in equational theorem proving can be employed to
ascertain the completeness and correctness of the
specified code generator.",
acknowledgement = ack-nhfb,
affiliation = "Univ Bielefeld",
affiliationaddress = "Bielefeld, West Ger",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "Code Generators; Computer Operating Systems ---
Program Compilers; Computer Programming Languages;
Design; Specification Languages",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
}
@Article{Wendt:1990:FCG,
author = "Alan L. Wendt",
title = "Fast code generation using automatically-generated
decision trees",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "9--15",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p9-wendt/",
abstract = "Several recent code generators [4,5,6,8] use DAG
rewriting rules to accomplish both code generation and
peephole optimization, and they compile these rules
into hard code to generate code quickly. The chop
system [6], for example, runs twice as fast as both pcc
and the GNU C compiler gcc on a Sun 3/50 system and
generates comparable code. These figures are for entire
compilers; the code generators themselves run about
seven times faster than comparable code generators.
This paper describes a new system, currently under
development, that further increases the speed of
automatically-generated retargetable code generation.
It offers two principal advantages over its
predecessors.",
acknowledgement = ack-nhfb,
affiliation = "Colorado State Univ",
affiliationaddress = "Fort Collins, CO, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Code Generation; Computer Operating
Systems --- Program Compilers; Computer Programming
Languages; Decision Trees; Design; performance;
theory",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Code generation. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Grammars and Other Rewriting Systems.
{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization.",
}
@Article{Pettis:1990:PGC,
author = "Karl Pettis and Robert C. Hansen",
title = "Profile guided code positioning",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "16--27",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p16-pettis/",
abstract = "This paper presents the results of our investigation
of code positioning techniques using execution profile
data as input into the compilation process. The primary
objective of the positioning is to reduce the overhead
of the instruction memory hierarchy. After initial
investigation in the literature, we decided to
implement two prototypes for the Hewlett-Packard
Precision Architecture (PA-RISC). The first, built on
top of the linker, positions code based on whole
procedures. This prototype has the ability to move
procedures into an order that is determined by a
`closest is best' strategy. The algorithms we
implemented are described through examples in this
paper. The performance improvements from our work are
also summarized in various tables and charts.",
acknowledgement = ack-nhfb,
affiliation = "Hewlett Packard Co, California Language Lab",
affiliationaddress = "Cupertino, CA, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Code Generation; Code Positioning;
Computer Operating Systems --- Program Compilers;
Computer Programming Languages; Design; measurement;
performance",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Graph algorithms. {\bf D.2.8} Software,
SOFTWARE ENGINEERING, Metrics, Performance measures.",
}
@Article{Santhanam:1990:RAA,
author = "Vatsa Santhanam and Daryl Odnert",
title = "Register allocation across procedure and module
boundaries",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "28--39",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p28-santhanam/",
abstract = "This paper describes a method for compiling programs
using interprocedural register allocation. A strategy
for handling programs built from multiple modules is
presented, as well as algorithms for global variable
promotion and register spill code motion. These
algorithms attempt to address some of the shortcomings
of previous interprocedural register allocation
strategies. Results are given for an implementation on
a single register file RISC-based architecture.",
acknowledgement = ack-nhfb,
affiliation = "Hewlett Packard Co, California Language Lab",
affiliationaddress = "Cupertino, CA, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer Operating Systems; Computer
Programming Languages --- Design; measurement;
performance; Register Allocation; Storage Allocation",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Compilers. {\bf C.1.1} Computer Systems
Organization, PROCESSOR ARCHITECTURES, Single Data
Stream Architectures, RISC. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Optimization. {\bf
D.1.m} Software, PROGRAMMING TECHNIQUES, Miscellaneous.
{\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics,
Performance measures.",
}
@Article{Nickerson:1990:GCR,
author = "Brian R. Nickerson",
title = "Graph coloring register allocation for processors with
multi-register operands",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "40--52",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p40-nickerson/",
abstract = "Though graph coloring algorithms have been shown to
work well when applied to register allocation problems,
the technique has not been generalized for processor
architectures in which some instructions refer to
individual operands that are comprised of multiple
registers. This paper presents a suitable
generalization.",
acknowledgement = ack-nhfb,
affiliation = "Intel Corp",
affiliationaddress = "Hillsboro, OR, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer Operating Systems; Computer
Programming Languages --- Design; design; Register
Allocation; Storage Allocation",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures. {\bf
C.5.3} Computer Systems Organization, COMPUTER SYSTEM
IMPLEMENTATION, Microcomputers, Intel 80960.",
}
@Article{Callahan:1990:IRA,
author = "David Callahan and Steve Carr and Ken Kennedy",
title = "Improving register allocation for subscripted
variables",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "53--65",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p53-callahan/",
abstract = "In this paper, we present a source-to-source
transformation, called scalar replacement, that finds
opportunities for reuse of subscripted variables and
replaces the references involved by references to
temporary scalar variables. The objective is to
increase the likelihood that these elements will be
assigned to registers by the coloring-based register
allocators found in most compilers. In addition, we
present transformations to improve the overall
effectiveness of scalar replacement and show how these
transformations can be applied in a variety of loop
nest types. Finally, we present experimental results
showing that these techniques are extremely effective
--- capable of achieving integer factor speedups over
code generated by good optimizing compilers of
conventional design.",
acknowledgement = ack-nhfb,
affiliation = "Tera Computer Co",
affiliationaddress = "Seattle, WA, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer Operating Systems; Computer
Programming Languages --- Design; design; languages;
performance; Register Allocation; Storage Allocation",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and
Techniques. {\bf D.3.2} Software, PROGRAMMING
LANGUAGES, Language Classifications, FORTRAN. {\bf
F.3.3} Theory of Computation, LOGICS AND MEANINGS OF
PROGRAMS, Studies of Program Constructs.",
}
@Article{Hieb:1990:RCP,
author = "Robert Hieb and R. Kent Dybvig and Carl Bruggeman",
title = "Representing control in the presence of first-class
continuations",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "66--77",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html;
http://portal.acm.org/; http://portal.acm.org/",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p66-hieb/",
abstract = "Languages such as Scheme and Smalltalk that provide
continuations as first-class data objects present a
challenge to efficient implementation. Allocating
activation records in a heap has proven unsatisfactory
because of increased frame linkage costs, increased
garbage collection overhead, and decreased locality of
reference. However, simply allocating activation
records on a stack and copying them when a continuation
is created results in unbounded copying overhead. This
paper describes a new approach based on stack
allocation that does not require the stack to be copied
when a continuation is created and that allows us to
place a small upper bound on the amount copied when a
continuation is reinstated. This new approach is faster
than the naive stack allocation approach, and it does
not suffer from the problems associated with unbounded
copying. For continuation-intensive programs, our
approach is at worst a constant factor slower than the
heap allocation approach, and for typical programs, it
is significantly faster. An important additional
benefit is that recovery from stack overflow is handled
gracefully and efficiently.",
acknowledgement = ack-nhfb,
affiliation = "Indiana Univ",
affiliationaddress = "Bloomington, IN, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer Operating Systems; Computer
Programming Languages --- Design; Data Processing ---
Data Structures; design; languages; performance;
Programming Language Scheme; Programming Language
Smalltalk; Storage Allocation",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage
Management, Allocation/deallocation strategies. {\bf
F.3.3} Theory of Computation, LOGICS AND MEANINGS OF
PROGRAMS, Studies of Program Constructs, Control
primitives. {\bf D.3.2} Software, PROGRAMMING
LANGUAGES, Language Classifications, SCHEME. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching.",
}
@Article{Kessler:1990:FBD,
author = "Peter B. Kessler",
title = "Fast breakpoints. Design and implementation",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "78--84",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p78-kessler/",
abstract = "We have designed and implemented a fast breakpoint
facility. Breakpoints are usually thought of as a
feature of an interactive debugger, in which case the
breakpoints need not be particularly fast. In our
environment breakpoints are often used for
non-interactive information gathering; for example,
procedure call count and statement execution count
profiling. When used non-interactively, breakpoints
should be as fast as possible, so as to perturb the
execution of the program as little as possible. Even in
interactive debuggers, a conditional breakpoint
facility would benefit from breakpoints that could
transfer to the evaluation of the condition rapidly,
and continue expeditiously if the condition were not
satisfied. Such conditional breakpoints could be used
to check assertions, etc. Program advising could also
make use of fast breakpoints. Examples of advising
include tracing, timing, and even animation, all of
which should be part of an advanced programming
environment.",
acknowledgement = ack-nhfb,
affiliation = "Xerox PARC",
affiliationaddress = "Palo Alto, CA, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "Computer Operating Systems; Computer Programming ---
Program Debugging; design; languages; performance;
Program Breakpoints; Program Processors; reliability",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
and Debugging, Debugging aids. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications, Cedar.
{\bf D.2.3} Software, SOFTWARE ENGINEERING, Coding
Tools and Techniques. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features,
Procedures, functions, and subroutines.",
}
@Article{Pugh:1990:TDR,
author = "William Pugh and Grant Weddell",
title = "Two-directional record layout for multiple
inheritance",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "85--91",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Pugh:1990:TRL,
author = "William Pugh and Grant Weddell",
title = "Two-directional record layout for multiple
inheritance",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "85--91",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p85-pugh/",
abstract = "Much recent work in polymorphic programming languages
allows subtyping and multiple inheritance for records.
In such systems, we would like to extract a field from
a record with the same efficiency as if we were not
making use of subtyping and multiple inheritance.
Methods currently used make field extraction 3-5 times
slower, which can produce a significant overall
performance slowdown. We describe a record layout
algorithm that allows us to assign a fixed offset to
each field name. This allows field extraction to done
just as quickly as in systems that do not provide
multiple inheritance. Assigning fixed offsets may
require us to leave gaps in some records (and waste
space). However, by placing fields at both positive and
negative offsets we can drastically reduce the amount
of wasted space. Finding an optimal layout is NP-hard,
so we propose and analyze heuristic algorithms for
producing good two-direction record layouts. In a trial
run, our algorithm produced a fixed layout for the
instance variables of the 563 flavors of a Lisp Flavors
system; this fixed layout only wastes 6\% of the total
space consumed by a collection of one instance of each
flavor.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Maryland",
affiliationaddress = "College Park, MD, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer Operating Systems; Computer
Programming --- Object Oriented Programming; design;
languages; Multiple Inheritance; performance;
Polymorphic Programming Languages; Program Compilers",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Studies of Program Constructs, Functional
constructs. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features,
Procedures, functions, and subroutines. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Graph algorithms.",
}
@Article{Clinger:1990:HRF,
author = "William D. Clinger",
title = "How to Read Floating Point Numbers Accurately",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "92--101",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISBN-13 = "978-0-89791-364-5",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/",
note = "See also output algorithms in
\cite{Knuth:1990:SPW,Steele:1990:HPF,Burger:1996:PFP,Abbott:1999:ASS,Steele:2004:RHP}.",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p92-clinger/",
abstract = "Consider the problem of converting decimal scientific
notation for a number into the best binary floating
point approximation to that number, for some fixed
precision. This problem cannot be solved using
arithmetic of any fixed precision. Hence the IEEE
Standard for Binary Floating-Point Arithmetic does not
require the result of such a conversion to be the best
approximation. This paper presents an efficient
algorithm that always finds the best approximation. The
algorithm uses a few extra bits of precision to compute
an IEEE-conforming approximation while testing an
intermediate result to determine whether the
approximation could be other than the best. If the
approximation might not be the best, then the best
approximation is determined by a few simple operations
on multiple-precision integers, where the precision is
determined by the input. When using 64 bits of
precision to compute IEEE double precision results, the
algorithm avoids higher-precision arithmetic over 99\%
of the time.",
acknowledgement = ack-nhfb # " and " # ack-nj,
affiliation = "Oregon Univ., Eugene, OR, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723; C1160 (Combinatorial mathematics); C5230
(Digital arithmetic methods); C7310 (Mathematics)",
confdate = "20-22 June 1990",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
conflocation = "White Plains, NY, USA",
confsponsor = "ACM",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Best binary floating point approximation;
Computer Programming Languages; Computers, Digital ---
Computational Methods; Decimal scientific notation;
Design; Efficient algorithm; experimentation; Fixed
precision; Floating point numbers; Floating Point
Numbers; Higher-precision arithmetic; IEEE double
precision results; IEEE Standard; IEEE-conforming
approximation; Intermediate result; Multiple-precision
integers",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms
and Problems. {\bf G.1.0} Mathematics of Computing,
NUMERICAL ANALYSIS, General, Computer arithmetic. {\bf
G.1.2} Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation.",
thesaurus = "Digital arithmetic; Mathematics computing; Number
theory; Standards",
}
@Article{Lee:1990:OPC,
author = "Vernon A. {Lee, Jr.} and Hans-J. Boehm",
title = "Optimizing programs over the constructive reals",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "102--111",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p102-lee/",
abstract = "The constructive reals provide programmers with a
useful mechanism for prototyping numerical programs,
and for experimenting with numerical algorithms.
Unfortunately, the performance of current
implementations is inadequate for some potential
applications. In particular, these implementations tend
to be space inefficient, in that they essentially
require a complete computation history to be
maintained. Some numerical analysts propose that the
programmer instead be provided with variable precision
interval arithmetic, and then be required to write code
to restart a computation when the intervals become too
inaccurate. Though this model is no doubt appropriate
at times, it is not an adequate replacement for exact
arithmetic. The correct transformation from a program
operating on the constructive reals to a reasonable
program using iterated interval arithmetic can be
nontrivial and error prone. Here we present a technique
based on program slicing to both automate this process
and reduce the amount of reexecution. Thus the
programmer is still free to use the simpler abstraction
of exact real arithmetic, but we can provide a more
efficient interval arithmetic based implementation.
Some preliminary empirical results are presented.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Rice Univ.",
affiliationaddress = "Houston, TX, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "722; 723; C6110 (Systems analysis and programming);
C6120 (File organisation); C7310 (Mathematics)",
confdate = "20-22 June 1990",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
conflocation = "White Plains, NY, USA",
confsponsor = "ACM",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Computer Operating Systems; Computer
Programming Languages --- Design; Constructive reals;
Efficient interval arithmetic based implementation;
Empirical results; Exact real arithmetic; Numerical
algorithms; Numerical analysts; Numerical programs;
Optimizing Compilers; performance; Performance; Program
Compilers; Program slicing; Reexecution; Variable
precision interval arithmetic",
meetingaddress = "White Plains, NY, USA",
meetingdate = "Jun 20--22 1990",
meetingdate2 = "06/20--22/90",
sponsor = "Assoc for Computing Machinery, Special Interest Group
on Programming Languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf F.2.1} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Numerical Algorithms and Problems. {\bf
G.1.0} Mathematics of Computing, NUMERICAL ANALYSIS,
General, Computer arithmetic. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures.",
thesaurus = "Data structures; Mathematics computing; Programming",
}
@Article{Steele:1990:HPF,
author = "Guy L. {Steele, Jr.} and Jon L. White",
title = "How to Print Floating-Point Numbers Accurately",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "112--126",
month = jun,
year = "1990",
CODEN = "SINODQ",
ISBN = "0-89791-364-7",
ISBN-13 = "978-0-89791-364-5",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:53 MST 2003",
bibsource = "http://portal.acm.org/; Compendex database;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/",
note = "See also input algorithm in
\cite{Clinger:1990:HRF,Clinger:2004:RHR}, and a faster
output algorithm in \cite{Burger:1996:PFP} and
\cite{Knuth:1990:SPW}, IBM S/360 algorithms in
\cite{Abbott:1999:ASS} for both IEEE 754 and S/360
formats, and a twenty-year retrospective in
\cite{Steele:2004:RHP}. In electronic mail dated Wed,
27 Jun 1990 11:55:36 EDT, Guy Steele reported that an
intrepid pre-SIGPLAN 90 conference implementation of
what is stated in the paper revealed 3 mistakes:
\begin{itemize} \item[1.] Table~5 (page 124):\par
\noindent insert {\tt k <-- 0} after assertion, and
also delete {\tt k <-- 0} from Table~6. \item[2.]
Table~9 (page 125):\par \noindent \begin{tabular} {ll}
for & {\tt -1:USER!({"}{"});} \\
substitute & {\tt -1:USER!({"}0{"});} \end{tabular}\par
\noindent and delete the comment. \item[3.] Table~10
(page 125):\par \noindent \begin{tabular}{ll} for &
{\tt fill(-k, {"}0{"})}\\
substitute & {\tt fill(-k-1, {"}0{"})} \end{tabular}
\end{itemize}
\def\EatBibTeXPeriod#1{\ifx#1.\else#1\fi}\EatBibTeXPeriod",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p112-steele/",
abstract = "Algorithms are presented for accurately converting
floating-point numbers to decimal representation. The
key idea is to carry along with the computation an
explicit representation of the required rounding
accuracy. The authors begin with the simpler problem of
converting fixed-point fractions. A modification of the
well-known algorithm for radix-conversion of
fixed-point fractions by multiplication explicitly
determines when to terminate the conversion process; a
variable number of digits are produced. They derive two
algorithms for free-format output of floating-point
numbers. Finally, they modify the free-format
conversion algorithm for use in fixed-format
applications. Information may be lost if the fixed
format provides too few digit position