%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "3.38",
%%% date = "19 June 2008",
%%% time = "08:10:15 MDT",
%%% 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 = "39793 71324 308301 3013171",
%%% 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 ( 202) 1997 ( 340)
%%% 1984 ( 0) 1991 ( 285) 1998 ( 321)
%%% 1985 ( 0) 1992 ( 234) 1999 ( 321)
%%% 1986 ( 0) 1993 ( 343) 2000 ( 1)
%%%
%%% Article: 2452
%%% InProceedings: 403
%%% Proceedings: 51
%%%
%%% Total entries: 2906
%%%
%%% 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",
}
@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,
}
%%% ====================================================================
%%% Finally, SIGPLAN entries:
@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{Labreche:1990:IRT,
author = "Pierre Labr{\`e}che and Louis Lamarche",
title = "{{\em Interactors\/}}: a real-time executive with
multiparty interactions in {C++}",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "20--32",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987482",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Interactors is a run-time environment for embedded
real-time software, which adds concurrency to the C++
object-oriented language. Interactors allows sequential
processes to interact synchronously or asynchronously,
and provides user-definable multiparty interactions.
Several forms of selective wait, inspired by Ada, are
provided. Scheduling algorithms follow Carnegie-Mellon
University's recommendations for implementing hard
deadline scheduling. Concepts are illustrated by simple
application examples: Producer/Consumer and Dining
Philosophers. This paper concludes by a description of
the current implementation.",
acknowledgement = ack-nhfb,
}
@Article{Meek:1990:SSF,
author = "Brian Meek",
title = "The static semantics file",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "33--42",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987483",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Prather:1990:PCP,
author = "Ronald E. Prather",
title = "Proposal for a categorical programming language",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "43--50",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987484",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Snelting:1990:HBL,
author = "Gregor Snelting",
title = "How to build {LR} parsers which accept incomplete
input",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "51--58",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987485",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In this short note, we describe a modification to LR
parsers which allows processing of incomplete input,
while at the same time building of correct abstract
syntax trees. This feature is very useful for
language-based editors.",
acknowledgement = ack-nhfb,
}
@Article{Pagan:1990:CEG,
author = "Frank G. Pagan",
title = "Comparative efficiency of general and residual
parsers",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "59--68",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987486",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Some fundamentals of the partial computation concept
are concisely reviewed, including its relevance to the
relationship between table-driven, general syntactic
analyzers and source-language-specific, residual
syntactic analyzers. A manual methodology for
converting general parsers into generators of residual
parsers is explained, using an LL(1) parser as a
detailed example. The results of several experiments
are reported, comparing the time and space efficiencies
of different general parsers with corresponding,
automatically generated, residual parsers. The latter
parsers are usually several times faster than the
former ones.",
acknowledgement = ack-nhfb,
}
@Article{Stansifer:1990:IVF,
author = "Ryan Stansifer",
title = "Imperative versus functional",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "69--72",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987487",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mandl:1990:PCP,
author = "Robert Mandl",
title = "On `powerloop' constructs in programming languages",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "73--82",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987488",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A recent article in these Notices [1] gives an
overview of proposals and implementations of a 'power
operator' which (in its simplest form), acting on a
nonnegative integer $N$ and on a dyadic function
$\lozenge$, yields a monadic function which maps any
nonnegative number $B$ into $B \lozenge B \lozenge B
\lozenge \ldots{} \lozenge B$ with $N$ occurrences of
$B$. The entire discourse is couched in APL terms, thus
unfortunately suggesting a somewhat narrow
relevance. To dispel this erroneous impression, we give
here a simple example of a programming task where the
utility of such a construct appears in a most natural
manner, and suggest a possible syntax therefor.",
acknowledgement = ack-nhfb,
}
@Article{Roberts:1990:RAR,
author = "George H. Roberts",
title = "From recursive ascent to recursive descent: via
compiler optimizations",
journal = j-SIGPLAN,
volume = "25",
number = "4",
pages = "83--89",
month = apr,
year = "1990",
CODEN = "SINODQ",
DOI = "http://doi.acm.org/10.1145/987481.987489",
ISSN = "0362-1340",
bibdate = "Wed Jun 18 16:26:36 MDT 2008",
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 = "Compendex database; http://portal.acm.org/;
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 = "Compendex database; http://portal.acm.org/;
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 = "Compendex database; http://portal.acm.org/;
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 = "Compendex database; http://portal.acm.org/;
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 = "Compendex database; http://portal.acm.org/;
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
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 = "Compendex database; http://portal.acm.org/;
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 = "Compendex database;
garbo.uwasa.fi:/pc/doc-soft/fpbiblio.txt;
http://portal.acm.org/;
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 = "Compendex database; http://portal.acm.org/;
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 = "Compendex database; http://portal.acm.org/;
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 positions, but the output
is always correctly rounded. On the other hand, no
`garbage digits' are ever produced, even if the fixed
format specifies too many digit positions (intuitively,
the `4/3 prints as 1.333333328366279602' problem does
not occur).",
acknowledgement = ack-nhfb,
affiliation = "Thinking Machines Corp",
affiliationaddress = "Cambridge, MA, USA",
classification = "722; 723; 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; computer programming languages; computers,
digital --- computational methods; conversion process;
decimal representation; design; digit positions;
explicit representation; fixed-format applications;
fixed-point fractions; floating point numbers;
floating-point numbers; free-format conversion
algorithm; free-format output; garbage digits;
performance; radix-conversion; rounding accuracy;
verification",
remark = "Published as part of the Proceedings of PLDI'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.",
thesaurus = "Digital arithmetic; Mathematics computing",
xxabstract = "We present algorithms 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. We 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. We then derive
two algorithms for free-format output of floating-point
numbers. Finally, we modify the free-format conversion
algorithm for use in fixed-format applications.",
}
@Article{Cormack:1990:TDP,
author = "Gordon V. Cormack and Andrew K. Wright",
title = "Type-dependent parameter inference",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "127--136",
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{Cormack:1990:TPI,
author = "Gordon V. Cormack and Andrew K. Wright",
title = "Type-dependent parameter inference",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "127--136",
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/p127-cormack/",
abstract = "An algorithm is presented to infer the type and
operation parameters of polymorphic functions.
Operation parameters are named and typed at the
function definition, but are selected from the set of
overloaded definitions available wherever the function
is used. These parameters are always implicit, implying
that the complexity of using a function does not
increase with the generality of its type.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Waterloo",
affiliationaddress = "Waterloo, Ont, Can",
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; Computer Programming Languages --- Design;
Data Abstraction; design; 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 D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Procedures, functions, and
subroutines. {\bf F.3.3} Theory of Computation, LOGICS
AND MEANINGS OF PROGRAMS, Studies of Program
Constructs, Functional constructs. {\bf D.2.2}
Software, SOFTWARE ENGINEERING, Design Tools and
Techniques.",
}
@Article{Anderson:1990:CHA,
author = "Steven Anderson and Paul Hudak",
title = "Compilation of {Haskell} array comprehensions for
scientific computing",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "137--149",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p137-anderson/",
abstract = "Monolithic approaches to functional language arrays,
such as Haskell array comprehensions, define elements
all at once, at the time the array is created, instead
of incrementally. Although monolithic arrays are
elegant, a naive implementation can be very
inefficient. For example, if a compiler does not know
whether an element has zero or many definitions, it
must compile runtime tests. If a compiler does not know
inter-element data dependences, it must resort to
pessimistic strategies such as compiling elements as
thunks, or making unnecessary copies when updating an
array. Subscript analysis, originally developed for
imperative language vectorizing and parallelizing
compilers, can be adapted to provide a functional
language compiler with the information needed for
efficient compilation of monolithic arrays. Our
contribution is to develop the number-theoretic basis
of subscript analysis with assumptions appropriate to
functional arrays, detail the kinds of dependence
information subscript analysis can uncover, and apply
that dependence information to sequential efficient
compilation of functional arrays.",
acknowledgement = ack-nhfb,
affiliation = "Yale Univ",
affiliationaddress = "New Haven, CT, 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; Haskell Array;
languages; Program Compilers; Scientific Computing",
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 D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features. {\bf F.3.3} Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Studies of Program Constructs.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures.",
}
@Article{Chambers:1990:ITA,
author = "Craig Chambers and David Ungar",
title = "Iterative type analysis and extended message
splitting: Optimizing dynamically-typed object-oriented
programs",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "150--164",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p150-chambers/",
abstract = "Object-oriented languages have suffered from poor
performance caused by frequent and slow
dynamically-bound procedure calls. The best way to
speed up a procedure call is to compile it out, but
dynamic binding of object-oriented procedure calls
without static receiver type information precludes
inlining. Iterative type analysis and extended message
splitting are new compilation techniques that extract
much of the necessary type information and make it
possible to hoist run-time type tests out of loops. Our
system compiles code on-the-fly that is customized to
the actual data types used by a running program. The
compiler constructs a control flow graph annotated with
type information by simultaneously performing type
analysis and inlining.",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ",
affiliationaddress = "Stanford, 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 --- Object Oriented Programming; languages;
Object-Oriented Languages; Optimizing Compilers;
performance; 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, Type
structure. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
Language Classifications. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Control structures. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Computations on discrete structures. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Optimization.",
}
@Article{Jacobs:1990:TDS,
author = "Dean Jacobs",
title = "Type declarations as subtype constraints in logic
programming",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "165--173",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p165-jacobs/",
abstract = "This paper presents a type system for logic programs
that supports parametric polymorphism and subtypes.
This system follows most knowledge representation and
object-oriented schemes in that subtyping is
name-based, i.e., \$tau${}_1$ is considered to be a
subtype of \$tau${}_2$ iff it is declared as such. We
take this as a fundamental principle in the sense that
type declarations have the form of subtype constraints.
Types are assigned meaning by viewing such constraints
as Horn clauses that, together with a few basic axioms,
define a subtype predicate. This technique provides a
(least) model for types and, at the same time, a sound
and complete proof system for deriving subtypes. Using
this proof system, we define well-typedness conditions
which ensure that a logic program\slash query respects
a set of predicate types. We prove that these
conditions are consistent in the sense that every atom
of every resolvent produced during the execution of a
well-typed program is consistent with its type.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California",
affiliationaddress = "Los Angeles, 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 Programming; Computer Programming
Languages --- Design; Data Abstraction; languages;
Logic Programming; Logic Programming Languages;
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 F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Type structure. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors,
Optimization. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features,
Procedures, functions, and subroutines. {\bf F.3.3}
Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Studies of Program Constructs, Type structure.",
}
@Article{Debray:1990:TGA,
author = "Saumya K. Debray and Nai-Wei Lin and Manuel
Hermenegildo",
title = "Task granularity analysis in logic programs",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "174--188",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p174-debray/",
abstract = "While logic programming languages offer a great deal
of scope for parallelism, there is usually some
overhead associated with the execution of goals in
parallel because of the work involved in task creation
and scheduling. In practice, therefore, the
`granularity' of a goal, i.e. an estimate of the work
available under it, should be taken into account when
deciding whether or not to execute a goal concurrently
as a separate task. This paper describes a method for
estimating the granularity of a goal at compile time.
The runtime overhead associated with our approach is
usually quite small, and the performance improvements
resulting from the incorporation of grainsize control
can be quite good. This is shown by means of
experimental results.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Arizona",
affiliationaddress = "Tucson, AZ, 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 --- Program
Compilers; Computer Programming; experimentation;
languages; Logic Programming; Logic Programming
Languages; performance; verification",
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.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Concurrent programming structures. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Optimization. {\bf D.3.2} Software, PROGRAMMING
LANGUAGES, Language Classifications. {\bf F.3.3} Theory
of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Studies of Program Constructs.",
}
@Article{Mitsolides:1990:GRC,
author = "Thanasis Mitsolides and Malcolm Harrison",
title = "Generators and the replicator control structure in the
parallel environment of {ALLOY}",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "189--196",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p189-mitsolides/",
abstract = "The need for searching a space of solutions appears
often. Many problems, such as iteration over a
dynamically created domain, can be expressed most
naturally using a generate-and-process style. Serial
programming languages typically support solutions of
these problems by providing some form of generators or
backtracking. A parallel programming language is more
demanding since it needs to be able to express parallel
generation and processing of elements. Failure driven
computation is no longer sufficient and neither is
multiple-assignment to generated values. We describe
the replicator control operator used in the high level
parallel programming language ALLOY. The replicator
control operator provides a new view of generators
which deals with these problems.",
acknowledgement = ack-nhfb,
affiliation = "New York Univ",
affiliationaddress = "New York, NY, 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; Computer Systems, Digital ---
Parallel Processing; languages; Parallel Programming
Languages; Program Compilers; Programming Language
alloy",
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.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Concurrent programming
structures. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Control
structures. {\bf D.3.2} Software, PROGRAMMING
LANGUAGES, Language Classifications. {\bf D.1.m}
Software, PROGRAMMING TECHNIQUES, Miscellaneous.",
}
@Article{Teitelbaum:1990:HAG,
author = "Tim Teitelbaum and Richard Chapman",
title = "Higher-order attribute grammars and editing
environments",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "197--208",
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/p197-teitelbaum/",
abstract = "In this paper, we describe a higher-order
attribute-grammar editing model, argue its merits with
the aid of a number of illustrative examples, and
present an efficient solution to the incremental
attribute evaluation problem for the model. The main
topics are higher-order grammars, syntactic
constraints, preserving user input, updating
nonterminal attributes, syntactic references,
transformations, and logical variables.",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ",
affiliationaddress = "Ithaca, NY, 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 = "Attribute Grammars; Computer Metatheory --- Grammars;
Computer Operating Systems; Editing Environments;
languages; Program Compilers; 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, Translator writing systems and compiler
generators. {\bf F.4.2} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and
Other Rewriting Systems, Grammar types. {\bf D.3.1}
Software, PROGRAMMING LANGUAGES, Formal Definitions and
Theory, Syntax.",
}
@Article{Teitelbaum:1990:HOA,
author = "Tim Teitelbaum and Richard Chapman",
title = "Higher-order attribute grammars and editing
environments",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "197--208",
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{Jourdan:1990:DIE,
author = "Martin Jourdan and Didier Parigot and Catherine
Juli{\'e} and Olivier Durin and Carole Le Bellec",
title = "Design, implementation and evaluation of the {FNC}-2
attribute grammar system",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "209--222",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p209-jourdan/",
abstract = "FNC-2 is a new attribute grammar processing system
aiming at expressive power, efficiency, ease of use and
versatility. Its development at INRIA started in 1986,
and a first running prototype is available since early
1989. Its most important features are: efficient
exhaustive and incremental visit-sequence-based
evaluation of strongly (absolutely) non-circular AGs;
extensive space optimizations; a specially-designed
AG-description language, with provisions for true
modularity; portability and versatility of the
generated evaluators; complete environment for
application development. This paper briefly describes
the design and implementation of FNC-2 and its
peripherals. Then preliminary experience with the
system is reported.",
acknowledgement = ack-nhfb,
affiliation = "INRIA",
affiliationaddress = "Le Chesnay, Fr",
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 = "Attribute Grammars; Automata Theory --- Grammars;
Computer Operating Systems; Computer Programming
Languages --- Design; design; languages; performance;
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.4.2} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Grammars and Other Rewriting
Systems, Grammar types. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Translator writing
systems and compiler generators. {\bf D.3.1} Software,
PROGRAMMING LANGUAGES, Formal Definitions and Theory,
Syntax. {\bf D.2.2} Software, SOFTWARE ENGINEERING,
Design Tools and Techniques.",
}
@Article{Henry:1990:UWI,
author = "Robert R. Henry and Kenneth M. Whaley and Bruce
Forstall",
title = "The {University} of {Washington} illustrating
compiler",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "223--233",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p223-henry/",
abstract = "The University of Washington illustrating compiler
(UWPI) automatically illustrates the data structures
used in simple programs written in a subset of
Pascal${}^2$. A UWPI user submits a program to UWPI,
and can then watch a graphical display show time
varying illustrations of the data structures and
program source code. UWPI uses the information latent
in the program to determine how to illustrate the
program. UWPI infers the abstract data types directly
from the declarations and operations used in the source
program, and then lays out the illustration in a
natural way by instantiating well-known layouts for the
abstract types. UWPI solves program illustration using
compile-time pattern matching and type inferencing to
link anticipated execution events to display events,
rather than relying on user assistance or specialized
programming techniques. UWPI has been used to
automatically illustrate didactic sorting and searching
examples, and can be used to help teach basic data
structures, or to help when debugging programs.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Washington",
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 = "Computer Operating Systems; Computer Programming
Languages --- pascal; Data Processing --- Data
Structures; design; Program Compilers; reliability;
University of Washington Illustrating Compiler (UWPI)",
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 D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Data types and structures. {\bf D.3.3}
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features, Abstract data types. {\bf D.2.2}
Software, SOFTWARE ENGINEERING, Design Tools and
Techniques, User interfaces. {\bf D.2.5} Software,
SOFTWARE ENGINEERING, Testing and Debugging, Debugging
aids. {\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory.",
}
@Article{Horwitz:1990:IST,
author = "Susan Horwitz",
title = "Identifying the semantic and textual differences
between two versions of a program",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "234--245",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p234-horwitz/",
abstract = "Text-based file comparators (e.g., the Unix utility
diff), are very general tools that can be applied to
arbitrary files. However, using such tools to compare
programs can be unsatisfactory because their only
notion of change is based on program text rather than
program behavior. This paper describes a technique for
comparing two versions of a program, determining which
program components represent changes, and classifying
each changed component as representing either a
semantic or a textual change.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Wisconsin-Madison",
affiliationaddress = "Madison, WI, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "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 --- Program
Processors; Computer Programming; design; Testing;
Text-Based File Comparators; verification",
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.1} Software, PROGRAMMING LANGUAGES, Formal
Definitions and Theory, Semantics. {\bf D.2.2}
Software, SOFTWARE ENGINEERING, Design Tools and
Techniques. {\bf F.3.3} Theory of Computation, LOGICS
AND MEANINGS OF PROGRAMS, Studies of Program
Constructs. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.
{\bf D.4.2} Software, OPERATING SYSTEMS, Storage
Management. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures.",
}
@Article{Agrawal:1990:DPS,
author = "Hiralal Agrawal and Joseph R. Horgan",
title = "Dynamic program slicing",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "246--256",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p246-agrawal/",
abstract = "Program slices are useful in debugging, testing,
maintenance, and understanding of programs. The
conventional notion of a program slice, the static
slice, is the set of all statements that might affect
the value of a given variable occurrence. In this
paper, we investigate the concept of the dynamic slice
consisting of all statements that actually affect the
value of a variable occurrence for a given program
input. The sensitivity of dynamic slicing to particular
program inputs makes it more useful in program
debugging and testing than static slicing. Several
approaches for computing dynamic slices are examined.
The notion of a Dynamic Dependence Graph and its use in
computing dynamic slices is discussed. The Dynamic
Dependence Graph may be unbounded in length; therefore,
we introduce the economical concept of a Reduced
Dynamic Dependence Graph, which is proportional in size
to the number of dynamic slices arising during the
program execution.",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ",
affiliationaddress = "West Lafayette, IN, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "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 --- Program
Processors; Computer Programming; Program Debugging;
Program Dependence Graph (PDG); Program Slicing;
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 F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory.",
}
@Article{Ballance:1990:PDW,
author = "Robert A. Ballance and Arthur B. Maccabe and Karl J.
Ottenstein",
title = "The {Program Dependence Web}: {A} Representation
Supporting Control-, Data-, and Demand-Driven
Interpretation of Imperative Languages",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "257--271",
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/p257-ottenstein/",
abstract = "The Program Dependence Web (PDW) is a program
representation that can be directly interpreted using
control-, data-, or demand-driven models of execution.
A PDW combines a single-assignment version of the
program with explicit operators that manage the flow of
data values. The PDW can be viewed as an augmented
Program Dependence Graph. Translation to the PDW
representation provides the basis for projects to
compile Fortran onto dynamic dataflow architectures and
simulators. A second application of the PDW is the
construction of various compositional semantics for
program dependence graphs.",
acknowledgement = ack-nhfb,
affiliation = "Univ of New Mexico",
affiliationaddress = "Albuquerque, NM, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "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; Imperative
Programming Languages; languages; Program Dependence
Graph (PDG); Program Dependence Web (PDW); Program
Interpreters",
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. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors,
Optimization. {\bf D.2.2} Software, SOFTWARE
ENGINEERING, Design Tools and Techniques. {\bf D.3.3}
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features, Control structures. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications,
FORTRAN 77.",
}
@Article{Gupta:1990:FLA,
author = "Rajiv Gupta",
title = "A fresh look at optimizing array bound checking",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "272--282",
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/p272-gupta/",
abstract = "This paper describes techniques for optimizing range
checks performed to detect array bound violations. In
addition to the elimination of range checks, the
optimizations discussed in this paper also reduce the
overhead due to range checks that cannot be eliminated
by compile-time analysis. The optimizations reduce the
program execution time and the object code size through
elimination of redundant checks, propagation of checks
out of loops, and combination of multiple checks into a
single check. A minimal control flow graph (MCFG) is
constructed using which the minimal amount of data flow
information required for range check optimizations is
computed. The range check optimizations are performed
using the MCFG rather the CFG for the entire program.
This allows the global range check optimizations to be
performed efficiently since the MCFG is significantly
smaller than the CFG.",
acknowledgement = ack-nhfb,
affiliation = "Philips Lab",
affiliationaddress = "Briarcliff Manor, NY, USA",
annote = "Published as part of the Proceedings of PLDI'90.",
classification = "723",
conference = "Proceedings of the ACM SIGPLAN '90 Conference on
Programming Language Design and Implementation",
conferenceyear = "1990",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Arrays; Computer Operating Systems; Data
Processing --- Data Structures; experimentation;
Optimizing Compilers; performance; 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 D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Graph algorithms. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs. {\bf D.2.2} Software, SOFTWARE
ENGINEERING, Design Tools and Techniques.",
}
@Article{Gupta:1990:FLO,
author = "Rajiv Gupta",
title = "A fresh look at optimizing array bound checking",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "272--282",
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{Ammarguellat:1990:ARI,
author = "Zahira Ammarguellat and W. L. {Harrison, III}",
title = "Automatic recognition of induction variables and
recurrence relations by abstract interpretation",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "283--295",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p283-ammarguellat/",
abstract = "The recognition of recurrence relations is important
in several ways to the compilation of programs.
Induction variables, the simplest form of recurrence,
are pivotal in loop optimizations and dependence
testing. Many recurrence relations, although expressed
sequentially by the programmer, lend themselves to
efficient vector or parallel computation. Despite the
importance of recurrences, vectorizing and
parallelizing compilers to date have recognized them
only in an ad-hoc fashion. In this paper we put forth a
systematic method for recognizing recurrence relations
automatically. Our method has two parts. First,
abstract interpretation is used to construct a map that
associates each variable assigned in a loop with a
symbolic form (expression) of its value. Second, the
elements of this map are matched with patterns that
describe recurrence relations. The scheme is easily
extensible by the addition of templates, and is able to
recognize nested recurrences by the propagation of the
closed forms of recurrences from inner loops. We
present some applications of this method and a proof of
its correctness.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign",
affiliationaddress = "Urbana, IL, 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 = "Abstract Interpretation; algorithms; Computer
Operating Systems; Computer Programming Languages ---
Design; Program Compilers; Recurrence Relations;
theory; verification",
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 G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory. {\bf D.2.4} Software,
SOFTWARE ENGINEERING, Software/Program Verification,
Correctness proofs. {\bf D.3.4} Software, PROGRAMMING
LANGUAGES, Processors, Optimization. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors, Compilers.
{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Semantics of Programming Languages.",
}
@Article{Chase:1990:APS,
author = "David R. Chase and Mark Wegman and F. Kenneth Zadeck",
title = "Analysis of pointers and structures",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "296--310",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p296-chase/",
abstract = "We propose a different way of summarizing linked data
structures that has better worst case time bounds,
allows a particularly efficient implementation for the
sparse (expected) case, preserves information about
unbounded data structures, and takes advantage of
information provided by the structure of the program.
Rather than try to match one part of the data structure
with another (in essence solving some variant of the
subgraph isomorphism problem), we look at the program
for hints about which parts of the data structure are
related, and then match those parts. In addition, a
simple extension of this analysis discovers data
structures that are `true lists' and `true trees'; that
is, it discovers data structures within which there is
no aliasing at all.",
acknowledgement = ack-nhfb,
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; Computational Models; Computer Operating
Systems; Computer Programming --- Algorithms; Data
Processing --- Data Structures; design; 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 G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory. {\bf D.4.2} Software,
OPERATING SYSTEMS, Storage Management,
Allocation/deallocation strategies. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors,
Optimization. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Data types
and structures. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Concurrent
programming structures.",
}
@Article{Tseng:1990:CPL,
author = "Ping-Sheng Tseng",
title = "Compiling programs for a linear systolic array",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "311--321",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p311-tseng/",
abstract = "This paper describes an AL compiler for the Warp
systolic array. AL is a programming language in which
the user programs a systolic array as if it were a
sequential computer and relies on the compiler to
generate parallel code. This paper introduces the
notion of data relations in compiling programs for
systolic arrays. Unlike dependence relations among
statements of a program, data relations define
compatibility relations among data objects of a
program. The AL compiler uses data relations to compute
data compatibility classes, determine data
distribution, and distribute loop iterations. The AL
compiler can generate efficient parallel code almost
identical to what the user would have written by hand.
For example, the AL compiler generates parallel code
for the LINPACK LU decomposition (SGEFA) and QR
decomposition (SQRDC) routines with a nearly 8-fold
speedup on the 10-cell Warp array for matrices of size
180 \$MUL 180.",
acknowledgement = ack-nhfb,
affiliation = "Bellcore",
affiliationaddress = "Morristown, NJ, 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 Architecture; Computer Operating Systems;
Computer Systems, Digital --- Parallel Processing;
design; languages; Program Compilers; Systolic Arrays",
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.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Parallelism and
concurrency. {\bf D.3.4} Software, PROGRAMMING
LANGUAGES, Processors, Compilers. {\bf I.2.5} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Programming
Languages and Software, AL. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Code generation.
{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Concurrent programming
structures.",
}
@Article{Sarkar:1990:IRF,
author = "Vivek Sarkar",
title = "Instruction reordering for fork-join parallelism",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "322--336",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p322-sarkar/",
abstract = "In this paper, we have studied the problem of
generating fork-join code with the maximum amount of
parallelism, for a given DAG. The results of our work
have been applied to Sisal programs, so as to expose
more parallelism for the fork-join microtasking model
supported by OSC. The reordering optimization was found
to be crucial for programs which rely solely on
non-loop parallelism (e.g. Fibonacci). This paper did
not address the issue of trading off overhead and
parallelism and thus determining what parallelism is
useful for the target multiprocessor. In previous work,
we addressed the problem of automatically partitioning
Sisal programs for a general macro-dataflow execution
model.",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, 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
Systems Programming --- Multiprogramming; Computer
Systems, Digital --- Parallel Processing;
experimentation; Fork-Join Parallelism; languages;
Program Compilers; verification",
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.1.2} Theory of Computation, COMPUTATION BY
ABSTRACT DEVICES, Modes of Computation, Parallelism and
concurrency. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Concurrent
programming structures. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf D.3.3}
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features, Control structures. {\bf G.1.2}
Mathematics of Computing, NUMERICAL ANALYSIS,
Approximation. {\bf D.3.2} Software, PROGRAMMING
LANGUAGES, Language Classifications, SISAL.",
}
@Article{Cytron:1990:CRC,
author = "Ron Cytron and Jeanne Ferrante and Vivek Sarkar",
title = "Compact representations for control dependence",
journal = j-SIGPLAN,
volume = "25",
number = "6",
pages = "337--351",
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://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p337-cytron/",
abstract = "Recently the Program Dependence Graph (PDG) has been
shown useful as a basis for solving a variety of
problems, including optimization, vectorization,
translation to dataflow machines, code generation for
VLIW machines, program transformation, merging versions
of programs, and automatic detection and management of
parallelism. The edges of the PDG consist of control
dependence and data dependence edges. The data
dependence edges represent the essential data flow
relationships of a program. In this paper, we examine
the control dependence aspect of the PDG, which
summarizes essential control flow relationships in a
program. Informally, for nodes X and Y in CFG, Y is
control dependent on X if during execution, X can
directly affect whether Y is executed. We improve the
space and time required to compute those aspects of
control dependence used by most algorithms.",
acknowledgement = ack-nhfb,
affiliation = "IBM T. J. Watson Research Cent",
affiliationaddress = "Yorktown Heights, NY, 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; Control Dependence;
design; experimentation; Optimizing Compilers;
performance; Program Compilers; Program Dependence
Graph (PDG); 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Studies of Program Constructs, Control
primitives. {\bf F.2.2} Theory of Computation, ANALYSIS
OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.3}
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features, Control structures. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Optimization.",
}
@Article{Eriksson:1990:CEM,
author = "Mikael Eriksson",
title = "A correct example of multiple inheritance",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "7--10",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Drashansky:1990:CFP,
author = "Tsvetan T. Drashansky",
title = "A concept for functional programming and distributed
data processing in a local area network and its
implementation",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "11--18",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lins:1990:PEO,
author = "C. Lins",
title = "Programming without enumerations in {Oberon}",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "19--27",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Paakki:1990:OTE,
author = "Jukka Paakki and Anssi Karhinen and Tomi Silander",
title = "Orthogonal type extensions and reductions",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "28--38",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yuen:1990:SIB,
author = "C. K. Yuen and W. F. Wong",
title = "A self interpreter for {BaLinda Lisp}",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "39--58",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Greenfield:1990:BZE,
author = "Peter Greenfield",
title = "{Bagof/3} to {ZF} expression: an example {Prolog}
application manually translated to {Miranda}",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "59--62",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Boyd:1990:PC,
author = "Joanne L. Boyd and Gerald M. Karam",
title = "{Prolog} in `{C}'",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "63--71",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Axford:1990:ELC,
author = "Tom Axford",
title = "An elementary language construct for parallel
programming",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "72--80",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McIntosh:1990:PLR,
author = "Harold V. McIntosh and Gerardo Cisneros",
title = "The programming languages {REC} and convert",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "81--94",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sakkinen:1990:EBS,
author = "Markku Sakkinen",
title = "On embedding {Boolean} as a subtype of integer",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "95--96",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Krishamurthy:1990:BSP,
author = "Sanjay M. Krishamurthy",
title = "A brief survey of papers on scheduling for pipelined
processors",
journal = j-SIGPLAN,
volume = "25",
number = "7",
pages = "97--106",
month = jul,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:54 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ince:1990:ABS,
author = "Darrel Ince",
title = "An Annotated Bibliography of Software Metrics",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "15--23",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
keywords = "bibliography, software engineering, metrics",
}
@Article{Wong:1990:TFS,
author = "L. Wong and B. C. Ooi",
title = "Treating failure as state",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "24--26",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Steigerwald:1990:CPS,
author = "R. Steigerwald and M. Nelson",
title = "Concurrent programming in {Smalltalk-80}",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "27--36",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Elsworth:1990:ACC,
author = "W. F. Elsworth and M. B. A. Parkes",
title = "Automated compiler construction based on top-down
syntax analysis and attribute evaluation",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "37--42",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Milanese:1990:CFG,
author = "V. Milanese",
title = "Coupling {FORTH} and {GKS} in monitoring processes",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "43--52",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dekeyser:1990:EEV,
author = "J. Dekeyser and Ph. Marquet and Ph. Pruex",
title = "{EVA}: an explicit vector language",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "53--71",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Schneider:1990:CTB,
author = "V. Schneider",
title = "Compiler textbook bibliographies considered harmful",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "72--74",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meek:1990:TVD,
author = "B. Meek",
title = "Two-valued datatypes",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "75--79",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meek:1990:FJO,
author = "B. Meek",
title = "Failure is not just one value",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "80--83",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Issendorff:1990:TOa,
author = "H. Von Issendorff",
title = "A theory of organization",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "84--102",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Berry:1990:AP,
author = "M. Berry",
title = "Adverbial programming",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "103--105",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jonsson:1990:FCN,
author = "D. Jonsson",
title = "The flow of control notations {Pancode} and
boxcharts",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "106--119",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Resler:1990:VVC,
author = "D. Resler",
title = "{VisiCLANG}: a visible compiler for {CLANG}",
journal = j-SIGPLAN,
volume = "25",
number = "8",
pages = "120--123",
month = aug,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:55 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Spackman:1990:BRI,
author = "Stephen P. Spackman",
title = "Book Review: {Interpretation and Instruction Path
Coprocessing by Eddy H. Debaere \& Jan M. Van
Campenhout: (MIT Press 1990)}",
journal = j-SIGPLAN,
volume = "25",
number = "9",
pages = "7--9",
month = sep,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:56 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gyorkos:1990:DSS,
author = "J. Gyorkos and I. Rozman and T. Welzer",
title = "Dynamical system specifications as validation media",
journal = j-SIGPLAN,
volume = "25",
number = "9",
pages = "10--16",
month = sep,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:56 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Talla:1990:NTO,
author = "D. Talla",
title = "Notes on termination of {OCCAM} processes",
journal = j-SIGPLAN,
volume = "25",
number = "9",
pages = "17--24",
month = sep,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:56 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jung:1990:CT,
author = "C. Jung and E. Sibert",
title = "Communication types",
journal = j-SIGPLAN,
volume = "25",
number = "9",
pages = "25--30",
month = sep,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:56 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{vonIssendorff:1990:TO,
author = "H. von Issendorff",
title = "A theory of organization",
journal = j-SIGPLAN,
volume = "25",
number = "9",
pages = "31--38",
month = sep,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:56 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rulghaver:1990:LSS,
author = "A. B. Rulghaver and T. T. E. Yeo",
title = "Language support for a semi-dataflow parallel
programming environment",
journal = j-SIGPLAN,
volume = "25",
number = "9",
pages = "39--47",
month = sep,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:56 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Booch:1990:DCB,
author = "Grady Booch and Michael Vilot",
title = "The design of the {C++ Booch Components}",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "1--11",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gossain:1990:IDM,
author = "Sanjiv Gossain and Bruce Anderson",
title = "An iterative-design model for reusable object-oriented
software",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "12--27",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bear:1990:GSO,
author = "Stephen Bear and Phillip Allen and Derek Coleman and
Fiona Hayes",
title = "Graphical specification of object oriented systems",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "28--37",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nierstrasz:1990:VOP,
author = "Oscar Nierstrasz and Michael Papathomas",
title = "Viewing object as patterns of communicating agents",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "38--43",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Andreoli:1990:BCS,
author = "Jean-Marc Andreoli and Remo Pareschi",
title = "{LO} and behold! {Concurrent} structured processes",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "44--56",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kahn:1990:ASC,
author = "K. Kahn and Vijay A. Saraswat",
title = "Actors as a special case of concurrent constraint
(logic) programming",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "57--66",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lerner:1990:BSE,
author = "Barbara Staudt Lerner and A. Nico Habermann",
title = "Beyond schema evolution to database reorganization",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "67--76",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Freeman-Benson:1990:KMO,
author = "Bjorn N. Freeman-Benson",
title = "{Kaleidoscope}: mixing objects, constraints, and
imperative programming",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "77--88",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meseguer:1990:LTC,
author = "Jos{\'e} Meseguer",
title = "A logical theory of concurrent objects",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "101--115",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Purchase:1990:MPS,
author = "Jan A. Purchase and Russel L. Winder",
title = "Message pattern specifications: a new technique for
handling errors in parallel object oriented systems",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "116--125",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kafura:1990:GCA,
author = "Dennis Kafura and Doug Washabaugh and Jeff Nelson",
title = "Garbage collection of actors",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "126--134",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{deChampeaux:1990:SAO,
author = "Dennis de Champeaux and Larry Constantine and Ivar
Jacobson and Stephen Mellor and Paul Ward and Edward
Yourdon",
title = "Structured analysis and object oriented analysis",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "135--139",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Madsen:1990:STO,
author = "Ole Lehrmann Madsen and Boris Magnusson and Birger
M{\o}lier-Pedersen",
title = "Strong typing of object-oriented languages revisited",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "140--150",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Palsberg:1990:TSO,
author = "Jens Palsberg and Michael I. Schwartzbach",
title = "Type substitution for object-oriented programming",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "151--160",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{America:1990:POO,
author = "Pierre America and Frank van der Linden",
title = "A parallel object-oriented language with inheritance
and subtyping",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "161--168",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Helm:1990:CSB,
author = "Richard Helm and Ian M. Holland and Dipayan
Gangopadhyay",
title = "{Contracts}: specifying behavioral compositions in
object-oriented systems",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "169--180",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Berlin:1990:WOC,
author = "Lucy M. Berlin",
title = "When objects collide experiences with reusing multiple
class hierarchies",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "181--193",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Paepcke:1990:PST,
author = "Andreas Paepcke",
title = "{PCLOS}: stress testing {CLOS} experiencing the
metaobject protocol",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "194--211",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Leavens:1990:RAO,
author = "Gary T. Leavens and William E. Weihl",
title = "Reasoning about object-oriented programs that use
subtypes",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "212--223",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Straube:1990:TCQ,
author = "Dave D. Straube and M. Tamer Oezsu",
title = "Type consistency of queries in an object-oriented
database system",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "224--233",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stein:1990:IOD,
author = "Jacob Stein and Tim Andrews and Bill Kent and Kate
Rotzell and Dan Weinreb",
title = "Issues in object database management",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "235--236",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Haarslev:1990:FVO,
author = "Volker Haarslev and Ralf M{\"o}ller",
title = "A framework for visualizing object-oriented systems",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "237--244",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
note = "OOPSLA ECOOP '90 Conference on Object-Oriented
Programming: Systems, Languages, and Applications.",
abstract = "A new approach to visualizing program systems within
the object-oriented paradigm is described. This
approach is based on a TEX like notation which has been
extended and generalized for specifying graphical
layout of arbitrary objects. The CLOS meta-level
architecture is used to associate visualization and
application objects. The authors propose several useful
techniques such as indirect values, slot and method
demons and instance-specific meta-objects. The
techniques require no modifications to the systems
which are selected for visualization. They demonstrate
the feasibility of the approach using application
domains such as CLOS debugging and constraint
systems.",
acknowledgement = ack-nhfb,
affiliation = "Xerox Palo Alto Res. Center, CA, USA",
classification = "C6110B (Software engineering techniques); C6130B
(Graphics techniques); C6180 (User interfaces)",
confdate = "21--25 Oct. 1990",
conflocation = "Ottawa, Ont., Canada",
confsponsor = "ACM",
keywords = "Application domains; Application objects; Arbitrary
objects; CLOS debugging; CLOS meta-level architecture;
Constraint systems; Graphical layout; Indirect values;
Instance-specific meta-objects; Method demons;
Object-oriented paradigm; Object-oriented systems;
Slot; TEX like notation; Visualization",
thesaurus = "Computer graphics; Formal specification;
Object-oriented programming; Visual programming",
}
@Article{McDonald:1990:PMV,
author = "John Alan McDonald and Werner Stuetzle and Andreas
Buja",
title = "Painting multiple views of complex objects",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "245--257",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shan:1990:MUS,
author = "Yen-Ping Shan",
title = "{MoDE}: a {UIMS} for {Smalltalk}",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "258--268",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Habert:1990:CKS,
author = "Sabine Habert and Laurence Mosseri",
title = "{COOL}: kernel support for object-oriented
environments",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "269--275",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Faust:1990:POO,
author = "John E. Faust and Henry M. Levy",
title = "The performance of an object-oriented threads
package",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "278--288",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ishikawa:1990:OOR,
author = "Yutaka Ishikawa and Hideyuki Tokuda",
title = "Object-oriented real-time language design: constructs
for timing constraints",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "289--298",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{DeNatale:1990:ORW,
author = "Rick DeNatale and Charles Irby and John LaLonde and
Burton Leathers and Reed Phillips",
title = "{OOP} in the real world",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "299--302",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bracha:1990:MBI,
author = "Gilad Bracha and William Cook",
title = "Mixin-based inheritance",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "303--311",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carre:1990:PVN,
author = "Bernard Carr{\'e} and Jean-Marc Geib",
title = "The point of view notion for multiple inheritance",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "312--321",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dony:1990:EHO,
author = "Christophe Dony",
title = "Exception handling and object-oriented programming:
towards a synthesis",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "322--330",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rymer:1990:ODO,
author = "John R. Rymer and Richard Mark Soley and William
Stephen Andreas and Ian Fuller and Neal Jacobson and
Richard A. Demers",
title = "{OOPSLA} distributed object management",
journal = j-SIGPLAN,
volume = "25",
number = "10",
pages = "331--333",
month = oct,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:57 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{staff:1990:AIC,
author = "SIGPLAN Notices staff",
title = "Abstracts of the {1990 International Conference on
Computer Languages Proceedings}",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "26--34",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christiansen:1990:SAG,
author = "H. Christiansen",
title = "A survey of adaptable grammars",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "35--44",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Andersen:1990:ELD,
author = "B. Andersen",
title = "Ellie language definition report",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "45--64",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ivanovic:1990:ICI,
author = "M. Ivanovic and Z. Budimac",
title = "Involving coroutines in interaction between functional
and conventional language",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "65--74",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McLaughlin:1990:PRP,
author = "R. McLaughlin",
title = "A plea for a readable {Prolog} programming style",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "75--79",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kovats:1990:CAP,
author = "T. Kovats",
title = "A conservative alternative to {Pancode}",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "80--84",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christopher:1990:FPP,
author = "T. Christopher and D. Ameiss",
title = "Functional programming in a parallel environment: the
implementation of {FP} in {MDC}",
journal = j-SIGPLAN,
volume = "25",
number = "11",
pages = "85--94",
month = nov,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:15:59 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dulli:1990:DDG,
author = "Susi Dulli and Vitaliano Milanese",
title = "A database design for graphical models",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "30--36",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lieu:1990:LTB,
author = "Choun Tong Lieu and Djamil Sarni",
title = "{O.LISP} theoretical basis and description",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "37--44",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Burshteyn:1990:GRF,
author = "Boris Burshteyn",
title = "Generation and recognition of formal languages by
modifiable grammars",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "45--53",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bothe:1990:PSB,
author = "K. Bothe",
title = "A {Prolog} space benchmark suite: a new tool to
compare {Prolog} implementations",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "54--60",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Auguston:1990:PLR,
author = "M. I. Auguston",
title = "Programming language {RIGAL} as a compiler writing
tool",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "61--69",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jellinghaus:1990:ELO,
author = "Robert Jellinghaus",
title = "{Eiffel Linda}: an object-oriented {Linda} dialect",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "70--84",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dotzel:1990:DMG,
author = "G{\"u}nter Dotzel",
title = "Does {Modula-2} generate racehorses?: comparison of
compiler generated code quality for floating point
arithmetic",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "85--88",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
abstract = "A simple example serves to demonstrate the code
quality generated by two different Modula-2 compilers.
The two compilers are called the Zurich/Hamburger and
the Erlanger. The author lists the Modula-2 source
program, shows an excerpt of the machine code listing
generated by the Erlanger and presents that of the
Zurich/Hamburger. The differences in code quality
concerning instruction count, code size and execution
speed are discussed and summarized. The author also
presents the main program module used for the
benchmarks and a short description of the development
history of Modula-2 and Modula/R.",
acknowledgement = ack-nhfb,
affiliation = "ModulaWare GmbH, Erlangen, West Germany",
classification = "C6140D (High level languages); C6150C (Compilers,
interpreters and other processors); C6150G (Diagnostic,
testing, debugging and evaluating systems)",
keywords = "Benchmarks; Code size; Compiler generated code
quality; Development history; Erlanger; Execution
speed; Floating point arithmetic; Instruction count;
Machine code listing; Main program module; Modula-2
compilers; Modula-2 source program; Modula/R;
Zurich/Hamburger",
thesaurus = "Modula; Modula listings; Program compilers; Program
testing",
}
@Article{Yovev:1990:UEU,
author = "C. S. Yovev",
title = "Universal editor unattainable",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "89--92",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zhai:1990:PIC,
author = "Cheng-xiang Zhai",
title = "Preliminary ideas of a conceptual programming
language",
journal = j-SIGPLAN,
volume = "25",
number = "12",
pages = "93--100",
month = dec,
year = "1990",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:00 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Smith:1991:ABL,
author = "Lisa M. C. Smith and Mansur H. Samadzadeh",
title = "An Annotated Bibliography of Literate Programming",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "14--20",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
abstract = "Although literate programming can be considered a
programming style, it would better be categorized asa
new programming paradigm. The entries in this
bibliography illustrate the recent growth of research
and interest in the area of literate programming.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Oklahoma State Univ.,
Stillwater, OK, USA",
classification = "C6110 (Systems analysis and programming)",
keywords = "Bibliography; Literate programming; Programming
paradigm; Programming style",
thesaurus = "Programming",
}
@Article{Pancake:1991:BPD,
author = "Cherri M. Pancake and Sue Utter",
title = "A bibliography of parallel debuggers, 1990 edition",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "21--37",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Calliss:1991:CMC,
author = "Frank W. Calliss",
title = "A comparison of module constructs in programming
languages",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "38--46",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Coward:1991:PFL,
author = "P. David Coward",
title = "Path feasibility, linear optimizers and the evaluate
standard form",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "47--56",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lujun:1991:CIR,
author = "Shang Lujun",
title = "{Cluster}: an informal report",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "57--74",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zhai:1991:PIC,
author = "Cheng-xiang Zhai",
title = "Preliminary {Ideas} of a {Conceptual Programming
Language}",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "77--84",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Watanabe:1991:ELS,
author = "Tan Watanabe and Kazuko Sakuma and Hideyuki Arai and
Kohbun Umetani",
title = "Essential language el($\alpha$) --- a reduced
expression set language for system programming",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "85--98",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stadel:1991:OOP,
author = "Manfred Stadel",
title = "Object oriented programming techniques to replace
software components on the fly in a running program",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "99--108",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Teodosiu:1991:HOP,
author = "Dan Teodosiu",
title = "{HARE}: an optimizing portable compiler for {Scheme}",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "109--120",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Franz:1991:RGT,
author = "Michael Franz",
title = "The rewards of generating true 32-bit code",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "121--123",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ejiogu:1991:TSM,
author = "Lem O. Ejiogu",
title = "{TM}: a systematic methodology of software metrics",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "124--132",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Joy:1991:GRS,
author = "Mike Joy and Tom Axford",
title = "{GCODE}: a revised standard for a graph representation
for functional programs",
journal = j-SIGPLAN,
volume = "26",
number = "1",
pages = "133--139",
month = jan,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:01 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Pemberton:1991:SIA,
author = "Steven Pemberton",
title = "A short introduction to the {ABC} language",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "11--16",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Coyle:1991:BAI,
author = "Christopher Coyle and Peter Crogono",
title = "Building abstract iterators using continuations",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "17--24",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gold:1991:IRN,
author = "E. Mark Gold",
title = "Incremental reduction with nested constraints",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "25--34",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cashman:1991:BET,
author = "Mark Cashman",
title = "The benefits of enumerated types in {Modula-2}",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "35--39",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kaplan:1991:PRP,
author = "Randy M. Kaplan",
title = "A plea for readable pleas for a readable {Prolog}
programming style",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "41--50",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Klug:1991:VML,
author = "Michael Klug",
title = "{VisiCola}, a model and a language for visibility
control in programming languages",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "51--63",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Madhav:1991:ICF,
author = "B. I. B. Madhav and Narayan Hegde",
title = "Implementing {C} function calls in rules for an expert
system shell",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "64--66",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Pellegrini:1991:STE,
author = "Marco Pellegrini and Raimondo Sepe",
title = "{SetLog}, a tool for experimenting with new
semantics",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "67--74",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zoran:1991:TWT,
author = "Putnik Zoran and Budimac Zoran and Ivanovic Mirjana",
title = "Turtle walk through functional language",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "75--82",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bernecky:1991:FA,
author = "Robert Bernecky",
title = "{Fortran 90} arrays",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "83--98",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Santo:1991:ESC,
author = "Michele Di Santo and Wilma Russo",
title = "The ensemble system: concurrent programming on a
personal computer",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "99--108",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Keller:1991:AGC,
author = "Wolfgang Keller",
title = "Automated generation of code using backtracking
parsers for attribute grammars",
journal = j-SIGPLAN,
volume = "26",
number = "2",
pages = "109--117",
month = feb,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:03 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Placer:1991:MRN,
author = "John Placer",
title = "Multiparadigm research: a new direction of language
design",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "9--17",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Roberts:1991:NMG,
author = "George H. Roberts",
title = "A note on modifiable grammars",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "18--18",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Roberts:1991:SDU,
author = "George H. Roberts",
title = "Searching in discrete universes",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "19--24",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fantechi:1991:EFD,
author = "A. Fantechi and S. Gnesi and F. Leggio and P. Talini",
title = "Executing the formal definition of {Ada}",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "25--34",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Delrieux:1991:TII,
author = "Claudio Delrieux and Pablo Azero and Fernando Tohme",
title = "Toward integrating imperative and logic programming
paradigms: {WYSIWYG} approach to {PROLOG} programming",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "35--44",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wilson:1991:SIS,
author = "Paul R. Wilson",
title = "Some issues and strategies in heap management and
memory hierarchies",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "45--52",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Konrad:1991:SMM,
author = "Erhard Konrad",
title = "Software metrics, measurement theory, and viewpoints",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "53--62",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Liu:1991:OOC,
author = "Chung-Shyan Liu",
title = "On the object-orientedness of {C++}",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "63--67",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Oyang:1991:EMW,
author = "Yen-Jen Oyang",
title = "Exploiting multi-way branching to boost superscalar
processor performance",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "68--78",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dobler:1991:TPC,
author = "H. Dobler",
title = "Top-down parsing in {Coco-2}",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "79--87",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shepherd:1991:WTP,
author = "Janice C. Shepherd",
title = "Why a two pass front end?",
journal = j-SIGPLAN,
volume = "26",
number = "3",
pages = "88--94",
month = mar,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:04 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wolfe:1991:VIS,
author = "Andrew Wolfe and John P. Shen",
title = "A Variable Instruction Stream Extension to the {VLIW}
Architecture",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "2--14",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Katevenis:1991:RBP,
author = "Manolis Katevenis and Nestoras Tzartzanis",
title = "Reducing the Branch Penalty by Rearranging
Instructions in Double-Width Memory",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "15--27",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Lee:1991:FPP,
author = "Roland L. Lee and Alex Y. Kwok and Fay{\'e} A.
Briggs",
title = "The Floating-Point Performance of a Superscalar
{SPARC} Processor",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "28--37",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Tue Dec 12 09:20:21 MST 1995",
abstract = "The floating point performance of superscalar SPARC
processors is evaluated based on empirical data from 12
benchmarks. This evaluation is done in the context of
two software instruction scheduling optimizations: loop
unrolling and software pipelining, and for three
machine models: 1-scalar, 2-scalar and 4-scalar. The
authors also consider the effect of the memory system
on the performance improvements. Superscalar hardware
alone exhibit little performance improvement without
software optimization. Of the two scheduling methods,
software pipelining more effectively takes advantage of
increased hardware parallelism, and achieves near
optimal speedup on the 4-scalar machine model. The
performance of loop unrolling is restricted by the
limited number of floating point registers in the SPARC
architecture. The best performance level is obtained by
applying both optimization techniques. A superscalar
SPARC processor can provide improved floating point
performance but with significant software and hardware
development costs.",
acknowledgement = ack-nhfb,
affiliation = "Sun Microsyst. Inc., Mountain View, CA, USA",
classification = "C5220 (Computer architecture); C5470 (Performance
evaluation and testing)",
confdate = "8-11 April 1991",
conflocation = "Santa Clara, CA, USA",
confsponsor = "IEEE; ACM",
keywords = "Benchmarks; Development costs; Floating point
performance; Floating point registers; Hardware
parallelism; Loop unrolling; Memory system; N-scalar
machine models; Optimal speedup; Software instruction
scheduling optimizations; Software pipelining; SPARC
architecture; Superscalar SPARC processor",
thesaurus = "Optimisation; Parallel architectures; Performance
evaluation; Pipeline processing; Scheduling",
}
@Article{Callahan:1991:SP,
author = "David Callahan and Ken Kennedy and Allan Porterfield",
title = "Software Prefetching",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "40--52",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Sohi:1991:HBD,
author = "Gurindar S. Sohi and Manoj Franklin",
title = "High-Bandwidth Data Memory Systems for Superscalar
Processors",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "53--62",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Lam:1991:CPO,
author = "Monica S. Lam and Edward E. Rothberg and Michael E.
Wolf",
title = "The Cache Performance and Optimization of Blocked
Algorithms",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "63--74",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Wed Aug 31 17:52:24 1994",
acknowledgement = ack-nhfb,
}
@Article{Mogul:1991:ECS,
author = "Jeffrey C. Mogul and Anita Borg",
title = "The Effect of Context Switches on Cache Performance",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "75--84",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Keppel:1991:PIF,
author = "David Keppel",
title = "A Portable Interface for On-the-Fly Instruction Space
Modification",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "86--95",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Appel:1991:VMP,
author = "Andrew W. Appel and Kai Li",
title = "Virtual Memory Primitives for User Programs",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "96--107",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Anderson:1991:IAO,
author = "Thomas E. Anderson and Henry M. Levy and Brian N.
Bershad and Edward D. Lazowska",
title = "The Interaction of Architecture and Operating System
Design",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "108--120",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Bradlee:1991:IRA,
author = "David G. Bradlee and Susan J. Eggers and Robert R.
Henry",
title = "Integrating Register Allocation and Instruction
Scheduling for {RISCs}",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "122--131",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Benitez:1991:CGS,
author = "Manuel E. Benitez and Jack W. Davidson",
title = "Code Generation for Streaming: An Access\slash Execute
Mechanism",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "132--141",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Bagrodia:1991:EIH,
author = "Rajiv Bagrodia and Sharad Mathur",
title = "Efficient Implementation of High Level Parallel
Programs",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "142--151",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Mangione-Smith:1991:VRD,
author = "William Mangione-Smith and Santosh G. Abraham and
Edward S. Davidson",
title = "Vector Register Design for Polycyclic Vector
Scheduling",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "154--163",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Culler:1991:FGP,
author = "David E. Culler and Anurag Sah and Klaus E. Schauser
and Thorsten von Eicken and John Wawrzynek",
title = "Fine-Grain Parallelism with Minimal Hardware Support:
{A} Compiler-Controlled Threaded Abstract Machine",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "164--175",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Wall:1991:LIL,
author = "David W. Wall",
title = "Limits of Instruction-Level Parallelism",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "176--188",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Lee:1991:PCP,
author = "Edward K. Lee and Randy H. Katz",
title = "Performance Consequences of Parity Placement in Disk
Arrays",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "190--199",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Cate:1991:ICC,
author = "Vincent Cate and Thomas Gross",
title = "Integration of Compression and Caching for a Two-Level
File System",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "200--211",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Bolosky:1991:NPT,
author = "William J. Bolosky and Michael L. Scott and Robert P.
Fitzgerald and Robert J. Fowler and Alan L. Cox",
title = "{NUMA} Policies and Their Relation to Memory
Architecture",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "212--221",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Chaiken:1991:LDS,
author = "David Chaiken and John Kubiatowicz and Anant Agarwal",
title = "{LimitLESS} Directories: {A} Scalable Cache Coherence
Scheme",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "224--234",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Min:1991:ECB,
author = "Sang Lyul Min and Jong-Deok Choi",
title = "An Efficient Cache-Based Access Anomaly Detection
Scheme",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "235--244",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Gharachorloo:1991:PEM,
author = "Kourosh Gharachorloo and Anoop Gupta and John L.
Hennessy",
title = "Performance Evaluation of Memory Consistency Models
for Shared Memory Multiprocessors",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "245--257",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Freudenthal:1991:PCF,
author = "Eric Freudenthal and Allan Gottlieb",
title = "Process Coordination with Fetch-and-Increment",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "260--268",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Mellor-Crummey:1991:SC,
author = "John M. Mellor-Crummey and Michael L. Scott",
title = "Synchronization without Contention",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "269--278",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Johnson:1991:CRB,
author = "Douglas Johnson",
title = "The Case for a Read Barrier",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "279--287",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sat May 01 18:50:04 1999",
acknowledgement = ack-nhfb,
}
@Article{Cmelik:1991:AMS,
author = "Robert F. Cmelik and Shing I. Kong and David R. Ditzel
and Edmund J. Kelly",
title = "An Analysis of {MIPS} and {SPARC} Instruction Set
Utilization on the {SPEC} Benchmarks",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "290--301 (or 290--302??)",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Tue Dec 12 09:20:21 MST 1995",
abstract = "The dynamic instruction counts of MIPS and SPARC are
compared using the SPEC benchmarks. MIPS typically
executes more user-level instructions than SPARC. This
difference can be accounted for by architectural
differences, compiler differences, and library
differences. The most significant differences are that
SPARC's double-precision floating point load/store is
an architectural advantage in the SPEC floating point
benchmarks while MIPS's compare-and-branch instruction
is an architectural advantage in the SPEC integer
benchmarks. After the differences in the two
architectures are isolated, it appears that although
MIPS and SPARC each have strengths and weaknesses in
their compilers and library routines, the combined
effect of compilers and library routines does not give
either MIPS or SPARC a clear advantage in these
areas.",
acknowledgement = ack-nhfb,
affiliation = "Sun Microsyst. Inc., Mountain View, CA, USA",
classification = "C5220 (Computer architecture); C5470 (Performance
evaluation and testing); C6140B (Machine-oriented
languages)",
confdate = "8-11 April 1991",
conflocation = "Santa Clara, CA, USA",
confsponsor = "IEEE; ACM",
keywords = "Architectural differences; Compare-and-branch
instruction; Compiler differences; Double-precision
floating point load/store; Dynamic instruction counts;
Instruction set utilization; Library differences; MIPS;
SPARC; SPEC floating point benchmarks; SPEC integer
benchmarks; User-level instructions",
thesaurus = "Instruction sets; Performance evaluation; Reduced
instruction set computing",
}
@Article{Hall:1991:PCA,
author = "C. Brian Hall and Kevin O'Brien",
title = "Performance Characteristics of Architectural Features
of the {IBM RISC System\slash 6000}",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "303--309",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Wed Aug 31 17:51:41 1994",
acknowledgement = ack-nhfb,
}
@Article{Bhandarkar:1991:PAC,
author = "Dileep Bhandarkar and Douglas W. Clark",
title = "Performance from Architecture: Comparing a {RISC} and
a {CISC} with Similar Hardware Organization",
journal = j-SIGPLAN,
volume = "26",
number = "4",
pages = "310--319",
month = apr,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Wed Aug 31 17:50:39 1994",
acknowledgement = ack-nhfb,
}
@Article{Meeson:1991:BRD,
author = "Reginald Meeson",
title = "Book Review: {Data Abstraction and Object-Oriented
Programming in C++ by Keith Gorlen, Sanford Orlow, and
Perry Plexico: (John Wiley \& Sons, 1990)}",
journal = j-SIGPLAN,
volume = "26",
number = "5",
pages = "25--26",
month = may,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:06 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zuse:1991:EKS,
author = "Horst Zuse and Peter Bollmann",
title = "Erhard {Konrad}: software metrics, measurement theory,
and viewpoints-critical remarks on a new approach",
journal = j-SIGPLAN,
volume = "26",
number = "5",
pages = "27--36",
month = may,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:06 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cohen:1991:TRU,
author = "Ellis S. Cohen",
title = "Trip report: {UIST'90 The Annual Symposium on User
Interface Software and Technology Snowbird, Utah,
October 3--5, 1990}",
journal = j-SIGPLAN,
volume = "26",
number = "5",
pages = "37--42",
month = may,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:06 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McNally:1991:TMI,
author = "David J. McNally and Antony J. T. Davie",
title = "Two models for integrating persistence and lazy
functional languages",
journal = j-SIGPLAN,
volume = "26",
number = "5",
pages = "43--52",
month = may,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:06 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sicherman:1991:ALD,
author = "G. L. Sicherman",
title = "An {Algorithmic Language} for {Database Operations}",
journal = j-SIGPLAN,
volume = "26",
number = "5",
pages = "53--58",
month = may,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:06 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rekers:1991:SPA,
author = "Jan Rekers and Wilco Koorn",
title = "Substring parsing for arbitrary context-free
grammars",
journal = j-SIGPLAN,
volume = "26",
number = "5",
pages = "59--66",
month = may,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:06 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Maydan:1991:EED,
author = "Dror E. Maydan and John L. Hennessy and Monica S.
Lam",
title = "Efficient and exact data dependence analysis",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "1--14",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p1-maydan/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance",
subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES,
Concurrent Programming, Parallel programming. {\bf
G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization, Integer programming. {\bf G.1.6}
Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization, Linear programming.",
}
@Article{Goff:1991:PDT,
author = "Gina Goff and Ken Kennedy and Chau-Wen Tseng",
title = "Practical dependence testing",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "15--29",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p15-goff/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design",
subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Concurrent programming
structures. {\bf G.1.6} Mathematics of Computing,
NUMERICAL ANALYSIS, Optimization.",
}
@Article{Wolf:1991:DLO,
author = "Michael E. Wolf and Monica S. Lam",
title = "A data locality optimizing algorithm",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "30--44",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p30-wolf/",
acknowledgement = ack-nhfb,
keywords = "algorithms; performance",
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,
Computations on matrices.",
}
@Article{Morris:1991:CPC,
author = "W. G. Morris",
title = "{CCG}: a prototype coagulating code generator",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "45--58",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p45-morris/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Code generation. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Control structures.",
}
@Article{Wall:1991:PPB,
author = "David W. Wall",
title = "Predicting program behavior using real or estimated
profiles",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "59--70",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p59-wall/",
acknowledgement = ack-nhfb,
keywords = "measurement; reliability; verification",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf D.2.5} Software,
SOFTWARE ENGINEERING, Testing and Debugging.",
}
@Article{McFarling:1991:PMI,
author = "Scott McFarling",
title = "Procedure merging with instruction caches",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "71--79",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p71-mcfarling/",
acknowledgement = ack-nhfb,
keywords = "performance",
subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Procedures, functions, and
subroutines. {\bf D.3.4} Software, PROGRAMMING
LANGUAGES, Processors, Optimization.",
}
@Article{Launchbury:1991:SBA,
author = "John Launchbury",
title = "Strictness and binding-time analyses: two for the
price of one",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "80--91",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p80-launchbury/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance",
subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Procedures, functions, and
subroutines. {\bf D.3.4} Software, PROGRAMMING
LANGUAGES, Processors. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Functional constructs.",
}
@Article{Launchbury:1991:SBT,
author = "John Launchbury",
title = "Strictness and binding-time analyses: two for the
price of one",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "80--91",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Consel:1991:PPE,
author = "Charles Consel and Siau Cheng Khoo",
title = "Parameterized partial evaluation",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "92--106",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p92-consel/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; languages",
subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Semantics of Programming Languages,
Algebraic approaches to semantics. {\bf D.3.3}
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features. {\bf F.3.3} Theory of Computation, LOGICS
AND MEANINGS OF PROGRAMS, Studies of Program
Constructs.",
}
@Article{Venkatesh:1991:SAP,
author = "G. A. Venkatesh",
title = "The semantic approach to program slicing",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "107--119",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p107-venkatesh/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages",
subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
and Debugging, Debugging aids. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs. {\bf F.3.2} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
of Programming Languages, Denotational semantics.",
}
@Article{Whitfield:1991:AGG,
author = "Deborah Whitfield and Mary Lou Soffa",
title = "Automatic generation of global optimizers",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "120--129",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p120-whitfield/",
acknowledgement = ack-nhfb,
keywords = "algorithms; experimentation; languages; performance",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers.",
}
@Article{Chatterjee:1991:SAI,
author = "Siddhartha Chatterjee and Guy E. Blelloch and Allan L.
Fisher",
title = "Size and access inference for data-parallel programs",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "130--144",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p130-chatterjee/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages; measurement; performance",
subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES,
Concurrent Programming, Parallel programming. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Compilers. {\bf D.2.8} Software, SOFTWARE ENGINEERING,
Metrics, Performance measures. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf G.2.2}
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Graph algorithms.",
}
@Article{Bromley:1991:FAT,
author = "Mark Bromley and Steven Heller and Tim McNerney and
Guy L. {Steele, Jr.}",
title = "{Fortran} at ten gigaflops: the {Connection Machine}
convolution compiler",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "145--156",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p145-bromley/",
abstract = "The authors have implemented a prototype of a
specialized compiler module and associated run-time
support that allows a Fortran user to achieve sustained
floating-point performance of over 10 gigaflops on the
Connection Machine Model CM-2. This improves
substantially over the previous record of 5.6
gigaflops, which was achieved by means of hand-crafted
low-level coding techniques. The compiler module
processes array assignment statements of a certain
form: the right-hand side must be a sum of products and
the products must use the Fortran 90 array shifting
intrinsics in a certain stylized pattern. Such
assignment statements are suitable for expressing array
convolution (stencil) computations and can be executed
efficiently by chained multiply-add operations.",
acknowledgement = ack-nhfb,
affiliation = "Thinking Machines Corp., Cambridge, MA, USA",
classification = "C5440 (Multiprocessor systems and techniques); C6110
(Systems analysis and programming); C6140D (High level
languages); C6150C (Compilers, interpreters and other
processors)",
confdate = "26-28 June 1991",
conflocation = "Toronto, Ont., Canada",
confsponsor = "ACM",
keywords = "Array assignment statements; Array convolution;
Chained multiply-add operations; Connection Machine
convolution compiler; Connection Machine Model CM-2;
Fortran 90 array shifting intrinsics; Fortran user;
Hand-crafted low-level coding techniques; languages;
performance; Run-time support; Specialized compiler
module; Sustained floating-point performance",
subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, FORTRAN. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Compilers.",
thesaurus = "FORTRAN; Parallel machines; Parallel programming;
Program compilers",
}
@Article{Bromley:1991:FTG,
author = "Mark Bromley and Steven Heller and Tim McNerney and
Guy L. {Steele, Jr.}",
title = "{Fortran} at ten gigaflops: the {Connection Machine}
convolution compiler",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "145--156",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Boehm:1991:MPG,
author = "Hans-J. Boehm and Alan J. Demers and Scott Shenker",
title = "Mostly parallel garbage collection",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "157--164",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p157-boehm/",
acknowledgement = ack-nhfb,
keywords = "measurement; performance",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors. {\bf D.1.0} Software, PROGRAMMING
TECHNIQUES, General. {\bf D.3.3} Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Concurrent
programming structures.",
}
@Article{Goldberg:1991:TFG,
author = "Benjamin Goldberg",
title = "Tag-free garbage collection for strongly typed
programming languages",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "165--176",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Goldberg:1991:TGC,
author = "Benjamin Goldberg",
title = "Tag-free garbage collection for strongly typed
programming languages",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "165--176",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p165-goldberg/",
acknowledgement = ack-nhfb,
subject = "{\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General.
{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Studies of Program Constructs. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors, Compilers.
{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, LISP. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Procedures, functions, and subroutines.",
}
@Article{Wilson:1991:ESG,
author = "Paul R. Wilson and Michael S. Lam and Thomas G.
Moher",
title = "Effective ``static-graph'' reorganization to improve
locality in garbage-collected systems",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "177--191",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wilson:1991:ESR,
author = "Paul R. Wilson and Michael S. Lam and Thomas G.
Moher",
title = "Effective ``static-graph'' reorganization to improve
locality in garbage-collected systems",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "177--191",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p177-wilson/",
acknowledgement = ack-nhfb,
keywords = "algorithms; measurement; performance",
subject = "{\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General.
{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf E.1}
Data, DATA STRUCTURES, Trees. {\bf D.2.8} Software,
SOFTWARE ENGINEERING, Metrics, Performance measures.",
}
@Article{Callahan:1991:RAH,
author = "David Callahan and Brian Koblenz",
title = "Register allocation via hierarchical graph coloring",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "192--203",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p192-callahan/",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE
MATHEMATICS, Graph Theory, Trees. {\bf F.2.2} Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors,
Optimization.",
}
@Article{Gao:1991:TPM,
author = "Guang R. Gao and Yue-Bong Wong and Qi Ning",
title = "A timed {Petri}-net model for fine-grain loop
scheduling",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "204--218",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p204-gao/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; experimentation; theory",
subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Concurrent programming
structures. {\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.",
}
@Article{Gao:1991:TPN,
author = "Guang R. Gao and Yue-Bong Wong and Qi Ning",
title = "A timed {Petri-net} model for fine-grain loop
scheduling",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "204--218",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jain:1991:CSN,
author = "Suneel Jain",
title = "Circular scheduling: a new technique to perform
software pipelining",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "219--228",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p219-jain/",
abstract = "With the advent of deeply pipelined RISC processors,
static instruction scheduling by the compiler has
become extremely important to obtain high processor
performance. This is especially true for floating point
code. The author suggests using a new algorithm called
circular scheduling to perform software pipelining.
Software pipelining has previously been investigated
mostly for VLIW architectures. The algorithm described
is shown to be quite effective for a scalar
architecture. Register renaming, an idea that
originates from dynamic instruction scheduling, is used
in conjunction with this algorithm to augment its
performance. The techniques described here have been
implemented as part of a commercial, production quality
optimizing compiler for a RISC architecture. The
resulting performance improvement has verified the
feasibility and practicality of the techniques.",
acknowledgement = ack-nhfb,
affiliation = "MIPS Comput. Syst. Inc., Sunnyvale, CA, USA",
classification = "C5220 (Computer architecture); C6110 (Systems
analysis and programming); C6150C (Compilers,
interpreters and other processors); C6150J (Operating
systems)",
confdate = "26-28 June 1991",
conflocation = "Toronto, Ont., Canada",
confsponsor = "ACM",
keywords = "algorithms; Circular scheduling; Deeply pipelined RISC
processors; Dynamic instruction scheduling;
experimentation; performance; Production quality
optimizing compiler; RISC architecture; Scalar
architecture; Software pipelining; Static instruction
scheduling; VLIW architectures",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Compilers. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Optimization.",
thesaurus = "Parallel programming; Pipeline processing; Program
compilers; Reduced instruction set computing;
Scheduling",
}
@Article{Bradlee:1991:MSR,
author = "David G. Bradlee and Robert R. Henry and Susan J.
Eggers",
title = "The {Marion} system for retargetable instruction
scheduling",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "229--240",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p229-bradlee/",
acknowledgement = ack-nhfb,
keywords = "design; languages",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Code generation.
{\bf C.1.3} Computer Systems Organization, PROCESSOR
ARCHITECTURES, Other Architecture Styles. {\bf B.5.2}
Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION,
Design Aids, Hardware description languages.",
}
@Article{Bernstein:1991:GIS,
author = "David Bernstein and Michael Rodeh",
title = "Global instruction scheduling for superscalar
machines",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "241--255",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p241-bernstein/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; performance",
subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization. {\bf F.3.3} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
of Program Constructs, Control primitives. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors, Compilers.
{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory.",
}
@Article{Proebsting:1991:LOC,
author = "Todd A. Proebsting and Charles N. Fischer",
title = "Linear-time, optimal code scheduling for delayed-load
architectures",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "256--267",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu May 13 12:37:27 MDT 1999",
bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p256-proebsting/",
acknowledgement = ack-nhfb,
keywords = "algorithms",
subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Computations on discrete
structures. {\bf G.2.2} Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.4}
Software, PROGRAMMING LANGUAGES, Processors,
Optimization.",
}
@Article{Proebsting:1991:LTO,
author = "Todd A. Proebsting and Charles N. Fischer",
title = "Linear-time, optimal code scheduling for delayed-load
architectures",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "256--267",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Freeman:1991:RTM,
author = "Tim Freeman and Frank Pfenning",
title = "Refinement types for {ML}",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "268--277",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p268-freeman/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages",
subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, ML. {\bf F.3.3} Theory of Computation,
LOGICS AND MEANINGS OF PROGRAMS, Studies of Program
Constructs, Type structure. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Data types and structures. {\bf F.3.3} Theory
of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Studies of Program Constructs, Functional constructs.",
}
@Article{Cartwright:1991:ST,
author = "Robert Cartwright and Mike Fagan",
title = "Soft typing",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "278--292",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p278-cartwright/",
acknowledgement = ack-nhfb,
keywords = "languages",
subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Studies of Program Constructs, Type
structure. {\bf D.3.3} Software, PROGRAMMING LANGUAGES,
Language Constructs and Features, Procedures,
functions, and subroutines. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications, ML.
{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Semantics of Programming Languages.",
}
@Article{Reppy:1991:CHC,
author = "John H. Reppy",
title = "{CML}: {A} higher concurrent language",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "293--305",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p293-reppy/",
acknowledgement = ack-nhfb,
keywords = "design; languages; measurement; performance",
subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
Classifications, Concurrent, distributed, and parallel
languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
Language Classifications, ML. {\bf D.3.3} Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Concurrent programming structures. {\bf
D.3.3} Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Procedures, functions, and
subroutines.",
}
@Article{Jaffar:1991:MMH,
author = "Joxan Jaffar and Spiro Michaylov and Roland H. C.
Yap",
title = "A methodology for managing hard constraints in {CLP}
systems",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "306--316",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p306-jaffar/",
acknowledgement = ack-nhfb,
keywords = "design; languages",
subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Logic and
constraint programming. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications,
Prolog. {\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Optimization.",
}
@Article{Fritzson:1991:GAD,
author = "Peter Fritzson and Tibor Gyimothy and Mariam Kamkar
and Nahid Shahmehri",
title = "Generalized algorithmic debugging and testing",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "317--326",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p317-fritzson/",
acknowledgement = ack-nhfb,
keywords = "algorithms; design; languages; theory",
subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
and Debugging, Debugging aids. {\bf I.2.2} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Automatic
Programming, Program verification. {\bf D.2.5}
Software, SOFTWARE ENGINEERING, Testing and Debugging,
Tracing.",
}
@Article{Bertot:1991:ODS,
author = "Yves Bertot",
title = "Occurrences in debugger specifications",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "327--337",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p327-bertot/",
acknowledgement = ack-nhfb,
keywords = "algorithms; languages",
subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic, Lambda
calculus and related systems. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications, OCCAM.
{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Semantics of Programming Languages. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Interpreters. {\bf D.2.5} Software, SOFTWARE
ENGINEERING, Testing and Debugging, Tracing.",
}
@Article{Kishon:1991:MSF,
author = "Amir Kishon and Paul Hudak and Charles Consel",
title = "Monitoring semantics: a formal framework for
specifying, implementing, and reasoning about execution
monitors",
journal = j-SIGPLAN,
volume = "26",
number = "6",
pages = "338--352",
month = jun,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:07 MST 2003",
bibsource = "http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p338-kishon/",
acknowledgement = ack-nhfb,
keywords = "languages",
subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
and Debugging, Monitors. {\bf F.3.2} Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
of Programming Languages, Denotational semantics.",
}
@Article{Nicolau:1991:OSP,
author = "Alexandru Nicolau and Haigeng Wang",
title = "Optimal schedules for parallel prefix computation with
bounded resources",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "1--10",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yang:1991:PPT,
author = "J. Allan Yang and Young-il Choo",
title = "Parallel-program transformation using a metalanguage",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "11--20",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bakewell:1991:MCP,
author = "Hester Bakewell and Donna J. Quammen and Pearl Y.
Wang",
title = "Mapping concurrent programs to {VLIW} processors",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "21--27",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lu:1991:UFS,
author = "Lee-Chung Lu",
title = "A unified framework for systematic loop
transformations",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "28--38",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ancourt:1991:SPD,
author = "Corinne Ancourt and Fran{\c{c}}ois Irigoin",
title = "Scanning polyhedra with {DO} loops",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "39--50",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Krothapalli:1991:RRD,
author = "V. P. Krothapalli and P. Sadayappan",
title = "Removal of redundant dependences in {DOACROSS} loops
with constant dependences",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "51--60",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ju:1991:EAD,
author = "Dz-Ching Ju and Wai-Mee Ching",
title = "Exploitation of {APL} data parallelism on a
shared-memory {MIMD} machine",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "61--72",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hatcher:1991:PQC,
author = "Philip J. Hatcher and Anthony J. Lapadula and Robert
R. Jones and Michael J. Quinn and Ray J. Anderson",
title = "A production-quality {C*} compiler for {Hypercube}
multicomputers",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "73--82",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Costa:1991:APP,
author = "V{\'\i}tor Santos Costa and David H. D. Warren and
Rong Yang",
title = "Andorra {I}: a parallel {Prolog} system that
transparently exploits both {And-and} or-parallelism",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "83--93",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lam:1991:CGP,
author = "Monica S. Lam and Martin C. Rinard",
title = "Coarse-grain parallel programming in {Jade}",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "94--105",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mellor-Crummey:1991:SRW,
author = "John M. Mellor-Crummey and Michael L. Scott",
title = "Scalable reader-writer synchronization for
shared-memory multiprocessors",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "106--113",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Feeley:1991:DNR,
author = "Michael J. Feeley and Brian N. Bershad and Jeffrey S.
Chase and Henry M. Levy",
title = "Dynamic node reconfiguration in a parallel-distributed
environment",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "114--121",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{LaRowe:1991:EOS,
author = "Richard P. {LaRowe, Jr.} and James T. Wilkes and Carla
S. Ellis",
title = "Exploiting operating system support for dynamic page
placement on a {NUMA} shared memory multiprocessor",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "122--132",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Netzer:1991:IAD,
author = "Robert H. B. Netzer and Barton P. Miller",
title = "Improving the Accuracy of Data Race Detection",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "133--144",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Choi:1991:RFR,
author = "Jong-Deok Choi and Sang Lyul Min",
title = "Race {Frontier}: reproducing data races in
parallel-program debugging",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "145--154",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bacon:1991:OPC,
author = "David F. Bacon and Robert E. Strom",
title = "Optimistic parallelization of communicating sequential
processes",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "155--166",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kung:1991:PNC,
author = "H. T. Kung and Peter Steenkiste and Marco Gubitoso and
Manpreet Khaira",
title = "Parallelizing a new class of large applications over
high-speed networks",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "167--177",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meier:1991:PPC,
author = "Ulrike Meier and Rudolf Eigenmann",
title = "Parallelization and performance of {Conjugate
Gradient} algorithms on the {Cedar} hierarchical-memory
multiprocessor",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "178--188",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hollingsworth:1991:IAS,
author = "Jeffrey K. Hollingsworth and R. Bruce Irvin and Barton
P. Miller",
title = "The integration of application and system based
metrics in a parallel program performance tool",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "189--200",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Malony:1991:EBP,
author = "Allen D. Malony",
title = "Event-based performance perturbation: a case study",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "201--212",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Balasundaram:1991:SPE,
author = "Vasanth Balasundaram and Geoffrey Fox and Ken Kennedy
and Ulrich Kremer",
title = "A static performance estimator to guide data
partitioning decisions",
journal = j-SIGPLAN,
volume = "26",
number = "7",
pages = "213--223",
month = jul,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:09 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Waters:1991:SVC,
author = "Richard C. Waters",
title = "System validation via constraint modeling",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "27--36",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sakkinen:1991:ADE,
author = "Markku Sakkinen",
title = "Another defense of enumerated types",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "37--41",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kaplan:1991:PL,
author = "Randy M. Kaplan",
title = "The {IL} programming language",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "42--49",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Heymann:1991:CAM,
author = "J{\"u}rgen Heymann",
title = "A comprehensive analytical model for garbage
collection algorithms",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "50--59",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kempe:1991:CTA,
author = "J. Kempe and T. Lenz and B. Freitag and H. Sh{\"u}tz
and G. Specht",
title = "{CL\slash TB} an allegro common {Lisp} programming
interface for {TransBase}",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "60--69",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fiterman:1991:MVP,
author = "Charles Fiterman",
title = "Multiple view programming languages",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "70--73",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Spinellis:1991:TSL,
author = "Diomidis Spinellis",
title = "Type-safe Linkage for Variables and Functions",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "74--79",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
URL = "http://kerkis.math.aegean.gr/~dspin/pubs/jrnl/1991-SIGPLAN-CType/html/tsl.html",
acknowledgement = ack-nhfb,
keys = "Linking Have",
where = "IC-photocopy",
}
@Article{Eckart:1991:CAS,
author = "J. Dana Eckart",
title = "A cellular automata simulation system",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "80--85",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McLaughlin:1991:TLS,
author = "Robert McLaughlin",
title = "Thoughts on large scale programming projects",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "86--89",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Butcher:1991:LO,
author = "Paul Butcher and Hussein Zedan",
title = "Lucinda --- an overview",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "90--100",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ishikawa:1991:RFR,
author = "Yutaka Ishikawa",
title = "Reflection facilities and realistic programming",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "101--110",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gruzlewski:1991:SCS,
author = "Tadeusz Gru{\'z}lewski and Zbigniew Weiss",
title = "Semantic correctness of structural editing",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "111--120",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wong:1991:DVF,
author = "K. C. Wong",
title = "Detection of version features in distributed systems",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "121--127",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yuasa:1991:BIE,
author = "Kei Yuasa",
title = "A browsing interface for {S-expressions}",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "128--136",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{MacDonell:1991:RCD,
author = "Stephen MacDonell",
title = "Reliance on correlation data for complexity metric use
and validation",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "137--144",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Baker:1991:SBM,
author = "Henry G. Baker",
title = "Shallow binding makes functional arrays fast",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "145--147",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{vonIssendorff:1991:TO,
author = "Hermann von Issendorff",
title = "A theory of organization",
journal = j-SIGPLAN,
volume = "26",
number = "8",
pages = "148--150",
month = aug,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:10 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Takano:1991:GPC,
author = "Akihiko Takano",
title = "Generalized partial computation for a lazy functional
language",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "1--11",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Romanenko:1991:IM,
author = "Alexander Romanenko",
title = "Inversion and metacomputation",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "12--22",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sahlin:1991:DAF,
author = "Dan Sahlin",
title = "Determinacy analysis for full {Prolog}",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "23--30",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lisper:1991:DSA,
author = "Bj{\"o}rn Lisper",
title = "Detecting static algorithms by partial evaluation",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "31--42",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hickey:1991:TPE,
author = "Timothy J. Hickey and Donald A. Smith",
title = "Toward the partial evaluation of {CLP} languages",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "43--51",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cortesi:1991:AIL,
author = "Agostino Cortesi and Gilbert Fil{\'e}",
title = "Abstract interpretation of logic programs: an abstract
domain for groundness, sharing, freeness and
compoundness analysis",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "52--61",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Smith:1991:PEP,
author = "Donald A. Smith",
title = "Partial evaluation of pattern matching in constraint
logic programming languages",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "62--71",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sherman:1991:OEP,
author = "David Sherman and Robert Strandh and Ir{\`e}ne
Durand",
title = "Optimization of equational programs using partial
evaluation",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "72--82",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sundaresh:1991:BIP,
author = "R. S. Sundaresh",
title = "Building incremental programs using partial
evaluation",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "83--93",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meyer:1991:TPE,
author = "Uwe Meyer",
title = "Techniques for partial evaluation of imperative
languages",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "94--105",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McNerney:1991:VCC,
author = "Timothy S. McNerney",
title = "Verifying the correctness of compiler transformations
on basic blocks using abstract interpretation",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "106--115",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ariola:1991:SAP,
author = "Zena M. Ariola",
title = "A syntactic approach to program transformations",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "116--129",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hannan:1991:STA,
author = "John Hannan",
title = "Staging transformations for abstract machines",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "130--141",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Niel:1991:PBP,
author = "Anne De Niel and Eddy Bevers and Karel De Vlaminck",
title = "Program bifurcation for a polymorphically typed
functional language",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "142--153",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hunt:1991:BTA,
author = "Sebastian Hunt and David Sands",
title = "Binding time analysis: a new {PERspective}",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "154--165",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gomard:1991:GLV,
author = "Carsten K. Gomard and Peter Sestoft",
title = "Globalization and live variables",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "166--177",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Park:1991:REA,
author = "Young Gil Park and Benjamin Goldberg",
title = "Reference escape analysis: optimizing reference
counting based on the lifetime of references",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "178--189",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shivers:1991:SSC,
author = "Olin Shivers",
title = "The semantics of {Scheme} control-flow analysis",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "190--198",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Klimov:1991:DSE,
author = "Andrei V. Klimov",
title = "Dynamic specialization in extended functional language
with monotone objects",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "199--210",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Khoo:1991:CIU,
author = "Siau Cheng Khoo and R. S. Sundaresh",
title = "Compiling inheritance using partial evaluation",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "211--222",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Holst:1991:PEF,
author = "Carsten Kehler Holst and Darsten Krogh Gomard",
title = "Partial evaluation is fuller laziness",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "223--233",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Muller:1991:MLN,
author = "Robert Muller",
title = "{M-LISP}: its natural semantics and equational logic",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "234--242",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hansen:1991:PUB,
author = "Torben Amtoft Hansen",
title = "Properties of unfolding-based meta-level systems",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "243--254",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wadler:1991:TUL,
author = "Philip Wadler",
title = "Is there a use for linear logic?",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "255--273",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Proietti:1991:SPT,
author = "Maurizio Proietti and Alberto Pettorossi",
title = "Semantics preserving transformation rules for
{Prolog}",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "274--284",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Michaylov:1991:CPS,
author = "Spiro Michaylov and Frank Pfenning",
title = "Compiling the polymorphic $\lambda$-calculus",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "285--296",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mason:1991:PTC,
author = "Ian A. Mason and Carolyn L. Talcott",
title = "Program transformations for configuring components",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "297--308",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gluck:1991:TMS,
author = "Robert Gl{\"u}ck",
title = "Towards multiple self-application",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "309--320",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ruf:1991:UTA,
author = "Erik Ruf and Daniel Weise",
title = "Using types to avoid redundant specialization",
journal = j-SIGPLAN,
volume = "26",
number = "9",
pages = "321--333",
month = sep,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:11 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hook:1991:BRS,
author = "Audrey A. Hook",
title = "Book Review: {The Software Factory: Managing Software
Development and Maintenance (2nd. Ed) by James R.
Johnson: (QED Information Sciences, Inc. 1991)}",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "8--8",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Creak:1991:GFI,
author = "G. Alan Creak",
title = "Garbage-further investigations",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "9--10",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kilov:1991:OCB,
author = "Haim Kilov",
title = "Objects concepts and bibliography",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "11--12",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{LeJacq:1991:FPO,
author = "Jean Pierre LeJacq",
title = "Function preconditions in object oriented software",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "13--18",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carpentieri:1991:CTT,
author = "B. Carpentieri and G. Mou",
title = "Compile-time transformations and optimization of
parallel {Divide-and-Conquer} algorithms",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "19--28",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fraser:1991:RCA,
author = "Christopher W. Fraser",
title = "A retargetable compiler for {ANSI C}",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "29--43",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Fri Feb 17 18:38:15 2006",
bibsource = "http://portal.acm.org/",
URL = "http://storage.webhop.net/documents/overview.pdf",
acknowledgement = ack-nhfb,
}
@Article{Tang:1991:CDC,
author = "L. S. Tang",
title = "{C++}'s destructors can be destructive",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "44--52",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Craske:1991:SOO,
author = "Noel Craske",
title = "{SNOOPS}: {An} object-oriented language enhancement
supporting dynamic program reconfiguration",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "53--63",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nelson:1991:COO,
author = "Michael L. Nelson",
title = "Concurrency {\&} object-oriented programming",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "63--72",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Miloucheva:1991:CSE,
author = "Ilka Miloucheva and Hans Loeper",
title = "Compiler structure engineering with attribute
grammars",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "73--82",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yuen:1991:WMP,
author = "C. K. Yuen",
title = "Which model of programming for {LISP}: sequential,
functional or mixed?",
journal = j-SIGPLAN,
volume = "26",
number = "10",
pages = "83--92",
month = oct,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:12 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chambers:1991:MPO,
author = "Craig Chambers and David Ungar",
title = "Making pure object-oriented languages practical",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "1--15",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sharma:1991:PGG,
author = "Ravi Sharma and Mary Lou Soffa",
title = "Parallel generational garbage collection",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "16--32",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hayes:1991:UKO,
author = "Barry Hayes",
title = "Using key object opportunism to collect old objects",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "33--46",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Helm:1991:IIR,
author = "Richard Helm and Yo{\"e}lle S. Maarek",
title = "Integrating information retrieval and domain specific
approaches for browsing and retrieval in
object-oriented class libraries",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "47--61",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gold:1991:PIC,
author = "Eric Gold and Mary Beth Rosson",
title = "{Portia}: an instance-centered environment for
{Smalltalk}",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "62--74",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Konstan:1991:DGU,
author = "Joseph A. Konstan and Lawrence A. Rowe",
title = "Developing a {GUIDE} using object-oriented
programming",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "75--88",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Guimaraes:1991:BGU,
author = "Nuno Guimar{\~a}es",
title = "Building generic user interface tools: an experience
with multiple inheritance",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "89--96",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gibbs:1991:CMA,
author = "Simon Gibbs",
title = "Composite multimedia and active objects",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "97--112",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Agrawal:1991:STC,
author = "Rakesh Agrawal and Linda G. Demichiel and Bruce G.
Lindsay",
title = "Static type checking of multi-methods",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "113--128",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ghelli:1991:STS,
author = "Giorgio Ghelli",
title = "A static type system for message passing",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "129--145",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Palsberg:1991:OOT,
author = "Jens Palsberg and Michael I. Schwartzbach",
title = "Object-oriented type inference",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "146--161",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Reed:1991:IMC,
author = "David R. Reed and Marty Cagan and Ted Goldstein and
Barbara Moo",
title = "Issues in moving from {C} to {C++}",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "163--165",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{America:1991:FTO,
author = "Pierre America and Derek Coleman and Roger Duke and
Doug Lea and Gary Leavens",
title = "Formal techniques for {OO} software development",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "166--170",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hayes:1991:CMO,
author = "Fiona Hayes and Derek Coleman",
title = "Coherent models for object-oriented analysis",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "171--183",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lewis:1991:ESO,
author = "John A. Lewis and Sallie M. Henry and Dennis G. Kafura
and Robert S. Schulman",
title = "An empirical study of the object-oriented paradigm and
software reuse",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "184--196",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chidamber:1991:TMS,
author = "Shyam R. Chidamber and Chris F. Kemerer",
title = "Towards a metrics suite for object oriented design",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "197--211",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Andreoli:1991:CFD,
author = "Jean-Marc Andreoli and Remo Pareschi",
title = "Communication as fair distribution of knowledge",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "212--229",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Simmel:1991:KBS,
author = "Sergui S. Simmel and Ivan Godard",
title = "The {Kala} basket: a semantic primitive unifying
object transactions, access control, versions, and
configurations",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "230--246",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yaseen:1991:EKO,
author = "Rahim Yaseen and Stanley Y. W. Su and Herman Lam",
title = "An extensible kernel object management system",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "247--263",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Griss:1991:ESR,
author = "Martin Griss and Sam S. Adams and Howard {Baetjer,
Jr.} and Brad J. Cox and Adele Goldberg",
title = "The economics of software reuse",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "264--270",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hogg:1991:IAP,
author = "John Hogg",
title = "{Islands}: aliasing protection in object-oriented
languages",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "271--285",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wilk:1991:EOO,
author = "Michael R. Wilk",
title = "{Equate}: an object-oriented constraint solver",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "286--298",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bergstein:1991:OPC,
author = "Paul L. Bergstein",
title = "Object-preserving class transformations",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "299--313",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hanson:1991:EDI,
author = "Eric N. Hanson and Tina M. Harvey and Mark A. Roth",
title = "Experiences in {DBMS} implementation using an
object-oriented persistent programming language and a
database toolkit",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "314--328",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Benson:1991:SSD,
author = "Dan Benson and Greg Zick",
title = "Symbolic and spatial database for structural biology",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "329--339",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jacobson:1991:ROS,
author = "Ivar Jacobson and Fredrik Lindstr{\"o}m",
title = "Reengineering of old systems to an object-oriented
architecture",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "340--350",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bobrow:1991:OA,
author = "Daniel Bobrow and Carl Hewitt and Jean-Francois Perror
and Reid Smith and Howard Shrobe",
title = "{OOP} and {AI}",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "351--354",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hazeltine:1991:MTO,
author = "Nelson Hazeltine and Tim Higenberg and Reed Philip and
David Taylor",
title = "Managing the transition to object-oriented
technology",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "355--358",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Snyder:1991:HGY,
author = "Alan Snyder",
title = "How to get your paper accepted at {OOPSLA}",
journal = j-SIGPLAN,
volume = "26",
number = "11",
pages = "359--363",
month = nov,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:13 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Malony:1991:MPP,
author = "Allen D. Malony and Daniel A. Reed",
title = "Models for Performance Perturbation Analysis",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "15--25",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Choi:1991:BRR,
author = "Jong-Deok Choi and Janice M. Stone",
title = "Balancing Runtime and Replay Costs in a
Trace-and-Replay System",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "26--35",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Griswold:1991:CAA,
author = "Victor Jon Griswold",
title = "Core Algorithms for Autonomous Monitoring of
Distributed Systems",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "36--45",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zernik:1991:AWT,
author = "Dror Zernik and Larry Rudolph",
title = "Animating Work and Time for Debugging Parallel
Programs Foundation and Experience",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "46--56",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kilpatrick:1991:CAS,
author = "Carol Kilpatrick and Karsten Schwan",
title = "{ChaosMON} --- Application-Specific Monitoring and
Display of Performance Information for Parallel and
Distributed Systems",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "57--67",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Francioni:1991:DPP,
author = "Joan M. Francioni and Larry Albright and Jay Alan
Jackson",
title = "Debugging Parallel Programs Using Sound",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "68--75",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Helmbold:1991:CRS,
author = "David P. Helmbold and Charles E. McDowell",
title = "Computing Reachable States of Parallel Programs",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "76--84",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dinning:1991:DAA,
author = "Anne Dinning and Edith Schonberg",
title = "Detecting Access Anomalies in Programs with Critical
Sections",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "85--96",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Masticola:1991:MAP,
author = "Stephen P. Masticola and Barbara G. Ryder",
title = "A Model of {Ada} Programs for Static Deadlock
Detection in Polynomial Time",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "97--107",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Pineo:1991:DPC,
author = "Patricia Prather Pineo and Mary Lou Soffa",
title = "Debugging Parallelized Code Using Code Liberation
Techniques",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "108--119",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Tolmach:1991:DCE,
author = "Andrew P. Tolmach and Andrew W. Appel",
title = "Debuggable Concurrency Extensions for {Standard ML}",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "120--131",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cohn:1991:SLD,
author = "Robert Cohn",
title = "Source Level Debugging of Automatically Parallelized
Code",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "132--143",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Goldberg:1991:RCG,
author = "Arthur P. Goldberg and Ajei Gopal and Andy Lowry and
Rob Strom",
title = "Restoring Consistent Global States of Distributed
Computations",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "144--154",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Spezialetti:1991:ARD,
author = "Madalene Spezialetti",
title = "An Approach to Reducing Delays in Recognizing
Distributed Event Occurrences",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "155--166",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cooper:1991:CDG,
author = "Robert Cooper and Keith Marzullo",
title = "Consistent Detection of Global Predicates",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "167--174",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gorlick:1991:FRA,
author = "Michael M. Gorlick",
title = "The Flight Recorder: An Architectural Aid for System
Monitoring",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "175--183",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bruegge:1991:PPD,
author = "Bernd Bruegge",
title = "A Portable Platform for Distributed Event
Environments",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "184--193",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bacon:1991:HAR,
author = "David F. Bacon and Seth Copen Goldstein",
title = "Hardware-Assisted Replay of Multiprocessor Programs",
journal = j-SIGPLAN,
volume = "26",
number = "12",
pages = "194--206",
month = dec,
year = "1991",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:15 MST 2003",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib;
http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hook:1992:BRS,
author = "Audrey A. Hook",
title = "Book Review: {Selecting an Ada Compilation System
Edited by J. Dawes, M. J. Pickett, and A. Wearing:
(Cambridge University Press 1990)}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "13--13",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lee:1992:BRR,
author = "J. A. N. Lee",
title = "Book Review: {The Rationale for the Design of the Ada
Programming Language, The Ada Companion Series by J.
ichbiah, J. Barnes, R. Firth, and M. Woodger.:
(Cambridge University Press, Cambridge, UK)}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "14--14",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Burshteyn:1992:UUS,
author = "Boris Burshteyn",
title = "{USSA}: {Universal Syntax and Semantics Analyzer}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "42--60",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kahan:1992:ARL,
author = "W. Kahan",
title = "Analysis and Refutation of the {LCAS}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "61--74",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Thirion:1992:EUC,
author = "Bernard Thirion",
title = "{Edison}, a {Unix} and {C} friendly {Rete} based
production system",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "75--84",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wu:1992:OOS,
author = "Pei-Chi Wu and Feng-Jian Wang",
title = "An object-oriented specification for compiler",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "85--94",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Baker:1992:CAB,
author = "H. G. Baker",
title = "Computing {$A * B \pmod{N}$} efficiently in {ANSI C}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "95--98",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Thu Dec 14 17:21:15 MST 1995",
abstract = "The modular product computation $A * B \mod{N}$ is a
bottleneck for some public-key encryption algorithms,
as well as many exact computations implemented using
the Chinese remainder theorem. The author shows how to
compute $A * B \pmod{N}$ efficiently, for
single-precision $A$, $B$, and $N$, on a modern RISC
architecture (Intel 80860) in ANSI C. On this
architecture, the method computes $A * B \pmod{N}$
faster than ANSI C computes $A \% N$, for unsigned
longs $A$ and $N$.",
acknowledgement = ack-nhfb,
affiliation = "Nimble Comput. Corp., Encino, CA, USA",
classification = "C5230 (Digital arithmetic methods); C6110 (Systems
analysis and programming); C6130S (Data security);
C6140D (High level languages)",
keywords = "ANSI C; Chinese remainder theorem; Exact computations;
Intel 80860; Modular product computation; Public-key
encryption algorithms; RISC architecture;
Single-precision",
thesaurus = "C language; Cryptography; Digital arithmetic;
Programming",
}
@Article{Baker:1992:CME,
author = "Henry G. Baker",
title = "Computing {A*B (mod N)} efficiently in {ANSI C}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "95--98",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ince:1992:APC,
author = "D. C. Ince",
title = "Arrays and pointers considered harmful",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "99--104",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Furtado:1992:AGQ,
author = "Antonio L. Furtado",
title = "Analogy by generalization --- and the quest of the
grail",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "105--113",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nourani:1992:PMS,
author = "Cyrus F. Nourani",
title = "Parallel module specification on {SLPX}",
journal = j-SIGPLAN,
volume = "27",
number = "1",
pages = "114--115",
month = jan,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:16 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wexelblat:1992:BRA,
author = "Alan Wexelblat",
title = "Book Review: {The Art of the Meta-Object Protocol by
Gregor Kiczales, Jim des Rivieres, and Daniel G.
Bobrow: (MIT Press, 1991)}",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "9--9",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Michael:1992:BRU,
author = "Bret Michael",
title = "Book Review: {A Unifying Framework for Structured
Analysis and Design Models by T. H. Tse: (Cambridge
University Press, 1991)}",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "10--11",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hernandez:1992:RME,
author = "Juan Hern{\'a}ndez and Juan Antonio Sanchez",
title = "{RT-MODULA2}: an embedded in {MODULA2} language for
writing concurrent and real time programs",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "26--36",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Arab:1992:EPC,
author = "Mouloud Arab",
title = "Enhancing program comprehension: formatting and
documenting",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "37--46",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gwinn:1992:OOP,
author = "J. M. Gwinn",
title = "Object-oriented programs in realtime",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "47--56",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ryan:1992:LCF,
author = "Steven Ryan",
title = "Linear control flow analysis",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "57--64",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Placer:1992:IDA,
author = "John Placer",
title = "Integrating destructive assignment and lazy evaluation
in the multiparadigm language {G-2}",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "65--74",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Caringal:1992:FIQ,
author = "Rizaldo B. Caringal and Phan Minh Dung",
title = "A {FORTRAN IV} to {QuickBASIC} translator",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "75--87",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Parr:1992:PRM,
author = "T. J. Parr and H. G. Dietz and W. E. Cohen",
title = "{PCCTS} reference manual: version 1.00",
journal = j-SIGPLAN,
volume = "27",
number = "2",
pages = "88--165",
month = feb,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:17 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Baker:1992:CSC,
author = "Henry G. {Baker, Jr.}",
title = "{CONS} Should Not {CONS} its Arguments, or, {A} Lazy
Alloc is a Smart Alloc",
journal = j-SIGPLAN,
volume = "27",
number = "3",
pages = "24--34",
month = mar,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:18 MST 2003",
bibsource = "file://sunspot.math.utah.edu/usr/local/src/bib/bibliography/Compiler/garbage.collection.bib;
http://portal.acm.org/",
note = "Submitted to {\em Communications of the ACM}.",
acknowledgement = ack-nhfb,
}
@Article{Salomon:1992:FDP,
author = "Daniel J. Salomon",
title = "Four {Dimensions} of programming-language
independence",
journal = j-SIGPLAN,
volume = "27",
number = "3",
pages = "35--53",
month = mar,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:18 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mamone:1992:ESM,
author = "Salvatore Mamone",
title = "Empirical study of motivation in a entry level
programming course",
journal = j-SIGPLAN,
volume = "27",
number = "3",
pages = "54--60",
month = mar,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:18 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Watt:1992:CSC,
author = "J. M. Watt",
title = "A compact syntax chart for {Ada}",
journal = j-SIGPLAN,
volume = "27",
number = "3",
pages = "61--65",
month = mar,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:18 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Baker:1992:TRT,
author = "Henry G. Baker",
title = "The treadmill: real-time garbage collection without
motion sickness",
journal = j-SIGPLAN,
volume = "27",
number = "3",
pages = "66--70",
month = mar,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:18 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anastasio:1992:OCL,
author = "Thomas A. Anastasio and William W. Carlson",
title = "An observation on the {C} library procedure {\tt
random()}",
journal = j-SIGPLAN,
volume = "27",
number = "3",
pages = "71--74",
month = mar,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:18 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Michael:1992:BRD,
author = "James Bret Michael",
title = "Book Review: {Discrete Mathematics: An Introduction
for Software Engineers, by Mike Piff: (Cambridge
University Press, 1991)}",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "10--10",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gladwell:1992:BRF,
author = "Ian Gladwell",
title = "Book Review: {Fortran 90 Explained by M. Metcalf and
J. Reid: (Oxford Science)}",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "11--11",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wu:1992:SRL,
author = "Pei-Chi Wu and Feng-Jian Wang and Kai-Ru Young",
title = "Scanning regular languages by dual finite automata",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "12--16",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Angele:1992:MAC,
author = "J{\"u}rgen Angele and Detlef K{\"u}pper",
title = "{Modula-2} an alternative to {C?}",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "17--26",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Young:1992:TMO,
author = "Norman Young",
title = "Two models of object-oriented programming and the
{Common Lisp Object System}",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "27--36",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gauthier:1992:NFP,
author = "Michel Gauthier",
title = "Noised or filtered programming? (about enumerated
types)",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "37--40",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ipser:1992:ELD,
author = "Edward A. {Ipser, Jr.}",
title = "Exploratory language design",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "41--50",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fischer:1992:TFC,
author = "Ronald Fischer",
title = "Two flaws of the current {C++} language definition",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "51--54",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ryan:1992:LEB,
author = "Steven Ryan",
title = "Linear expression bounding",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "55--58",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ryan:1992:LDF,
author = "Steven Ryan",
title = "Linear data flow analysis",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "59--67",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fraser:1992:BFO,
author = "Christopher W. Fraser and Robert R. Henry and Todd A.
Proebsting",
title = "{BURG}: fast optimal instruction selection and tree
parsing",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "68--76",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{vandenBosch:1992:BSE,
author = "Peter N. van den Bosch",
title = "A bibliography on syntax error handling in context
free languages",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "77--86",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Appel:1992:PMS,
author = "Andrew W. Appel",
title = "Is {POPL} mathematics or science?",
journal = j-SIGPLAN,
volume = "27",
number = "4",
pages = "87--89",
month = apr,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:19 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hudak:1992:GIH,
author = "Paul Hudak and Joseph H. Fasel",
title = "A gentle introduction to {Haskell}",
journal = j-SIGPLAN,
volume = "27",
number = "5",
pages = "1--52",
month = may,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hudak:1992:RPL,
author = "Paul Hudak and Simon Peyton Jones and Philip Wadler
and Brian Boutel and Jon Fairbairn and Joseph Fasel and
Mar{\'\i}a M. Guzm{\'a}n and Kevin Hammond and John
Hughes and Thomas Johnsson and Dick Kieburtz and
Rishiyur Nikhil and Will Partain and John Peterson",
title = "Report on the programming language {Haskell}: a
non-strict, purely functional language (Version 1.2)",
journal = j-SIGPLAN,
volume = "27",
number = "5",
pages = "Ri--Rx, R1--R163",
month = may,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
abstract = "Haskell is a general purpose, purely functional
programming language incorporating many recent
innovations in programming language research, including
higher-order functions, non-strict semantics, static
polymorphic typing, user-defined algebraic datatypes,
pattern-matching, list comprehensions, a module system,
and a rich set of primitive datatypes, including lists,
arrays, arbitrary and fixed precision integers, and
floating-point numbers. Haskell is both the culmination
and solidification of many years of research on
functional languages-the design has been influenced by
languages as old as ISWIM and as new as Miranda. The
report defines the syntax for Haskell programs and an
informal abstract semantics for the meaning of such
programs.",
acknowledgement = ack-nhfb,
affiliation = "Yale Univ., New Haven, CT, USA",
classification = "C6140D (High level languages)",
keywords = "Abstract semantics; Arrays; Fixed precision integers;
Floating-point numbers; Functional programming
language; Haskell; Higher-order functions; List
comprehensions; Lists; Module system; Non-strict
semantics; Pattern-matching; Primitive datatypes;
Static polymorphic typing; Syntax; User-defined
algebraic datatypes",
thesaurus = "Functional programming; High level languages",
}
@Article{Michael:1992:BRV,
author = "James Bret Michael",
title = "Book Review: {Verifying Temporal Properties of
Systems, by Julian Charles Bradfield: (Birkh{\"a}user
Boston, Cambridge, Massachusetts, 1992)}",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "8--8",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meeson:1992:BRIa,
author = "Reginald Meeson",
title = "Book Review: {Implementation of Functional
Multiprocessors by O. Boudillet, J. P. Gupta, and S. C.
Winter: (John Wiley \& Sons Inc. 1991)}",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "9--9",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Casimir:1992:RPD,
author = "Rommert J. Casimir",
title = "Real programmers don't use spreadsheets",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "10--16",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cargille:1992:BWT,
author = "Jon Cargille and Barton P. Miller",
title = "Binary wrapping: a technique for instrumenting object
code",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "17--18",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Leavenworth:1992:PIR,
author = "Burt Leavenworth",
title = "{Proxy}: an interpreter for rapid prototyping",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "19--28",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sabatella:1992:LEC,
author = "Marc Sabatella",
title = "Lazy evaluation of {C++} static constructors",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "29--36",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Coolsaet:1992:QIP,
author = "K. Coolsaet",
title = "A quick introduction to the programming language
{MIKE}",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "37--46",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carrasco:1992:NLM,
author = "Jos{\'e} M. Garc{\'\i}a Carrasco",
title = "A new language for multicomputer programming",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "47--53",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Prather:1992:SC,
author = "Ronald E. Prather",
title = "The semantics of {CAT}",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "54--63",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Trinity Univ., San Antonio, TX, USA",
classification = "C4210 (Formal logic); C6110 (Systems analysis and
programming); C6140D (High level languages)",
keywords = "Cartesian closed categorical framework; CAT language
development; Consistent typing; Constructive notion;
Exact arithmetic; First class; Functorial semantics;
Imperative programming methodologies; Mathematical
theory; Pointers; Programming language; Programming
philosophy; Proof technique; Provable recursiveness;
Recursive structures; Semantic interpretation",
thesaurus = "Computational linguistics; High level languages;
Programming",
}
@Article{onExtensions:1992:HWC,
author = "Corporate X3J16 Working Group on Extensions",
title = "How to write a {C++} language extension proposal for
{ANSI-X3J16\slash ISO-WG21}",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "64--71",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Frost:1992:GAG,
author = "Richard A. Frost",
title = "Guarded attribute grammars: top down parsing and left
recursive productions",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "72--75",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ponder:1992:PCH,
author = "Carl Ponder and Bill Bush",
title = "Polymorphism considered harmful",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "76--79",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mody:1992:UTD,
author = "R. P. Mody",
title = "On understanding type declarations in {C}",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "80--83",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sakkinen:1992:WEA,
author = "Markku Sakkinen",
title = "Where is the evidence against arrays and pointers?",
journal = j-SIGPLAN,
volume = "27",
number = "6",
pages = "84--85",
month = jun,
year = "1992",
CODEN = "SINODQ",
ISSN = "0362-1340",
bibdate = "Sun Dec 14 09:16:21 MST 2003",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Brooks:1992:NAD,
author = "Gary Brooks and Gilbert J. Hansen and Steve Simmons",
title = "A new approach to debugging optimized code",
journal = j-SIGPLAN,
volume = "27",
number = "7",
pages = "1--11",
month = jul,
year = "1992",
CODEN = "SINODQ",
ISBN = "0-89791-475-9",
ISSN = "0362-1340",
LCCN = "QA76.7.S53 1992",
bibdate = "Sun Dec 14 09:16:22 MST 2003",
bibsource = "Compendex database; http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p1-brooks/",
abstract = "Debugging optimized code is a desirable capability not
provided by most current debuggers. Users are forced to
debug the unoptimized code when a bug occurs in the
optimized version. Current research offers partial
solutions for a small class of optimizations, but not a
unified approach that handles a wide range of
optimizations, such as the sophisticated optimizations
performed by supercomputer compilers. The trend with
current research is to make the effects of optimization
transparent, i.e., provide the same behavior as that of
the unoptimized program. We contend that this approach
is neither totally feasible nor entirely desirable.
Instead, we propose a new approach based on the premise
that one should be able to debug the optimized code.
This implies mapping the current state of execution
back to the original source, tracking the location of
variables, and mapping compiler-synthesized variables
back to user-defined induction variables. To aid the
user in understanding program behavior, various visual
means are provided, e.g., different forms of
highlighting and annotating of the source\slash
assembly code. While this unavoidably requires the user
to have a basic understanding of the optimizations
performed, it permits the user to see what is actually
happening, infer the optimizations performed, and
detect bugs. An example illustrates the effectiveness
of visual feedback. To support conventional debugger
functionality for optimized code, the compiler must
generate additional information. Current
compiler-debugger interfaces (CDIs) were neither
designed to handle this new information nor are they
extensible in a straight forward manner. Therefore, a
new CDI was designed that supports providing visual
feedback and the debugging of optimized code. This
paper specifies the details of a new CDI and relates
each feature back to the debugger functionality it
supports.",
acknowledgement = ack-nhfb,
affiliation = "Convex Computer Corp",
affiliationaddress = "Richardson, TX, USA",
annote = "Published as part of the Proceedings of PLDI'92.",
classification = "723.1",
conference = "Proceedings of the ACM SIGPLAN '92 Conference on
Programming Language Design and Implementation",
conferenceyear = "1992",
journalabr = "SIGPLAN Not",
keywords = "algorithms; Compiler-debugger interfaces; Computer
programming; languages; measurement; Optimized code
debugging; performance; Program compilers; Program
debugging; reliability",
meetingaddress = "San Francisco, CA, USA",
meetingdate = "Jun 17--19 1992",
meetingdate2 = "06/17--19/92",
sponsor = "ACM",
subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
and Debugging, Debugging aids. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors, Optimization. {\bf
D.3.4} Software, PROGRAMMING LANGUAGES, Processors,
Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
Language Classifications, FORTRAN. {\bf D.2.8}
Software, SOFTWARE ENGINEERING, Metrics, Performance
measures.",
}
@Article{Sosic:1992:DTP,
author = "Rok Sosi{\v{c}}",
title = "Dynascope. {A} tool for program directing",
journal = j-SIGPLAN,
volume = "27",
number = "7",
pages = "12--21",
month = jul,
year = "1992",
CODEN = "SINODQ",
ISBN = "0-89791-475-9",
ISSN = "0362-1340",
LCCN = "QA76.7.S53 1992",
bibdate = "Sun Dec 14 09:16:22 MST 2003",
bibsource = "Compendex database; http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p12-sosic/",
abstract = "This paper introduces program {\em directing\/}, a new
way of program interaction. Directing enables one
program, the {\em director\/}, to monitor and to
control another program, the {\em executor\/}. One
important application of program directing is human
interaction with complex computer simulations. The
Dynascope programming environment is designed
specifically to support directing in traditional,
compiled languages. It provides a framework and
building blocks for easy construction of sophisticated
directors. Directors are regular programs that perform
the directing of executors through Dynascope
primitives. Dynascope is built around the concept of
the {\em execution stream\/} which provides a complete
description of the executor's computational behavior.
The source code of executors requires no changes in
order to be subjected to directing. This paper gives an
overview of the Dynascope system. Sample applications
are presented: debugging register allocation, animation
of procedure calls, and a complex artificial life
simulation. The performance of Dynascope is illustrated
by real time measurements.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Utah",
affiliationaddress = "Salt Lake City, UT, USA",
annote = "Published as part of the Proceedings of PLDI'92.",
classification = "723.1",
conference = "Proceedings of the ACM SIGPLAN '92 Conference on
Programming Language Design and Implementation",
conferenceyear = "1992",
journalabr = "SIGPLAN Not",
keywords = "Computer programming; design; Dynascope system;
languages; measurement; performance; Program debugging;
Program directing; Register allocation",
meetingaddress = "San Francisco, CA, USA",
meetingdate = "Jun 17--19 1992",
meetingdate2 = "06/17--19/92",
sponsor = "ACM",
subject = "{\bf D.2.6} Software, SOFTWARE ENGINEERING,
Programming Environments. {\bf D.2.5} Software,
SOFTWARE ENGINEERING, Testing and Debugging, Debugging
aids. {\bf D.3.2} Software, PROGRAMMING LANGUAGES,
Language Classifications, C. {\bf D.3.4} Software,
PROGRAMMING LANGUAGES, Processors. {\bf D.2.8}
Software, SOFTWARE ENGINEERING, Metrics. {\bf D.2.8}
Software, SOFTWARE ENGINEERING, Metrics, Performance
measures.",
}
@Article{Ramsey:1992:RD,
author = "Norman Ramsey and David R. Hanson",
title = "A retargetable debugger",
journal = j-SIGPLAN,
volume = "27",
number = "7",
pages = "22--31",
month = jul,
year = "1992",
CODEN = "SINODQ",
ISBN = "0-89791-475-9",
ISSN = "0362-1340",
LCCN = "QA76.7.S53 1992",
bibdate = "Fri Feb 17 18:40:31 2006",
bibsource = "Compendex database; http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html",
URL = "http://storage.webhop.net/documents/retargetable.pdf;
http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p22-ramsey/",
abstract = "We are developing techniques for building retargetable
debuggers. Our prototype, 1db, debugs C programs
compiled for the MIPS R3000, Motorola 68020, SPARC, and
VAX architectures. It can use a network to connect to
faulty processes and can do cross-architecture
debugging. 1db's total code size is about 16,000 lines,
but it needs only 250-550 lines of machine-dependent
code for each target. 1db owes its retargetability to
three techniques: getting help from the compiler, using
a machine-independent embedded interpreter, and
choosing abstractions that minimize and isolate
machine-dependent code. 1db reuses existing compiler
function by having the compiler emit PostScript code
that 1db later interprets; PostScript works well in
this unusual context.",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ",
affiliationaddress = "Princeton, NJ, USA",
annote = "Published as part of the Proceedings of PLDI'92.",
classification = "723.1",
conference = "Proceedings of the ACM SIGPLAN '92 Conference on
Programming Language Design and Implementation",
conferenceyear = "1992",
journalabr = "SIGPLAN Not",
keywords = "Computer programming; design; languages; Post script
code; Program debugging; Retargetable debugger",
meetingaddress = "San Francisco, CA, USA",
meetingdate = "Jun 17--19 1992",
meetingdate2 = "06/17--19/92",
sponsor = "ACM",
subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing
and Debugging, Debugging aids. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications, C.
{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
Processors, Compilers. {\bf D.3.2} Software,
PROGRAMMING LANGUAGES, Language Classifications,
PostScript.",
}
@Article{Holzle:1992:DOC,
author = "Urs H{\"o}lzle and Craig Chambers and David Ungar",
title = "Debugging optimized code with dynamic deoptimization",
journal = j-SIGPLAN,
volume = "27",
number = "7",
pages = "32--43",
month = jul,
year = "1992",
CODEN = "SINODQ",
ISBN = "0-89791-475-9",
ISSN = "0362-1340",
LCCN = "QA76.7.S53 1992",
bibdate = "Sun Dec 14 09:16:22 MST 2003",
bibsource = "Compendex database; http://portal.acm.org/;
http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html",
URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p32-holzle/",
abstract = "SELF's debugging system provides complete source-level
debugging ({