%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "3.58", %%% date = "11 April 2024", %%% time = "10:25:33 MST", %%% filename = "sigplan1990.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "04747 82379 349249 3611340", %%% 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/ %%% https://dl.acm.org/loi/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/ %%% %%% At version 3.58, the year coverage looks %%% like this: %%% %%% 1980 ( 3) 1987 ( 0) 1994 ( 254) %%% 1981 ( 0) 1988 ( 0) 1995 ( 298) %%% 1982 ( 1) 1989 ( 0) 1996 ( 299) %%% 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: 2448 %%% InProceedings: 403 %%% Proceedings: 51 %%% %%% Total entries: 2902 %%% %%% 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|https://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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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 (print), 1943-5835 (electronic)", bibdate = "Sat Apr 25 16:51:13 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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 (print), 1557-7317 (electronic)", bibdate = "Mon Apr 24 09:59:18 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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 (print), 1557-7317 (electronic)", bibdate = "Tue Jul 19 22:50:23 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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 (print), 1557-7317 (electronic)", bibdate = "Tue Jul 19 22:51:08 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, annote = "An annotated bibliography of programming style", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987482", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987483", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987484", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987485", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987486", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987487", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987488", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 = "https://doi.org/10.1145/987481.987489", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:36 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{VanHorebeek: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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 18:40:11 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "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; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", DOI = "https://doi.org/10.1145/93548.93557", ISBN = "0-89791-364-7", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; ftp://garbo.uwasa.fi/pc/doc-soft/fpbiblio.txt; http://www.acm.org/pubs/contents/proceedings/pldi/93542/; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", DOI = "https://doi.org/10.1145/93548.93559", ISBN = "0-89791-364-7", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; computer programming languages; computers, digital --- computational methods; conversion process; decimal floating-point arithmetic; 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "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; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "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; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "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; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "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; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Dec 12 09:20:21 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Aug 31 17:52:24 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:50:04 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Dec 12 09:20:21 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Aug 31 17:51:41 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Aug 31 17:50:39 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p1-maydan/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p15-goff/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p30-wolf/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p45-morris/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p59-wall/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p71-mcfarling/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p80-launchbury/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p92-consel/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p107-venkatesh/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p120-whitfield/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p130-chatterjee/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p157-boehm/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p165-goldberg/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p177-wilson/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p192-callahan/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p204-gao/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p229-bradlee/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p241-bernstein/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p256-proebsting/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p268-freeman/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p278-cartwright/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p293-reppy/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p306-jaffar/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p317-fritzson/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p327-bertot/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:07 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/113445/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/113445/p338-kishon/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://kerkis.math.aegean.gr/~dspin/pubs/jrnl/1991-SIGPLAN-CType/html/tsl.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 17 18:38:15 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://storage.webhop.net/documents/overview.pdf", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bobrow:1991:OA, author = "Daniel Bobrow and Carl Hewitt and Jean-Fran{\c{c}}ois 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:15 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 17:21:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "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; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Submitted to {\em Communications of the ACM}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:18 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:18 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:18 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:18 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", DOI = "https://doi.org/10.1145/130854.130863", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:18 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Bit-level repetition of the sequences generated by the C library procedure random() have been observed as a function of seed. This note documents that observation. The effect has not been observed in drand48().", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:19 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Trinity Univ., San Antonio, TX, USA", classification = "C4210 (Formal logic); C6110 (Systems analysis and programming); C6140D (High level languages)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @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", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Fri Feb 17 18:40:31 2006", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", 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", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p32-holzle/", abstract = "SELF's debugging system provides complete source-level debugging ({\em expected behavior\/}) with globally optimized code. It shields the debugger from optimizations performed by the compiler by dynamically {\em deoptimizing\/} code on demand. Deoptimization only affects the procedure activations that are actively being debugged; all other code runs at full speed. Deoptimization requires the compiler to supply debugging information at discrete {\em interrupt points\/}; the compiler can still perform extensive optimizations between interrupt points without affecting debuggability. At the same time, the inability to interrupt between interrupt points is invisible to the user. Our debugging system also handles {\em programming changes\/} during debugging. Again, the system provides expected behavior: it is possible to change a running program and immediately observe the effects of the change. Dynamic deoptimization transforms old compiled code (which may contain inlined copies of the old version of the changed procedure) into new versions reflecting the current source-level state. To the best of our knowledge, SELF is the first practical system providing full expected behavior with globally optimized code.", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "Stanford, CA, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Dynamic deoptimization; languages; Optimized code debugging; performance; Program debugging", 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.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Self.", } @Article{Ogata:1992:DIH, author = "Kazuhiro Ogata and Satoshi Kurihara and Mikio Inari and Norihisa Doi", title = "The design and implementation of {HoME}", journal = j-SIGPLAN, volume = "27", number = "7", pages = "44--54", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p44-ogata/", abstract = "HoME is a version of Smalltalk which can be efficiently executed on a multiprocessor and can be executed in parallel by combining a Smalltalk process with a Mach thread and executing the process on the thread. HoME is nearly the same as ordinary Smalltalk except that multiple processes may execute in parallel. Thus, almost all applications running on ordinary Smalltalk can be executed on HoME without changes in their code. HoME was designed and implemented based on the following fundamental policies: (1) theoretically, an infinite number of processes can become active; (2) the moment a process is scheduled, it becomes active; (3) no process switching occurs; (4) HoME is equivalent to ordinary Smalltalk except for the previous three policies. The performance of the current implementation of HoME running on OMRON LUNA-88K, which had four processors, was measured by benchmarks which execute in parallel with multiple processes. In all benchmarks, the results showed that HoME's performance is much better than HPS on the same workstation.", acknowledgement = ack-nhfb, affiliation = "Keio Univ", affiliationaddress = "Yokohama, Jpn", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Computer programming; design; HPS on Mach environment; languages; measurement; Object oriented programming; performance; Smalltalk", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", } @Article{Jagannathan:1992:CSC, author = "Suresh Jagannathan and Jim Philbin", title = "A customizable substrate for concurrent languages", journal = j-SIGPLAN, volume = "27", number = "7", pages = "55--67", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p55-jagannathan/", abstract = "We describe an approach to implementing a wide-range of concurrency paradigms in high-level (symbolic) programming languages. The focus of our discussion is STING, a dialect of Scheme, that supports lightweight threads of control and virtual processors as first-class objects. Given the significant degree to which the behavior of these objects may be customized, we can easily express a variety of concurrency paradigms and linguistic structures within a common framework without loss of efficiency. Unlike parallel systems that rely on operating system services for managing concurrency, STING implements concurrency management entirely in terms of Scheme objects and procedures. It, therefore, permits users to optimize the runtime behavior of their applications without requiring knowledge of the underlying runtime system. This paper concentrates on (a) the implications of the design for building asynchronous concurrency structures, (b) organizing large-scale concurrent computations, and (c) implementing robust programming environments for symbolic computing.", acknowledgement = ack-nhfb, affiliation = "NEC Research Inst", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming languages; Concurrency paradigms; Concurrency structures; design; languages; Parallel processing systems; performance; Robust programming; Symbolic programming languages", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming.", } @Article{Wortman:1992:CCM, author = "David B. Wortman and Michael D. Junkin", title = "A concurrent compiler for {Modula-2+}", journal = j-SIGPLAN, volume = "27", number = "7", pages = "68--81", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p68-wortman/", abstract = "In this paper we describe a collection of techniques for the design and implementation of concurrent compilers. We begin by describing a technique for dividing a source program into many {\em streams\/} so that each stream can be compiled concurrently. We discuss several compiler design issues unique to concurrent compilers including source program partitioning, symbol table management, compiler task scheduling and information flow constraints. The application of our techniques is illustrated by a complete design for a concurrent Modula-2+ compiler. After describing the structure of this compiler's performance that demonstrates that significant improvements in compilation time can be achieved through the use of concurrency.", acknowledgement = ack-nhfb, affiliation = "Univ of Toronto", affiliationaddress = "Toronto, Ont, Can", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Compiler design; Compiler structure; Computer programming; Concurrent compilers; Concurrent Modula-2 compiler; design; languages; Modula (programming language); performance; Program compilers; Source program partitioning", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Modula-2.", } @Article{Tjiang:1992:STB, author = "Steven W. K. Tjiang and John L. Hennessy", title = "{Sharlit} --- a tool for building optimizers", journal = j-SIGPLAN, volume = "27", number = "7", pages = "82--93", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p82-tjiang/", abstract = "A complex and time-consuming function of a modern compiler is global optimization. Unlike other functions of a compiler such as parsing and code generation which examine only one statement or one basic block at a time, optimizers are much larger in scope, examining and changing large portions of a program all at once. The larger scope means optimizers must perform many program transformations. Each of these transformations makes its own particular demands on the internal representation of programs; each can interact with and depend on the others in different ways. This makes optimizers large and complex. Despite their complexity, few tools exist to help in building optimizers. This is in stark contrast with other parts of the compiler where years of experience have culminated in tools with which these other parts can be constructed easily. For example, parser generators are used to build front-ends, and peephole optimizers and tree matchers are used to build code generators. This paper presents Sharlit, a tool to support the construction of modular and extensible global optimizers. We will show how Sharlit helps in constructing data-flow analyzers and the transformations that use data-flow analysis information, both are major components of any optimizer. Sharlit is implemented in C++ and uses C++ in the same way that YACC uses C. Thus we assume the reader has some familiarity with C++[9].", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "CA, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Data-flow analyzers; design; Global optimizers; Optimization; Program compilers; Sharlit", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", } @Article{Chen:1992:PFC, author = "Marina Chen and James Cowie", title = "Prototyping {Fortran-90} compilers for massively parallel machines", journal = j-SIGPLAN, volume = "27", number = "7", pages = "94--105", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p94-chen/", abstract = "Massively parallel architectures, and the languages used to program them, are among both the most difficult and the most rapidly-changing subjects for compilation. This has created a demand for new compiler prototyping technologies that allow novel style of compilation and optimization to be tested in a reasonable amount of time. Using formal specification techniques, we have produced a data-parallel Fortran-90 subset compiler for Thinking Machines' Connection Machine/2 and Connection Machine/5. The prototype produces code from initial Fortran-90 benchmarks demonstrating sustained performance superior to hand-coded Lisp and competitive with Thinking Machines' CM Fortran compiler. This paper presents some new specification techniques necessary to construct competitive, easily retargetable prototype compilers.", acknowledgement = ack-nhfb, affiliation = "Yale Univ", affiliationaddress = "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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer architecture; Computer programming; design; experimentation; Fortran-90 compilers; languages; Parallel architectures; Parallel processing systems; Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), CM-2.", } @Article{Tan:1992:CDA, author = "Jichang Tan and I-Peng Lin", title = "Compiling dataflow analysis of logic programs", journal = j-SIGPLAN, volume = "27", number = "7", pages = "106--115", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p106-tan/", abstract = "Abstract interpretation is a technique extensively used for global dataflow analyses of logic programs. Existing implementations of abstract interpretation are slow due to interpretive or transforming overhead and the inefficiency in manipulation of global information. Since abstract interpretation mimics standard interpretation, it is a promising alternative to compile abstract interpretation into the framework of the WAM (Warren Abstract Machine) for better performance. In this paper, we show how this approach can be effectively implemented in a low-cost manner. To evaluate the possible benefits of this approach, a prototype dataflow analyzer has been implemented for inference of mode, type and variable aliasing information of logic programs. For a subset of benchmark programs in [15], it significantly improves the performance by a factor of over 150 on the average.", acknowledgement = ack-nhfb, affiliation = "Natl Taiwan Univ", affiliationaddress = "Taipei, Taiwan", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Abstract interpretation; Computer programming; Dataflow analysis; design; languages; Logic programming; Logic programs; Program compilers; prolog (programming language)", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @Article{Park:1992:EAL, author = "Young Gil Park and Benjamin Goldberg", title = "Escape analysis on lists", journal = j-SIGPLAN, volume = "27", number = "7", pages = "116--127", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p116-park/", abstract = "Higher order functional programs constantly allocate objects dynamically. These objects are typically cons cells, closures, and records and are generally allocated in the heap and reclaimed later by some garbage collection process. This paper describes a compile time analysis, called escape analysis, for determining the lifetime of dynamically created objects in higher order functional programs, and describes optimizations that can be performed, based on the analysis, to improve storage allocation and reclamation of such objects. In particular, our analysis can be applied to programs manipulating lists, in which case optimizations can be performed to allow cons cells in spines of lists to be either reclaimed immediately or reused without incurring any garbage collection overhead. In a previous paper on escape analysis, we had left open the problem of performing escape analysis on lists. Escape analysis simply determines when the argument (or some part of the argument) to a function call is returned by that call. This simple piece of information turns out to be sufficiently powerful to allow stack allocation of objects, compile-time garbage collection, reduction of run-time storage reclamation overhead, and other optimizations that are possible when the lifetimes of objects can be computed statically. Our approach is to define a high-level non-standard semantics that, in many ways, is similar to the standard semantics and captures the escape behavior caused by the constructs in a functional language. The advantage of our analysis lies in its conceptual simplicity and portability (i.e. no assumption is made about an underlying abstract machine).", acknowledgement = ack-nhfb, affiliation = "New York Univ", affiliationaddress = "New York City, NY, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Compile time analysis; Computer programming; Escape analysis; Higher order functional programs; languages; Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @Article{Jaffar:1992:AMC, author = "Joxan Jaffar and Peter J. Stuckey and Spiro Michaylov and Roland H. C. Yap", title = "An abstract machine for {CLP$(\mathcal{R})$}", journal = j-SIGPLAN, volume = "27", number = "7", pages = "128--139", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p128-jaffar/", abstract = "An abstract machine is described for the CLP$(\mathcal{R})$ programming language. It is intended as a first step toward enabling CLP$(\mathcal{R})$ programs to be executed with efficiency approaching that of conventional languages. The core Constraint Logic Arithmetic Machine (CLAM) extends the Warren Abstract Machine (WAM) for compiling Prolog with facilities for handling real arithmetic constraints. The full CLAM includes facilities for taking advantage of information obtained from global program analysis.", acknowledgement = ack-nhfb, affiliation = "IBM T. J. Watson Research Cent", affiliationaddress = "Yorktown Heights, NY, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Abstract machine; algorithms; Computer programming; Computer programming languages; Constraint logic arithmetic machine; design; Global program analysis; languages; Program compilers; prolog (programming language)", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf D.1.6} Software, PROGRAMMING TECHNIQUES, Logic Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Pugh:1992:EFD, author = "William Pugh and David Wonnacott", title = "Eliminating false data dependences using the {Omega} test", journal = j-SIGPLAN, volume = "27", number = "7", pages = "140--151", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p140-pugh/", abstract = "Array data dependence analysis methods currently in use generate false dependences that can prevent useful program transformations. These false dependences arise because the questions asked are conservative approximations to the questions we really should be asking. Unfortunately, the questions we really should be asking go beyond integer programming and require decision procedures for a subclass of Presburger formulas. In this paper, we describe how to extend the Omega test so that it can answer these queries and allow us to eliminate these false data dependences. We have implemented the techniques described here and believe they are suitable for use in production compilers.", acknowledgement = ack-nhfb, affiliation = "Univ of Maryland", affiliationaddress = "College Park, MD, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; experimentation; False data dependencies; Omega test; Program compilers; Program debugging", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Omega. {\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.", } @Article{Maslov:1992:DEW, author = "Vadim Maslov", title = "{Delinearization}: an efficient way to break multiloop dependence equations", journal = j-SIGPLAN, volume = "27", number = "7", pages = "152--161", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p152-maslov/", abstract = "Exact and efficient data dependence testing is a key to success of loop-parallelizing compiler for computationally intensive programs. A number of algorithms has been created to test array references contained in parameter loops for dependence but most of them are unable to answer the following question correctly: Are references C(i${}_1$ + 10j${}_1$) and C(i${}_2$ + 10j${}_2$ + 5), 0 $leq$ i${}_1$, i${}_2$ $leq$ 4, 0 $leq$ j${}_1$, j${}_2$ $leq$ 9 independent? The technique introduced in this paper recognizes that i${}_1$, i${}_2$ and j${}_1$, j${}_2$ make different order contributions to the subscript index, and breaks dependence equation i${}_1$ + 10j${}_1$ $=$ i${}_2$ + 10j${}_2$ + 5 into two equations i${}_1$ $=$ i${}_2$ + 5 and 10j${}_1$ $=$ 10j${}_2$ which then can be solved independently. Since resulting equations contain less variables it is less expensive to solve them. We call this technique delinearization because it is reverse of the linearization much discussed in the literature. In the introduction we demonstrate that linearized references are used not infrequently in scientific FORTRAN and C codes. Then we present a theorem on which delinearization algorithm is based and the algorithm itself. The algorithm is fairly simple and inexpensive. As a byproduct it tests equations it produces for independence as exactly as it is done by GCD-test and Banerjee inequalities combined. The algorithm has been implemented at Moscow State University in a vectorizer named VIC.", acknowledgement = ack-nhfb, affiliation = "Moscow State Univ", affiliationaddress = "Moscow, Russia", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Data dependence testing; Delinearization algorithm; languages; Program compilers; theory", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN.", } @Article{Wolfe:1992:BIV, author = "Michael Wolfe", title = "Beyond induction variables", journal = j-SIGPLAN, volume = "27", number = "7", pages = "162--174", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p162-wolfe/", abstract = "Induction variable detection is usually closely tied to the strength reduction optimization. This paper studies induction variable analysis from a different perspective, that of finding induction variables for data dependence analysis. While classical induction variable analysis techniques have been used successfully up to now, we have found a simple algorithm based on the Static Single Assignment form of a program that finds all linear induction variables in a loop. Moreover, this algorithm is easily extended to find induction variables in multiple nested loops, to find nonlinear induction variables, and to classify other integer scalar assignments in loops, such as monotonic, periodic and wrap-around variables. Some of these other variables are now classified using ad hoc pattern recognition, while others are not analyzed by current compilers. Giving a unified approach improves the speed of compilers and allows a more general classification scheme. We also show how to use these variables in data dependence testing.", acknowledgement = ack-nhfb, affiliation = "Oregon Graduate Inst of Science and Technology", affiliationaddress = "OR, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Data dependence analysis; Induction variable detection; Linear induction expressions; Program compilers; Strength reduction optimization", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Sarkar:1992:GFI, author = "Vivek Sarkar and Radhika Thekkath", title = "A general framework for iteration-reordering loop transformations", journal = j-SIGPLAN, volume = "27", number = "7", pages = "175--187", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p175-sarkar/", abstract = "This paper describes a general framework for representing iteration-reordering transformations. These transformations can be both matrix-based and non-matrix-based. Transformations are defined by rules for mapping dependence vectors, rules for mapping loop bound expressions, and rules for creating new initialization statements. The framework is extensible, and can be used to represent any iteration-reordering transformation. Mapping rules for several common transformations are included in the paper.", acknowledgement = ack-nhfb, affiliation = "IBM Palo ALto Scientific Cent", affiliationaddress = "Palo Alto, CA, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Iteration reordering transformations; Mapping rules; Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", 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.", } @Article{Hanxleden:1992:RSC, author = "Reinhard v. Hanxleden and Ken Kennedy", title = "Relaxing {SIMD} control flow constraints using loop transformations", journal = j-SIGPLAN, volume = "27", number = "7", pages = "188--199", month = jul, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{vonHanxleden:1992:RSC, author = "Reinhard {von Hanxleden} and Ken Kennedy", title = "Relaxing {SIMD} control flow constraints using loop transformations", journal = j-SIGPLAN, volume = "27", number = "7", pages = "188--199", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p188-v__hanxleden/", abstract = "Many loop nests in scientific codes contain a parallelizable outer loop but have an inner loop for which the number of iterations varies between different iterations of the outer loop. When running this kind of loop nest on a SIMD machine, the SIMD-inherent restriction to single program counter common to all processors will cause a performance degradation relative to comparable MIMD implementations. This problem is not due to limited parallelism or bad load balance, it is merely a problem of control flow. This paper presents a loop transformation, which we call {\em loop flattening\/}, that overcomes this limitation by letting each processor advance to the next loop iteration containing useful computation, if there is such an iteration for the given processor. We study a concrete example derived from a molecular dynamics code and compare performance results for flattened and unflattened versions of this kernel on two SIMD machines, the CM-2 and the DECmpp 12000. We then evaluate loop flattening from the compiler's perspective in terms of applicability, cost, profitability, and safety. We conclude with arguing that loop flattening, whether performed by the programmer or by the compiler, introduces negligible overhead and can significantly improve the performance of scientific codes for solving irregular problems.", acknowledgement = ack-nhfb, affiliation = "Rice Univ", affiliationaddress = "Houston, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer architecture; Computer programming; design; languages; Loop flattening; Loop transformations; Parallel processing systems", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Single-instruction-stream, multiple-data-stream processors (SIMD). {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Lucco:1992:DSM, author = "Steven Lucco", title = "A dynamic scheduling method for irregular parallel programs", journal = j-SIGPLAN, volume = "27", number = "7", pages = "200--211", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p200-lucco/", abstract = "This paper develops a methodology for compiling and executing {\em irregular\/} parallel programs. Such programs implement parallel operations whose size and work distribution depend on input data. We show a fundamental relationship between three quantities that characterize an irregular parallel computation: the total available parallelism, the optimal grain size, and the statistical variance of execution times for individual tasks. This relationship yields a dynamic scheduling algorithm that substantially reduces the overhead of executing irregular parallel operations. We incorporated this algorithm into an extended Fortran compiler. The compiler accepts as input a subset of Fortran D which includes blocked and cyclic decompositions and perfect alignment; it outputs Fortran 77 augmented with calls to library routines written in C. For irregular parallel operations, the compiled code gathers information about available parallelism and task execution time variance and uses this information to schedule the operation. On distributed memory architectures, the compiler encodes information about data access patterns for the runtime scheduling system so that it can preserve communication locality. We evaluated these compilation techniques using a set of application programs including climate modeling, circuit simulation, and x-ray tomography, that contain irregular parallel operations. The results demonstrate that, for these applications, the dynamic techniques described here achieve near-optimal efficiency on large numbers of processors. In addition, they perform significantly better, on these problems, than any previously proposed static or dynamic scheduling algorithm.", acknowledgement = ack-nhfb, affiliation = "Univ of California Berkeley", affiliationaddress = "Berkeley, CA, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Irregular parallel program compiling; Irregular parallel program computation; languages; Parallel processing systems; performance; Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN.", } @Article{Dhamdhere:1992:HAL, author = "Dhananjay M. Dhamdhere and Barry K. Rosen and F. Kenneth Zadeck", title = "How to analyze large programs efficiently and informatively", journal = j-SIGPLAN, volume = "27", number = "7", pages = "212--223", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p212-dhamdhere/", abstract = "Elimination of partial redundancies is a powerful optimization that has been implemented in at least three important production compilers and has inspired several similar optimizations. The global data flow analysis that supports this family of optimizations includes some bidirectional problems. (A bidirectional problem is one in which the global information at each basic block depends on both control flow predecessors and control flow successors.) This paper contributes two ways to simplify and expedite the analysis, especially for large programs. For each global data flow question, we examine only the places in the program where the question might have an answer different from a trivial default answer. In a large program, we may examine only a small fraction of the places conventional algorithms would examine. We reduce the relevant bidirectional problems to simpler unidirectional problems. These bidirectional problems can be solved by applying a quick correction to a unidirectional approximation.", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Bombay, India", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer programming; Elimination of partial redundancies; Global data flow analysis; Production compilers; Program compilers; theory", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", 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. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures.", } @Article{Knoop:1992:LCM, author = "Jens Knoop and Oliver R{\"u}thing and Bernhard Steffen", title = "Lazy code motion", journal = j-SIGPLAN, volume = "27", number = "7", pages = "224--234", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p224-knoop/", abstract = "We present a bit-vector algorithm for the {\em optimal\/} and {\em economical\/} placement of computations within flow graphs, which is as {\em efficient\/} as standard uni-directional analyses. The point of our algorithm is the {\em decomposition\/} of the bi-directional structure of the known placement algorithms into a sequence of a backward and a forward analysis, which directly implies the efficiency result. Moreover, the new compositional structure opens the algorithm for modification: two further uni-directional analysis components exclude any unnecessary code motion. This {\em laziness\/} of our algorithm minimizes the register pressure, which has drastic effects on the run-time behaviour of the optimized programs in practice, where an economical use of registers is essential.", acknowledgement = ack-nhfb, affiliation = "Christian-Albrechts-Univ", affiliationaddress = "Kiel, Ger", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Bit-vector data flow analyses; Code motion; Computer programming; Data flow analysis; Partial redundancy elimination; Program debugging; Program optimization; theory", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", 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. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", } @Article{Landi:1992:SAA, author = "William Landi and Barbara G. Ryder", title = "A safe approximate algorithm for interprocedural aliasing", journal = j-SIGPLAN, volume = "27", number = "7", pages = "235--248", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p235-landi/", abstract = "During execution, when two or more names exist for the same location at some program point, we call them {\em aliases\/}. In a language which allows arbitrary pointers, the problem of determining aliases at a program point is {$\cal P$}-space-hard [Lan92]. We present an algorithm for the Conditional May Alias problem, which can be used to safely approximate Interprocedural May Alias in the presence of pointers. This algorithm is as precise as possible in the worst case and has been implemented in a prototype analysis tool for C programs. Preliminary speed and precision results are presented.", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ", affiliationaddress = "New Brunswick, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Algorithms; algorithms; Computer programming; Conditional May Alias problem; Interprocedural pointer aliasing; languages", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", } @Article{Hendren:1992:ARP, author = "Laurie J. Hendren and Joseph Hummel and Alexandru Nicolau", title = "Abstractions for recursive pointer data structures. Improving the analysis and transformation of imperative programs", journal = j-SIGPLAN, volume = "27", number = "7", pages = "249--260", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p249-hendren/", abstract = "Even though impressive progress has been made in the area of optimizing and parallelizing programs with arrays, the application of similar techniques to programs with pointer data structures has remained difficult. In this paper we introduce a new approach that leads to improved analysis and transformation of programs with recursively-defined pointer data structures. Our approach is based on a mechanism for the Abstract Description of Data Structures (ADDS), which makes explicit the important properties, such as dimensionality, of pointer data structures. Numerous examples demonstrate that ADDS definitions are both natural to specify and flexible enough to describe complex, cyclic pointer data structures. We discuss how an abstract data structure description can improve program analysis by presenting an analysis approach that combines an alias analysis technique, {\em path matrix\/} analysis, with information available from an ADDS declaration. Given this improved alias analysis technique, we provide a concrete example of applying a software pipelining transformation to loops involving pointer data structures.", acknowledgement = ack-nhfb, affiliation = "McGill Univ", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Alias analysis; Array reference analysis; Computer programming; design; Imperative program transformations; Parallel processing systems; Pointer data structure analysis; Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Hoover:1992:AIC, author = "Roger Hoover", title = "{Alphonse}: Incremental computation as a programming abstraction", journal = j-SIGPLAN, volume = "27", number = "7", pages = "261--272", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p261-hoover/", abstract = "Alphonse is a program transformation system that uses dynamic dependency analysis and incremental computation techniques to automatically generate efficient dynamic implementations from simple exhaustive imperative program specifications.", acknowledgement = ack-nhfb, affiliation = "IBM T. J. Watson Research Cent", affiliationaddress = "Yorktown Heights, NY, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Algorithms; algorithms; Alphonse; Computer programming; Dependency analysis; Incremental computations; languages; Program transformation system", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\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 F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @Article{Diwan:1992:CSG, author = "Amer Diwan and Eliot Moss and Richard Hudson", title = "Compiler support for garbage collection in a statically typed language", journal = j-SIGPLAN, volume = "27", number = "7", pages = "273--282", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p273-diwan/", abstract = "We consider the problem of supporting compacting garbage collection in the presence of modern compiler optimizations. Since our collector may move any heap object, it must accurately locate, follow, and update all pointers and values derived from pointers. To assist the collector, we extend the compiler to emit tables describing live pointers, and values derived from pointers, at each program location where collection may occur. Significant results include identification of a number of problems posed by optimizations, solutions to those problems, a working compiler, and experimental data concerning table sizes, table compression, and time overhead of decoding tables during collection. While gc support can affect the code produced, our sample programs show no significant changes, the table sizes are a modest fraction of the size of the optimized code, and stack tracing is a small fraction of total gc time. Since the compiler enhancements are also modest, we conclude that the approach is practical.", acknowledgement = ack-nhfb, affiliation = "Univ of Massachusetts", affiliationaddress = "Amherst, MA, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Compiler optimization; Computer programming; Garbage collection; languages; Modula (programming language); Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\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, Modula-3.", } @Article{Rau:1992:RAS, author = "B. R. Rau and M. Lee and P. P. Tirumalai and M. S. Schlansker", title = "Register allocation for software pipelined loops", journal = j-SIGPLAN, volume = "27", number = "7", pages = "283--299", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p283-rau/", abstract = "Software pipelining is an important instruction scheduling technique for efficiently overlapping successive iterations of loops and executing them in parallel. This paper studies the task of register allocation for software pipelined loops, both with and without hardware features that are specifically aimed at supporting software pipelines. Register allocation for software pipelines presents certain novel problems leading to unconventional solutions, especially in the presence of hardware support. This paper formulates these novel problems and presents a number of alternative solution strategies. These alternatives are comprehensively tested against over one thousand loops to determine the best register allocation strategy, both with and without the hardware support for software pipelining.", acknowledgement = ack-nhfb, affiliation = "Hewlett Packard Lab", affiliationaddress = "Palo Alto, CA, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Code generation; Computer programming; Computer software; design; experimentation; Instruction scheduling; measurement; Modulo scheduling; Pipeline processing systems; Register allocation; Software pipelining; Superscalar processors; Very long instruction word processors; VLIW processors", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\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.", } @Article{Proebsting:1992:PRA, author = "Todd A. Proebsting and Charles N. Fischer", title = "Probabilistic register allocation", journal = j-SIGPLAN, volume = "27", number = "7", pages = "300--310", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p300-proebsting/", abstract = "A new global register allocation technique, {\em probabilistic register allocation\/}, is described. Probabilistic register allocation quantifies the costs and benefits of allocating variables to registers over live ranges so that excellent allocation choices can be made. Local allocation is done first, and then global allocation is done iteratively beginning in the most deeply nested loops. Because local allocation precedes global allocation, probabilistic allocation does not interfere with the use of well-known, high-quality local register allocation and instruction scheduling techniques.", acknowledgement = ack-nhfb, affiliation = "Univ of Wisconsin-Madison", affiliationaddress = "WI, USA", annote = "Published as part of the Proceedings of PLDI'92.", classification = "723.1; 922.1", conference = "Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation", conferenceyear = "1992", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Computer systems programming; Graph coloring allocators; Instruction scheduling; performance; Probability; Register allocation", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Briggs:1992:R, author = "Preston Briggs and Keith D. Cooper and Linda Torczon", title = "Rematerialization", journal = j-SIGPLAN, volume = "27", number = "7", pages = "311--321", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p311-briggs/", abstract = "This paper examines a problem that arises during global register allocation --- {\em rematerialization\/}. If a value cannot be kept in a register, the allocator should recognize when it is cheaper to recompute the value (rematerialize it) than to store and reload it. Chaitin's original graph-coloring allocator handled simple instance of this problem correctly. This paper details a general solution to the problem and presents experimental evidence that shows its importance. Our approach is to tag individual values in the procedure's SSA graph with information specifying how it should be spilled. We use a variant of Wegman and Zadeck's {\em sparse simple constant\/} algorithm to propagate tags throughout the graph. The allocator then splits live ranges into values with different tags. This isolates those values that can be easily rematerialized from values that require general spilling. We modify the base allocator to use this information when estimating spill costs and introducing spill code. Our presentation focuses on rematerialization in the context of Chaitin's allocator; however, the problem arises in any global allocator. We believe that our approach will work in other allocators-while the details of implementation will vary, the key insights should carry over directly.", acknowledgement = ack-nhfb, affiliation = "Rice Univ", affiliationaddress = "Houston, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Chaitin-style allocators; Computer programming; experimentation; Global register allocation; Program compilers; Rematerialization", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", } @Article{Mueller:1992:AUJ, author = "Frank Mueller and David B. Whalley", title = "Avoiding unconditional jumps by code replication", journal = j-SIGPLAN, volume = "27", number = "7", pages = "322--330", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p322-mueller/", abstract = "This study evaluates a global optimization technique that avoids unconditional jumps by replicating code. When implemented in the back-end of an optimizing compiler, this technique can be generalized to work on almost all instances of unconditional jumps, including those generated from conditional statements and unstructured loops. The replication method is based on the idea of finding a replacement for each unconditional jump which minimizes the growth in code size. This is achieved by choosing the shortest sequence of instructions as a replacement. Measurements taken from a variety of programs showed that not only the number of executed instructions decreased, but also that the total cache work was reduced (except for small caches) despite increases in code size. Pipelined and superscalar machines may also benefit from an increase in the average basic block size.", acknowledgement = ack-nhfb, affiliation = "Florida State Univ", affiliationaddress = "Tallahassee, FL, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Code replication method; Computer programming; measurement; performance; Program compilers; Unconditional jumps", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", 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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", } @Article{Proebsting:1992:SEB, author = "Todd A. Proebsting", title = "Simple and efficient {BURS} table generation", journal = j-SIGPLAN, volume = "27", number = "7", pages = "331--340", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p331-proebsting/", abstract = "A simple and efficient algorithm for generating bottom-up rewrite system (BURS) tables is described. A small prototype implementation produces tables 10 to 30 times more quickly than the best current techniques. The algorithm does not require novel data structures or complicated algorithmic techniques. Previously published methods for the on-the-fly elimination of states are generalized and simplified to create a new method, {\em triangle trimming\/}, that is employed in the algorithm.", acknowledgement = ack-nhfb, affiliation = "Univ of Wisconsin-Madison", affiliationaddress = "WI, 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "Algorithms; Bottom-up rewrite system; Computer programming; Table generation algorithm; Triangle trimming", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\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. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Granlund:1992:EBU, author = "Torbj{\"o}rn Granlund and Richard Kenner", title = "Eliminating branches using a superoptimizer and the {GNU} {C} compiler", journal = j-SIGPLAN, volume = "27", number = "7", pages = "341--352", month = jul, year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9", ISBN-13 = "978-0-89791-475-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1992", bibdate = "Sun Dec 14 09:16:22 MST 2003", bibsource = "Compendex database; http://www.acm.org/pubs/contents/proceedings/pldi/143095/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/143095/p341-granlund/", abstract = "This paper describes an alternative technique for constructing a superoptimizer, which is called the Superoptimizer or GSO. Some sample results of the superoptimizer are presented. The basic design and structure of the GNU C compiler are discussed. Subsequently it is shown as to how the results of the superoptimizer were used to enable the GNU C compiler to produce very compact code sequences on the RS\slash 6000.", acknowledgement = ack-nhfb, affiliation = "Swedish Inst of Computer Science", affiliationaddress = "Kista, Swed", 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", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", keywords = "algorithms; Compact code sequence generation; Computer programming; design; GNU C compiler; GNU superoptimizer; Program compilers", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", sponsor = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.5.1} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Large and Medium (``Mainframe'') Computers, IBM RS/6000.", } @Article{Meeson:1992:BRM, author = "Reginald Meeson", title = "Book Review: {ML for the Working Programmer by Laurence C. Paulson: (Cambridge University Press, 429 pp., 1991)}", journal = j-SIGPLAN, volume = "27", number = "8", pages = "14--14", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cardelli:1992:MLD, author = "Luca Cardelli and James Donahue and Lucille Glassman and Mick Jordan and Bill Kalsow and Greg Nelson", title = "{Modula-3} language definition", journal = j-SIGPLAN, volume = "27", number = "8", pages = "15--42", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hamel:1992:ISC, author = "Lutz H. Hamel", title = "Industrial strength compiler construction with equations", journal = j-SIGPLAN, volume = "27", number = "8", pages = "43--50", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lowry:1992:HLO, author = "Andy Lowry", title = "The {Hermes} language in outline form", journal = j-SIGPLAN, volume = "27", number = "8", pages = "51--70", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuen:1992:HNL, author = "C. K. Yuen", title = "{Hamming} numbers, lazy evaluation, and eager disposal", journal = j-SIGPLAN, volume = "27", number = "8", pages = "71--75", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Plat:1992:OIV, author = "Nico Plat and Peter Gorm Larsen", title = "An overview of the {ISO\slash VDM-SL} standard", journal = j-SIGPLAN, volume = "27", number = "8", pages = "76--82", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mossenbock:1992:TSS, author = "Hanspeter M{\"o}ssenb{\"o}ck", title = "Treating statement sequences as block objects", journal = j-SIGPLAN, volume = "27", number = "8", pages = "83--86", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Abrahams:1992:SPE, author = "Paul W. Abrahams", title = "Software patents: an example of the threat", journal = j-SIGPLAN, volume = "27", number = "8", pages = "87--88", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1992:LLL, author = "Henry G. Baker", title = "Lively linear {Lisp}: ``look ma, no garbage!''", journal = j-SIGPLAN, volume = "27", number = "8", pages = "89--98", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eckart:1992:CAS, author = "J. Dana Eckart", title = "A cellular automata simulation system: version 2.0", journal = j-SIGPLAN, volume = "27", number = "8", pages = "99--106", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eckart:1992:CLR, author = "J. Dana Eckart", title = "Cellang 2.0: language reference manual", journal = j-SIGPLAN, volume = "27", number = "8", pages = "107--112", month = aug, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:24 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Burrows:1992:LDC, author = "Michael Burrows and Charles Jerian and Butler Lampson and Timothy Mann", title = "On-line data compression in a log-structured file system", journal = j-SIGPLAN, volume = "27", number = "9", pages = "2--9", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p2-burrows/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance", subject = "{\bf E.4} Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management.", } @Article{Baker:1992:NVM, author = "Mary Baker and Satoshi Asami and Etienne Deprit and John Ousterhout and Margo Seltzer", title = "Non-volatile memory for fast, reliable file systems", journal = j-SIGPLAN, volume = "27", number = "9", pages = "10--22", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p10-baker/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; reliability", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management.", } @Article{Holland:1992:PDC, author = "Mark Holland and Garth A. Gibson", title = "Parity declustering for continuous operation in redundant disk arrays", journal = j-SIGPLAN, volume = "27", number = "9", pages = "23--35", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p23-holland/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; reliability", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @Article{Rogers:1992:SSS, author = "Anne Rogers and Kai Li", title = "Software support for speculative loads", journal = j-SIGPLAN, volume = "27", number = "9", pages = "38--50", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p38-rogers/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Chen:1992:RML, author = "Tien-Fu Chen and Jean-Loup Baer", title = "Reducing memory latency via non-blocking and prefetching caches", journal = j-SIGPLAN, volume = "27", number = "9", pages = "51--61", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p51-chen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling.", } @Article{Mowry:1992:DEC, author = "Todd C. Mowry and Monica S. Lam and Anoop Gupta", title = "Design and evaluation of a compiler algorithm for prefetching", journal = j-SIGPLAN, volume = "27", number = "9", pages = "62--73", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p62-mowry/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @Article{Pan:1992:IAD, author = "Shien-Tai Pan and Kimming So and Joseph T. Rahmeh", title = "Improving the accuracy of dynamic branch prediction using branch correlation", journal = j-SIGPLAN, volume = "27", number = "9", pages = "76--84", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p76-pan/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Fisher:1992:PCB, author = "Joseph A. Fisher and Stefan M. Freudenberger", title = "Predicting conditional branch directions from previous runs of a program", journal = j-SIGPLAN, volume = "27", number = "9", pages = "85--95", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p85-fisher/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; management; measurement; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous.", } @Article{Anderson:1992:HSS, author = "Thomas E. Anderson and Susan S. Owicki and James B. Saxe and Charles P. Thacker", title = "High speed switch scheduling for local area networks", journal = j-SIGPLAN, volume = "27", number = "9", pages = "98--110", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p98-anderson/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.2.5} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area Networks.", } @Article{Henry:1992:TCP, author = "Dana S. Henry and Christopher F. Joerg", title = "A tightly-coupled processor-network interface", journal = j-SIGPLAN, volume = "27", number = "9", pages = "111--122", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p111-henry/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Wheeler:1992:CMV, author = "Bob Wheeler and Brian N. Bershad", title = "Consistency management for virtually indexed caches", journal = j-SIGPLAN, volume = "27", number = "9", pages = "124--136", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p124-wheeler/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Chiueh:1992:EAT, author = "Tzi-cker Chiueh and Randy H. Katz", title = "Eliminating the address translation bottleneck for physical address cache", journal = j-SIGPLAN, volume = "27", number = "9", pages = "137--148", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p137-chiueh/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Veenstra:1992:PEO, author = "Jack E. Veenstra and Robert J. Fowler", title = "A performance evaluation of optimal hybrid cache coherency protocols", journal = j-SIGPLAN, volume = "27", number = "9", pages = "149--160", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p149-veenstra/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @Article{Torrellas:1992:CCS, author = "Josep Torrellas and Anoop Gupta and John Hennessy", title = "Characterizing the caching and synchronization performance of a multiprocessor operating system", journal = j-SIGPLAN, volume = "27", number = "9", pages = "162--174", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p162-torrellas/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors).", } @Article{Koldinger:1992:ASS, author = "Eric J. Koldinger and Jeffrey S. Chase and Susan J. Eggers", title = "Architecture support for single address space operating systems", journal = j-SIGPLAN, volume = "27", number = "9", pages = "175--186", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p175-koldinger/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.0} Software, OPERATING SYSTEMS, General.", } @Article{Harty:1992:ACP, author = "Kieran Harty and David R. Cheriton", title = "Application-controlled physical memory using external page-cache management", journal = j-SIGPLAN, volume = "27", number = "9", pages = "187--197", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p187-harty/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Virtual memory. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Wahbe:1992:EDB, author = "Robert Wahbe", title = "Efficient data breakpoints", journal = j-SIGPLAN, volume = "27", number = "9", pages = "200--212", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p200-wahbe/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; reliability", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance.", } @Article{Andrews:1992:MCC, author = "Kristy Andrews and Duane Sand", title = "Migrating a {CISC} computer family onto {RISC} via object code translation", journal = j-SIGPLAN, volume = "27", number = "9", pages = "213--222", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p213-andrews/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance", subject = "{\bf C.1.1} Computer Systems Organization, PROCESSOR ARCHITECTURES, Single Data Stream Architectures, CISC. {\bf C.1.1} Computer Systems Organization, PROCESSOR ARCHITECTURES, Single Data Stream Architectures, RISC. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators.", } @Article{Bershad:1992:FME, author = "Brian N. Bershad and David D. Redell and John R. Ellis", title = "Fast mutual exclusion for uniprocessors", journal = j-SIGPLAN, volume = "27", number = "9", pages = "223--233", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p223-bershad/", abstract = "In this paper we describe restartable atomic sequences, an {\em optimistic\/} mechanism for implementing simple atomic operations (such as {\em Test-And-Set\/}) on a uniprocessor. A thread that is suspended within a restartable atomic sequence is resumed by the operating system at the beginning of the sequence, rather than at the point of suspension. This guarantees that the thread eventually executes the sequence {\em atomically\/}. A restartable atomic sequence has significantly less overhead than other software-based synchronization mechanisms, such as kernel emulation or software reservation. Consequently, it is an attractive alternative for use on uniprocessors that do no support atomic operations. Even on processors that do support atomic operations in hardware, restartable atomic sequences can have lower overhead. We describe different implementations of restartable atomic sequences for the Mach 3.0 and Taos operating systems. These systems' thread management packages rely on atomic operations to implement higher-level mutual exclusion facilities. We show that improving the performance of low-level atomic operations, and therefore mutual exclusion mechanisms, improves application performance.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Mutual exclusion.", } @Article{Mahlke:1992:SSV, author = "Scott A. Mahlke and William Y. Chen and Wen-mei W. Hwu and B. Ramakrishna Rau and Michael S. Schlansker", title = "Sentinel scheduling for {VLIW} and superscalar processors", journal = j-SIGPLAN, volume = "27", number = "9", pages = "238--247", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p238-mahlke/", abstract = "Speculative execution is an important source of parallelism for VLIW and superscalar processors. A serious challenge with compiler-controlled speculative execution is to accurately detect and report all program execution errors at the time of occurrence. In this paper, a set of architectural features and compile-time scheduling support referred to as {\em sentinel scheduling\/} is introduced. Sentinel scheduling provides an effective framework for compiler-controlled speculative execution that accurately detects and reports all exceptions. Sentinel scheduling also supports speculative execution of store instructions by providing a store buffer which allows probationary entries. Experimental results show that sentinel scheduling is highly effective for a wide range of VLIW and superscalar processors.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling.", } @Article{Smith:1992:ESP, author = "Michael D. Smith and Mark Horowitz and Monica S. Lam", title = "Efficient superscalar performance through boosting", journal = j-SIGPLAN, volume = "27", number = "9", pages = "248--259", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p248-smith/", abstract = "The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that speculative execution is required for high instruction per cycle (IPC) rates in non-numerical applications. The general trend has been toward supporting speculative execution in complicated, dynamically-scheduled processors. Performance, though, is more than just a high IPC rate; it also depends upon instruction count and cycle time. Boosting is an architectural technique that supports general speculative execution in simpler, statically-scheduled processors. Boosting labels speculative instructions with their control dependence information. This labelling eliminates control dependence constraints on instruction scheduling while still providing full dependence information to the hardware. We have incorporated boosting into a trace-based, global scheduling algorithm that exploits ILP without adversely affecting the instruction count of a program. We use this algorithm and estimates of the boosting hardware involved to evaluate how much speculative execution support is really necessary to achieve good performance. We find that a statically-scheduled superscalar processor using a minimal implementation of boosting can easily reach the performance of a much more complex dynamically-scheduled superscalar processor.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance", subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance.", } @Article{Hill:1992:CSM, author = "Mark D. Hill and James R. Larus and Steven K. Reinhardt and David A. Wood", title = "Cooperative shared memory: software and hardware for scalable multiprocessor", journal = j-SIGPLAN, volume = "27", number = "9", pages = "262--273", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p262-hill/", abstract = "We believe the absence of massively-parallel, shared-memory machines follows from the lack of a shared-memory programming performance model that can inform programmers of the cost of operations (so they can avoid expensive ones) and can tell hardware designers which cases are common (so they can build simple hardware to optimize them). {\em Cooperative shared memory\/}, our approach to shared-memory design, addresses this problem. Our initial implementation of cooperative shared memory uses a simple programming model, called {\em Check-In\/} / {\em Check-Out (CICO)\/}, in conjunction with even simpler hardware, called {\em Dir1SW\/} is a minimal director protocol that adds little complexity to message-passing hardware, but efficiently supports programs written within the CICO model.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization.", } @Article{Kubiatowicz:1992:CWV, author = "John Kubiatowicz and David Chaiken and Anant Agarwal", title = "Closing the window of vulnerability in multiphase memory transactions", journal = j-SIGPLAN, volume = "27", number = "9", pages = "274--284", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p274-kubiatowicz/", abstract = "Multiprocessor architects have begun to explore several mechanisms such as prefetching, context-switching and software-assisted dynamic cache-coherence, which transform single-phase memory transactions in conventional memory systems into multiphase operations. Multiphase operations introduce a {\em window of vulnerability\/} in which data can be invalidated before it is used. Losing data due to invalidations introduces damaging livelock situations. This paper discusses the origins of the window of vulnerability and proposes an architectural framework that closes it. The framework is implemented in Alewife, a large-scale multi-processor being built at MIT.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance; reliability", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory.", } @Article{Li:1992:ANL, author = "Wei Li and Keshav Pingali", title = "Access normalization: loop restructuring for {NUMA} compilers", journal = j-SIGPLAN, volume = "27", number = "9", pages = "285--295", month = sep, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:26 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/143365/p285-li/", abstract = "In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must be made, it is usually more efficient to use block transfers of data rather than to use many small messages. To run well on such machines, software must exploit these features. We believe it is too onerous for a programmer to do this by hand, so we have been exploring the use of restructuring compiler technology for this purpose. In this paper, we start with a language like FORTRAN-D with user-specified data distribution and develop a systematic loop transformation strategy called {\em access normalization\/} that restructures loop nests to exploit locality and block transfers. We demonstrate the power of our techniques using routines from the BLAS (Basic Linear Algebra Subprograms) library. An important feature of our approach is that we model loop transformations using {\em invertible\/} matrices and integer lattice theory, thereby generalizing Banerjee's framework of unimodular matrices [5].", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @Article{Cook:1992:ISS, author = "William R. Cook", title = "Interfaces and Specifications for the {Smalltalk-80} Collection Classes", journal = j-SIGPLAN, volume = "27", number = "10", pages = "1--15", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ducournau:1992:MCR, author = "R. Ducournau and M. Habib and M. Huchard and Marie-Laure Mugnier", title = "Monotonic Conflict Resolution Mechanisms for Inheritance", journal = j-SIGPLAN, volume = "27", number = "10", pages = "16--24", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ossher:1992:CIH, author = "Harold Ossher and William H. Harrison", title = "Combination of Inheritance Hierarchies", journal = j-SIGPLAN, volume = "27", number = "10", pages = "25--40", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McCollough:1992:RPT, author = "Paul McCollough and Bob Atkinson and Adele Goldberg and Martin Griss and John Morrison", title = "Reuse (panel): truth or fiction", journal = j-SIGPLAN, volume = "27", number = "10", pages = "41--44", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McCullough:1992:RTF, author = "Paul McCullough and Robert G. Atkinson and Adele Goldberg and Martin L. Griss and John Morrison", title = "Reuse: Truth or Fiction (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "41--44", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:21:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deChampeaux:1992:POO, author = "Dennis {de Champeaux} and Doug Lea and Penelope Faure", title = "The Process of Object-Oriented Design", journal = j-SIGPLAN, volume = "27", number = "10", pages = "45--62", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Johnson:1992:DFU, author = "Ralph E. Johnson", title = "Documenting Frameworks using Patterns", journal = j-SIGPLAN, volume = "27", number = "10", pages = "63--76", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liu:1992:WCS, author = "Chamond Liu and Stephen Goetze and Bill Glynn", title = "What Contributes to Successful Object-Oriented Learning?", journal = j-SIGPLAN, volume = "27", number = "10", pages = "77--86", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bulman:1992:OLP, author = "David Bulman and S. Tucker Taft and Bertrand Meyer and Greg Nelson and Mike Kilian", title = "{OOP} in Languages Providing Strong, Static Typing (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "87--87", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taft:1992:PPO, author = "S. Tucker Taft", title = "Position paper for {OOPSLA '92} panel on {OOP} for languages based on strong, static typing", journal = j-SIGPLAN, volume = "27", number = "10", pages = "88--88", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Meyer:1992:EST, author = "Bertrand Meyer", title = "Ensuring strong typing in an object-oriented language (abstract)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "89--90", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kilian:1992:TWW, author = "Michael F. Kilian", title = "{Trellis}: what we have learned from a strongly typed language", journal = j-SIGPLAN, volume = "27", number = "10", pages = "91--91", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hosking:1992:CPE, author = "Antony L. Hosking and J. Eliot B. Moss and Darko Stefanovic", title = "A Comparative Performance Evaluation of Write Barrier Implementations", journal = j-SIGPLAN, volume = "27", number = "10", pages = "92--109", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Andre:1992:OMS, author = "Pascal Andr{\'e} and Jean-Claude Royer", title = "Optimizing method search with lookup caches and incremental coloring", journal = j-SIGPLAN, volume = "27", number = "10", pages = "110--126", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Royer:1992:OMS, author = "Jean-Claude Royer", title = "Optimizing Method Search with Lookup Caches and Incremental Coloring", journal = j-SIGPLAN, volume = "27", number = "10", pages = "110--126", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:21:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Masuhara:1992:OOC, author = "Hidehiko Masuhara and Satoshi Matsuoka and Takuo Watanabe and Akinori Yonezawa", title = "Object-Oriented Concurrent Reflective Languages can be Implemented Efficiently", journal = j-SIGPLAN, volume = "27", number = "10", pages = "127--144", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{DeNatale:1992:RMC, author = "Rick DeNatale and Grady Booch and Peter Coad and Dave A. Thomas and John Tibbets", title = "The Role of Methods and {CASE} in {OO} Development (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "145--145", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:21:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wangler:1992:VOM, author = "Michael F. Wangler and Peeter Hansen", title = "Visualizing Objects: Methods for Exploring Human Computer Interaction Concepts", journal = j-SIGPLAN, volume = "27", number = "10", pages = "146--153", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Calder:1992:OOI, author = "Paul R. Calder and Mark A. Linton", title = "The Object-Oriented Implementation of a Document Editor", journal = j-SIGPLAN, volume = "27", number = "10", pages = "154--165", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eggenschwiler:1992:EUO, author = "Thomas Eggenschwiler and Erich Gamma", title = "{ET++SwapsManager}: using object technology in the financial engineering domain", journal = j-SIGPLAN, volume = "27", number = "10", pages = "166--177", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eggenschwiler:1992:SMU, author = "Thomas Eggenschwiler and Erich Gamma", title = "{ET++} Swaps Manager: Using Object Technology in the Financial Engineering Domain", journal = j-SIGPLAN, volume = "27", number = "10", pages = "166--177", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:21:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Walsh:1992:PDD, author = "James F. Walsh", title = "Preliminary defect data from the iterative development of a large {C++} program (experience report)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "178--183", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Myers:1992:DPP, author = "Brad A. Myers and Dario A. Giuse and Brad T. {Vander Zanden}", title = "Declarative Programming in a Prototype-Instance System: Object-Oriented Programming Without Writing Methods", journal = j-SIGPLAN, volume = "27", number = "10", pages = "184--200", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dony:1992:PBL, author = "Christophe Dony and Jacques Malenfant and Pierre Cointe", title = "Prototype-Based Languages: From a New Taxonomy to Constructive Proposals and Their Validation", journal = j-SIGPLAN, volume = "27", number = "10", pages = "201--217", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Horn:1992:CPB, author = "Bruce Horn", title = "Constraint Patterns As a Basis for Object-Oriented Programming", journal = j-SIGPLAN, volume = "27", number = "10", pages = "218--233", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yelland:1992:ECF, author = "Phillip M. Yelland", title = "Experimental Classification Facilities for {Smalltalk}", journal = j-SIGPLAN, volume = "27", number = "10", pages = "235--246", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Feeley:1992:DSM, author = "Michael J. Feeley and Henry M. Levy", title = "Distributed Shared Memory with Versioned Objects", journal = j-SIGPLAN, volume = "27", number = "10", pages = "247--262", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Richardson:1992:CEF, author = "Joel Richardson and Peter Schwarz and Luis-Felipe Cabrera", title = "{CACL}: Efficient Fine-Grained Protection for Objects", journal = j-SIGPLAN, volume = "27", number = "10", pages = "263--275", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Takashio:1992:DOO, author = "Kazunori Takashio and Mario Tokoro", title = "{DROL}: An Object-Oriented Programming Language for Distributed Real-Time Systems", journal = j-SIGPLAN, volume = "27", number = "10", pages = "276--294", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Constantine:1992:EOH, author = "Larry L. Constantine and Ivar Jacobson and Meilir Page-Jones and John Palmer and Steven Weiss", title = "From Events to Objects: The Heresy of Event-Orientation in a World of Objects (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "295--297", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:21:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Constantine:1992:EOP, author = "Larry L. Constantine and Ivar Jacobson and Meilir Page-Jones and John Palmer and Steven Weiss", title = "From events to objects (panel): the heresy of event-orientation in a world of objects", journal = j-SIGPLAN, volume = "27", number = "10", pages = "295--297", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stacy:1992:ESI, author = "Webb Stacy and Richard Helm and Gail E. Kaiser and Bertrand Meyer", title = "Ensuring Semantic Integrity of Reusable Objects (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "298--302", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ishikawa:1992:CMA, author = "Yutaka Ishikawa", title = "Communication Mechanism on Autonomous Objects", journal = j-SIGPLAN, volume = "27", number = "10", pages = "303--314", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Satoh:1992:FRT, author = "Ichiro Satoh and Mario Tokoro", title = "A Formalism for Real-Time Concurrent Object-Oriented Computing", journal = j-SIGPLAN, volume = "27", number = "10", pages = "315--326", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lohr:1992:CA, author = "Klaus-Peter L{\"o}hr", title = "Concurrency Annotations", journal = j-SIGPLAN, volume = "27", number = "10", pages = "327--340", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Aksit:1992:OOO, author = "Mehmet Aksit and Lodewijk Bergmans", title = "Obstacles in Object-Oriented Software Development", journal = j-SIGPLAN, volume = "27", number = "10", pages = "341--358", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bruegge:1992:OOS, author = "Bernd Bruegge and Jim Blythe and Jeffrey Jackson and Jeff Shufelt", title = "Object-Oriented System Modeling with {OMT}", journal = j-SIGPLAN, volume = "27", number = "10", pages = "359--376", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deChampeaux:1992:CSO, author = "Dennis {de Champeaux} and Al Anderson and Ed Feldhousen", title = "Case Study of Object-Oriented Software Development", journal = j-SIGPLAN, volume = "27", number = "10", pages = "377--391", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wegner:1992:OOM, author = "Peter Wegner and William L. Scherlis and James M. Purtilo and David C. Luckham and Ralph E. Johnson", title = "Object-Oriented Megaprogramming (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "392--396", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chase:1992:LSO, author = "Jeffrey S. Chase and Henry M. Levy and Edward D. Lazowska and Miche Baker-Harvey", title = "Lightweight Shared Objects in a 64-Bit Operating System", journal = j-SIGPLAN, volume = "27", number = "10", pages = "397--413", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yokote:1992:ARO, author = "Yasuhiko Yokote", title = "The {Apertos} Reflective Operating System: The Concept and its Implementation", journal = j-SIGPLAN, volume = "27", number = "10", pages = "414--434", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiczales:1992:IDD, author = "Gregor Kiczales and John Lamping", title = "Issues in the Design and Documentation of Class Libraries", journal = j-SIGPLAN, volume = "27", number = "10", pages = "435--451", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:21:11 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiczales:1992:IDS, author = "Gregor Kiczales and John Lamping", title = "Issues in the design and specification of class libraries", journal = j-SIGPLAN, volume = "27", number = "10", pages = "435--451", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clyde:1992:TFO, author = "Stephen W. Clyde and David E. Embley and Scott N. Woodfield", title = "Tunable Formalism in Object-Oriented Systems Analysis: Meeting the Needs of Both Theoreticians and Practitioners", journal = j-SIGPLAN, volume = "27", number = "10", pages = "452--465", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Buhr:1992:AP, author = "Raymond J. A. Buhr and Ronald S. Casselman", title = "Architectures with Pictures", journal = j-SIGPLAN, volume = "27", number = "10", pages = "466--483", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deChampeaux:1992:OSD, author = "Dennis de Champeaux and Robert Balzer and Dave Bulman and Kathleen Culver-Lozo and Ivar Jacobson and Stephen J. Mellor", title = "The {OO} Software Development Process (Panel)", journal = j-SIGPLAN, volume = "27", number = "10", pages = "484--489", month = oct, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Meeson:1992:BRIb, author = "Reginald Meeson", title = "Book Review: {An Introduction to Functional Programming Systems Using Haskell by Antony J. T. Davie: (Cambridge University Press, 1992)}", journal = j-SIGPLAN, volume = "27", number = "11", pages = "11--11", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lawyer:1992:BRW, author = "Steve Lawyer", title = "Book Review: {Windows Graphics Programming with Borland C++ by Loren Heiny: (John Wiley \& Sons, Inc., 1992)}", journal = j-SIGPLAN, volume = "27", number = "11", pages = "12--12", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mody:1992:FPS, author = "R. P. Mody", title = "Functional programming is not self-modifying code", journal = j-SIGPLAN, volume = "27", number = "11", pages = "13--14", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1992:LCE, author = "Henry G. Baker", title = "Less complex elementary functions", journal = j-SIGPLAN, volume = "27", number = "11", pages = "15--16", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liu:1992:COO, author = "Bing Liu and Yuen-Wah Ku", title = "{ConstraintLisp}: an object-oriented constraint programming language", journal = j-SIGPLAN, volume = "27", number = "11", pages = "17--26", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yulin:1992:LLE, author = "Feng Yulin and Huang Tao and Li Jing", title = "{LogC}: a language and environment for embedded rule based systems", journal = j-SIGPLAN, volume = "27", number = "11", pages = "27--32", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Panti:1992:MOH, author = "Maurizio Panti and Salvatore Valenti", title = "A Modulus Oriented Hash Function for the Construction of Minimal Perfect Tables", journal = j-SIGPLAN, volume = "27", number = "11", pages = "33--38", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cabasino:1992:DPE, author = "S. Cabasino and P. S. Paolucci and G. M. Todesco", title = "Dynamic parsers and evolving grammars", journal = j-SIGPLAN, volume = "27", number = "11", pages = "39--48", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fickert:1992:UBF, author = "Chris Fickert and Thomas Sudkamp", title = "Unification based {FP} interpreters", journal = j-SIGPLAN, volume = "27", number = "11", pages = "49--58", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sakharov:1992:MPH, author = "Alexander Sakharov", title = "Macro processing in high-level languages", journal = j-SIGPLAN, volume = "27", number = "11", pages = "59--66", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Weisert:1992:MDC, author = "Conrad Weisert", title = "Macros for defining {C++} classes", journal = j-SIGPLAN, volume = "27", number = "11", pages = "67--76", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuen:1992:AMD, author = "C. K. Yuen", title = "An abstract machine design for lexically scoped parallel {Lisp} with speculative processing", journal = j-SIGPLAN, volume = "27", number = "11", pages = "77--84", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mijanovic:1992:MNA, author = "Srdjan Mijanovic", title = "{MANEVRO}: a new approach to class based programming", journal = j-SIGPLAN, volume = "27", number = "11", pages = "85--89", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Klint:1992:PER, author = "Paul Klint and Thomas Reps and Gregor Snelting", title = "Programming environments: report on an international workshop at {Dagstuhl Castle}", journal = j-SIGPLAN, volume = "27", number = "11", pages = "90--96", month = nov, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Myers:1992:RCW, author = "Brad A. Myers", title = "Report on the {CHI'91 Workshop on Languages for Developing User Interfaces}", journal = j-SIGPLAN, volume = "27", number = "12", pages = "8--12", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Konrad:1992:AMT, author = "Erhard Konrad", title = "Application of Measurement Theory to Software Metrics --- Comments on the {Bollmann-Zuse} Approach", journal = j-SIGPLAN, volume = "27", number = "12", pages = "13--19", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See reply \cite{Zuse:1992:REK}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zuse:1992:REK, author = "Horst Zuse and Peter Bollmann-Sdorra", title = "Reply to: {Erhard Konrad: ``Application of measurement theory to software metrics. Comments on the Bollmann-Zuse approach''}", journal = j-SIGPLAN, volume = "27", number = "12", pages = "20--27", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Konrad:1992:AMT}.", abstract = "This paper is the reply to the paper `Erhard Konrad: Application of Measurement Theory to Software Metrics. Comments on the Bollmann-Zuse approach' (ibid., vol.27, no.12, p.13-19, 1992). Konrad is criticizing the authors' approach: `Horst Zuse; Peter Bollmann: Using measurement theory to describe the properties and scales of software complexity metrics', which was published in SIGPLAN Notices; vol.24, no.8, p.23-33, 1989. Konrad first criticized the authors' paper in SIGPLAN Notices in March 1991. They replied in SIGPLAN Notices May 1991 to this criticism. Now (November 1992) Konrad imputes again that the authors have failed to achieve their goals of refuting his criticism. It is shown that Konrad has a totally different view of established concepts of measurement theory as treated by Roberts, Krantz, Luce, Suppes and Tversky.", acknowledgement = ack-nhfb, affiliation = "Tech. Univ. Berlin, Germany", classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Erhard Konrad; Measurement theory; Software metrics", thesaurus = "Computational complexity; Software metrics", } @Article{Pool:1992:DTD, author = "Robert Pool", title = "Did {Turing Discover How} the {Leopard Got Its Spots?}: {Understanding} the way a simple chemical system produces patterns may offer insights into animal development", journal = j-SIGPLAN, volume = "27", number = "12", pages = "28--28", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dumke:1992:MBC, author = "Reiner R. Dumke and Kerstin Neumann and Kerstin Stoeffler", title = "The Metric Based Compiler --- {A} Current Requirement", journal = j-SIGPLAN, volume = "27", number = "12", pages = "29--38", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1992:ISS, author = "Henry G. Baker", title = "Inlining Semantics for Subroutines which are Recursive", journal = j-SIGPLAN, volume = "27", number = "12", pages = "39--46", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McCluskey:1992:TI, author = "Glen McCluskey and Robert B. Murray", title = "Template Instantiation For {C++}", journal = j-SIGPLAN, volume = "27", number = "12", pages = "47--56", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri May 19 10:54:43 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-js, annote = "Reports how template instantiation is done in {\tt cfront}.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McCluskey:1992:TIC, author = "Glen McCluskey and Robert B. Murray", title = "Template instantiation for {C++}", journal = j-SIGPLAN, volume = "27", number = "12", pages = "47--56", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wong:1992:FIP, author = "K. C. Wong", title = "Feature Inversion: {A} Practice on Language Versions Determination", journal = j-SIGPLAN, volume = "27", number = "12", pages = "57--60", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stansifer:1992:CE, author = "Ryan Stansifer", title = "The Calculation of {Easter}", journal = j-SIGPLAN, volume = "27", number = "12", pages = "61--65", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See also \cite{Bevan:1994:LEC}.", abstract = "In a 1962 article that appeared in the Communications of the ACM, Donald Knuth gave two programs for computing the date on which Easter falls. One was written in ALGOL, the other in COBOL. Besides having a fascinating history, this algorithm makes a good, small programming project. The author presents his own programs written in Modula-3 and ML. Modula-3 is an imperative language with modules. Other distinctive features are objects, exception handling, garbage collection, and processes.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA", classification = "C6110 (Systems analysis and programming); C7890 (Other special applications)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Easter; Exception handling; Garbage collection; ML; Modula-3; Modules; Objects; Processes", thesaurus = "Modula listings; Programming", } @Article{Razek:1992:COR, author = "Gottfried Razek", title = "Combining Objects and Relations", journal = j-SIGPLAN, volume = "27", number = "12", pages = "66--70", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zorn:1992:EMS, author = "Benjamin G. Zorn and Dirk Grunwald", title = "Empirical Measurements of Six Allocation-intensive {C} Programs", journal = j-SIGPLAN, volume = "27", number = "12", pages = "71--80", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cattaneo:1992:ACT, author = "G. Cattaneo and G. Di Giore and M. Ruotolo", title = "Another {C} Threads Library", journal = j-SIGPLAN, volume = "27", number = "12", pages = "81--90", month = dec, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Steele:1993:HPF, author = "Guy L. {Steele, Jr.}", title = "{High Performance Fortran}: Status Report", journal = j-SIGPLAN, volume = "28", number = "1", pages = "1--4", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pratt:1993:KCP, author = "Terrence W. Pratt", title = "Kernel-Control Parallel Versus Data Parallel: {A} Technical Comparison", journal = j-SIGPLAN, volume = "28", number = "1", pages = "5--8", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Li:1993:LTN, author = "Wei Li and Keshav Pingali", title = "Loop Transformations for {NUMA} Machines", journal = j-SIGPLAN, volume = "28", number = "1", pages = "9--12", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sharma:1993:DDA, author = "S. Sharma and Chua-Huang Huang and P. Sadayappan", title = "On Data Dependence Analysis for Compiling Programs on Distributed-Memory Machines (Extended Abstract)", journal = j-SIGPLAN, volume = "28", number = "1", pages = "13--16", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Feldman:1993:SML, author = "Jerome A. Feldman and Chu-Cheow Lim and Thomas Rauber", title = "The Shared-Memory Language {pSather} on a Distributed-Memory Multiprocessor", journal = j-SIGPLAN, volume = "28", number = "1", pages = "17--20", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lemke:1993:LAI, author = "Max Lemke and Daniel Quinlan", title = "Library for architecture-independent development of structured grid applications", journal = j-SIGPLAN, volume = "28", number = "1", pages = "21--23", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lemke:1993:PPC, author = "Max Lemke and Daniel Quinlan", title = "{P++}, a Parallel {C++} Array Class Library for Architecture-Independent Development of Structured Grid Applications", journal = j-SIGPLAN, volume = "28", number = "1", pages = "21--23", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 16:43:22 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baden:1993:LPP, author = "Scott B. Baden and Scott R. Kohn", title = "Lattice Parallelism: {A} Parallel Programming Model for Manipulating Non-Uniform Structured Scientific Data Structures", journal = j-SIGPLAN, volume = "28", number = "1", pages = "24--27", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yelick:1993:PMI, author = "Katherine A. Yelick", title = "Programming Models for Irregular Applications", journal = j-SIGPLAN, volume = "28", number = "1", pages = "28--31", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gross:1993:CTD, author = "T. Gross and S. Hinrichs and G. Lueh and D. O'Hallaron and J. Stichnoch and J. Subhlok", title = "Compiling Task and Data Parallel Programs for {iWarp} (Extended Abstract)", journal = j-SIGPLAN, volume = "28", number = "1", pages = "32--35", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bala:1993:EDPa, author = "Vasanth Bala and Jeanne Ferrante", title = "Explicit Data Placement ({XDP}): {A} Methodology for Explicit Compile-Time Representation and Optimization of Data Movement (Extended Abstract)", journal = j-SIGPLAN, volume = "28", number = "1", pages = "36--39", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Snyder:1993:SOS, author = "Lawrence Snyder", title = "Synopsis of {Orca}, {A} Simple Language Implementation of Phase Abstractions", journal = j-SIGPLAN, volume = "28", number = "1", pages = "40--43", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Seevers:1993:PPE, author = "Bradley K. Seevers and Michael J. Quinn and Philip J. Hatcher", title = "A Parallel Programming Environment Supporting Multiple Data-Parallel Modules", journal = j-SIGPLAN, volume = "28", number = "1", pages = "44--47", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Maniatty:1993:EDA, author = "Bill Maniatty and Boleslaw K. Szymanski and Balaram Sinharoy", title = "Efficiency of Data Alignment on {Maspar}", journal = j-SIGPLAN, volume = "28", number = "1", pages = "48--51", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ponnusamy:1993:EDM, author = "Ravi Ponnusamy and Joel Saltz and Raja Das and Charles Koelbel and Alok N. Choudhary", title = "Embedding Data Mappers with Distributed Memory Machine Compilers", journal = j-SIGPLAN, volume = "28", number = "1", pages = "52--55", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bailey:1993:IMD, author = "Peter R. Bailey and Malcolm C. Newey", title = "Implementing {ML} on Distributed Memory Multiprocessors", journal = j-SIGPLAN, volume = "28", number = "1", pages = "56--59", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cox:1993:PTS, author = "Stuart Cox and Shell-Ying Huang and Paul Kelly and Junxian Liu and Frank Taylor", title = "Program Transformations for Static Process Networks", journal = j-SIGPLAN, volume = "28", number = "1", pages = "60--63", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tu:1993:APS, author = "Peng Tu and David A. Padua", title = "Array Privatization for Shared and Distributed Memory Machines (Extended Abstract)", journal = j-SIGPLAN, volume = "28", number = "1", pages = "64--67", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chatterjee:1993:OEA, author = "Siddhartha Chatterjee and John R. Gilbert and Robert Schreiber and Shang-Hua Teng", title = "Optimal Evaluation of Array Expressions on Massively Parallel Machines (Extended Abstract)", journal = j-SIGPLAN, volume = "28", number = "1", pages = "68--71", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chapman:1993:UDM, author = "Barbara M. Chapman and Piyush Mehrotra and Hans P. Zima", title = "User Defined Mappings in {Vienna Fortran}", journal = j-SIGPLAN, volume = "28", number = "1", pages = "72--75", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rosing:1993:PPA, author = "Matthew Rosing and Robert B. Schnabel and Robert P. Weaver", title = "A Programmable Preprocessor Approach to Efficient Parallel Language Design", journal = j-SIGPLAN, volume = "28", number = "1", pages = "76--79", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Brewer:1993:PLS, author = "Eric A. Brewer and Adrian Colbrook and Wilson C. Hsieh and Paul Wang and William E. Weihl", title = "{Pipes}: linguistic support for ordered asynchronous invocations", journal = j-SIGPLAN, volume = "28", number = "1", pages = "80--80", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Carr:1993:DC, author = "Harold Carr and Robert R. Kessler and Mark R. Swanson", title = "Distributed {C++}", journal = j-SIGPLAN, volume = "28", number = "1", pages = "81--81", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gupta:1993:AGD, author = "S. K. S. Gupta and S. D. Kaushik and C.-H. Huang and J. R. Johnson and R. W. Johnson and P. Sadayappan", title = "On the Automatic Generation of Data Distributions", journal = j-SIGPLAN, volume = "28", number = "1", pages = "82--82", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ikei:1993:FCT, author = "Mitsuru Ikei and Michael Wolfe", title = "Functional Compiler techniques for an Imperative Language", journal = j-SIGPLAN, volume = "28", number = "1", pages = "83--83", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kranz:1993:IMPa, author = "David Kranz and Beng-Hong Lim and Kirk L. Johnson and John Kubiatowicz and Anant Agarwal", title = "Integrating Message-Passing and Shared-Memory: Early Experience", journal = j-SIGPLAN, volume = "28", number = "1", pages = "84--84", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Majumdar:1993:ESC, author = "Aloke Majumdar and Marina C. Chen", title = "Efficient {SPMD} Constructs for Asynchronous Message Passing Architectures", journal = j-SIGPLAN, volume = "28", number = "1", pages = "85--85", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Smith:1993:DSI, author = "Sharon L. Smith", title = "Dynamic Scheduling of Irregularly Structured Parallel Computations in Heterogeneous Distributed Systems", journal = j-SIGPLAN, volume = "28", number = "1", pages = "86--86", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zenith:1993:EMI, author = "Steven Ericsson Zenith", title = "{Ease}: the Model and Its Implementation", journal = j-SIGPLAN, volume = "28", number = "1", pages = "87--87", month = jan, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cohen:1993:BRD, author = "Jacques Cohen", title = "Book Review: {DLP --- A Language for Distributed Logic Programming by A. Eliens: (John Wiley and Sons, 1992)}", journal = j-SIGPLAN, volume = "28", number = "2", pages = "13--13", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baowen:1993:SVN, author = "Xu Baowen", title = "On subprograms with a variable number of parameters of varying types", journal = j-SIGPLAN, volume = "28", number = "2", pages = "14--20", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1993:SVN, author = "Baowen Xu", title = "On Subprograms With {A} Variable Number Of Parameters Of Varying Types", journal = j-SIGPLAN, volume = "28", number = "2", pages = "14--20", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 16:39:09 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Waite:1993:ELD, author = "W. M. Waite", title = "An Executable Language Definition", journal = j-SIGPLAN, volume = "28", number = "2", pages = "21--40", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper describes a subset of C, called C--, defined as a literate program using the Eli and FunnelWeb systems.", abstract = "This paper is an application of the literate programming paradigm to language definition. C-- is a scaled down version of C. The features selected illustrate basic problems for compiler designers: scanning, parsing, name analysis, overload resolution, static storage allocation and code generation. Features that merely increase the implementation effort without illustrating such techniques were excluded. This paper defines the structure and meaning of a C-- program. It has five sections, each dealing with one aspect of the language: basic symbols and comments, program structure, declarations, expressions and statements.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. and Comput. Eng., Colorado Univ., Boulder, CO, USA", classification = "C6110B (Software engineering techniques); C6140D (High level languages)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C-- program; Compiler designers; Executable language definition; Literate programming paradigm; Program structure", thesaurus = "C language; Formal specification", } @Article{Nigro:1993:TEO, author = "Libero Nigro", title = "On the Type Extensions of {Oberon-2}", journal = j-SIGPLAN, volume = "28", number = "2", pages = "41--44", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Trehan:1993:COO, author = "Rajiv Trehan and Nobuyuki Sawashima and Akira Morishita and Ichiro Tomoda and Toru Imai and Ken-Ichi Maeda", title = "{Concurrent Object Oriented `C' (cooC)}", journal = j-SIGPLAN, volume = "28", number = "2", pages = "45--52", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schreiweis:1993:IPPa, author = "Uwe Schreiweis and A. Keune and Horst Langend{\"o}rfer", title = "An Integrated {Prolog} Programming Environment", journal = j-SIGPLAN, volume = "28", number = "2", pages = "53--60", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", xxnote = "This article was published in both February and April issues.", } @Article{Abrahams:1993:TEP, author = "Paul W. Abrahams", title = "Typographical Extensions for Programming Languages: Breaking out of the {ASCII} Straitjacket", journal = j-SIGPLAN, volume = "28", number = "2", pages = "61--68", month = feb, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:33 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1993:MCP, author = "Per Brinch Hansen", title = "Monitors and {Concurrent Pascal}: a personal history", journal = j-SIGPLAN, volume = "28", number = "3", pages = "1--35", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p1-hansen/", abstract = "This is a personal history of the early development of the monitor concept and its implementation in the programming language Concurrent Pascal. The paper explains how monitors evolved from the ideas of Dahl, Dijkstra, Hoare, and the author (1971--1973). At Caltech the author and his students developed and implemented Concurrent Pascal and used it to write several model operating systems (1974--1975). A portable implementation of Concurrent Pascal was widely distributed and used for system design (1976--1990). The monitor paradigm was also disseminated in survey papers and text books. The author ends the story by expressing his own mixed feelings about monitors and Concurrent Pascal.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY, USA", classification = "C6110P (Parallel programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Concurrent Pascal; design; languages; Model operating systems; Monitors; Personal history; Programming language", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent Pascal. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", thesaurus = "History; Parallel languages; Pascal; Supervisory programs", } @Article{Colmerauer:1993:BP, author = "Alain Colmerauer and Philippe Roussel", title = "The birth of {Prolog}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "37--52", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p37-colmerauer/", abstract = "The programming language, Prolog, was born of a project aimed not at producing a programming language but at processing natural languages; in this case, French. The project gave rise to a preliminary version of Prolog at the end of 1971 and a more definitive version at the end of 1972. This article gives the history of this project and describes in detail the preliminary and then the final versions of Prolog. The authors also felt it appropriate to describe the Q-systems since it was a language which played a prominent part in Prolog's genesis.", acknowledgement = ack-nhfb, affiliation = "Groupe Intelligence Artificielle, Fac. des Sci. de Luminy, Marseille, France", classification = "C6110L (Logic programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; French; History; languages; Natural languages; Programming language; Prolog; Q-systems", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf I.2.7} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Natural Language Processing. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf I.2.1} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Applications and Expert Systems, Natural language interfaces. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software.", thesaurus = "History; PROLOG", } @Article{Griswold:1993:HIP, author = "Ralph E. Griswold and Madge T. Griswold", title = "History of the {Icon} programming language", journal = j-SIGPLAN, volume = "28", number = "3", pages = "53--68", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p53-griswold/", abstract = "The Icon programming language, which was conceived in 1977, was strongly influenced by the earlier SNOBOL languages and the subsequent SL5. This paper concentrates primarily on the early development of Icon, but also discusses subsequent versions. The motivation, design philosophy, and environmental factors that shaped Icon are emphasized in this paper.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "documentation; Icon programming language; languages; management; SL5; SNOBOL languages; standardization", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ICON. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, SNOBOL. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software.", thesaurus = "High level languages; History", } @Article{Kay:1993:EHS, author = "Alan C. Kay", title = "The early history of {Smalltalk}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "69--95", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p69-kay/", abstract = "Most ideas come from previous ideas. The sixties, particularly in the ARPA community, gave rise to a host of notions about ``human-computer symbiosis'' through interactive time-shared computers, graphics screens and pointing devices. Advanced computer languages were invented to simulate complex systems such as oil refineries and semi-intelligent behavior. The soon to follow paradigm shift of modern personal computing, overlapping window interfaces, and object-oriented design came from seeing the work of the sixties as something more than a ``better old thing''. That is, more than a better way: to do mainframe computing; for end-users to invoke functionality; to make data structures more abstract. Instead the promise of exponential growth in computing/\$/volume demanded that the sixties be regarded as ``{\em almost\/} a new thing'' and to find out what the actual ``new things'' might be. For example, one would compute with a handheld ``Dynabook'' in a way that would not be possible on a shared mainframe; millions of potential users meant that the user interface would have to become a learning environment along the lines of Montessori and Bruner; and needs for large scope, reduction in complexity, and end-user literacy would require that data and control structures be done away with in favor of a more biological scheme of protected universal cells interacting only through messages that could mimic any desired behavior. Early Smalltalk was the first complete realization of these new points of view as parented by its many predecessors in hardware, language and user interface design. It became the exemplar of the new computing, in part, because we were actually trying for a qualitative shift in belief structures---a new Kuhnian paradigm in the same spirit as the invention of the printing press---and thus took highly extreme positions which almost forced these new styles to be invented.", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Belief structure; design; Kuhnian paradigm; languages; Smalltalk; User interface", subject = "{\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk-80. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Hardware. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, User interfaces. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, XEROX. {\bf K.8.0} Computing Milieux, PERSONAL COMPUTING, General. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters.", thesaurus = "History; Smalltalk", } @Article{Lindsey:1993:HA, author = "C. H. Lindsey", title = "A history of {ALGOL} 68", journal = j-SIGPLAN, volume = "28", number = "3", pages = "97--132", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p97-lindsey/", abstract = "ALGOL 68 is a language with a lot of `history'. The reader will hear of discord, resignations, unreadable documents, a minority report, and all manner of politicking. But although ALGOL 68 was produced by a committee (and an unruly one at that), the language itself is no camel. Indeed, the rigorous application of the principle of ``orthogonality'' makes it one of the cleanest languages around, as I hope to show. Moreover, when the language came to be revised, the atmosphere was quite different, enabling a much more robust and readable defining document to be produced in a spirit of true cooperation. There are some lessons here for future language design efforts, but I am not optimistic that they have been learned.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ALGOL 68; algorithms; History; human factors; languages; Orthogonality; standardization", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL-68. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, People. {\bf H.1.2} Information Systems, MODELS AND PRINCIPLES, User/Machine Systems, Human factors. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", thesaurus = "ALGOL; History", } @Article{Liskov:1993:HC, author = "Barbara Liskov", title = "A history of {CLU}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "133--147", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p133-liskov/", abstract = "The idea of a data abstraction has had a significant impact on the development of programming languages and on programming methodology. CLU was the first implemented programming language to provide direct linguistic support for data abstraction. This paper provides a history of data abstraction and CLU. CLU contains a number of other interesting and influential features, including its exception handling mechanism, its iterators, and its parameterized types.", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", classification = "C6110J (Object-oriented programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "CLU; Data abstraction; design; Exception handling mechanism; History; languages; Linguistic support; Programming languages; Programming methodology", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, CLU. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, People. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software.", thesaurus = "Abstract data types; High level languages; History; Object-oriented languages; Structured programming", } @Article{Nance:1993:HDE, author = "Richard E. Nance", title = "A history of discrete event simulation programming languages", journal = j-SIGPLAN, volume = "28", number = "3", pages = "149--175", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p149-nance/", abstract = "The history of simulation programming languages is organized as a progression in periods of similar developments. The five periods, spanning 1955-1986, are labeled: The Period of Search (1955-1960); The advent (1961-1965); The Formative Period (1966-1970); The Expansional Period (1971-1978), and The Period of Consolidation and Regeneration (1979-1986). The focus is on recognizing the people and places that have made important contributions in addition to the nature of the contribution. A balance between comprehensive and in-depth treatment has been reached by providing more detailed description of those languages which have or have had major use. Over 30 languages are mentioned, and numerous variations are described in the major contributors. A concluding summary notes the concepts and techniques either originating with simulation programming languages or given significant visibility by them.", acknowledgement = ack-nhfb, affiliation = "Virginia Polytech. Inst. and State Univ., Blacksburg, VA, USA", classification = "C6140D (High level languages); C6185 (Simulation techniques)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; Discrete event simulation programming languages; History; languages", subject = "{\bf I.6.2} Computing Methodologies, SIMULATION AND MODELING, Simulation Languages. {\bf I.6.8} Computing Methodologies, SIMULATION AND MODELING, Types of Simulation, Discrete event. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, People. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software.", thesaurus = "Discrete event simulation; History; Simulation languages", } @Article{Rather:1993:EF, author = "Elizabeth D. Rather and Donald R. Colburn and Charles H. Moore", title = "The evolution of {Forth}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "177--199", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p177-rather/", abstract = "Forth is unique among programming languages in that its development and proliferation has been a grass-roots effort unsupported by any major corporate or academic sponsors. Originally conceived and developed by a single individual, its later development progressed under two significant influences: professional programmers who developed tools to solve application problems and then commercialized them, and the interests of hobbyists concerned with free distribution of Forth. These influences have produced a language markedly different from traditional programming languages.", acknowledgement = ack-nhfb, affiliation = "FORTH Inc., Manhattan Beach, CA, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; Forth; History; languages; management; Programming languages; standardization", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters.", thesaurus = "FORTH; History", } @Article{Ritchie:1993:DCL, author = "Dennis M. Ritchie", title = "The development of the {C} language", journal = j-SIGPLAN, volume = "28", number = "3", pages = "201--208", month = mar, year = "1993", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/234286.1057834", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p201-ritchie/", abstract = "The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become one of the dominant languages of today. This paper studies its evolution.", acknowledgement = ack-nhfb, affiliation = "AT and T Bell Lab., Murray Hill, NJ, USA", author-dates = "Dennis M. Ritchie (9 September 1941--12 October 2011)", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "BCPL; C programming language; design; languages; Programming environment; standardization; Type structure; Typeless language; Unix operating system", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, BCPL.", thesaurus = "C language; History", } @Article{Sammet:1993:BDF, author = "Jean E. Sammet", title = "The beginning and development of {FORMAC (FORmula MAnipulation Compiler)}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "209--230", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p209-sammet/", abstract = "The first widely available programming language for symbolic mathematical computation to have significant practical usage was FORMAC (FORmula MAnipulation Compiler). This paper discusses the earliest conceptual work in detail, and then provides information about later developments of the language. Other languages and systems of the early and mid-1960s are described briefly, with emphasis on their relation to FORMAC. There are also a few glimpses into the software management process at IBM. Finally there is an evaluation of FORMAC and its influence.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C7310 (Mathematics)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; FORMAC; IBM; languages; Programming language; Software management process; Symbolic mathematical computation", subject = "{\bf K.2} Computing Milieux, HISTORY OF COMPUTING, FORMAC. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and Systems.", thesaurus = "High level languages; History; Mathematics computing; Symbol manipulation", } @Article{Steele:1993:EL, author = "Guy L. {Steele, Jr.} and Richard P. Gabriel", title = "The evolution of {Lisp}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "231--270", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p231-steele/", abstract = "Lisp is the world's greatest programming language---or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one-upsmanship, and the glee born of technical cleverness that is characteristic of the ``hacker culture'' than by sober assessments of technical requirements. Nevertheless this process has eventually produced both an industrial-strength programming language, messy but powerful, and a technically pure dialect, small but powerful, that is suitable for use by programming-language theoreticians.\par We pick up where McCarthy's paper in the first HOPL conference left off. We trace the development chronologically from the era of the PDP-6, through the heyday of Interlisp and MacLisp, past the ascension and decline of special purpose Lisp machines, to the present era of standardization activities. We then examine the technical evolution of a few representative language features, including both some notable successes and some notable failures, that illuminate design issues that distinguish Lisp from other programming languages. We also discuss the use of Lisp as a laboratory for designing other programming languages. We conclude with some reflections on the forces that have driven the evolution of Lisp.", acknowledgement = ack-nhfb, affiliation = "Thinking Machines Corp., Cambridge, MA, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; Interlisp; languages; Lisp; MacLisp; PDP-6; Programming languages; Special purpose Lisp machines; standardization; Standardization", subject = "{\bf K.2} Computing Milieux, HISTORY OF COMPUTING, LISP. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, LISP. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Common Lisp.", thesaurus = "History; LISP", } @Article{Stroustrup:1993:HC, author = "Bjarne Stroustrup", title = "A history of {C++}: 1979--1991", journal = j-SIGPLAN, volume = "28", number = "3", pages = "271--297", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p271-stroustrup/", abstract = "This paper outlines the history of the C++ programming language. The emphasis is on the ideas, constraints, and people that shaped the language, rather than the minuitiae of language features. Key design decisions relating to language features are discussed, but the focus is on the overall design goals and practical constraints. The evolution of C++ is traced from C with Classes to the current ANSI and ISO standards work and the explosion of use, interest, commercial activity, compilers, tools, environments, and libraries.", acknowledgement = ack-nhfb, affiliation = "AT and T Bell Labs., Murray Hill, NJ, USA", classification = "C6110J (Object-oriented programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ANSI; C++; Compilers; design; Environments; History; ISO; Language features; languages; Libraries; Programming language", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\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.", thesaurus = "C language; History; Object-oriented languages", } @Article{Whitaker:1993:APD, author = "William A. Whitaker", title = "{Ada}---the project: the {DoD High Order Language Working Group}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "299--331", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p299-whitaker/", abstract = "The Department of Defense (DoD) High Order Language Commonality program began in 1975 with the goal of establishing a single high order computer programming language appropriate for DoD real-time embedded computer systems. A High Order Language Working Group (HOLWG) was chartered to formulate the DoD requirements for High Order Languages, to evaluate existing languages against those requirements, and to implement the minimal set of languages required for DoD use. Other parts of the effort included administrative initiatives toward the eventual goal. Specifically, DoD Directive 5000.29 which provided that new defense systems should be programmed in a DoD ``approved'' and centrally controlled high order language and DoD Instruction 5000.31 which gave the interim defining list of approved languages. The HOLWG language requirements were widely distributed for comment throughout the military and civil communities worldwide. Each successive version of the requirements, from STRAWMAN through STEELMAN, produced a more refined definition of the proposed language. During the requirement development process, it was determined that the set of requirements generated was both necessary and sufficient for all major DoD applications (and the analogous large commercial applications). Formal evaluations were performed on dozens of existing languages. It was concluded that no existing language could be adopted as a single common high order language for the DoD, but that a single language meeting essentially all the requirements was both feasible and desirable. Four contractors were funded to produce competitive prototypes. A first-phase evaluation reduced the designs to two, which were carried to completion. In turn, a single language design was subsequently chosen. Follow-on steps included the test and evaluation of the language, control of the language and validation of compilers. The production of compilers and a program development and tool environment were to be accomplished separately by the individual Service Components. The general requirements and expectations for the environment and the control of the language were addressed in another iterative series of documents. A language validation capability (the test code suite) and associated facilities were established to assure compliance to the language definition of compilers using the name ``Ada''. The name Ada was initially protected by a DoD-owned trademark.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C7150 (Military)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Ada; Compilers; Department of Defense; design; High Order Language Commonality program; High Order Language Working Group; History; languages; management", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Ada. {\bf J.7} Computer Applications, COMPUTERS IN OTHER SYSTEMS, Military. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, Software. {\bf K.2} Computing Milieux, HISTORY OF COMPUTING, People. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development.", thesaurus = "Ada; History; Military computing", } @Article{Wirth:1993:RAD, author = "N. Wirth", title = "Recollections about the development of {Pascal}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "333--342", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p333-wirth/", abstract = "Pascal was defined in 1970 and, after a slow start, became one of the most widely used languages in introductory programming courses. This article first summarises the events leading to Pascal's design and implementation, and then proceeds with a discussion of some of the language's merits and deficiencies. In the last part, developments that followed its release are recounted. Its influence chiefly derived from its being a vehicle for structured programming and a basis for further development of languages and for experiments in program verification.", acknowledgement = ack-nhfb, affiliation = "Inst. fur Computersyst., ETH Zurich, Switzerland", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; History; Introductory programming courses; languages; management; Pascal; Program verification; Structured programming", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Pascal. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", thesaurus = "History; Pascal", } @Article{Gargaro:1993:BIA, author = "Anthony Gargaro", title = "A brief introduction to {Ada}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "343--344", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p343-gargaro/", abstract = "Ada is a procedural programming language oriented towards developing maintainable real-time safety-critical applications. The language is an international standard (ISO-8652), is strictly controlled through formal validation, and there are over 450 validated Ada compilers available on all types of computers. Ada is the standard programming language for embedded military systems (MIL-STD-1815A). In addition, because Ada promotes a disciplined and systematic style of programming, it is used to exemplify preferred software engineering techniques within many computer science curricula and is often used in very large non-military applications.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Ada; Ada compilers; Computer science curricula; Embedded military systems; Formal validation; International standard; ISO-8652; languages; Maintainable real-time safety-critical applications; MIL-STD-1815A; Procedural programming language; Software engineering techniques", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Ada. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Software libraries. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", thesaurus = "Ada; Standards", } @Article{Bowlden:1993:IA, author = "Henry J. Bowlden", title = "An introduction to {ALGOL} 68", journal = j-SIGPLAN, volume = "28", number = "3", pages = "345--346", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p345-bowlden/", abstract = "The language ALGOL 68 was conceived as a successor to ALGOL 60, with special attention to be given to a widened scope of applicability and to a more rigorously defined syntax and semantics. In the final analysis, the contributions of the ALGOL 68 effort to the development of computer science stem primarily from original design concepts which were passed on in one form or another to many of the subsequently developed programming languages. Some implementations based on a sublanguage became popular in academic environments and were used as a basis for courses in computer programming.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Academic environments; ALGOL 68; algorithms; Computer programming; design; Design concepts; languages; Semantics; Syntax", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL-68. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Input/output.", thesaurus = "ALGOL", } @Article{McKeeman:1993:BIC, author = "W. M. McKeeman", title = "A brief introduction to {C}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "347--348", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p347-mckeeman/", abstract = "The most evident strength of C is that there is a standard for the language and compilers are everywhere. The distinguishing feature of C is its simplicity; it can be learned in a week. The simplicity of C is enabled by pushing many concepts off behind function calls into the run-time library-string manipulation, input/output, heat allocation, exceptions, asynchronous tasks. Because the C standard does not tie down all the details, and because most compilers have some extensions, making C programs portable is a significant and demanding activity. On the other hand, the language is defined to make good optimization possible. Because of the flexibility of C and the ubiquity of its compilers, C is often a target language for other translators. Finally, standard C has been made internationally viable by adding a locale mechanism which frees the language from its American cultural roots.", acknowledgement = ack-nhfb, affiliation = "Digital Equipment Corp., Maynard, MA, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Asynchronous tasks; Compilers; Exceptions; Heat allocation; Input/output; languages; Locale mechanism; Optimization; Run-time library; standardization; String manipulation", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Modules, packages. {\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, Procedures, functions, and subroutines.", thesaurus = "C language", } @Article{Schwarz:1993:BIC, author = "Jerry Schwarz", title = "A brief introduction to {C++}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "349--350", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p349-schwarz/", abstract = "C++ is a procedural language in the tradition of the Algol family. It is a direct descendant of C and shares with C much syntax and semantics with extensions primarily in the type system. The type system is static (that is, type correctness is checked at compile time) and runtime efficiency of C++ code is not compromised by the introduction of more complicated types.", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; C++; languages; Procedural language; Runtime efficiency; Type correctness; Type system", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", thesaurus = "C language; Object-oriented languages", } @Article{Guttag:1993:BIC, author = "John Guttag", title = "A brief introduction to {CLU}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "351--352", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p351-guttag/", abstract = "CLU is an imperative programming language that features several interesting abstraction mechanisms. On the surface it looks like a member of the Algol family of languages: its syntax is Algol-like and it is lexically scoped and strongly typed. However, CLU's underlying semantic model is much closer to LISP's than to Algol's.", acknowledgement = ack-nhfb, affiliation = "MIT, Cambridge, MA, USA", classification = "C6110J (Object-oriented programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstraction mechanisms; CLU; Imperative programming language; languages; Semantic model", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, CLU. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", thesaurus = "High level languages; Object-oriented languages", } @Article{Hayden:1993:BIC, author = "Charles Hayden", title = "A brief introduction to {Concurrent Pascal}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "353--354", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p353-hayden/", abstract = "Concurrent Pascal is designed for writing concurrent programs such as operating systems and real-time monitoring systems on shared-memory computers. A separate language, Sequential Pascal, is used as the language for applications programs run by operating systems written in Concurrent Pascal. Both languages are extensions of Wirth's Pascal, and share a common threaded code interpreter. The article describes how Concurrent Pascal differs from Wirth's Pascal.", acknowledgement = ack-nhfb, affiliation = "AT and T Bell Labs., Middletown, NJ, USA", classification = "C6110P (Parallel programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Concurrent Pascal; languages; Operating systems; Real-time monitoring systems; Sequential Pascal; Shared-memory computers; Threaded code interpreter", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent Pascal. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Pascal. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", thesaurus = "Parallel languages; Pascal", } @Article{Griesmer:1993:BIF, author = "James H. Griesmer", title = "A brief introduction to {FORMAC}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "355--356", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p355-griesmer/", abstract = "FORMAC (formula manipulation compiler) was an early programming language for symbolic mathematical computation which gained a widespread user community. The concept of FORMAC was to add a symbolic capability to an existing language for numerical computing that already had a community of users. 7090/94 FORMAC was developed as an extension to FORTRAN IV, and, as indicated by its name, PL/I-FORMAC was an extension to PL/I. A FORMAC user had the full numerical and iteration capability of the base language, plus a symbolic computing capability, and thus could write programs in a familiar syntax to do symbolic computation. In short, FORMAC was a complete programming language, not just a collection of subroutines which the user had to access by writing a top-level program.", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", classification = "C6140D (High level languages); C7310 (Mathematics)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "7090/94 FORMAC; algorithms; FORMAC; FORTRAN IV; languages; PL/I-FORMAC; Programming language; Symbolic mathematical computation", subject = "{\bf K.2} Computing Milieux, HISTORY OF COMPUTING, FORMAC. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and Systems.", thesaurus = "High level languages; Mathematics computing; Symbol manipulation", } @Article{Koopman:1993:BIF, author = "Philip J. {Koopman, Jr.}", title = "A brief introduction to {Forth}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "357--358", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p357-koopman/", abstract = "Forth is both an extensible language and an interactive program development methodology. Originally developed for small embedded control mini- and micro-computers. Forth seems to have been implemented on every major processor manufactured. It has been used in a wide variety of applications, including spreadsheets, expert systems, and multi-user databases.", acknowledgement = ack-nhfb, affiliation = "United Technologies Research Center, East Hartford, CT, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Extensible language; Forth; Interactive program development methodology; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", thesaurus = "FORTH", } @Article{Hanson:1993:BII, author = "David R. Hanson", title = "A brief introduction to {Icon}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "359--360", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p359-hanson/", abstract = "Icon is a very high-level imperative language with a rich repertoire of string and structure processing facilities. It is available on a wide range of computers and is in wide use. In Icon, values, not variables, are typed. Built-in data types include numerics, character sets, strings, sets, lists, associative tables, records, and procedures. The aggregate types-sets, lists, tables, and records-can hold values of any type. Tables can be indexed by values of any type. Numerics, character sets, and strings are atomic values; operations on them produce new values. Aggregates use pointer semantics; operations on them can change existing values as well as produce new ones. Strings and aggregates can be of arbitrary size, and their sizes can change during execution. Memory management is automatic. Icon has an expression-oriented syntax, even control structures are expressions. Procedures consist of zero or more expressions separated by newlines or semicolons. Icon programs consist of one or more procedure definitions, and execution begins by calling the procedure named main.", acknowledgement = ack-nhfb, affiliation = "Princeton Univ., NJ, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Aggregate types; algorithms; Associative tables; Character sets; Control structures; Data types; Expression-oriented syntax; Icon; languages; Lists; Numerics; Pointer semantics; Procedures; Records; Sets; Strings; Structure processing; Values; Very high-level imperative language", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ICON. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", thesaurus = "High level languages", } @Article{Sussman:1993:BIL, author = "G. J. Sussman and G. L. {Steele, Jr.} and R. P. Gabriel", title = "A brief introduction to {Lisp}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "361--362", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p361-lee/", abstract = "Lisp is a functional programming language with imperative features. By functional the authors mean that the overall style of the language is organized primarily around expressions and functions rather than statements and subroutines. Every Lisp expression returns some value. Every Lisp procedure is syntactically a function; when called, it returns some data object as its value. By imperative they mean that some Lisp expressions and procedures have side effects, such as storing into variables or array positions. Thus Lisp procedures are not always functions in the `pure' sense of logicians, but in practice they are frequently referred to as `functions' anyway, even those that may have side effects, in order to emphasize that a computed result is always returned. Imperative features are usually used sparingly; while it is possible to transliterate, say, Fortran code directly into Lisp. the result would not exhibit typical Lisp programming style.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Functional programming language; Imperative features; languages; Lisp", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, LISP. {\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, Procedures, functions, and subroutines.", thesaurus = "LISP", xxnote = "The URL above is incorrectly named, and its author attribution is also incorrect. The error was reported to webmaster@www.acm.org on Tue May 4 07:08:34 1999.", } @Article{Lee:1993:BIP, author = "Peter Lee", title = "A brief introduction to {Pascal}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "363--364", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p363-lee/", abstract = "Pascal is syntactically similar to ALGOL60, borrowing the nested block structure and having recursive procedures and functions. However, some differences arise out of the desire for simplicity, orthogonality, and efficiency. The main innovation of Pascal is its system of static types. Like ALGOL, the type of every variable must be declared. However, in Pascal it is possible to declare new types. Types can be constructed from the usual primitive types such as integer, boolean, and real. In addition, one can define the values of a type by enumeration or as a subrange of another type. As a result, Pascal brought together for the first time a wide variety of features for data-structuring into the type system of the language. These facilities allow one to built up structured types such as arrays, records, sets, and files from other types. Pointer types are also provided, which in conjunction with recursive definition of types permit creation of dynamically allocated data structures such as LISP-like lists and trees.", acknowledgement = ack-nhfb, affiliation = "Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ALGOL60; algorithms; Data structures; Enumeration; languages; Pascal; Static types", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Pascal. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf E.1} Data, DATA STRUCTURES, Trees.", thesaurus = "Pascal", } @Article{Pereira:1993:BIP, author = "Fernando Pereira", title = "A brief introduction to {Prolog}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "365--366", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p365-pereira/", abstract = "Because of its origins in logic and formal grammars. Prolog has a very simple abstract syntax which has been given a variety of different concrete realizations over the years. The author uses the concrete syntax in the current draft ISO standard for Prolog, and shows the correspondence of that syntax to the original Marseille syntax is described in The Birth of Prolog. (A. Colmerauer et al., ibid., p.37-52).", acknowledgement = ack-nhfb, affiliation = "AT and T Bell Labs., Murray HIll, NJ, USA", classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstract syntax; algorithms; Concrete syntax; Draft ISO standard; Formal grammars; languages; Marseille syntax; Prolog", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", thesaurus = "PROLOG", } @Article{Budd:1993:BIS, author = "Tim Budd", title = "A brief introduction to {Smalltalk}", journal = j-SIGPLAN, volume = "28", number = "3", pages = "367--368", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p367-budd/", abstract = "The guiding principle behind the development of Smalltalk was that of recursive design; `making the part have the same power as the whole'. In short, computation is viewed as a process carried out through the interactions of a collection of autonomous interacting computing units, called objects. Five characteristics of objects can be considered to be applicable to all the Smalltalk languages. These are: (1) everything is an object; (2) objects communicate by sending and receiving messages; (3) objects have their own memory; (4) every object is an instance of a class (which must itself be an object); and (5) the class holds the shared behavior for its instances. Later versions of Smalltalk (-76 and -80) added a different sixth principle: (6) classes are organized into a singly-rooted tree structure, called the inheritance hierarchy. Memory and behavior associated with instances of a class are automatically available to any class associated with a descendent in this tree structure.", acknowledgement = ack-nhfb, affiliation = "Oregon State Univ., Corvallis, OR, USA", classification = "C6110J (Object-oriented programming); C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Inheritance hierarchy; languages; Messages; Objects; Recursive design; Smalltalk", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", thesaurus = "Smalltalk", } @Article{Kiviat:1993:BID, author = "Philip Kiviat", title = "A brief introduction to discrete-event simulation programming languages", journal = j-SIGPLAN, volume = "28", number = "3", pages = "369--370", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:34 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/154766/p369-kiviat/", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6185 (Simulation techniques)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confname = "HOPL-II. The second ACM SIGPLAN conference on History of programming languages, April 20--23, 1993, Cambridge, MA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Attributes; Discrete-event simulation programming languages; languages; Relationship values; Time-dependent behavior", subject = "{\bf I.6.2} Computing Methodologies, SIMULATION AND MODELING, Simulation Languages. {\bf I.6.8} Computing Methodologies, SIMULATION AND MODELING, Types of Simulation, Discrete event.", thesaurus = "Discrete event simulation; Simulation languages", } @Article{Anonymous:1993:CME, author = "Anonymous", title = "Computer museum ephemera announcement", journal = j-SIGPLAN, volume = "28", number = "3", pages = "viii--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Anonymous:1993:SOH, author = "Anonymous", title = "Special offer for {HOPL} books", journal = j-SIGPLAN, volume = "28", number = "3", pages = "xiii--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Lee:1993:A, author = "John A. N. Lee", title = "Acknowledgements", journal = j-SIGPLAN, volume = "28", number = "3", pages = "vii--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Lee:1993:GI, author = "John A. N. Lee and Jean E. Sammet", title = "General introduction", journal = j-SIGPLAN, volume = "28", number = "3", pages = "i--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Mahoney:1993:MH, author = "Michael S. Mahoney", title = "`What makes history?'", journal = j-SIGPLAN, volume = "28", number = "3", pages = "x--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Sammet:1993:PD, author = "Jean E. Sammet", title = "Program development", journal = j-SIGPLAN, volume = "28", number = "3", pages = "iii--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Wexelblat:1993:EI, author = "Richard L. Wexelblat", title = "{Editor}'s introduction", journal = j-SIGPLAN, volume = "28", number = "3", pages = "ix--??", month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Norris:1993:BRM, author = "John W. Norris", title = "Book Review: {Micro Focus Workbench: Developing Mainframe Applications on the PC by Alida Jatich and Phil Nowak: (John Wiley \& Sons, New York, NY 1992)}", journal = j-SIGPLAN, volume = "28", number = "4", pages = "7--7", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Weisert:1993:KR, author = "Conrad Weisert", title = "Has the {King} Returned?", journal = j-SIGPLAN, volume = "28", number = "4", pages = "9--10", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hernandez:1993:APL, author = "J. Hern{\'a}ndez and Pedro de Miguel and M. Barrena and J. M. Mart{\'\i}nez and A. Polo and M. Nieto", title = "{ALBA}: {A} Parallel Language Based on Actors", journal = j-SIGPLAN, volume = "28", number = "4", pages = "11--20", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schreiweis:1993:IPPb, author = "Uwe Schreiweis and A. Keune and Horst Langend{\"o}rfer", title = "An Integrated {Prolog} Programming Environment", journal = j-SIGPLAN, volume = "28", number = "4", pages = "21--28", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", xxnote = "This article was published in both February and April issues.", } @Article{Ivanovic:1993:DIL, author = "Mirjana Ivanovic and Zoran Budimac", title = "A Definition of an {ISWIM}-Like Language via {Scheme}", journal = j-SIGPLAN, volume = "28", number = "4", pages = "29--38", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shu:1993:ADO, author = "William S. Shu", title = "Adapting a Debugger for Optimized Programs", journal = j-SIGPLAN, volume = "28", number = "4", pages = "39--44", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stolz:1993:ART, author = "Otto Stolz", title = "Anonymous Routine-Texts: an Orthogonal Approach to Block Objects", journal = j-SIGPLAN, volume = "28", number = "4", pages = "45--48", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baowen:1993:CPP, author = "Xu Baowen", title = "{CRL\slash Pascal}: a {Pascal-oriented} cross reference language and its applications", journal = j-SIGPLAN, volume = "28", number = "4", pages = "49--54", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1993:CPP, author = "Baowen Xu", title = "{CRL\slash Pascal}: {A} {Pascal}-oriented Cross Reference Language And Its Applications", journal = j-SIGPLAN, volume = "28", number = "4", pages = "49--54", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:09:15 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1993:IMG, author = "Henry G. Baker", title = "`Infant Mortality' and Generational Garbage Collection", journal = j-SIGPLAN, volume = "28", number = "4", pages = "55--57", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Davison:1993:JSM, author = "Andrew Davison", title = "{15th July 1972}: {A} Significant Moment for Logic Programming", journal = j-SIGPLAN, volume = "28", number = "4", pages = "58--60", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Templ:1993:SAM, author = "Josef Templ", title = "A Systematic Approach to Multiple Inheritance Implementation", journal = j-SIGPLAN, volume = "28", number = "4", pages = "61--66", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hall:1993:PCC, author = "Philip W. {Hall, IV}", title = "Parsing with {C++} Constructors", journal = j-SIGPLAN, volume = "28", number = "4", pages = "67--68", month = apr, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hu:1993:CCK, author = "Shibin Hu", title = "Comment on {Cooper} and {Kennedy}'s Flow-Insensitive Interprocedural Summary Information Computation Algorithm", journal = j-SIGPLAN, volume = "28", number = "5", pages = "3--8", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See comments \cite{Banning:1993:CCSa,Banning:1993:CCSb}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Badii:1993:DSS, author = "M. Badii and F. Abdollahzadeh", title = "Dynamic Semantic Specification by Two-Level Grammars for a Block Structured Language with Subroutine Parameters", journal = j-SIGPLAN, volume = "28", number = "5", pages = "9--18", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuhua:1993:APE, author = "Zheng Yuhua and Tu Honglei and Xie Li", title = "And\slash Or Parallel Execution of Logic Programs: Exploiting Dependent And-Parallelism", journal = j-SIGPLAN, volume = "28", number = "5", pages = "19--28", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:16:02 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuhua:1993:PEL, author = "Zheng Yuhua and Tu Honglei and Xie Li", title = "And\slash Or parallel execution of logic programs: exploiting dependent {And-parallelism}", journal = j-SIGPLAN, volume = "28", number = "5", pages = "19--28", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Drechsler:1993:VKR, author = "Karl-Heinz Drechsler and Manfred P. Stadel", title = "A variation of {Knoop}, {R{\"u}thing}, and {Steffen}'s {{\em Lazy Code Motion}}", journal = j-SIGPLAN, volume = "28", number = "5", pages = "29--38", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Passia:1993:FFI, author = "Jacek Passia and Klaus-Peter L{\"o}hr", title = "{Fips}: {A} Functional-Imperative Language for Explorative Programming", journal = j-SIGPLAN, volume = "28", number = "5", pages = "39--48", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wentworth:1993:GRE, author = "E. P. Wentworth", title = "Generalized Regular Expressions --- a Programming Exercise in {Haskell}", journal = j-SIGPLAN, volume = "28", number = "5", pages = "49--54", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "functional", } @Article{Xu:1993:PSP, author = "Baowen Xu", title = "{PIDL} \slash{} {Pascal}: {A} {Pascal}-oriented Program Interface Description Language And Its Applications", journal = j-SIGPLAN, volume = "28", number = "5", pages = "53--62", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:16:02 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baowen:1993:PPP, author = "Xu Baowen", title = "{PIDL\slash Pascal}: a {Pascal-oriented} program interface description language and its applications", journal = j-SIGPLAN, volume = "28", number = "5", pages = "55--62", month = may, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:36 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wahbe:1993:PDB, author = "Robert Wahbe and Steven Lucco and Susan L. Graham", title = "Practical data breakpoints: design and implementation", journal = j-SIGPLAN, volume = "28", number = "6", pages = "1--12", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p1-wahbe/", abstract = "A data breakpoint associates debugging actions with programmer-specified conditions on the memory state of an executing program. Data breakpoints provide a means for discovering program bugs that are tedious or impossible to isolate using control breakpoints alone. In practice, programmers rarely use data breakpoints, because they are either unimplemented or prohibitively slow in available debugging software. In this paper, we present the design and implementation of a practical data breakpoint facility. A data breakpoint facility must monitor all memory updates performed by the program being debugged. We implemented and evaluated two complementary techniques for reducing the overhead of monitoring memory updates. First, we checked write instructions by inserting checking code directly into the program being debugged. The checks use a {\em segmented bitmap\/} data structure that minimizes address lookup complexity. Second, we developed data flow algorithms that eliminate checks on some classes of write instructions but may increase the complexity of the remaining checks. We evaluated these techniques on the SPARC using the SPEC benchmarks. Checking each write instruction using a segmented bitmap achieved an average overhead of 42\%. This overhead is {\em independent\/} of the number of breakpoints in use. Data flow analysis eliminated an average of 79\% of the dynamic write checks. For scientific programs such the NAS kernels, analysis reduced write checks by a factor of ten or more. On the SPARC these optimizations reduced the average overhead to 25\%.", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6120 (File organisation); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Address lookup complexity; Checking code; Complementary techniques; Complexity; Data flow algorithms; Debugging actions; design; Executing program; languages; Memory state; Memory updates; performance; Practical data breakpoint facility; Programmer-specified conditions; Segmented bitmap data structure; SPARC; SPEC benchmarks; Write instructions", subject = "{\bf C.0} Computer Systems Organization, GENERAL, SPARC. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", thesaurus = "Computational complexity; Data structures; Program debugging; Storage management; System monitoring", } @Article{Adl-Tabatabai:1993:DRE, author = "Ali-Reza Adl-Tabatabai and Thomas Gross", title = "Detection and recovery of endangered variables caused by instruction scheduling", journal = j-SIGPLAN, volume = "28", number = "6", pages = "13--25", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p13-adl-tabatabai/", abstract = "Instruction scheduling re-orders and interleaves instruction sequences from different source statements. This impacts the task of a symbolic debugger, which attempts to present the user a picture of program execution that matches the source program. At a breakpoint {\em B\/}, if the value in the run-time location of a variable {\em V\/} may not correspond to the value the user expects {\em V\/} to have, then this variable is {\em endangered\/} at {\em B\/}. This paper describes an approach to detecting and recovering endangered variables caused by instruction scheduling. We measure the effects of instruction scheduling on a symbolic debugger's ability to recover source values at a breakpoint. This paper reports measurements for three C programs from the SPEC suite and a collection of programs from the Numerical Recipes, which have been compiled with a variant of a commercial C compiler.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comp. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Breakpoint; C programs; Commercial C compiler; Endangered variables; Instruction scheduling; Instruction sequences; languages; Numerical Recipes; performance; Program execution; Run-time location; Source statements; Source values; SPEC suite; Symbolic debugger", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Error handling and recovery. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", thesaurus = "Program compilers; Program debugging; Programming; Scheduling; System recovery", } @Article{Boyd:1993:IAO, author = "Mickey R. Boyd and David B. Whalley", title = "Isolation and analysis of optimization errors", journal = j-SIGPLAN, volume = "28", number = "6", pages = "26--35", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p26-boyd/", abstract = "Descriptions are given of two related tools developed to support the isolation and analysis of optimization errors in the vpo optimizer. Both tools rely on vpo identifying sequences of changes, referred to as transformations, that result in semantically equivalent (and usually improved) code. One tool determines the first transformation that causes incorrect output of the execution of the compiled program. This tool also identifies the location and the instant the transformation is performed in vpo. To assist in the analysis of an optimization error, a graphical optimization viewer was also implemented that can display the state of the generated instructions before and after each transformation performed by vpo. Unique features of the optimization viewer include reverse viewing (or undoing) of transformations and the ability to stop at breakpoints associated with the generated instructions. Together these tools form a powerful environment for facilitating the retargeting of vpo to a new machine and supporting experimentation with new optimizations. In addition, the optimization view can be used as a teaching aid in compiler classes.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comp. Sci., Florida State Univ., Tallahassee, FL, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150E (General utility programs); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Breakpoints; Compiled program; Compiler classes; design; Generated instructions; Graphical optimization viewer; Incorrect output; Optimization errors; Reverse viewing; Semantically equivalent; Teaching aid; Very portable optimizer; Vpo optimizer", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Error handling and recovery. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", thesaurus = "Program compilers; Program debugging; Programming; Utility programs", } @Article{Cytron:1993:EAM, author = "Ron Cytron and Reid Gershbein", title = "Efficient accommodation of may-alias information in {SSA} form", journal = j-SIGPLAN, volume = "28", number = "6", pages = "36--45", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p36-cytron/", abstract = "We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use of may-alias information, as optimization problems converge well before most may-aliases are needed.", acknowledgement = ack-nhfb, affiliation = "Washington Univ., St. Louis, MO, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; May-alias information; Optimization problems; Partial SSA forms; performance; Static single assignment form; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", thesaurus = "Data structures; Program compilers; Programming; Storage management", } @Article{Bourdoncle:1993:ADH, author = "Fran{\c{c}}ois Bourdoncle", title = "Abstract debugging of higher-order imperative languages", journal = j-SIGPLAN, volume = "28", number = "6", pages = "46--55", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p46-bourdoncle/", abstract = "Abstract interpretation is a formal method that enables the static determination (i.e. at compile-time) of the dynamic properties (i.e. at run-time) of programs. We present an abstract interpretation-based method, called {\em abstract debugging\/}, which enables the static and formal debugging of programs, prior to their execution, by finding the origin of potential bugs as well as necessary conditions for these bugs not to occur at run-time. We show how {\em invariant assertions\/} and {\em intermittent assertions\/}, such as termination, can be used to formally debug programs. Finally, we show how abstract debugging can be effectively and efficiently applied to higher-order imperative programs with exceptions and jumps to non-local labels, and present the {\em Syntox\/} system that enables the abstract debugging of the {\em Pascal\/} language by the determination of the range of the scalar variables of programs.", acknowledgement = ack-nhfb, affiliation = "Digital Paris Res. Lab., Malmaison, France", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstract debugging; Abstract interpretation-based method; algorithms; Dynamic properties; Exceptions; Formal debugging; Formal method; Higher-order imperative programs; Intermittent assertions; Invariant assertions; Jumps; languages; Non-local levels; Pascal language; Scalar variables; Static determination; Syntox system", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Pascal.", thesaurus = "Formal verification; High level languages; Program debugging; System monitoring", } @Article{Landi:1993:IMS, author = "William Landi and Barbara G. Ryder and Sean Zhang", title = "Interprocedural modification side effect analysis with pointer aliasing", journal = j-SIGPLAN, volume = "28", number = "6", pages = "56--67", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p56-landi/", abstract = "We present a new interprocedural modification side effects algorithm for C programs, that can discern side effects through general-purpose pointer usage. Ours is the first complete design and implementation of such an algorithm. Preliminary performance findings support the practicality of the technique, which is based on our previous approximation algorithm for pointer aliases [LR92]. Each indirect store through a pointer variable is found, on average, to correspond to a store into 1.2 locations. This indicates that our program-point-specific pointer aliasing information is quite precise when used to determine the effects of these stores.", acknowledgement = ack-nhfb, affiliation = "Siemens Corp. Res. Inc., Princeton, NJ, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Approximation algorithm; C programs; design; General-purpose pointer usage; Indirect store; Interprocedural modification side effects algorithm; languages; Performance findings; Pointer aliases; Pointer variable; Program-point-specific pointer; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging.", thesaurus = "C language; Data structures; Program compilers; Programming", } @Article{Duesterwald:1993:PDF, author = "Evelyn Duesterwald and Rajiv Gupta and Mary Lou Soffa", title = "A practical data flow framework for array reference analysis and its use in optimizations", journal = j-SIGPLAN, volume = "28", number = "6", pages = "68--77", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p68-duesterwald/", abstract = "Data flow analysis techniques have traditionally been restricted to the analysis of scalar variables. This restriction, however, imposes a limitation on the kinds of optimizations that can be performed in loops containing array references. We present a data flow framework for array reference analysis that provides the information needed in various optimizations targeted at sequential or fine-grained parallel architectures. The framework extends the traditional scalar framework by incorporating iteration distance values into the analysis to qualify the computed data flow solution during the fixed point iteration. Analyses phrased in this framework are capable of discovering recurrent access patterns among array references that evolve during the execution of a loop. Applications of our framework are discussed for register allocation, load/store optimizations, and controlled loop unrolling.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Array references; Computed data flow solution; Controlled loop unrolling; Data flow framework; Fine-grained parallel architectures; Fixed point iteration; Fixed point solution; Iteration distance values; Load/store optimizations; performance; Recurrent access patterns; Reference analysis; Register allocation; Structured loops", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", thesaurus = "Data structures; Parallel programming; Program compilers; Storage allocation", } @Article{Johnson:1993:DBP, author = "Richard Johnson and Keshav Pingali", title = "Dependence-based program analysis", journal = j-SIGPLAN, volume = "28", number = "6", pages = "78--89", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Johnson:1993:DPA, author = "Richard Johnson and Keshav Pingali", title = "Dependence-based program analysis", journal = j-SIGPLAN, volume = "28", number = "6", pages = "78--89", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p78-johnson/", abstract = "Program analysis and optimization can be speeded up through the use of the {\em dependence flow graph\/} (DFG), a representation of program dependences which generalizes def-use chains and static single assignment (SSA) form. In this paper, we give a simple graph-theoretic description of the DFG and show how the DFG for a program can be constructed in {\em O(EV)\/} time. We then show how forward and backward dataflow analyses can be performed efficiently on the DFG, using constant propagation and elimination of partial redundancies as examples. These analyses can be framed as solutions of dataflow equations in the DFG. Our construction algorithm is of independent interest because it can be used to construct a program's control dependence graph in {\em O(E)\/} time and its SSA representation in {\em O(EV)\/} time, which are improvements over existing algorithms.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Backward dataflow analyses; Constant propagation; Control dependence graph; Dataflow equations; Def-use chains; Dependence flow graph; Dependence-based program analysis; DFG; Graph-theoretic description; Optimization; Partial redundancies; performance; Program dependences; SSA representation; Static single assignment; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\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, Control primitives.", thesaurus = "Graph theory; Program compilers; Programming; Programming theory", } @Article{Grove:1993:ICP, author = "Dan Grove and Linda Torczon", title = "Interprocedural constant propagation: a study of jump function implementations", journal = j-SIGPLAN, volume = "28", number = "6", pages = "90--99", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p90-grove/", abstract = "An implementation of interprocedural constant propagation must model the transmission of values through each procedure. In the framework proposed by Callahan, Cooper, Kennedy, and Torczon in 1986, this intraprocedural propagation is modeled with a {\em jump function\/}. While Callahan {\em et al.\/} propose several kinds of jump functions, they give no data to help choose between them. This paper reports on a comparative study of jump function implementations. It shows that different jump functions produce different numbers of useful constants; it suggests a particular function, called the {\em pass-through parameter jump function\/}, as the most cost-effective in practice.", acknowledgement = ack-nhfb, affiliation = "Sun Microsystems, Mountain View, CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Comparative study; Constants; Cost-effective; Interprocedural constant propagation; Jump function implementations; Pass-through parameter jump function; 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, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", thesaurus = "Data structures; Program compilers; Programming", } @Article{Graham:1993:OIA, author = "Susan L. Graham and Steven Lucco and Oliver Sharp", title = "Orchestrating interactions among parallel computations", journal = j-SIGPLAN, volume = "28", number = "6", pages = "100--111", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p100-graham/", abstract = "Many parallel programs contain multiple sub-computations, each with distinct communication and load balancing requirements. The traditional approach to compiling such programs is to impose a processor synchronization barrier between sub-computations, optimizing each as a separate entity. This paper develops a methodology for managing the interactions among sub-computations, avoiding strict synchronization where concurrent or pipelined relationships are possible. Our approach to compiling parallel programs has two components: symbolic data access analysis and adaptive runtime support. We summarize the data access behavior of sub-computations (such as loop nests) and split them to expose concurrency and pipelining opportunities. The split transformation has been incorporated into an extended FORTRAN compiler, which outputs a FORTRAN 77 program augmented with calls to library routines written in C and a coarse-grained dataflow graph summarizing the exposed parallelism. The compiler encodes symbolic information, including loop bounds and communication requirements, for an adaptive runtime system, which uses runtime information to improve the scheduling efficiency of irregular sub-computations. The runtime system incorporates algorithms that allocate processing resources to concurrently executing sub-computations and choose communication granularity. We have demonstrated that these dynamic techniques substantially improve performance on a range of production applications including climate modeling and x-ray tomography, especially when large numbers of processors are available.", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Adaptive runtime support; Adaptive runtime system; algorithms; Coarse-grained dataflow graph; Communication requirements; Data access behavior; design; Extended FORTRAN compiler; FORTRAN 77 program; Library routines; Loop bounds; performance; Pipelined relationships; Pipelining opportunities; Processing resources; Runtime system; Scheduling efficiency; Sub-computations; Symbolic data access analysis; Symbolic information", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", thesaurus = "Concurrency control; Parallel programming; Pipeline processing; Program compilers; Scheduling", } @Article{Anderson:1993:GOP, author = "Jennifer M. Anderson and Monica S. Lam", title = "Global optimizations for parallelism and locality on scalable parallel machines", journal = j-SIGPLAN, volume = "28", number = "6", pages = "112--125", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p112-anderson/", acknowledgement = ack-nhfb, affiliation = "Comput. Syst. Lab., Stanford Univ., CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Affine functions; algorithms; Array accesses; Compiler algorithm; Data decompositions; Data locality; Dense matrix computations; Explicit synchronisation; Fully parallelizable loops; General nestings; High performance; Large-scale parallel machines; Loop indices; Mathematical framework; performance; Scalable parallel machines; Sequential loops; Shared address space machines; theory", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", thesaurus = "Parallel machines; Parallel programming; Program compilers; Programming theory", } @Article{Amarasinghe:1993:COC, author = "Saman P. Amarasinghe and Monica S. Lam", title = "Communication optimization and code generation for distributed memory machines", journal = j-SIGPLAN, volume = "28", number = "6", pages = "126--138", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p126-amarasinghe/", abstract = "This paper presents several algorithms to solve code generation and optimization problems specific to machines with distributed address spaces. Given a description of how the computation is to be partitioned across the processors in a machine, our algorithms produce an SPMD (single program multiple data) program to be run on each processor. Our compiler generated the necessary receive and send instructions, optimizes the communication by eliminating redundant communication and aggregating small messages into large messages, allocates space locally on each processor, and translates global data addresses to local addresses. Our techniques are based on an exact data-flow analysis on individual array element accesses. Unlike data dependence analysis, this analysis determines if two dynamic instances refer to the same value, and not just to the same location. Using this information, our compiler can handle more flexible data decompositions and find more opportunities for communication optimization than systems based on data dependence analysis. Our technique is based on a uniform framework, where data decompositions, computation decompositions and the data flow information are all represented as systems of linear inequalities. We show that the problems of communication code generation, local memory management, message aggregation and redundant data communication elimination can all be solved by projecting polyhedra represented by sets of inequalities onto lower dimensional spaces.", acknowledgement = ack-nhfb, affiliation = "Comput. Syst. Lab., Stanford Univ., CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Code generation; Communication code generation; Compiler; Computation decompositions; Data flow information; Distributed address spaces; Exact data-flow analysis; Global data addresses; Individual array element accesses; Linear inequalities; Local addresses; Local memory management; Message aggregation; Optimization problems; performance; Polyhedra; Redundant communication; Redundant data communication elimination; Send instructions; Single program multiple data; SPMD; theory; Uniform framework", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\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, Trees.", thesaurus = "Distributed memory systems; Parallel programming; Program compilers; Storage management", } @Article{Adams:1993:FCD, author = "Norman Adams and Pavel Curtis and Mike Spreitzer", title = "First-class data-type representations in {SCHEMEXEROX}", journal = j-SIGPLAN, volume = "28", number = "6", pages = "139--146", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Adams:1993:FDR, author = "Norman Adams and Pavel Curtis and Mike Spreitzer", title = "First-class data-type representations in {SCHEME} {XEROX}", journal = j-SIGPLAN, volume = "28", number = "6", pages = "139--146", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p139-adams/", abstract = "In most programming language implementations, the compiler has detailed knowledge of the representations of and operations on primitive data typed and data-type constructors. In SCHEMEXEROX, this knowledge is almost entirely external to the compiler, in ordinary, procedural user code. The primitive representations and operations are embodied in first-class ``representation types'' that are constructed and implemented in an abstract and high-level fashion. Despite this abstractness, a few generally-useful optimizing transformations are sufficient to allow the SCHEMEXEROX compiler to generate efficient code for the primitive operations, essentially as good as could be achieved using more contorted, traditional techniques.", acknowledgement = ack-nhfb, affiliation = "Xerox, Pal Alto Res Center, CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstractness; algorithms; Compiler; Data-type constructors; Data-type representations; languages; Optimizing transformations; Primitive data types; Primitive operations; Primitive representations; Procedural user code; Programming language implementations; Representation types; SCHEME-XEROX", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\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, Type structure. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", thesaurus = "Abstract data types; High level languages; Program compilers", } @Article{Sitaram:1993:HC, author = "Dorai Sitaram", title = "Handling control", journal = j-SIGPLAN, volume = "28", number = "6", pages = "147--155", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p147-sitaram/", abstract = "Non-local control transfer and exception handling have a long tradition in higher-order programming languages such as Common Lisp, Scheme and ML. However, each language stops short of providing a full and complementary approach---control handling is provided {\em only\/} if the corresponding control operator is first-order. In this work, we describe handlers in a higher-order control setting. We invoke our earlier theoretical result that all denotational models of control languages invariably include capabilities that handle control. These capabilities, when incorporated into the language, form an elegant and powerful higher-order generalization of the first-order exception-handling mechanism.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Complementary approach; Control handling; Corresponding control operator; Denotational models; Exception handling; Higher-order control setting; Higher-order programming languages; languages; Powerful higher-order generalization", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML.", thesaurus = "Exception handling; High level languages; Programming", } @Article{Weise:1993:PSM, author = "Daniel Weise and Roger F. Crew", title = "Programmable syntax macros", journal = j-SIGPLAN, volume = "28", number = "6", pages = "156--165", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p156-weise/", abstract = "Lisp has shown that a programmable syntax macro system acts as an adjunct to the compiler that gives the programmer important and powerful abstraction facilities not provided by the language. Unlike simple token substitution macros, such as are provided by CPP (the C preprocessor), syntax macros operate on Abstract Syntax Trees (ASTs). Programmable syntax macro systems have not yet been developed for syntactically rich languages such as C because rich concrete syntax requires the manual construction of syntactically valid program fragments, which is a tedious, difficult, and error prone process. Also, using two languages, one for writing the program, and one for writing macros, is another source of complexity. This research solves these problems by having the macro language be a minimal extension of the programming language, by introducing explicit code template operators into the macro language, and by using a type system to guarantee, at macro definition time, that all macros and macro functions only produce syntactically valid program fragments. The code template operators make the language context sensitive, which requires changes to the parser. The parser must perform type analysis in order to parse macro definitions, or to parse user code that invokes macros.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'93.", classification = "C4210 (Formal logic); C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstract syntax trees; algorithms; Compiler; Context sensitive; Explicit code template operators; languages; Macro definition time; Macro functions; Macro language; Minimal extension; Parser; Powerful abstraction facilities; Programmable syntax macro system; Programming language; Syntactically rich languages; Syntactically valid program fragments; Syntax macros; Type system", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Parsing. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Macro and assembly languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", thesaurus = "Abstract data types; Context-sensitive grammars; High level languages; Macros", } @Article{Hong:1993:CRP, author = "Seongsoo Hong and Richard Gerber", title = "Compiling real-time programs into schedulable code", journal = j-SIGPLAN, volume = "28", number = "6", pages = "166--176", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p166-hong/", abstract = "We present a programming language with first-class timing constructs, whose semantics is based on time-constrained relationships between observable events. Since a system specification postulates timing relationships between events, realizing the specification in a program becomes a more straightforward process. Using these constraints, as well as those imposed by data and control flow properties, our objective is to transform the code so that its worst-case execution time is consistent with its real-time requirements. To accomplish this goal we first translate an event-based source program into intermediate code, in which the timing constraints are imposed on the code itself, and then use a compilation technique which synthesizes feasible code from the original source program.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110B (Software engineering techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Compilation technique; Control flow properties; design; Event-based source program; Feasible code; First-class timing constructs; Intermediate code; languages; Observable events; Original source program; performance; Programming language; Real-time requirements; Semantics; System specification; Time-constrained relationships; Timing constraints; Timing relationships; Worst-case execution time", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", thesaurus = "Formal specification; High level languages; Program compilers; Real-time systems; Scheduling", } @Article{Hong:1993:CRT, author = "Seongsoo Hong and Richard Gerber", title = "Compiling real-time programs into schedulable code", journal = j-SIGPLAN, volume = "28", number = "6", pages = "166--176", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grunwald:1993:ICL, author = "Dirk Grunwald and Benjamin Zorn and Robert Henderson", title = "Improving the cache locality of memory allocation", journal = j-SIGPLAN, volume = "28", number = "6", pages = "177--186", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p177-grunwald/", abstract = "The allocation and disposal of memory is a ubiquitous operation in most programs. Rarely do programmers concern themselves with details of memory allocators; most assume that memory allocators provided by the system perform well. This paper presents a performance evaluation of the reference locality of dynamic storage allocation algorithms based on trace-driven simulation of five large allocation-intensive C programs. In this paper, we show how the design of a memory allocator can significantly affect the reference locality for various applications. Our measurements show that poor locality in sequential-fit allocation algorithms reduces program performance, both by increasing paging and cache miss rates. While increased paging can be debilitating on any architecture, cache misses rates are also important for modern computer architectures. We show that algorithms attempting to be space-efficient by coalescing adjacent free objects show poor reference locality, possibly negating the benefits of space efficiency. At the other extreme, algorithms can expend considerable effort to increase reference locality yet gain little in total execution performance. Our measurements suggest an allocator design that is both very fast and has good locality of reference.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6120 (File organisation); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Adjacent free objects; algorithms; Allocator design; Cache miss rates; Computer architectures; design; Dynamic storage allocation algorithms; Execution performance; languages; Large allocation-intensive C programs; measurement; Paging; performance; Performance evaluation; Reference locality; Sequential-fit allocation algorithms; Space-efficient; Trace-driven simulation", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", thesaurus = "Performance evaluation; Program diagnostics; Storage allocation; Storage management", } @Article{Barrett:1993:ULP, author = "David A. Barrett and Benjamin G. Zorn", title = "Using lifetime predictors to improve memory allocation performance", journal = j-SIGPLAN, volume = "28", number = "6", pages = "187--196", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p187-barrett/", abstract = "Dynamic storage allocation is used heavily in many application areas including interpreters, simulators, optimizers, and translators. We describe research that can improve all aspects of the performance of dynamic storage allocation by predicting the lifetimes of short-lived objects when they are allocated. Using five significant, allocation-intensive C programs, we show that a great fraction of all bytes allocated are short-lived ($>$ 90\% in all cases). Furthermore, we describe an algorithm for lifetime prediction that accurately predicts the lifetimes of 42--99\% of all objects allocated. We describe and simulate a storage allocator that takes advantage of lifetime prediction of short-lived objects and show that it can significantly improve a program's memory overhead and reference locality, and even, at times, improve CPU performance as well.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Allocation-intensive C programs; CPU performance; DSA; Dynamic storage allocation; languages; Lifetime prediction; measurement; Memory allocation performance; Memory overhead; performance; Reference locality; Short-lived objects; Storage allocator", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", thesaurus = "Storage allocation; Storage management", } @Article{Boehm:1993:SEC, author = "Hans-Juergen Boehm", title = "Space efficient conservative garbage collection", journal = j-SIGPLAN, volume = "28", number = "6", pages = "197--206", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p197-boehm/", abstract = "We call a garbage collector conservative if it has only partial information about the location of pointers, and is thus forced to treat arbitrary bit patterns as though they might be pointers, in at least some cases. We show that some very inexpensive, but previously unused techniques can have dramatic impact on the effectiveness of conservative garbage collectors in reclaiming memory. Our most significant observation is that static data that appears to point to the heap should not result in misidentified references to the heap. The garbage collector has enough information to allocate around such references. We also observe that programming style has a significant impact on the amount of spuriously retained storage, typically even if the collector is not terribly conservative. Some fairly common C and C++ programming style significantly decrease the effectiveness of any garbage collector. These observations suffice to explain some of the different assessments of conservative collection that have appeared in the literature.", acknowledgement = ack-nhfb, affiliation = "Xerox Parc, Palo Alto, CA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Arbitrary bit patterns; C++ programming styles; Conservative garbage collectors; languages; Partial information; performance; Spuriously retained storage; Static data", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf C.0} Computer Systems Organization, GENERAL, SPARC. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Cedar.", thesaurus = "Data structures; Programming; Storage allocation; Storage management", } @Article{Dybvig:1993:GGB, author = "R. Kent Dybvig and Carl Bruggeman and David Eby", title = "Guardians in a generation-based garbage collector", journal = j-SIGPLAN, volume = "28", number = "6", pages = "207--216", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dybvig:1993:GGG, author = "R. Kent Dybvig and Carl Bruggeman and David Eby", title = "Guardians in a generation-based garbage collector", journal = j-SIGPLAN, volume = "28", number = "6", pages = "207--216", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p207-dybvig/", abstract = "This paper describes a new language feature that allows dynamically allocated objects to be saved from deallocation by an automatic storage management system so that clean-up or other actions can be performed using the data stored within the objects. The program has full control over the timing of clean-up actions, which eliminates several potential problems and often eliminates the need for critical sections in code that interacts with clean-up actions. Our implementation is ``generation-friendly'' in the sense that the additional overhead within a generation-based garbage collector is proportional to the work already done there, and the overhead within the mutator is proportional to the number of clean-up actions actually performed.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Automatic storage management system; Clean-up; Critical sections; design; Dynamically allocated objects; Generation based garbage collector; Generation-friendly; Language feature; languages; Mutator; Overhead", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME.", thesaurus = "High level languages; Programming; Storage allocation; Storage management", } @Article{Nettles:1993:RRG, author = "Scott Nettles and James O'Toole", title = "Real-time replication garbage collection", journal = j-SIGPLAN, volume = "28", number = "6", pages = "217--226", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p217-nettles/", abstract = "We have implemented the first copying garbage collector that permits continuous unimpeded mutator access to the original objects during copying. The garbage collector incrementally replicates all accessible objects and uses a mutation log to bring the replicas up-to-date with changes made by the mutator. An experimental implementation demonstrates that the costs of using our algorithm are small and that bounded pause times of 50 milliseconds can be readily achieved.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150J (Operating systems)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "50 Ms; Accessible objects; algorithms; Bounded pause times; Continuous unimpeded mutator access; Copying garbage collector; Experimental implementation; experimentation; Mutation log; Real-time replication", numericalindex = "Time 5.0E-02 s", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies.", thesaurus = "Real-time systems; Storage allocation; Storage management", } @Article{Nettles:1993:RTR, author = "Scott Nettles and James O'Toole", title = "Real-time replication garbage collection", journal = j-SIGPLAN, volume = "28", number = "6", pages = "217--226", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Peterson:1993:ITC, author = "John Peterson and Mark P. Jones", title = "Implementing type classes", journal = j-SIGPLAN, volume = "28", number = "6", pages = "227--236", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p227-peterson/", abstract = "We describe the implementation of a type checker for the functional programming language Haskell that supports the use of {\em type classes\/}. This extends the type system of ML to support overloading (ad-hoc polymorphism) and can be used to implement features such as equality types and numeric overloading in a simple and general way. The theory of type classes is well understood, but the practical issues involved in the implementation of such systems have not received a great deal of attention. In addition to the basic type checking algorithm, an implementation of type classes also requires some form of program transformation. In all current Haskell compilers this takes the form of dictionary conversion, using functions as hidden parameters to overloaded values. We present efficient techniques for type checking and dictionary conversion. A number of optimizations and extensions to the basic type class sytems are also described.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Ad-hoc polymorphism; algorithms; Basic type checking algorithm; Dictionary conversion; Efficient techniques; Equality types; Functional programming language Haskell; Haskell compilers; Hidden parameters; languages; Numeric overloading; performance; Program transformation; Type checker; Type classes", 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, Haskell. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Standard ML.", thesaurus = "Abstract data types; Functional programming; High level languages; Program compilers", } @Article{Flanagan:1993:ECC, author = "Cormac Flanagan and Amr Sabry and Bruce F. Duba and Matthias Felleisen", title = "The essence of compiling with continuations", journal = j-SIGPLAN, volume = "28", number = "6", pages = "237--247", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p237-flanagan/", abstract = "In order to simplify the compilation process, many compilers for higher-order languages use the continuation-passing style (CPS) transformation in a first phase to generate an intermediate representation of the source program. The salient aspect of this intermediate form is that all procedures take an argument that represents the rest of the computation (the ``continuation''). Since the na{\"\i}ve CPS transformation considerably increases the size of programs, CPS compilers perform reductions to produce a more compact intermediate representation. Although often implemented as a part of the CPS transformation, this step is conceptually a second phase. Finally, code generators for typical CPS compilers treat continuations specially in order to optimize the interpretation of continuation parameters. A thorough analysis of the abstract machine for CPS terms show that the actions of the code generator {\em invert\/} the na{\"\i}ve CPS translation step. Put differently, the combined effect of the three phases is equivalent to a source-to-source transformation that simulates the compaction phase. Thus, fully developed CPS compilers do not need to employ the CPS transformation but can achieve the same results with a simple source-level transformation.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstract machine; algorithms; Code generators; Compact intermediate representation; Compaction phase; Compilation process; Continuation-passing style; Higher-order languages; Intermediate representation; languages; Procedures; Simple source-level transformation; Source program; Source-to-source transformation; theory; Typical CPS compilers; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", thesaurus = "High level languages; Program compilers; Programming", } @Article{Pinter:1993:RAI, author = "Shlomit S. Pinter", title = "Register allocation with instruction scheduling: a new approach", journal = j-SIGPLAN, volume = "28", number = "6", pages = "248--257", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p248-pinter/", abstract = "We present a new framework in which considerations of both register allocation and instruction scheduling can be applied uniformly and simultaneously. In this framework an optimal coloring of a graph, called the {\em parallel interference graph\/}, provides an optimal register allocation and preserves the property that no false dependences are introduced, thus all the options for parallelism are kept for the scheduler to handle. For this framework we provide heuristics for trading off parallel scheduling with register spilling.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C1160 (Combinatorial mathematics); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; Heuristics; Instruction scheduling; Optimal coloring; Optimal register allocation; Parallel interference graph; Parallel scheduling; Register spilling; Scheduler; theory", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", thesaurus = "Graph colouring; Program compilers; Scheduling; Storage allocation", } @Article{Huff:1993:LMS, author = "Richard A. Huff", title = "Lifetime-sensitive modulo scheduling", journal = j-SIGPLAN, volume = "28", number = "6", pages = "258--267", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p258-huff/", abstract = "This paper shows how to software pipeline a loop for minimal register pressure without sacrificing the loop's minimum execution time. This novel {\em bidirectional slack-scheduling\/} method has been implemented in a FORTRAN compiler and tested on many scientific benchmarks. The empirical results---when measured against an absolute lower bound on execution time, and against a novel {\em schedule-independent\/} absolute lower bound on register pressure---indicate near-optimal performance.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Bidirectional slack-scheduling method; FORTRAN compiler; languages; Minimal register pressure; Minimum execution time; Near-optimal performance; performance; Schedule-independent absolute lower bound; Scientific benchmarks; Software pipeline", subject = "{\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 C.1.3} Computer Systems Organization, PROCESSOR ARCHITECTURES, Other Architecture Styles.", thesaurus = "FORTRAN; Parallel programming; Program compilers; Scheduling", } @Article{Huff:1993:LSM, author = "Richard A. Huff", title = "Lifetime-sensitive modulo scheduling", journal = j-SIGPLAN, volume = "28", number = "6", pages = "258--267", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kolte:1993:LRA, author = "Priyadarshan Kolte and Mary Jean Harrold", title = "Load\slash store range analysis for global register allocation", journal = j-SIGPLAN, volume = "28", number = "6", pages = "268--277", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p268-kolte/", abstract = "Live range splitting techniques improve global register allocation by splitting the live ranges of variables into segments that are individually allocated registers. Load/store range analysis is a new technique for live range splitting that is based on reaching definition and live variable analyses. Our analysis localizes the profits and the register requirements of every access to every variable to provide a fine granularity of candidates for register allocation. Experiments on a suite of C and FORTRAN benchmark programs show that a graph coloring register allocator operating on load/store ranges often provides better allocations than the same allocator operating on live ranges. Experimental results also show that the computational cost of using load/store ranges for register allocation is moderately more than the cost of using live ranges.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Clemson Univ., SC, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C1160 (Combinatorial mathematics); C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; C; Computational cost; experimentation; Fine granularity; FORTRAN benchmark programs; Global register allocation; Graph coloring register allocator; Individually allocated registers; Live range splitting; Live variable analyses; Load/store ranges; performance; Range splitting techniques", 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. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN.", thesaurus = "Graph colouring; Program compilers; Programming; Storage allocation", } @Article{Kolte:1993:LSR, author = "Priyadarshan Kolte and Mary Jean Harrold", title = "Load\slash store range analysis for global register allocation", journal = j-SIGPLAN, volume = "28", number = "6", pages = "268--277", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kerns:1993:BSI, author = "Daniel R. Kerns and Susan J. Eggers", title = "Balanced scheduling: instruction scheduling when memory latency is uncertain", journal = j-SIGPLAN, volume = "28", number = "6", pages = "278--289", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p278-kerns/", abstract = "Traditional list schedulers order instructions based on an optimistic estimate of the load delay imposed by the implementation. Therefore they cannot respond to variations in load latencies (due to cache hits or misses, congestion in the memory interconnect, etc.) and cannot easily be applied across different implementations. We have developed an alternative algorithm, known as balanced scheduling, that schedule instructions based on an estimate of the amount of instruction level parallelism in the program. Since scheduling decisions are program-rather than machine-based, balanced scheduling is unaffected by implementation changes. Since it is based on the amount of instruction level parallelism that a program can support, it can respond better to variations in load latencies. Performance improvements over a traditional list scheduler on a Fortran workload and simulating several different machine types (cache-based workstations, large parallel machines with a multipath interconnect and a combination, all with non-blocking processors) are quite good, averaging between 3\% and 18\%.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Balanced scheduling; Cache hits; experimentation; Fortran workload; Instruction level parallelism; Load delay; Load latencies; Memory latency; Multipath interconnect; Non-blocking processors; Optimistic estimate; performance; Scheduling decisions", 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, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", thesaurus = "Parallel programming; Program compilers; Scheduling", } @Article{Warter:1993:RI, author = "Nancy J. Warter and Scott A. Mahlke and Wen-Mei W. Hwu and B. Ramakrishna Rau", title = "Reverse {If-Conversion}", journal = j-SIGPLAN, volume = "28", number = "6", pages = "290--299", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p290-warter/", abstract = "In this paper we present a set of isomorphic control transformations that allow the compiler to apply local scheduling techniques to acyclic subgraphs of the control flow graph. Thus, the code motion complexities of global scheduling are eliminated. This approach relies on a new technique, Reverse If-Conversion (RIC), that transforms scheduled If-Converted code back to the control flow graph representation. This paper presents the predicate internal representation, the algorithms for RIC, and the correctness of RIC. In addition, the scheduling issues are addressed and an application to software pipelining is presented.", acknowledgement = ack-nhfb, affiliation = "Center for Reliable and High-Performance Comput., Illinois Univ., Urbana, IL, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Acyclic subgraphs; algorithms; Code motion complexities; Compiler; Control flow graph; Control flow graph representation; Correctness; design; Global scheduling; Isomorphic control transformations; Local scheduling techniques; Predicate internal representation; Reverse if-conversion; RIC; Scheduled if-converted code; Scheduling issues; Software pipelining", subject = "{\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 D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", thesaurus = "Computational complexity; Graph theory; Program compilers; Scheduling", } @Article{Warter:1993:RIC, author = "Nancy J. Warter and Scott A. Mahlke and Wen-Mei W. Hwu and B. Ramakrishna Rau", title = "Reverse {If-Conversion}", journal = j-SIGPLAN, volume = "28", number = "6", pages = "290--299", month = jun, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ball:1993:BPF, author = "Thomas Ball and James R. Larus", title = "Branch prediction for free", journal = j-SIGPLAN, volume = "28", number = "6", pages = "300--313", month = jun, year = "1993", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:37 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p300-ball/", abstract = "Many compilers rely on branch prediction to improve program performance by identifying frequently executed regions and by aiding in scheduling instructions.{\em Profile-based\/} predictors require a time-consuming and inconvenient compile-profile-compile cycle in order to make predictions. We present a {\em program-based\/} branch predictor that performs well for a large and diverse set of programs written in C and Fortran. In addition to using natural loop analysis to predict branches that control the iteration of loops, we focus on heuristics for predicting non-loop branches, which dominate the dynamic branch count of many programs. The heuristics are simple and require little program analysis, yet they are effective in terms of coverage and miss rate. Although program-based prediction does not equal the accuracy of profile-based prediction, we believe it reaches a sufficiently high level to be useful. Additional type and semantic information available to a compiler would enhance our heuristics.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", annote = "Published as part of the Proceedings of PLDI'93.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "23-25 June 1993", conflocation = "Albuquerque, NM, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Branch prediction; C; Compile-profile-compile cycle; Dynamic branch count; Fortran; Frequently executed regions; Heuristics; languages; Miss rate; Natural loop analysis; Non-loop branches; performance; Program performance; Program-based branch predictor; Scheduling instructions; Semantic information", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", thesaurus = "Program compilers; Programming; Tree data structures", } @Article{Culler:1993:LTR, author = "David E. Culler and Richard M. Karp and David A. Patterson and Abhijit Sahay and Klaus E. Schauser and Eunice Santos and Ramesh Subramonian and Thorsten von Eicken", title = "{LogP}: towards a realistic model of parallel computation", journal = j-SIGPLAN, volume = "28", number = "7", pages = "1--12", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", classification = "C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C7430 (Computer engineering)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "CM-5; Communication bandwidth; Communication delay; Computing bandwidth; LogP; Machine configuration; Machine designers; Parallel computers; Parallel machine model; Portable parallel algorithms", thesaurus = "Parallel algorithms; Parallel machines; Parallel programming; Virtual machines", } @Article{Subhlok:1993:ETD, author = "Jaspal Subhlok and James M. Stichnoth and David R. O'Hallaron and Thomas Gross", title = "Exploiting task and data parallelism on a multicomputer", journal = j-SIGPLAN, volume = "28", number = "7", pages = "13--22", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "For many applications, achieving good performance on a private memory parallel computer requires exploiting data parallelism as well as task parallelism. Depending on the size of the input data set and the number of nodes (i.e. processors), different tradeoffs between task and data parallelism are appropriate for a parallel system. Most existing compilers focus on only one of data parallelism and task parallelism. Therefore, to achieve the desired results, the programmer must separately program the data and task parallelism. The authors have taken a unified approach to exploiting both kinds of parallelism in a single framework with an existing language. This approach eases the task of programming and exposes the tradeoffs between data and task parallelism to the compiler. They have implemented a parallelizing Fortran compiler for the iWarp system based on this approach. They discuss the design of the compiler, and present performance results to validate the approach.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Data parallelism; IWarp system; Multicomputer; Parallelizing Fortran compiler; Performance results; Private memory parallel computer; Single framework; Task parallelism; Unified approach", thesaurus = "FORTRAN; Parallel programming; Program compilers", } @Article{Agha:1993:AOD, author = "Gul Agha and Christian J. Callsen", title = "{ActorSpace}: an open distributed programming paradigm", journal = j-SIGPLAN, volume = "28", number = "7", pages = "23--32", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A programming paradigm is presented called, ActorSpace. ActorSpace provides a new communication model based on destination patterns. An actorSpace is a computationally passive container of actors which acts as a context for matching patterns. Patterns are matched against listed attributes of actors and actorSpaces that are visible in the actorSpace. Both visibility and attributes are dynamic. Messages may be sent to one or all members of a group defined by a pattern. The paradigm provides powerful support for component-based construction of massively parallel and distributed applications. In particular, it supports open interfaces to servers and pattern-directed access to software repositories.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Illinois Univ., Urbana-Champaign, IL, USA", classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6150N (Distributed systems)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ActorSpace; Communication model; Component-based construction; Computationally passive container; Destination patterns; Distributed applications; Listed attributes; Matching patterns; Open distributed programming; Open interfaces; Pattern-directed access; Programming paradigm; Software repositories", thesaurus = "Object-oriented methods; Object-oriented programming; Open systems; Parallel programming", } @Article{Hall:1993:EUP, author = "Mary W. Hall and Timothy J. Harvey and Ken Kennedy and Nathaniel McIntosh and Kathryn S. McKinley and Jeffrey D. Oldham and Michael H. Paleczny and Gerald Roth", title = "Experiences using the {ParaScope Editor}: an interactive parallel programming tool", journal = j-SIGPLAN, volume = "28", number = "7", pages = "33--43", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The ParaScope Editor is an interactive parallel programming tool that assists knowledgeable users in developing scientific Fortran programs. It displays the results of sophisticated program analyses, provides a set of powerful interactive transformations, and supports program editing. The authors summarize experiences of scientific programmers and tool designers using the ParaScope Editor. They evaluate existing features and describe enhancements in three key areas: user interface, analysis, and transformation. Many existing features prove crucial to successful program parallelization. They include interprocedural array side-effect analysis and program and dependence view filtering. Desirable functionality includes improved program navigation based on performance estimation, incorporating user assertions in analysis and more guidance in selecting transformations. These results offer insights for the authors of a variety of programming tools and parallelizing compilers.", acknowledgement = ack-nhfb, affiliation = "Center for Integrated Syst., Stanford Univ., Palo Alto, CA, USA", classification = "C6110P (Parallel programming); C6130 (Data handling techniques); C6180 (User interfaces); C7300 (Natural sciences)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Dependence view filtering; Interactive parallel programming tool; Interprocedural array side-effect analysis; Knowledgeable users; Parallelizing compilers; ParaScope Editor; Performance estimation; Powerful interactive transformations; Program editing; Program navigation; Program parallelization; Scientific Fortran programs; Scientific programmers; Sophisticated program analyses; Tool designers; User assertions; User interface", thesaurus = "Natural sciences computing; Parallel programming; Text editing; User interfaces", } @Article{Sarukkai:1993:PAH, author = "Sekhar R. Sarukkai and Allen D. Malony", title = "Perturbation analysis of high level instrumentation for {SPMD} programs", journal = j-SIGPLAN, volume = "28", number = "7", pages = "44--53", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The process of instrumenting a program to study its behavior can lead to perturbations in the program's execution. These perturbations can become severe for large parallel systems or problem sizes, even when one captures only high level events. The authors address the important issue of eliminating execution perturbations caused by high-level instrumentation of SPMD programs. They describe perturbation analysis techniques for common computation and communication measurements, and show examples which demonstrate the effectiveness of these techniques in practice.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", classification = "C4240 (Programming and algorithm theory); C6110P (Parallel programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Common computation; Communication measurements; Execution perturbations; High level events; High level instrumentation; High-level instrumentation; Large parallel systems; Perturbation analysis techniques; Problem sizes; Single program multiple data; SPMD programs", thesaurus = "Message passing; Parallel programming; System monitoring", } @Article{Kranz:1993:IMPb, author = "David Kranz and Kirk Johnson and Anant Agarwal and John Kubiatowicz and Beng-Hong Lim", title = "Integrating message-passing and shared-memory: early experience", journal = j-SIGPLAN, volume = "28", number = "7", pages = "54--63", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kranz:1993:IMS, author = "David Kranz and Kirk L. Johnson and Anant Agarwal and John Kubiatowicz and Beng-Hong Lim", title = "Integrating message-passing and shared-memory: early experience", journal = j-SIGPLAN, volume = "28", number = "7", pages = "54--63", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A discussion is given on some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. While such a programming model can be implemented on both shared-memory and message-passing architectures, the authors argue that the transparent, coherent caching of global data provided by many shared-memory architectures is of crucial importance. Because message-passing mechanisms are much more efficient than shared-memory loads and stores for certain types of interprocessor communication and synchronization operations, however, the authors argue for building multiprocessors that efficiently support both shared-memory and message-passing mechanisms. The authors describe an architecture, Alewife, that integrates support for shared-memory and message-passing through a simple interface; they expect the compiler and runtime system to cooperate in using appropriate hardware mechanisms that are most efficient for specific operations. They report on both integrated and exclusively shared-memory implementations of the runtime system and two applications.", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", classification = "C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Alewife; Coherent caching; Compiler; Distributed-memory multiprocessors; Exclusively shared-memory implementations; Global data; Hardware mechanisms; Interprocessor communication; Message-passing architectures; Message-passing mechanisms; Runtime system; Shared-address space programming model; Shared-memory architectures; Shared-memory loads; Synchronization operations", thesaurus = "Message passing; Parallel programming; Shared memory systems", } @Article{Kontothanasiss:1993:USI, author = "Leonidas Kontothanasiss and Robert W. Wisniewski", title = "Using schedular information to achieve optimal barrier synchronization performance", journal = j-SIGPLAN, volume = "28", number = "7", pages = "64--72", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Parallel programs frequently use barriers to synchronize successive steps in an algorithm. In the presence of multiprogramming, the choice of spinning versus blocking barriers can have a significant impact on performance. The authors demonstrate how competitive spinning techniques previously designed for locks can be extended to barriers, and evaluate their performance. They design an additional competitive spinning technique that adapts more quickly in a dynamic environment. They then propose and evaluate a new method that obtains by using scheduler information to decide between spinning and blocking. The schedular information technique makes optimal choices incurring little overhead.", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6150N (Distributed systems)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Blocking; Competitive spinning techniques; Multiprogramming; Optimal barrier synchronization performance; Optimal choices; Scheduler information", thesaurus = "Concurrency control; Parallel programming; Scheduling", } @Article{Kontothanassis:1993:USI, author = "Leonidas Kontothanassis and Robert W. Wisniewski", title = "Using scheduler information to achieve optimal barrier synchronization performance", journal = j-SIGPLAN, volume = "28", number = "7", pages = "64--72", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Huelsbergen:1993:CCG, author = "Lorenz Huelsbergen and James R. Larus", title = "A concurrent copying garbage collector for languages that distinguish (im)mutable data", journal = j-SIGPLAN, volume = "28", number = "7", pages = "73--82", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin-Madison Univ., WI, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Concurrent collection; Concurrent compacting garbage collector; Garbage-collection pauses; Immutable data; Minimal mutator/collector synchronization; Multiple mutator threads; Mutable data; Pure functional languages; Shared-memory parallel computers; Standard ML compiler", thesaurus = "Parallel programming; Program compilers; Shared memory systems; Storage allocation; Storage management", } @Article{Leung:1993:IPR, author = "Shun-Tak Leung and John Zahorjan", title = "Improving the performance of runtime parallelization", journal = j-SIGPLAN, volume = "28", number = "7", pages = "83--91", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "When the inter-iteration dependency pattern of the iterations of a loop cannot be determined statically, compile time parallelization of the loop is not possible. In these cases, runtime parallelization is the only alternative. The idea is to transform the loop into two code fragments: the inspector and the executor. When the program is run, the inspector examines the iteration dependencies and constructs a parallel schedule. The executor subsequently uses that schedule to carry out the actual computation in parallel. The authors show how to reduce the overhead of running the inspector through its parallel execution. They describe two related approaches. The first, which emphasizes inspector efficiency achieves nearly linear speedup relative to a sequential execution of the inspector, but produces a schedule that may be less efficient for the executor. The second technique, which emphasizes executor efficiency, does not in general achieve linear speedup of the inspector, but is guaranteed to produce the best achievable schedule. The authors present these techniques, show that they are correct, and compare their performance to existing techniques using a set of experiments.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compile time parallelization; Executor; Inspector; Inter-iteration dependency pattern; Parallel execution; Parallel schedule; Runtime parallelization; Sequential execution", thesaurus = "Parallel programming; Program compilers; Scheduling", } @Article{Chapman:1993:HPF, author = "Barbara M. Chapman and Piyush Mehrotra and Hans P. Zima", title = "High performance {Fortran} without templates: an alternative model for distribution and alignment", journal = j-SIGPLAN, volume = "28", number = "7", pages = "92--101", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Language extensions of Fortran are being developed which permit the user to map data structures to the individual processors of distributed memory machines. These languages allow a programming style in which global data references are used. Current efforts are focussed on designing a common basis for such languages, the result of which is known as high performance Fortran (HPF). One of the central debates in the HPF effort revolves around the concept of templates, introduced as an abstract index space to which data could be aligned. The authors present a model for the mapping of data which provides the functionality of high performance Fortran distributions without the use of templates.", acknowledgement = ack-nhfb, affiliation = "Dept. for Software Technol. and Parallel Syst., Vienna Univ., Austria", classification = "C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstract index space; Common basis; Data structures; Distributed memory machines; Fortran language extensions; Global data references; High performance Fortran; Programming style; Templates", thesaurus = "Data structures; Distributed memory systems; FORTRAN; Parallel programming", } @Article{Blelloch:1993:IPN, author = "Guy E. Blelloch and Siddhartha Chatterjee and Jonathan C. Hardwick and Jay Sipelstein and Marco Zagha", title = "Implementation of a portable nested data-parallel language", journal = j-SIGPLAN, volume = "28", number = "7", pages = "102--111", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "An overview is given of the implementation of NESL, a portable nested data-parallel language. This language and its implementation are the first to fully support nested data structures as well as nested data-parallel function calls. These features allow the concise description of parallel algorithms on irregular data, such as sparse matrices and graphs. In addition, they maintain the advantages of data-parallel languages: a simple programming model and portability. The current NESL implementation is based on an intermediate language called VCODE and a library of vector routines called CVL. It runs on the Connection Machine CM-2, the Cray Y-MP C90, and serial machines. Benchmark results show, that NESL's performance is competitive with that of machine-specific codes for regular dense data, and is often superior for irregular data.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburg, PA, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Connection Machine CM-2; Cray Y-MP C90; CVL; Data-parallel languages; intermediate language; Irregular data; NESL implementation; Nested data structures; Nested data-parallel function calls; Parallel algorithms; Portable nested data-parallel language; Serial machines; Sparse matrices; VCODE; Vector routines", thesaurus = "Data structures; Parallel algorithms; Parallel languages; Parallel programming; Software portability", } @Article{Rao:1993:ELD, author = "Pushpa Rao and Clifford Walinsky", title = "An equational language for data-parallelism", journal = j-SIGPLAN, volume = "28", number = "7", pages = "112--118", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Data-parallelism provides a clean conceptual framework for parallel programming. The authors are developing two programming languages: a high level equational language, called EL*, and a low-level implementation language. Both languages exploit data-parallelism instead of control-parallelism. EL* is a declarative data-parallel language. EL* programs are high-level equational specifications that use extensive pattern-matching and recursion. The language's syntax and semantics are intended to be clear and simple. Recursive forms arc restricted to enable translation to efficient data-parallel operations. EL* programs are compiled into FP*, a variant of Backus's FP, where parallel operations are more explicit and low-level. The target language has a rich set of functions for performing communication, and computation. It also has a powerful set of combining forms that generate large highly-parallel functions from smaller program units. Prototype compilers have been implemented for both languages, and they demonstrate good performance. Several linear algebra and non-numeric problems have been programmed with relative ease using EL*.", acknowledgement = ack-nhfb, affiliation = "Dartmouth Coll., Hanover, NH, USA", classification = "C6110B (Software engineering techniques); C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Clean conceptual framework; Data-parallelism; Declarative data-parallel language; FP*; High level equational language; Linear algebra; Low-level implementation language; Non-numeric problems; Parallel programming", thesaurus = "Formal specification; Parallel languages; Parallel programming; Program compilers", } @Article{Prins:1993:THD, author = "Jan F. Prins and Daniel W. Palmer", title = "Transforming high-level data-parallel programs into vector operations", journal = j-SIGPLAN, volume = "28", number = "7", pages = "119--128", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A discussion is given on efficient parallel execution based on nested sequences, higher order function and generalized iterators. They can be realized in the vector model using a suitable representation of nested sequences and a small set of transformational rules to distribute iterators through the constructs of the language.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Efficient parallel execution; Generalized iterators; Higher order function; Nested sequences; Transformational rules; Vector model; Vector operations", thesaurus = "Data structures; Parallel languages; Parallel programming", } @Article{Prins:1993:THL, author = "Jan F. Prins and Daniel W. Palmer", title = "Transforming high-level data-parallel programs into vector operations", journal = j-SIGPLAN, volume = "28", number = "7", pages = "119--128", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Masticola:1993:NA, author = "Stephen P. Masticola and Barbara G. Ryder", title = "Non-concurrency analysis", journal = j-SIGPLAN, volume = "28", number = "7", pages = "129--138", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Non-concurrency analysis is a set of techniques for statically identifying pairs (or sets) of statements in a concurrent program which can never happen together. The authors present a framework for non-currency analysis, capable of incorporating previous analysis algorithms and improving upon them. They show general theoretical results which are useful in estimating nonconcurrency, and examples of non-concurrency analysis frameworks for two synchronization primitives: the Ada rendezvous and binary semaphores. Both of these frameworks have a low-order polynomial bound on worst-case solution time. The provide experimental evidence that static non-concurrency analysis of Ada programs can be accomplished in a reasonable time, and is generally quite accurate.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Ada programs; Ada rendezvous; Binary semaphores; Concurrent program; Non-currency analysis; Polynomial bound; Synchronization primitives; Worst-case solution time", thesaurus = "Ada; Concurrency control; Parallel programming", } @Article{Masticola:1993:NCA, author = "Stephen P. Masticola and Barbara G. Ryder", title = "Non-concurrency analysis", journal = j-SIGPLAN, volume = "28", number = "7", pages = "129--138", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bala:1993:EDPb, author = "Vasanth Bala and Jeanne Ferrante and Larry Carter", title = "Explicit data placement {(XDP)}: a methodology for explicit compile-time representation and optimization of data movement", journal = j-SIGPLAN, volume = "28", number = "7", pages = "139--148", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Data movement; Data ownership; Distributed memory machine; Efficient code; Explicit compile-time representation; Explicit data placement; Global memory; Intermediate program language; Run-time structures; Run-time transfer; Shared memory machine; XDP methodology", thesaurus = "Data structures; Distributed memory systems; Parallel programming; Program compilers; Shared memory systems", } @Article{Chatterjee:1993:GLA, author = "Siddhartha Chatterjee and John R. Gilbert and Fred J. E. Long and Robert Schreiber and Shang-Hua Teng", title = "Generating local addresses and communication sets for data-parallel programs", journal = j-SIGPLAN, volume = "28", number = "7", pages = "149--158", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Generating local addresses and communication sets is an important issue in distributed-memory implementations of data-parallel languages such as high performance Fortran. The authors show that for an array A affinely aligned to a template that is distributed across p processors with a cyclic(k) distribution, and a computation involving the regular section a(l:h:s), the local memory access sequence of at most k states. They present fast algorithms for computing the essential information about these state machines, and extend the framework to handle multidimensional arrays. They also show how to generate communication sets using the state machine approach. Performance results show that this solution requires very little runtime overhead and acceptable preprocessing time.", acknowledgement = ack-nhfb, affiliation = "NASA Ames Res. Center, Moffett Field, CA, USA", classification = "C4220 (Automata theory); C6110P (Parallel programming); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Communication sets; Data-parallel languages; Distributed-memory implementations; Fast algorithms; Local memory access sequence; Multidimensional arrays; State machines", thesaurus = "Distributed memory systems; Finite automata; FORTRAN; Parallel programming", } @Article{Grunwald:1993:DFE, author = "Dirk Grunwald and Harini Srinivasan", title = "Data flow equations for explicitly parallel programs", journal = j-SIGPLAN, volume = "28", number = "7", pages = "159--168", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Correct programs; Data ownership; Data races; Explicit lexically specified parallel constructs; Explicit synchronization operations; Explicitly parallel programming language; Memory consistency model; Memory consistency semantics; Parallel programs; Reaching definitions problem; Sequential programs; Standard optimization problems", thesaurus = "Parallel languages; Parallel programming; Program compilers; Programming theory", } @Article{Chakrabarti:1993:IIA, author = "Soumen Chakrabarti and Katherine A. Yelick", title = "Implementing an irregular application on a distributed memory multiprocessor", journal = j-SIGPLAN, volume = "28", number = "7", pages = "169--178", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C7310 (Mathematics)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Algebraic properties; Application-specific scheduler; Case study; Correctness; Distributed memory implementation; Efficient parallel implementation; Gr{\"o}bner basis problem; Guarded statements; Irregular patterns; Locally inconsistent views; Multiple processors; Non-deterministic invocations; Sequential algorithm; Shared data structures; Symbolic algebra application; Transition axio style", thesaurus = "Data structures; Distributed memory systems; Parallel programming; Scheduling; Symbol manipulation", } @Article{Siegl:1993:PAS, author = "Kurt Siegl", title = "Parallelizing algorithms for symbolic computation using $\parallel${Maple}$\parallel$", journal = j-SIGPLAN, volume = "28", number = "7", pages = "179--186", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "$\parallel$Maple$\parallel$ (speak: parallel Maple) is a portable system for parallel symbolic computation. The system is built as an interface between the parallel declarative programming language Strand and the sequential computer algebra system Maple, thus providing the elegance of Strand and the power of the existing sequential algorithms in Maple. The implementation of different parallel programming paradigms shows that it is fairly easy to parallelize even complex algebraic algorithms using this system. Sample applications (among them algorithms solving multivariate nonlinear equation systems) are implemented on various parallel architectures. For example a straightforward parallelization of the complex and important problem of real root isolation has been parallelized using a generic Strand program of fewer than 20 lines of code and a slight modification of 5 lines in the original sequential Maple source. Even with such a simple modification we gained a speed-up of 5 times, that is better than those reported by others in the literature.", acknowledgement = ack-nhfb, affiliation = "Res. Inst. for Symbolic Comput., Johannes Kepler Univ., Linz, Austria", classification = "721.1; 722.4; 723.1; 921.1; C6110P (Parallel programming); C6140D (High level languages); C7310 (Mathematics)", confdate = "19-22 May 1993", conference = "Proceedings of the 4th ACM SIGPLAN Symposium on Principles \& Practice of Parallel Programming", conferenceyear = "1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Algebra; Algorithms; Complex algebraic algorithms; Computational methods; Computer programming languages; Computer software portability; Generic Strand program; Interfaces (computer); Logic programming; Multivariate nonlinear equation systems; Parallel architectures; Parallel declarative programming language Strand; Parallel Maple; Parallel processing systems; Parallel programming paradigms; Parallel symbolic computation; Portable system; Real root isolation; Sequential algorithms; Sequential computer algebra system; Slight modification; Subroutines; Symbolic computation", meetingabr = "Proc 4th ACM SIGPLAN Symp Princ Pract Parallel Program", meetingaddress = "San Diego, CA, USA", meetingdate = "May 19--22 1993", meetingdate2 = "05/19--22/93", pubcountry = "USA", sponsor = "Association for Computing Machinery", thesaurus = "Parallel languages; Parallel programming; Symbol manipulation", } @Article{Yeung:1993:EFG, author = "Donald Yeung and Anant Agarwal", title = "Experience with fine-grain synchronization in {MIMD} machines for preconditioned conjugate gradient", journal = j-SIGPLAN, volume = "28", number = "7", pages = "187--192", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yeung:1993:EFS, author = "Donald Yeung and Anant Agarwal", title = "Experience with fine-grain synchronization in {MIMD} machines for preconditioned conjugate gradient", journal = j-SIGPLAN, volume = "28", number = "7", pages = "187--197", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The authors discuss experience with fine-grain synchronization for a variant of the preconditioned conjugate gradient method. Through a series of experiments conducted using a simulator of a distributed shared-memory multiprocessor, the authors address two major questions related to fine-grain synchronization in the context of this application. First, what is the overall impact of fine-grain synchronization on performance? Second, what are the individual contributions of the following three mechanisms typically provided to support fine-grain synchronization: language-level support, full-empty bits for compact storage and communications of synchronization state, and efficient processor operations on the state bits?", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", classification = "C4140 (Linear algebra); C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming); C7310 (Mathematics)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compact storage; Distributed shared-memory multiprocessor; Fine-grain synchronization; Full-empty bits; Language-level support; MIMD machines; Preconditioned conjugate gradient method", thesaurus = "Distributed memory systems; Mathematics computing; Matrix algebra; Parallel programming; Synchronisation", } @Article{Morrisett:1993:PLP, author = "J. Gregory Morrisett and Andrew P. Tolmach", title = "Procs and locks: a portable multiprocessing platform for {Standard ML} of {New Jersey}", journal = j-SIGPLAN, volume = "28", number = "7", pages = "198--207", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A portable platform has been built for running Standard ML of New Jersey programs on multiprocessors. It can be used to implement user-level thread packages for multiprocessors within the ML language with first-class continuations. The platform supports experimentation with different thread scheduling policies and synchronization constructs. It has been used to construct a Modula-3 style thread package and a version of Concurrent ML, and has been ported to three different multiprocessors running variants of Unix. The authors describe the platform's design, implementation, and performance.", acknowledgement = ack-nhfb, affiliation = "Carnegie Mellon Univ., Pittsburg, PA, USA", classification = "C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Concurrent ML; First-class continuations; Functional language; Modula-3 style thread package; New Jersey programs; Portable multiprocessing platform; Portable platform; Standard ML; Synchronization constructs; Thread scheduling policies; User-level thread packages", thesaurus = "Multiprocessing systems; Parallel languages; Parallel programming; Scheduling", } @Article{Wagner:1993:LPT, author = "David B. Wagner and Bradley G. Calder", title = "{Leapfrogging}: a portable technique for implementing efficient futures", journal = j-SIGPLAN, volume = "28", number = "7", pages = "208--217", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A future is a language construct that allows programmers to expose parallelism in applicative languages such as MultiLisp with minimal effort. The authors describe a technique for implementing futures, which they call leapfrogging, that reduces blocking due to load imbalance. The utility of leapfrogging is enhanced by the fact that it is completely platform-independent, is free from deadlock, and places a bound on stack sizes that is at most a small constant times the maximum stack size encountered during a sequential execution of the same computation. The authors demonstrate the performance of leapfrogging using a prototype implementation written in C++.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", classification = "C6110P (Parallel programming); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Applicative languages; Blocking; C++; Deadlock; Future; Language construct; Leapfrogging; Load imbalance; Maximum stack size; MultiLisp; Parallelism; Platform-independent; Prototype implementation; Sequential execution; Stack sizes", thesaurus = "Parallel languages; Parallel programming; Software portability", } @Article{Taura:1993:EIS, author = "Kenjiro Taura and Satoshi Matsuoka and Akinori Yonezawa", title = "An efficient implementation scheme of concurrent object-oriented languages on stock multicomputers", journal = j-SIGPLAN, volume = "28", number = "7", pages = "218--228", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Several novel techniques for efficient implementation of concurrent object-oriented languages on general purpose, stock multicomputers are presented. These techniques have been developed in implementing a concurrent object-oriented language ABCL on a Fujitsu Laboratory's experimental multicomputer AP1000 consisting of 512 SPARC chips. The proposed intra-node scheduling mechanism reduces the cost of local message passing. The minimum latency of asynchronous internode message passing is about 9 mu s, or about 120 instructions, employing the self-dispatching mechanism independently proposed by T. Eicken et al., (1992). A large scale benchmark which involves 9,000,000 message passings shows 440 times speedup on the 512 nodes system compared to the sequential version of the same algorithm.", acknowledgement = ack-nhfb, affiliation = "Dept. of Inf. Sci., Tokyo Univ., Japan", classification = "C5620 (Computer networks and techniques); C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "AP1000; Asynchronous internode message passing; Concurrent object-oriented language ABCL; Concurrent object-oriented languages; Intra-node scheduling mechanism; Large scale benchmark; Local message passing; Minimum latency; Self-dispatching mechanism; SPARC chips; Stock multicomputers", thesaurus = "Message passing; Object-oriented languages; Parallel languages; Parallel programming; Scheduling", } @Article{Sandhu:1993:SRA, author = "Harjinder S. Sandhu and Benjamin Gamsa and Songnian Zhou", title = "The shared regions approach to software cache coherence on multiprocessors", journal = j-SIGPLAN, volume = "28", number = "7", pages = "229--238", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The effective management of caches is critical to the performance of applications on shared-memory multiprocessors. The authors discuss a technique for software cache coherence that is based upon the integration of a program-level abstraction for shared data with software cache management. The program-level abstraction, called shared regions, explicitly relates synchronization objects with the data they protect. Cache coherence algorithms are presented which use the information provided by shared region primitives, and ensure that shared regions are always cachable by the processors accessing them. Measurements and experiments of the shared region approach on a shared-memory multiprocessor are shown. Comparisons with other software based coherence strategies, including a user-controlled strategy and an operating system-based strategy, show that this approach is able to deliver better performance, with relatively low corresponding overhead and only a small increase in the programming effort.", acknowledgement = ack-nhfb, affiliation = "Comput. Syst. Res. Inst., Toronto Univ., Ont., Canada", classification = "C5440 (Multiprocessor systems and techniques); C6110P (Parallel programming)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Effective management; Operating system-based strategy; Program-level abstraction; Shared data; Shared region primitives; Shared regions; Shared-memory multiprocessors; Software based coherence strategies; Software cache coherence; Software cache management; Synchronization objects; User-controlled strategy", thesaurus = "Buffer storage; Parallel programming; Shared memory systems; Synchronisation", } @Article{Hsieh:1993:CME, author = "Wilson C. Hsieh and Paul Wang and William E. Weihl", title = "Computation migration: enhancing locality for distributed-memory parallel systems", journal = j-SIGPLAN, volume = "28", number = "7", pages = "239--248", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Computation migration is a technique that is based on compile-time program transformation, for accessing remote data in a distributed-memory parallel system. In contrast with RPC-style access, where the access is performed remotely, and with data migration, where the data is moved so that it is local, computation migration moves put of the current thread to the processor where the data resides. The access is performed at the remote processor, and the migrated thread portion continues to run on that same processor; this makes subsequent accesses in the thread portion local. The authors describe an implementation of computation migration that consists of two parts: a implementation that migrates single activation frames, and a high-level language annotation that allows a programmer to express when migration is desired. They performed experiments using two applications; these experiments demonstrate that computation migration is a valuable alternative to RPC and data migration.", acknowledgement = ack-nhfb, affiliation = "Lab. of Comput. Sci., MIT, Cambridge, MA, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compile-time program transformation; Computation migration; Current thread; Distributed-memory parallel system; High-level language annotation; Remote data; Remote processor; Single activation frames", thesaurus = "Distributed memory systems; Parallel programming; Program compilers; Storage management", } @Article{Chandra:1993:DLL, author = "Rohit Chandra and Anoop Gupta and John L. Hennessy", title = "Data locality and load balancing in {COOL}", journal = j-SIGPLAN, volume = "28", number = "7", pages = "249--259", month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Center for Integrated Syst., Stanford Univ., CA, USA", classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Concurrent object-oriented language; COOL; Data locality; Data reference patterns; Data structures; Multilevel memory hierarchy; Per-processor caches; Remote memory references; Remote shared memory; Runtime system; SPLASH parallel benchmark suite; Underlying memory hierarchy", thesaurus = "Data structures; Object-oriented languages; Parallel languages; Parallel programming; Shared memory systems", } @Article{Guthery:1993:WSH, author = "Scott Guthery", title = "Are we still having fun?: a minority report from {HOPL-II}", journal = j-SIGPLAN, volume = "28", number = "8", pages = "1--1", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wexelblat:1993:BRO, author = "Alan Wexelblat", title = "Book Review: {Obfuscated C and Other Mysteries by Don Libes: (John Wiley \& Sons, Inc.)}", journal = j-SIGPLAN, volume = "28", number = "8", pages = "2--2", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hesse:1993:PIB, author = "Jan Hesse and Rainer K{\"o}nig and Filippo Logi and Jens Herder", title = "A Prototype of an Interface Builder for the {Common Lisp Interface Manager} --- {CLIB}", journal = j-SIGPLAN, volume = "28", number = "8", pages = "19--28", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chandra:1993:CEW, author = "Kailash Chandra", title = "{C++} in Eight Weeks", journal = j-SIGPLAN, volume = "28", number = "8", pages = "29--38", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schilling:1993:FSP, author = "Jonathan L. Schilling", title = "Fail-Safe Programming in Compiler Optimization", journal = j-SIGPLAN, volume = "28", number = "8", pages = "39--42", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grune:1993:TLG, author = "Dick Grune", title = "Two-level grammars are more expressive than {Type 0} grammars: or are they?", journal = j-SIGPLAN, volume = "28", number = "8", pages = "43--45", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fei:1993:ATM, author = "Zongming Fei and Jian Lu", title = "An Approach Toward Mechanization of Acquiring Reusable Software Components", journal = j-SIGPLAN, volume = "28", number = "8", pages = "46--52", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Czeck:1993:DSL, author = "Edward W. Czeck and James M. Feldman", title = "On defusing a small landmine in the type casting of pointers in the {``C''} language", journal = j-SIGPLAN, volume = "28", number = "8", pages = "53--56", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Janssens:1993:HDP, author = "Pascal Janssens and Annie Cuyt", title = "How Does {PASCAL-XSC} Compare to Other Programming Languages with Respect to the {IEEE} Standard?", journal = j-SIGPLAN, volume = "28", number = "8", pages = "57--66", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ejiogu:1993:FPF, author = "Lem O. Ejiogu", title = "Five Principles for the Formal Validation of Models of Software Metrics", journal = j-SIGPLAN, volume = "28", number = "8", pages = "67--76", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cashman:1993:ESC, author = "Mark Cashman", title = "Edicates --- {A} Specification of Calling Sequences", journal = j-SIGPLAN, volume = "28", number = "8", pages = "77--80", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:36:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Caslunan:1993:ESC, author = "Mark Caslunan", title = "Edicates --- a specification of calling sequences", journal = j-SIGPLAN, volume = "28", number = "8", pages = "77--80", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deLaRocqueRodriguez:1993:TS, author = "Noemi {de La Rocque Rodriguez} and Roberto Ierusalimschy and Jos{\'e} Lucas Rangel", title = "Types in School", journal = j-SIGPLAN, volume = "28", number = "8", pages = "81--89", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:36:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rodriguez:1993:TS, author = "Noemi de la Rocque Rodriguez and Roberto Ierusalimschy and Jos{\'e} Lucas Rangel", title = "Types in school", journal = j-SIGPLAN, volume = "28", number = "8", pages = "81--89", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shute:1993:AAB, author = "Malcolm J. Shute", title = "{Abotec}: an automatic back-of-the-envelope calculator", journal = j-SIGPLAN, volume = "28", number = "8", pages = "90--98", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The trial-and-error method, iteratively applied, is invariably involved in any kind of design work, with much back-of-the-envelope calculation to guide the process. In this, the `what-if' game is a very useful tactic in the search for unexpected solutions in complex design spaces, made all the more effective by the availability of automated interpreters. These are needed to perform the tedious re-calculation of the model each time a change is made to a small part. In the financial world, the interpreter generally takes the form of the spread-sheet, of which Quattro is a fine example; in mathematics it takes the form of packages such as Mathematica. Neither of these is ideally tailored for engineering design, and so Abotec was developed when the author had need of such a tool. There are four main characteristics which fit Abotec for its purpose: it works with floating-point numbers throughout; it uses a richer than normal set of arithmetic operators and functions; it uses mnemonic labelling throughout; and, most importantly it treats all variables as having an upper and lower bound.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Manchester Univ., UK", classification = "C6140D (High level languages); C7310 (Mathematics); C7400 (Engineering)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abotec; Arithmetic operators; Automated interpreters; Automatic back-of-the-envelope calculator; Back-of-the-envelope calculation; Complex design spaces; Design work; Engineering design; Floating-point numbers; Mnemonic labelling; Re-calculation; Trial-and-error method; Unexpected solutions; What-if", thesaurus = "CAD; High level languages; Mathematics computing", } @Article{Philippsen:1993:CMI, author = "Michael Philippsen and Ernst A. Heinz and Paul Lukowicz", title = "Compiling Machine-Independent Parallel Programs", journal = j-SIGPLAN, volume = "28", number = "8", pages = "99--108", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rost:1993:DDD, author = "Johann Rost", title = "{``D2R''}: a dynamic dataflow representation for task scheduling", journal = j-SIGPLAN, volume = "28", number = "8", pages = "109--116", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rost:1993:DDR, author = "Johann Rost", title = "{$D^2R$}: {A} Dynamic Dataflow Representation for Task Scheduling", journal = j-SIGPLAN, volume = "28", number = "8", pages = "109--116", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:36:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Arro:1993:PBQ, author = "Henrik Arro and Jonas Barklund and Johan Bevemyr", title = "Parallel Bounded Quantification --- Preliminary Results", journal = j-SIGPLAN, volume = "28", number = "8", pages = "117--124", month = aug, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:40 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Getzinger:1993:ARA, author = "Thomas W. Getzinger and Ralph Clarke Haygood and Peter {Van Roy}", title = "Announcing the Release of {Aquarius Prolog}", journal = j-SIGPLAN, volume = "28", number = "9", pages = "5--5", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:43:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pfeiffer:1993:RSA, author = "Phil Pfeiffer", title = "Report on the {Second Annual Alan J. Perlis Symposium on Programming Languages}", journal = j-SIGPLAN, volume = "28", number = "9", pages = "6--12", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:43:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bielak:1993:OOP, author = "Richie Bielak", title = "Object Oriented Programming: The Fundamentals", journal = j-SIGPLAN, volume = "28", number = "9", pages = "13--14", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Woodman:1993:TMS, author = "Mark Woodman", title = "A Taste of the {Modula-2 Standard}", journal = j-SIGPLAN, volume = "28", number = "9", pages = "15--24", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Banning:1993:CCSa, author = "John Banning", title = "Comment on a Comment by {Shibin Hu}", journal = j-SIGPLAN, volume = "28", number = "9", pages = "25--25", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 17:43:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Hu:1993:CCK,Banning:1993:CCSa}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bell:1993:SRA, author = "Doug Bell and Mike Parr", title = "Spreadsheets: {A} Research Agenda", journal = j-SIGPLAN, volume = "28", number = "9", pages = "26--28", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gao:1993:SIC, author = "Yaoqing Gao and Chung Kwong Yuen", title = "A Survey of Implementations of Concurrent, Parallel and Distributed {Smalltalk}", journal = j-SIGPLAN, volume = "28", number = "9", pages = "29--35", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liffers:1993:IVC, author = "Rainer H. Liffers", title = "Inheritance versus Containment", journal = j-SIGPLAN, volume = "28", number = "9", pages = "36--38", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Heymann:1993:PID, author = "Jurgen Heymann", title = "A 100\% Portable Inline-Debugger", journal = j-SIGPLAN, volume = "28", number = "9", pages = "39--46", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Goldsby:1993:SIT, author = "Michael E. Goldsby", title = "A simple implementation technique for mixin inheritance", journal = j-SIGPLAN, volume = "28", number = "9", pages = "47--56", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Muller:1993:OOP, author = "Bernd M{\"u}ller", title = "Is Object-Oriented Programming Structured Programming?", journal = j-SIGPLAN, volume = "28", number = "9", pages = "57--66", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marlowe:1993:PIA, author = "Thomas J. Marlowe and William G. Landi and Barbara G. Ryder and Jong-Deok Choi and Michael G. Burke and Paul Carini", title = "Pointer-Induced Aliasing: {A} Clarification", journal = j-SIGPLAN, volume = "28", number = "9", pages = "67--70", month = sep, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", xxauthor = "Thomas J. Marlowe and Jong-Deok Choi and William Landi and Michael G. Burke and Barbara G. Ryder and Paul R. Carini", } @Article{Nierstrasz:1993:RTA, author = "Oscar Nierstrasz", title = "Regular types for active objects", journal = j-SIGPLAN, volume = "28", number = "10", pages = "1--15", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ de Geneve", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Liskov:1993:STU, author = "Barbara Liskov and Jeannette M. Wing", title = "Specifications and their use in defining subtypes", journal = j-SIGPLAN, volume = "28", number = "10", pages = "16--28", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Massachusetts Inst of Technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Bruce:1993:SDT, author = "Kim B. Bruce and Jon Crabtree and Thomas P. Murtagh and Robert {van Gent} and Allyn Dimock and Robert Muller", title = "Safe and decidable type checking in an object-oriented language", journal = j-SIGPLAN, volume = "28", number = "10", pages = "29--46", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Williams Coll", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Mendez:1993:WMB, author = "Rich Mendez and Rebecca Wirfs-Brock and James Rumbaugh and Stephen J. Mellor and Ivar Jacobson and Grady Booch", title = "Which method is best? Shoot out at the {OO} corral", journal = j-SIGPLAN, volume = "28", number = "10", pages = "46--47 (or 47--47??)", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "AT\&T", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Krueger:1993:TDA, author = "Keith Krueger and David Loftesness and Amin Vahdat and Thomas Anderson", title = "Tools for the development of application-specific virtual memory management", journal = j-SIGPLAN, volume = "28", number = "10", pages = "48--64", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California at Berkeley", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Bruegge:1993:FDP, author = "Bernd Bruegge and Tim Gottschalk and Bin Luo", title = "A framework for dynamic program analyzers", journal = j-SIGPLAN, volume = "28", number = "10", pages = "65--82", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Carnegie Mellon Univ", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Bingham:1993:EDU, author = "Tim Bingham and Nancy Hobbs and Dave Husson", title = "Experiences Developing and Using an Object-Oriented Library for Program Manipulation", journal = j-SIGPLAN, volume = "28", number = "10", pages = "83--89", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Digital Equipment Corp", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{VanStee:1993:SOO, author = "J. G. {Van Stee} and Dan Clarke and David Filani and Dmitry Lenkov and Raymond Obin", title = "Status of object-oriented {COBOL} (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "90--90", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{vanStee:1993:SOC, author = "J. G. {van Stee} and Megan Adams and Dan Clarke and Dimitri Lenkov and Raymond Obin", title = "Status of object-oriented {COBOL}", journal = j-SIGPLAN, volume = "28", number = "10", pages = "90--90", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IBM", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Kale:1993:CPC, author = "Laxmikant V. Kal{\'e} and Sanjeev Krishnan", title = "{CHARM++}: {A} portable concurrent object oriented system based on {C++}", journal = j-SIGPLAN, volume = "28", number = "10", pages = "91--108", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Illinois at Urbana-Champaign", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Matsuoka:1993:HEE, author = "Satoshi Matsuoka and Kenjiro Taura and Akinori Yonezawa", title = "Highly efficient and encapsulated re-use of synchronization code in concurrent object-oriented languages", journal = j-SIGPLAN, volume = "28", number = "10", pages = "109--126", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Tokyo", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Taft:1993:AAO, author = "S. Tucker Taft", title = "{Ada 9X}. From abstraction-oriented to object-oriented", journal = j-SIGPLAN, volume = "28", number = "10", pages = "127--136", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Intermetrics, Inc", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Seidewitz:1993:DSL, author = "Ed Seidewitz and Brad Balfour and Sam S. Adams and David M. Wade and Brad Cox", title = "Developing software for large-scale reuse (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "137--143", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "NASA Goddard Space Flight Cent", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Cahill:1993:AGG, author = "Vinny Cahill and Se{\'a}n Baker and Chris Horn and Gradimir Starovic", title = "The {Amadeus GRT}: generic runtime support for distributed persistent programming", journal = j-SIGPLAN, volume = "28", number = "10", pages = "144--161", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Trinity Coll", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Bal:1993:ODO, author = "Henri E. Bal and M. Frans Kaashoek", title = "Object distribution in {Orca} using {Compile-Time} and {Run-Time} techniques", journal = j-SIGPLAN, volume = "28", number = "10", pages = "162--177", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Vrije Univ", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Odeh:1993:OEO, author = "Mohammed H. Odeh and Julian A. Padget", title = "Object-oriented execution of {OPS5} production systems", journal = j-SIGPLAN, volume = "28", number = "10", pages = "178--190", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Bath Univ", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Odeh:1993:OOE, author = "Mohammed H. Odeh and Julian A. Padget", title = "Object-oriented execution of {OPS5} production systems", journal = j-SIGPLAN, volume = "28", number = "10", pages = "178--190", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Coppola:1993:DBG, author = "Angela Jo Coppola and William Ruth", title = "Doing business with governments", journal = j-SIGPLAN, volume = "28", number = "10", pages = "191--191", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "CIA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Strauss:1993:IIG, author = "Paul S. Strauss", title = "{IRIS Inventor}, {A} {3D} graphics toolkit", journal = j-SIGPLAN, volume = "28", number = "10", pages = "192--200", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Silicon Graphics, Inc", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Lamping:1993:TSI, author = "John Lamping", title = "Typing the specialization interface", journal = j-SIGPLAN, volume = "28", number = "10", pages = "201--214", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Larnping:1993:TSI, author = "John Larnping", title = "Typing the specialization interface", journal = j-SIGPLAN, volume = "28", number = "10", pages = "201--214", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Xerox PARC", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Bracha:1993:STS, author = "Gilad Bracha and David Griswold", title = "{Strongtalk}: typechecking {Smalltalk} in a production environment", journal = j-SIGPLAN, volume = "28", number = "10", pages = "215--230", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Horizon Technologies of New York", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Hauck:1993:IME, author = "Franz J. Hauck", title = "Inheritance modeled with explicit bindings: An approach to typed inheritance", journal = j-SIGPLAN, volume = "28", number = "10", pages = "231--239", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Erlangen-N{\"u}rnberg", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Hoydalsvik:1993:POA, author = "Geir Magne Hoydalsvik and Guttorm Sindre", title = "On the purpose of object-oriented analysis", journal = j-SIGPLAN, volume = "28", number = "10", pages = "240--255", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Trondheim", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Hoydalsvik:1993:POO, author = "Geir Magne H{\o}ydalsvik and Guttorm Sindre", title = "On the purpose of object-oriented analysis", journal = j-SIGPLAN, volume = "28", number = "10", pages = "240--255", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Thomas:1993:DPO, author = "Dave Thomas and Adele Goldberg and James Coplien and Peter Coad and Geir Magne H{\o}ydalsvik", title = "A discussion of {On} the {Purpose} of {Object-Oriented Analysis}", journal = j-SIGPLAN, volume = "28", number = "10", pages = "256--258", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Driesen:1993:STI, author = "Karel Driesen", title = "Selector table indexing {\&} sparse arrays", journal = j-SIGPLAN, volume = "28", number = "10", pages = "259--270", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Vrije Univ Brussel", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Casean:1993:EHM, author = "Yves Casean", title = "Efficient handling of multiple inheritance hierarchies", journal = j-SIGPLAN, volume = "28", number = "10", pages = "271--287", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Bellcore", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Caseau:1993:EHM, author = "Yves Caseau", title = "Efficient handling of multiple inheritance hierarchies", journal = j-SIGPLAN, volume = "28", number = "10", pages = "271--287", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hosking:1993:OFH, author = "Antony L. Hosking and J. Eliot B. Moss", title = "Object fault handling for persistent programming languages: {A} performance evaluation", journal = j-SIGPLAN, volume = "28", number = "10", pages = "288--303", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Massachusetts", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Thuraisingham:1993:IOO, author = "Bhavani Thuraisingham", title = "Integrating object-oriented technology and security technology", journal = j-SIGPLAN, volume = "28", number = "10", pages = "304--304", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Thuraisingham:1993:IOT, author = "Bhavani M. Thuraisingham", title = "Integrating object technology and security technology: {A} panel discussion", journal = j-SIGPLAN, volume = "28", number = "10", pages = "304--304", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Integrating object technology and security technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Ting:1993:MSR, author = "T. C. Ting", title = "Modeling Security Requirements for Applications (Panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "305--305", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Integrating object technology and security technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Sell:1993:OOA, author = "Peter J. Sell", title = "Object Oriented Approach to {MLS} Database Application Design (Panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "306--306", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Integrating object technology and security technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Sandhu:1993:SOS, author = "Ravi S. Sandhu", title = "Security for {OODBMS} (or Systems) (Panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "307--307", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Integrating object technology and security technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Keefe:1993:ROM, author = "Thomas F. Keefe", title = "Reconciling Objects and Multilevel Security (Panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "308--308", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Integrating object technology and security technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Koved:1993:GOO, author = "Larry Koved and Wayne L. Wooten", title = "{GROOP}: an object-oriented toolkit for animated {$3$D} graphics", journal = j-SIGPLAN, volume = "28", number = "10", pages = "309--325", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Koved:1993:GOT, author = "Larry Koved and Wayne L. Wooten", title = "{GROOP}: An object-oriented toolkit for animated {3D} graphics", journal = j-SIGPLAN, volume = "28", number = "10", pages = "309--325", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IBM T.J. Watson Lab", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{DePauw:1993:VBO, author = "Wim {De Pauw} and Richard Helm and Doug Kimelman and John Vlissides", title = "Visualizing the behavior of object-oriented systems", journal = j-SIGPLAN, volume = "28", number = "10", pages = "326--337", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IBM T.J. Watson Lab", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Pauw:1993:VBO, author = "Wim De Pauw and Richard Helm and Doug Kimelman and John Vlissides", title = "Visualizing the behavior of object-oriented systems", journal = j-SIGPLAN, volume = "28", number = "10", pages = "326--337", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Minoura:1993:SAO, author = "Toshimi Minoura and Shirish S. Pargaonkar and Kurt Rehfuss", title = "Structural active object systems for simulation", journal = j-SIGPLAN, volume = "28", number = "10", pages = "338--355", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Oregon State Univ", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Anderson:1993:SAN, author = "Bruce Anderson and Mary Shaw and Larry Best and Kent Beck", title = "Software architecture: the next step for object technology (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "356--359", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shaw:1993:SAN, author = "Mary Shaw and Larry Best and Kent Beck", title = "Software architecture: The next step for object technology (Panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "356--362", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Essex", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Shan:1993:MIE, author = "Yen-Ping Shan and Tom Cargill and Brad Cox and William Cook and Mary Loomis and Alan Snyder", title = "Is multiple inheritance essential to {OOP?} (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "360--363", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shan:1993:PMI, author = "Yeng-Ping Shan and Tom Cargill and Brad Cox and William Cook and Mary Loomis and Alan Snyder", title = "Panel: Is multiple inheritance essential to {OOP}?", journal = j-SIGPLAN, volume = "28", number = "10", pages = "363--363", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IBM Cary", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Nierstrasz:1993:PDP, author = "Oscar Nierstrasz", title = "Panel: Distributed processing", journal = j-SIGPLAN, volume = "28", number = "10", pages = "364--364", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Univ Geneve", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Stark:1993:IOO, author = "Mike Stark", title = "Impacts of object-oriented technologies: seven years of {SEL} studies", journal = j-SIGPLAN, volume = "28", number = "10", pages = "365--373", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stark:1993:IOT, author = "Mike Stark", title = "Impacts of object-oriented technologies: Seven years of {SEL} studies", journal = j-SIGPLAN, volume = "28", number = "10", pages = "365--373", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Litvintchonk:1993:PET, author = "Steven D. Litvintchonk and Mike Stark and Brad Balfour and Mohamed Fayad and Bernie Rosenfeld", title = "Panel: Evolving toward object-oriented technology in large organizations", journal = j-SIGPLAN, volume = "28", number = "10", pages = "374--375", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Litvintchouk:1993:ETO, author = "Steven D. Litvintchouk and Mike Stark and Brad Balfour and Mohamed Fayad and Bernie Rosenfeld", title = "Evolving toward object-oriented technology in large organizations (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "374--375", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Civello:1993:RCO, author = "Franco Civello", title = "Roles for composite objects in object-oriented analysis and design", journal = j-SIGPLAN, volume = "28", number = "10", pages = "376--393", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Godin:1993:BMA, author = "Robert Godin and Hafedh Mili", title = "Building and maintaining analysis-level class hierarchies using {Galois Lattices}", journal = j-SIGPLAN, volume = "28", number = "10", pages = "394--410", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Harrison:1993:SOP, author = "William Harrison and Harold Ossher", title = "Subject-oriented programming: a critique of pure objects", journal = j-SIGPLAN, volume = "28", number = "10", pages = "411--428", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harrison:1993:SPC, author = "William Harrison and Harold Ossher", title = "Subject-oriented programming (a critique of pure objects)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "411--428", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Beck:1993:HGP, author = "Kent Beck and Grady Booch and William Cook and Richard Gabriel and Rebecca Wirfs-Brock", title = "How to get a paper accepted at {OOPSLA} (Panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "429--436", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Johnson:1993:HGP, author = "Ralph E. Johnson and Kent Beck and Grady Booch and William Cook and Richard Gabriel and Rebecca Wirfs-Brock", title = "How to get a paper accepted at {OOPSLA} (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "429--436", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deChampeaux:1993:SOO, author = "Dennis de Champeaux and Andrew J. Baer and Brian Bernsen and Alan R. Korncoff and Tim Korson and Daniel S. Tkach", title = "Strategies for object-oriented technology transfer (panel)", journal = j-SIGPLAN, volume = "28", number = "10", pages = "437--447", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1993:TI, author = "Anonymous", title = "Title index", journal = j-SIGPLAN, volume = "28", number = "10", pages = "448--448", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Anonymous:1993:AI, author = "Anonymous", title = "Author index", journal = j-SIGPLAN, volume = "28", number = "10", pages = "449--??", month = oct, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Michael:1993:BRN, author = "J. Bret Michael", title = "Book Review: {NeXTStep Programming: Step One, Object-Oriented Applications, by Simson L. Garfinkel and Michael K. Mahoney: (Springer-Verlag, New York, 1993)}", journal = j-SIGPLAN, volume = "28", number = "11", pages = "2--2", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Banning:1993:CCSb, author = "John Banning", title = "Comment on a Comment by {Shibin Hu}", journal = j-SIGPLAN, volume = "28", number = "11", pages = "3--3", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:01:54 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Hu:1993:CCK,Banning:1993:CCSb}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jones:1993:HGG, author = "Simon L. Peyton Jones and John Hughes and John Launchbury", title = "How to give a good research talk", journal = j-SIGPLAN, volume = "28", number = "11", pages = "9--12", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{PeytonJones:1993:HGG, author = "Simon L. {Peyton Jones} and John Hughes and John Launchbury", title = "How to Give a Good Research Talk", journal = j-SIGPLAN, volume = "28", number = "11", pages = "9--12", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:01:54 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Adrian:1993:MPC, author = "Frank A. Adrian", title = "A Modest Proposal Concerning Variables and Assignment Statements", journal = j-SIGPLAN, volume = "28", number = "11", pages = "13--15", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dehbonei:1993:VPB, author = "Babak Dehbonei and Fernando Mejia", title = "Verification of Proofs for the {B} Formal Development Process", journal = j-SIGPLAN, volume = "28", number = "11", pages = "16--21", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1993:CGI, author = "Henry G. Baker", title = "Complex {Gaussian} Integers for `{Gaussian} Graphics'", journal = j-SIGPLAN, volume = "28", number = "11", pages = "22--27", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deOliveiraGuimaraes:1993:PM, author = "Jos{\'e} {de Oliveira Guimar{\~a}es}", title = "Parametrized Methods", journal = j-SIGPLAN, volume = "28", number = "11", pages = "28--32", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 01 18:01:54 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Guimaraes:1993:PM, author = "Jos{\'e} de Oliveira Guimar{\~a}es", title = "Parametrized methods", journal = j-SIGPLAN, volume = "28", number = "11", pages = "28--32", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harman:1993:PFM, author = "Mark Harman and Sebastian Danicic", title = "Projecting Functional Models of Imperative Programs", journal = j-SIGPLAN, volume = "28", number = "11", pages = "33--41", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hetherington:1993:IEP, author = "Tony Hetherington", title = "An Introduction to the {Extended Pascal} Language", journal = j-SIGPLAN, volume = "28", number = "11", pages = "42--51", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiessling:1993:BP, author = "Heiko Kie{\ss}ling and Uwe Kr{\"u}ger", title = "Blocks and Procedures", journal = j-SIGPLAN, volume = "28", number = "11", pages = "52--61", month = nov, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Netzer:1993:OTR, author = "Robert H. B. Netzer", title = "Optimal tracing and replay for debugging shared-memory parallel programs", journal = j-SIGPLAN, volume = "28", number = "12", pages = "1--11", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Kimelman:1993:FTS, author = "Doug Kimelman and Dror Zernik", title = "On-the-fly topological sort --- a basis for interactive debugging and live visualization of parallel programs", journal = j-SIGPLAN, volume = "28", number = "12", pages = "12--20", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kimelman:1993:OTS, author = "Doug Kimelman and Dror Zernik", title = "On-the-fly topological sort: {A} basis for interactive debugging and live visualization of parallel programs", journal = j-SIGPLAN, volume = "28", number = "12", pages = "12--20", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Tomlinson:1993:DRG, author = "Alexander I. Tomlinson and Vijay K. Garg", title = "Detecting relational global predicates in distributed systems", journal = j-SIGPLAN, volume = "28", number = "12", pages = "21--31", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Hurfin:1993:DAS, author = "Michel Hurfin and No{\"e}l Plouzeau and Michel Raynal", title = "Detecting atomic sequences of predicates in distributed computations", journal = j-SIGPLAN, volume = "28", number = "12", pages = "32--42", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Valot:1993:CAD, author = "C{\'e}line Valot", title = "Characterizing the accuracy of distributed timestamps", journal = j-SIGPLAN, volume = "28", number = "12", pages = "43--52", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Rover:1993:MAM, author = "Diane T. Rover and Abdul Waheed", title = "Multiple-domain analysis methods", journal = j-SIGPLAN, volume = "28", number = "12", pages = "53--63", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Rover:1993:MDA, author = "Diane T. Rover and Abdul Waheed", title = "Multiple-domain analysis methods", journal = j-SIGPLAN, volume = "28", number = "12", pages = "53--63", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pancake:1993:CPP, author = "Cherri M. Pancake", title = "Customizable portrayals of program structure", journal = j-SIGPLAN, volume = "28", number = "12", pages = "64--74", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Kunz:1993:PCD, author = "Thomas Kunz", title = "Process clustering for distributed debugging", journal = j-SIGPLAN, volume = "28", number = "12", pages = "75--84", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Cuny:1993:ADS, author = "Janice E. Cuny and George Forman and Alfred Hough and Joydip Kundu and Calvin Lin and Lawrence Snyder and David W. Stemple", title = "The {Ariadne} debugger: scalable application of event-based abstraction", journal = j-SIGPLAN, volume = "28", number = "12", pages = "85--95", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{May:1993:PPE, author = "John May and Francine Berman", title = "{Panorama}: {A} portable, extensible parallel debugger", journal = j-SIGPLAN, volume = "28", number = "12", pages = "96--106", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Jun:1993:FDA, author = "Yong-Kee Jun and Kern Koh", title = "On-the-fly detection of access anomalies in nested parallel loops", journal = j-SIGPLAN, volume = "28", number = "12", pages = "107--117", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jun:1993:ODA, author = "Yong-Kee Jun and Kern Koh", title = "On-the-fly detection of access anomolies in nested parallel loops", journal = j-SIGPLAN, volume = "28", number = "12", pages = "107--117", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Damodaran-Kamal:1993:NTD, author = "Suresh K. Damodaran-Kamal and Joan M. Francioni", title = "Nondeterminancy: testing and debugging in message passing parallel programs", journal = j-SIGPLAN, volume = "28", number = "12", pages = "118--128", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Mellor-Crummey:1993:CSE, author = "John Mellor-Crummey", title = "Compile-time support for efficient data race detection in shared-memory parallel programs", journal = j-SIGPLAN, volume = "28", number = "12", pages = "129--139", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Mellor-Crummey:1993:CTS, author = "John Mellor-Crummey", title = "Compile-time support for efficient data race detection in shared-memory parallel programs", journal = j-SIGPLAN, volume = "28", number = "12", pages = "129--139", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Crovella:1993:PDU, author = "Mark E. Crovella and Thomas J. LeBlanc", title = "Performance debugging using parallel performance predicates", journal = j-SIGPLAN, volume = "28", number = "12", pages = "140--150", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Timmerman:1993:HLT, author = "M. Timmerman and Frank Gielen and P. Lambrix", title = "High level tools for the debugging of real time multiprocessor systems", journal = j-SIGPLAN, volume = "28", number = "12", pages = "151--157", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Brewer:1993:DPA, author = "Eric A. Brewer and William E. Weihl", title = "Developing parallel applications using high-performance simulation", journal = j-SIGPLAN, volume = "28", number = "12", pages = "158--168", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Pancake:1993:BPD, author = "Cherri M. Pancake and Robert H. B. Netzer", title = "A bibliography of parallel debuggers, 1993 edition", journal = j-SIGPLAN, volume = "28", number = "12", pages = "169--186", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM\slash ONR Workshop on Parallel and Distributed Debugging.", abstract = "The list of references includes technical reports, journal and conference papers, and Ph.D. dissertations dealing with parallel debuggers. No distinction is made between tools for parallel and for distributed systems, although debuggers implemented on multiprocessor or multicomputer architectures which are only capable of analyzing serial programs have been omitted. Treatments of parallel programming environments, debugging methodology, or techniques for program analysis are included when a significant portion of the publication is devoted to factors influencing the design/implementation of debugging tools.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA", classification = "C6110P (Parallel programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "17-18 June 1993", conflocation = "San Diego, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Bibliography; Distributed systems; Multicomputer architectures; Multiprocessor; Parallel debuggers; Parallel programming environments; Program analysis", thesaurus = "Parallel programming; Program debugging", } @Article{Brown:1993:SC, author = "Jeff Brown and B. Irvin and G. Forman", title = "Session 6. Chair", journal = j-SIGPLAN, volume = "28", number = "12", pages = "xvi--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Cargille:1993:OFM, author = "J. Cargille and A. Tomlinson and G. Forman and F. Gielen", title = "Open forum. Moderator, {Bart Miller}, speaker, {Pat Helland}. The users' view of debugging", journal = j-SIGPLAN, volume = "28", number = "12", pages = "xviii--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Choi:1993:SC, author = "Jong Choi and J. Lumpp and F. Gielen", title = "Session 5. Chair", journal = j-SIGPLAN, volume = "28", number = "12", pages = "xv--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Francioni:1993:SC, author = "Joan Francioni and S. Damodaran-Kamal and J. Hollingsworth and C. McDowell", title = "Session 3. Chair", journal = j-SIGPLAN, volume = "28", number = "12", pages = "ix--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Hollingsworth:1993:PVY, author = "J. Hollingsworth and S. Damodaran-Kamal and B. Irvin and J. Lumpp", title = "Program visualization: Are you drawing useful pictures?", journal = j-SIGPLAN, volume = "28", number = "12", pages = "xi--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Marzullo:1993:SC, author = "Keith Marzullo and G. Forman and J. Lumpp", title = "Session 2. Chair", journal = j-SIGPLAN, volume = "28", number = "12", pages = "viii--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Miller:1993:SC, author = "Bart Miller and F. Gielen and Suresh K. Damodaran-Kamal", title = "Session 1. Chair", journal = j-SIGPLAN, volume = "28", number = "12", pages = "vii--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Recd:1993:SC, author = "Dan Recd and A. Tomlinson and J. Cargille", title = "Session 4. Chair", journal = j-SIGPLAN, volume = "28", number = "12", pages = "xiii--??", month = dec, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 09:17:45 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "SIGPLAN Not", } @Article{Radenski:1994:MTM, author = "Atanas Radenski", title = "Module types, module variables, and their use as a universal encapsulation mechanism", journal = j-SIGPLAN, volume = "29", number = "1", pages = "3--8", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Winston-Salem State Univ., NC, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "data encapsulation; data structures; experimental language; high level languages; implementation scheme; module body; module call; module type; module variables; program compilers; prototype compiler; universal encapsulation mechanism", treatment = "P Practical", } @Article{Kokol:1994:SCP, author = "P. Kokol", title = "The self-similarity and computer programs", journal = j-SIGPLAN, volume = "29", number = "1", pages = "9--12", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6130B (Graphics techniques); C6130D (Document processing techniques)", corpsource = "Fac. of Tech. Sci., Maribor Univ., Slovenia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "computer graphics; computer programs; fractals; operators; reserved words; scientific areas; self-similarity; word processing", treatment = "P Practical", } @Article{Kokol:1994:SSC, author = "Peter Kokol", title = "The self-similarity and computer programs", journal = j-SIGPLAN, volume = "29", number = "1", pages = "9--12", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zhu:1994:CRP, author = "Ming-Yuan Zhu", title = "Computational reflection in {Power Epsilon}", journal = j-SIGPLAN, volume = "29", number = "1", pages = "13--19", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110L (Logic programming); C6140D (High level languages)", corpsource = "Beijing Inst. of Syst. Eng., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "artificial intelligence; computational reflection mechanism; extensible languages; high level languages; higher-order lambda -calculus; lambda calculus; logic programming; Power Epsilon; reflective computation; reflective programming languages", treatment = "P Practical", } @Article{Zeng:1994:EPA, author = "Li-Xin Zeng and Ming-Yuan Zhu", title = "Extending {PowerEpsilon} with algebraic rewriting", journal = j-SIGPLAN, volume = "29", number = "1", pages = "20--26", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Beijing Inst. of Syst. Eng., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algebraic rewriting mechanism; calculus of constructions; functional programming; high level languages; PowerEpsilon; rewriting systems; strongly-typed polymorphic functional programming language; type theory", treatment = "P Practical", } @Article{Kans:1994:UAP, author = "Aaron Kans and Clive Hayton", title = "Using {ABC} to prototype {VDM} specifications", journal = j-SIGPLAN, volume = "29", number = "1", pages = "27--36", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6140D (High level languages)", corpsource = "Software Eng. Res. Center, South Bank Univ., London, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ABC; BASIC; easy-to-use imperative language; formal specification; formal specifications; high level languages; rapid prototyping; software prototyping; specification language; specification languages; teaching language; VDM specifications", treatment = "P Practical", } @Article{Reiser:1994:PPP, author = "John F. Reiser and Joseph P. Skudlarek", title = "Program profiling problems, and a solution via machine language rewriting", journal = j-SIGPLAN, volume = "29", number = "1", pages = "37--45", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4210 (Formal systems); C6140B (Machine-oriented languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Mentor Graphics Corp., Wilsonville, OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "alternate profiling mechanisms; executable binary image; execution statistics; machine language rewriting; machine oriented languages; primary outputs; profile information; program diagnostics; rewriting systems; system monitoring", treatment = "P Practical", } @Article{Conway:1994:PCC, author = "Damian Conway", title = "Parsing with {C++} classes", journal = j-SIGPLAN, volume = "29", number = "1", pages = "46--52", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110J (Object-oriented programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "alternative C++ based parser generation scheme; C++ constructor functions; grammars; object-oriented languages; object-oriented methods; overloaded operators; parsing schemes; parsing schemes file; preprocessor technique; program compilers; recursive descent parsers; standard C++ source file", treatment = "P Practical", } @Article{Durst:1994:UPC, author = "Martin J. D{\"u}rst", title = "{Uniprep}: preparing a {C\slash C++} compiler for {Unicode}", journal = j-SIGPLAN, volume = "29", number = "1", pages = "53--53", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6130D (Document processing techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Multimedia Lab., Zurich Univ., Switzerland", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C/C++ compiler; C/C++ macro preprocessor; casted traditional constants; character sets; filter; language translation; macros; multilingual 16-bit character sets; program compilers; programmers; programming; Unicode; uniprep; UTF- 2; wide-character constants", treatment = "P Practical", } @Article{Alblas:1994:BPP, author = "Henk Alblas and Rieks op den Akker and Paul Oude Luttighuis and Klaas Sikkel", title = "A bibliography on parallel parsing", journal = j-SIGPLAN, volume = "29", number = "1", pages = "54--65", month = jan, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6180N (Natural language processing); C7820 (Humanities)", corpsource = "Dept. of Comput. Sci., Twente Univ., Enschede, Netherlands", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "bibliography; computer science; context-free languages; general context-free language parsing methods; high level languages; language recognition; natural language interfaces; natural language processing; natural languages; parallel algorithms; parallel compiler systems parallel compiler systems; parallel parsing; parallel programming; program compilers", treatment = "B Bibliography; P Practical", } @Article{Baker:1994:LLQ, author = "Henry G. {Baker, Jr.}", title = "A ``linear logic'' {Quicksort}", journal = j-SIGPLAN, volume = "29", number = "2", pages = "13--18", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:47 MST 2003", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110 (Systems analysis and programming); C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Nimble Comput. Corp., Encino, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "formal logic; garbage collection; linear Lisp; linear list Quicksort; linear logic Quicksort; linear programming; linear vector Quicksort; linearity checking; LISP; list processing; machine; nonlinear architectures; parallel systems; performance impact; programming; serial machine; sorting", treatment = "P Practical", } @Article{Zhu:1994:PBM, author = "Genjiang Zhu and Li Xie and Zhongxiu Sun", title = "A path-based method of parallelizing {C++} programs", journal = j-SIGPLAN, volume = "29", number = "2", pages = "19--24", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Nanjing Univ., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C++ program parallelization; compiler time; execution model; object-oriented languages; object-oriented programming; parallel programming parallel programming; path information; path-based method; roll-backs", treatment = "P Practical", } @Article{Zhang:1994:REA, author = "K. Zhang", title = "A review of exploitation of {AND}-parallelism and combined {AND\slash OR}-parallelism in logic programs", journal = j-SIGPLAN, volume = "29", number = "2", pages = "25--32", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110L (Logic programming); C6110P (Parallel programming)", corpsource = "Sch. of MPCE, Macquarie Univ., North Ryde, NSW, Australia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "AND-parallelism; combined AND/OR-parallelism; formal logic; logic programming; logic programs; OR-parallelism; parallel execution; parallel programming", treatment = "P Practical", } @Article{Zhang:1994:REP, author = "Kang Zhang", title = "A review of exploitation of {AND}-parallelism and combined {AND\slash OR-parallelism} in logic programs", journal = j-SIGPLAN, volume = "29", number = "2", pages = "25--32", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bantchev:1994:TSD, author = "Boyko B. Bantchev", title = "Terminable statements and destructive computation", journal = j-SIGPLAN, volume = "29", number = "2", pages = "33--38", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Inst. of Math., Sofia, Bulgaria", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "destructive computation; high level languages; imperative model; imperative-style programming; loop execution; programming; repetitive instruction sequence; T-sets; T-statements; terminable statements", treatment = "P Practical", } @Article{Brown:1994:NLT, author = "Bob Brown", title = "Non-linear type extensions", journal = j-SIGPLAN, volume = "29", number = "2", pages = "39--43", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Brown:1994:NTE, author = "B. Brown", title = "Nonlinear type extensions", journal = j-SIGPLAN, volume = "29", number = "2", pages = "39--43", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation); C6140D (High level languages)", corpsource = "Dept. of Computing, Hong Kong Polytech., Hong Kong", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "data structures; hierarchic type relationship; high level languages; language facility; nonlinear type extensions; programming language Oberon; type extension facility; type theory", treatment = "P Practical", } @Article{Berman:1994:DSE, author = "A. Michael Berman", title = "Does {Scheme} enhance an introductory programming course?: some preliminary empirical results", journal = j-SIGPLAN, volume = "29", number = "2", pages = "44--48", month = feb, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0220 (Education and training); C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Rowan Coll. of New Jersey, Glassboro, NJ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "best first language; computer science; computer science education; educational courses; introductory programming course; LISP; Lisp dialect; pre-major courses; programming; programming language; Scheme; structured BASIC; student attitudes; student interest", treatment = "P Practical; X Experimental", } @Article{Black:1994:FOO, author = "Andrew Black and Jens Palsberg", title = "Foundations of object-oriented languages", journal = j-SIGPLAN, volume = "29", number = "3", pages = "3--11", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuen:1994:PMC, author = "C. K. Yuen and M. D. Feng", title = "Parallel multiplication: a case study in parallel programming", journal = j-SIGPLAN, volume = "29", number = "3", pages = "12--17", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C7310 (Mathematics)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "AND/OR parallel problems; bottom up design method; mathematics computing; parallel multiplication; parallel program; parallel programming; performance evaluation; program structure design; speculative processing; systems analysis; top down design method; tuplespace", treatment = "P Practical", } @Article{Srinivasan:1994:CLA, author = "S. Srinivasan", title = "A critical look at some {Ada} features", journal = j-SIGPLAN, volume = "29", number = "3", pages = "18--22", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0220 (Education and training); C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Dept. of Comput. Inf. Syst., Louisville Univ., KY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "academic community; Ada; Ada courses; Ada features; C; Computer Science curricula; computer science education; data structure concepts; language definition inconsistency; Pascal; programming; programming language education; teaching", treatment = "P Practical", } @Article{Srinivasan:1994:CLS, author = "S. Srinivasan", title = "A critical look at some {Ada} features", journal = j-SIGPLAN, volume = "29", number = "3", pages = "18--22", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuen:1994:PPL, author = "C. K. Yuen", title = "Programming the premature loop exit: from functional to navigational", journal = j-SIGPLAN, volume = "29", number = "3", pages = "23--27", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Singapore", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "array; functional; Lisp; LISP; LISP listings; list processing; navigational; Pascal; Pascal listings; premature loop exit programming; program structuring; programming; simple programming problem", treatment = "P Practical", } @Article{Sakharov:1994:PCAa, author = "Alexander Sakharov", title = "Propagation of {Constants} and {Assertions}", journal = j-SIGPLAN, volume = "29", number = "3", pages = "28--32", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "Motorola Inc., Rolling Meadows, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "assertion propagation; constant propagation; control flow redirection; data flow analysis frameworks; data flow analysis time calculation; program compilers; programming; programming theory; unreachable code deletion", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Rizzo:1994:UPC, author = "Michael Rizzo", title = "Using producer and consumer manipulators to extend stream {I/O} formatting in {C++}", journal = j-SIGPLAN, volume = "29", number = "3", pages = "33--35", month = mar, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150J (Operating systems)", corpsource = "Comput. Lab., Kent Univ., Canterbury, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C++ I/O stream package; consumer manipulators; formatting state; high level languages; input-output programs; parameterised manipulators; programming; simple parsing; stream I/O formatting; stream input; stream manipulators", treatment = "P Practical", } @Article{Anjaneyulu:1994:BAP, author = "K. S. R. Anjaneyulu", title = "Bug analysis of {Pascal} programs", journal = j-SIGPLAN, volume = "29", number = "4", pages = "15--22", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0220 (Education and training); C6110 (Systems analysis and programming); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Nat. Center for Software Technol., Bombay, India", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "computer science education; Pascal; Pascal program bug analysis; program debugging; programming; programming education; programming problem solutions; programming teaching", treatment = "P Practical", } @Article{Frost:1994:UMA, author = "R. A. Frost", title = "Using memoization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers", journal = j-SIGPLAN, volume = "29", number = "4", pages = "23--30", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6110B (Software engineering techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Sch. of Comput. Sci., Windsor Univ., Ont., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "computational complexity; formal specification; functional programming; functional programming languages; grammars; Haskell; high level languages; LML; memoization; Miranda; mutable object; nondeterministic top-down executable specifications; nondeterministic top-down parsers; polynomial complexity; program compilers; programming theory; purely functional executable specifications; reasoning; referential transparency; simple top-down backtracking parser; top-down backtracking parsers", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Dekeyser:1994:GDL, author = "J.-L. Dekeyser and D. Lazure and P. Marquet", title = "A geometrical data-parallel language", journal = j-SIGPLAN, volume = "29", number = "4", pages = "31--40", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6140D (High level languages)", corpsource = "Lab. d'Inf. Fondamentale, Univ. des Sci. et Tech. de Lille Flandres Artois, Villeneuve d'Ascq, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithm development; C-HELP; cartesian reference space; compilation-oriented concept; computation semantics; data manipulation; data-parallel program; data-parallel programming model; explicit data-parallel languages; geometrical data-parallel language; geometrical migrations; HELP project; hyper-space notion; multidimensional virtual array; object access; object multidimensional virtual array; parallel algorithms; parallel languages; parallel programming; programming model; vector description; visual languages", treatment = "P Practical", } @Article{Dekeyser:1994:GDP, author = "Jean-Luc Dekeyser and Dominique Lazure and Philippe Marquet", title = "A geometrical data-parallel language", journal = j-SIGPLAN, volume = "29", number = "4", pages = "31--40", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Loeliger:1994:DIO, author = "Jon Loeliger and R. Metzger", title = "Developing an interprocedural optimizing compiler", journal = j-SIGPLAN, volume = "29", number = "4", pages = "41--48", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6150C (Compilers, interpreters and other processors); C6180 (User interfaces)", corpsource = "CONVEX Comput. Corp., Richardson, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Application Compiler; C compiler; C language; compiler development; CONVEX Computer Corporation; FORTRAN; FORTRAN compiler; interprocedural analysis; interprocedural optimizing compiler; language-independent interprocedural optimizer; optimisation; procedure processing; program compilers; software engineering; system architecture; system compiler; user feedback; user interfaces", treatment = "P Practical", } @Article{Meek:1994:PLT, author = "Brian L. Meek", title = "Programming languages: towards greater commonality", journal = j-SIGPLAN, volume = "29", number = "4", pages = "49--57", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140 (Programming languages)", corpsource = "Comput. Centre, King's Coll., London, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cross-language standardisation; JTC1; language independent arithmetic; language independent calling; language independent datatypes; language independent procedure calling; language independent standards; language standardisation; OSI; programming; programming guidelines; programming languages; programming languages commonality; programming languages differences; remote procedure calling; remote procedure calls; SC22; standardisation; standards; subcommittee; working group", treatment = "G General Review", } @Article{Baker:1994:TGC, author = "Henry G. Baker", title = "Thermodynamics and garbage collection", journal = j-SIGPLAN, volume = "29", number = "4", pages = "58--63", month = apr, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:49 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C6120 (File organisation)", corpsource = "Nimble Comput. Corp., Encino, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cooling; garbage collection; GC copying; locality of reference; lowest energy concept; lowest energy level; Maxwell--Boltzmann distribution; simulated annealing; statistical mechanics; statistical thermodynamics; storage allocation; storage management; storage management problems; temperature concept", treatment = "P Practical", } @Article{Sakharov:1994:PCAb, author = "Alexander Sakharov", title = "Propagation of constants and assertions", journal = j-SIGPLAN, volume = "29", number = "5", pages = "3--6, 6", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Motorola Inc., Rolling Meadows, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "assertion assignments; assertion propagation; conditional branches; constant propagation; data flow analysis; deletion of assignments; equalities; high level languages; program assignments; program compilers; programming theory; redirection of control flow", treatment = "T Theoretical or Mathematical", } @Article{Cisneros:1994:CR, author = "Gerardo Cisneros", title = "Configurable {REC}", journal = j-SIGPLAN, volume = "29", number = "5", pages = "7--16", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Direccion de Computo para la Investigacion, Univ. Nacional Autonoma de Mexico, Mexico City, Mexico", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C functions; C language; C program; compiler; Configurable REC; CREC; program; program compilers; REC operators; REC predicates; REC programs; software reusability; subroutines; user interface", treatment = "P Practical", } @Article{Andersen:1994:GFG, author = "Birger Andersen", title = "A general, fine-grained, machine independent, object-oriented language", journal = j-SIGPLAN, volume = "29", number = "5", pages = "17--26", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Andersen:1994:GFM, author = "B. Andersen", title = "A general, fine-grained, machine independent, object-oriented language", journal = j-SIGPLAN, volume = "29", number = "5", pages = "17--26", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Kaiserslautern Univ., Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstraction; code reuse; Ellie; fine-grained; general-purpose; machine independent; object-oriented language; object-oriented languages; parallel language; parallel languages; parallel mesh transputer network; parallel programming; parallelism", treatment = "P Practical", } @Article{Burson:1994:CC, author = "Scott L. Burson", title = "Continuations without copying", journal = j-SIGPLAN, volume = "29", number = "5", pages = "27--30", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "Blue Space Found., Santa Cruz, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "capture; continuation frames; first-class continuations; heap; invocation; program compilers; Scheme; stack pop; stack-oriented languages; stack-wise deallocation", treatment = "T Theoretical or Mathematical", } @Article{Sharafuddin:1994:PLD, author = "Ahsan J. Sharafuddin and Nathan Ida and James E. Grover", title = "Passing large dynamic objects out of function frame boundaries: the temporary linked list method", journal = j-SIGPLAN, volume = "29", number = "5", pages = "31--36", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Dept. of Electr. Eng., Akron Univ., OH, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C++; C++ linked list method; data structures; function frame boundaries; large dynamic objects; list processing; memory-leak; object-oriented programming; passing objects; temporary linked list method", treatment = "P Practical", } @Article{Zivkova:1994:ETO, author = "Emilia Zivkova", title = "Experience in teaching object-oriented programming with {C++}", journal = j-SIGPLAN, volume = "29", number = "5", pages = "37--40", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0220 (Education and training); C6140D (High level languages)C6110J (Object-oriented programming)", corpsource = "Fac. of Math. and Inf., Sofia Univ., Bulgaria", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C++ programming language; computer science education; derived classes; educational courses; inheritance; object-oriented languages; object-oriented programming; polymorphism; teaching; virtual functions", treatment = "P Practical", } @Article{Manwu:1994:ALN, author = "Xu Manwu and Lu Jianfeng and Zeng Fancong and Dai Jingwen", title = "Agent language {NUML} and its reduction implementation model based on {HO$\pi$}", journal = j-SIGPLAN, volume = "29", number = "5", pages = "41--48", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1994:ALN, author = "Manwu Xu and Jianfeng Lu and Fancong Zeng and Jingwen Dai", title = "Agent language {NUML} and its reduction implementation model based on {HO} pi", journal = j-SIGPLAN, volume = "29", number = "5", pages = "41--48", month = may, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150N (Distributed systems); C6170 (Expert systems)", corpsource = "Dept. of Comput. Sci., Nanjing Univ., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "agent language NUML; computation model; concurrency; cooperative systems; DAI; distributed artificial intelligence; distributed processing; formal languages; higher-order x-calculus; HO pi; lambda calculus; reduction implementation model; semantics", treatment = "T Theoretical or Mathematical", } @Article{Sabry:1994:CPU, author = "Amr Sabry and Matthias Felleisen", title = "Is Continuation-Passing Useful for Data Flow Analysis?", journal = j-SIGPLAN, volume = "29", number = "6", pages = "1--12", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178244", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p1-sabry/", abstract = "The widespread use of the continuation-passing style (CPS) transformation in compilers, optimizers, abstract interpreters, and partial evaluators reflects a common belief that the transformation has a positive effect on the analysis of programs. Investigations by Nielson [13] and Burn/Filho [5,6] support, to some degree, this belief with theoretical results. However, they do not pinpoint the source of increased abstract information and do not explain the observation of many people that continuation-passing confuses some conventional data flow analyses. To study the impact of the CPS transformation on program analysis, we derive three canonical data flow analyzers for the core of an applicative higher-order programming language. The first analyzer is based on a direct semantics of the language, the second on a continuation-semantics of the language, and the last on the direct semantics of CPS terms. All analyzers compute the control flow graph of the source program and hence our results apply to a large class of data flow analyses. A comparison of the information gathered by our analyzers establishes the following points: 1. The results of a direct analysis of a source program are {\em incomparable\/} to the results of an analysis of the equivalent CPS program. In other words, the translation of the source program to a CPS version may increase or decrease static information. The gain of information occurs in non-distributive analyses and is solely due to the {\em duplication\/} of the analysis of the continuation. The loss of information is due to the confusion of distinct procedure returns. 2. The analyzer based on the continuation semantics produces more accurate results than both direct analyzers, but again only in non-distributive analyses due to the {\em duplication\/} of continuations along every execution path. However, when the analyzer explicitly accounts for looping constructs, the results of the semantic-CPS analysis are no longer computable. In view of these results, we argue that, in practice, a direct data flow analysis that relies on some amount of duplication would be as satisfactory as a CPS analysis.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; applicative higher-order programming language; canonical data flow analyzers; continuation-passing style; continuation-semantics; data flow analysis; design; direct semantics; languages; program compilers; program testing; systems analysis", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", treatment = "T Theoretical or Mathematical", } @Article{Appel:1994:SCS, author = "Andrew W. Appel and David B. MacQueen", title = "Separate Compilation for {Standard ML}", journal = j-SIGPLAN, volume = "29", number = "6", pages = "13--23", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178245", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p13-appel/", abstract = "Languages that support abstraction and modular structure, such as Standard ML, Modula, Ada, and (more or less) C++, may have deeply nested dependency hierarchies among source files. In ML the problem is particularly severe because ML's powerful parameterized module (functor) facility entails dependencies among implementation modules, not just among interfaces. To efficiently compile individual modules in such languages, it is useful (in ML, necessary) to infer, digest, and cache the static environment resulting from the compilation of each module. Our system provides a simple model of compilation and linkage that supports incremental recompilation (a restricted form of separate compilation) with type-safe linkage. This model is made available to user programs in the form of a set of internal compiler modules, a feature that we call the ``visible compiler''. The chief client of this interface is the IRM incremental recompilation manager from CMU.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Princeton Univ., NJ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstraction; Ada; algorithms; C++; cache; CMU; compilation; compile; deeply nested dependency hierarchies; design; environment; high level languages; incremental recompilation; incremental recompilation manager; internal compiler modules; IRM; languages; Modula; modular structure; parameterized module; program compilers; programming; source files; Standard ML; static environment; type-safe linkage; user programs; visible compiler", sponsororg = "ACM", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Modules, packages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", treatment = "P Practical", } @Article{Launchbury:1994:LFS, author = "John Launchbury and Simon L. {Peyton Jones}", title = "Lazy Functional State Threads", journal = j-SIGPLAN, volume = "29", number = "6", pages = "24--35", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178246", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p24-launchbury/", abstract = "Some algorithms make critical internal use of updatable state, even though their external specification is purely functional. Based on earlier work on monads, we present a way of securely encapsulating stateful computations that manipulate multiple, named, mutable objects, in the context of a non-strict, purely-functional language. The security of the encapsulation is assured by the type system, using parametricity. Intriguingly, this parametricity requires the provision of a (single) constant with a rank-2 polymorphic type.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6140D (High level languages)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Glasgow Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; encapsulation; external specification; functional language; functional programming; high level languages; languages; lazy functional state threads; monads; mutable objects; nonstrict purely-functional language; parametricity; rank-2 polymorphic type; security; specification; stateful computations; type system; type theory; updatable state", sponsororg = "ACM", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Ebcioglu:1994:VCT, author = "Kemal Ebcio{\u{g}}lu and Randy D. Groves and Ki-Chang Kim and Gabriel M. Silberman and Isaac Ziv", title = "{VLIW} Compilation Techniques in a Superscalar Environment", journal = j-SIGPLAN, volume = "29", number = "6", pages = "36--48", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178247", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p36-ebcioglu/", abstract = "We describe techniques for converting the intermediate code representation of a given program, as generated by a modern compiler, to another representation which produces the same run-time results, but can run faster on a superscalar machine. The algorithms, based on novel parallelization techniques for {\em Very Long Instruction Word (VLIW)\/} architectures, find and place together independently executable operations that may be far apart in the original code. i.e., they may be separated by many conditional branches or belong to different iterations of a loop. As a result, the functional units in the superscalar are presented with more work that can proceed in parallel, thus achieving higher performance than the approach of using hardware instruction dispatch techniques alone. While general scheduling techniques improve performance by removing idle pipeline cycles, to further improve performance on a superscalar with only a few functional units requires a reduction in the pathlength. We have designed a set of new algorithms for reducing pathlength and removing stalls due to branches, namely speculative load-store motion out of loops, unspeculation, limited combining, basic block expansion, and prolog tailoring. These algorithms were implemented in a prototype version of the IBM RS/6000 xlc compiler and have shown significant improvement in SPEC integer benchmarks on the IBM POWER machines. Also, we describe a new technique to obtain profiling information with low overhead, and some applications of profiling directed feedback, including scheduling heuristics, code reordering and branch reversal.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6140B (Machine-oriented languages); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; basic block expansion; compiler; compiler optimizations; executable operations; experimentation; global scheduling; hardware instruction dispatch techniques; IBM POWER machines; IBM RS/6000; idle pipeline cycles; instruction sets; intermediate code representation; limited combining; novel parallelization techniques; parallel algorithms; parallel programming; pathlength; performance; performance evaluation; profiling directed feedback; profiling information; program compilers; Prolog tailoring; reduced instruction set computing; reduced performance evaluation; run-time results; scheduling; scheduling techniques; software pipelining; SPEC integer benchmarks; speculative load-store motion; superscalar environment; superscalar machine; superscalars; unspeculation; very long instruction word architecture; VLIW; VLIW compilation techniques", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.1.0} Computer Systems Organization, PROCESSOR ARCHITECTURES, General. {\bf C.5.1} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Large and Medium (``Mainframe'') Computers, IBM RS/6000.", treatment = "P Practical", } @Article{Srivastava:1994:LTO, author = "Amitabh Srivastava and David W. Wall", title = "Link-time optimization of address calculation on a 64--bit architecture", journal = j-SIGPLAN, volume = "29", number = "6", pages = "49--60", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178248", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p49-srivastava/", abstract = "Compilers for new machines with 64-bit addresses must generate code that works when the memory used by the program is large. Procedures and global variables are accessed indirectly via {\em global address tables\/}, and calling conventions include code to establish the addressability of the appropriate tables. In the common case of a program that does {\em not\/} require a lot of memory, all of this can be simplified considerably, with a corresponding reduction in program size and execution time. We have used our link-time code modification system OM to perform program transformations related to global address use on the Alpha AXP. Though simple, many of these are{\em whole-program\/} optimizations that can be done only when we can see the entire program at once, so link-time is an ideal occasion to perform them. This paper describes the optimizations performed and shows their effects on program size and performance. Relatively modest transformations, possible without moving code, improve the performance of SPEC benchmarks by an average of 1.5\%. More ambitious transformations, requiring an understanding of program structure that is thorough but not difficult at link-time, can do even better, reducing program size by 10\% or more, and improving performance by an average of 3.8\%. Even a program compiled monolithically with interprocedural optimization can benefit nearly as much from this technique, if it contains statically-linked pre-compiled library code. When the benchmark sources were compiled in this way, we were still able to improve their performance by 1.35\% with the modest transformations and 3.4\% with the ambitious transformations.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Western Res. Lab., Digital Equipment Corp., Palo Alto, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "64 bit; 64-bit architecture; address calculation; Alpha AXP; benchmark sources; compilers; execution time; global address tables; global variables; interprocedural optimization; languages; link-time; link-time code modification system; link-time optimization; measurement; optimisation; performance; performance evaluation; program compilers; program size; program transformations; programming; reduced instruction set computing; SPEC benchmarks; statically-linked pre-compiled interprocedural optimization; statically-linked pre-compiled library code; whole-program optimizations", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", treatment = "P Practical", } @Article{Granlund:1994:DII, author = "Torbj{\"o}rn Granlund and Peter L. Montgomery", title = "Division by Invariant Integers using Multiplication", journal = j-SIGPLAN, volume = "29", number = "6", pages = "61--72", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178249", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "ftp://ftp.cwi.nl/pub/pmontgom/divcnst.psa4.gz; ftp://ftp.cwi.nl/pub/pmontgom/divcnst.psl.gz; http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p61-granlund/", abstract = "Integer division remains expensive on today's processors as the cost of integer multiplication declines. We present code sequences for division by arbitrary nonzero integer constants and run-time invariants using integer multiplication. The algorithms assume a two's complement architecture. Most also require that the upper half of an integer product be quickly accessible. We treat unsigned division, signed division where the quotient rounds towards zero, signed division where the quotient rounds towards $-\infty$, and division where the result is known a priori to be exact. We give some implementation results using the C compiler GCC.", acknowledgement = ack-nhfb, affiliation = "Cygnus Support, Mountain View, CA, USA", annote = "Published as part of the Proceedings of PLDI'94.", classification = "C5230 (Digital arithmetic methods); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", confdate = "20-24 June 1994", conflocation = "Orlando, FL, USA; 20-24 June 1994", confsponsor = "ACM", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Cygnus Support, Mountain View, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; arbitrary nonzero integer constants; Arbitrary nonzero integer constants; arbitrary nonzero integer constants; C compiler; Code sequences; code sequences; Code sequences; code sequences; digital arithmetic; floating point arithmetic; Floating point arithmetic; floating point arithmetic; GCC; Integer division; integer division; Integer division; integer division; Integer multiplication; integer multiplication; Integer multiplication; integer multiplication; Invariant integers; invariant integers; Invariant integers; invariant integers; mathematics computing; multiplication; Multiplication; multiplication; performance; program; program compilers; programming; reduced instruction set computing; RISC processors; run-time invariants; Run-time invariants; run-time invariants; signed division; Signed division; signed division; two's complement architecture; Two's complement architecture; two's complement architecture; unsigned division; Unsigned division; unsigned division", sponsororg = "ACM", subject = "{\bf G.1.0} Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", thesaurus = "Digital arithmetic; Mathematics computing; Program compilers; Programming; Reduced instruction set computing", treatment = "T Theoretical or Mathematical", } @Article{Wang:1994:PCT, author = "Ko-Yang Wang", title = "Precise Compile-Time Performance Prediction for Superscalar-Based Computers", journal = j-SIGPLAN, volume = "29", number = "6", pages = "73--84", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178250", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p73-wang/", abstract = "Optimizing compilers (particularly parallel compilers) are constrained by their ability to predict performance consequences of the transformations they apply. Many factors, such as unknowns in control structures, dynamic behavior of programs, and complexity of the underlying hardware, make it very difficult for compilers to estimate the performance of the transformations accurately and efficiently. In this paper, we present a performance prediction framework that combines several innovative approaches to solve this problem. First, the framework employs a detailed, architecture-specific, but portable, cost model that can be used to estimate the cost of straight line code efficiently. Second, aggregated costs of loops and conditional statements are computed and represented symbolically. This avoids unnecessary, premature guesses and preserves the precision of the prediction. Third, symbolic comparison allows compilers to choose the best transformation dynamically and systematically. Some methodologies for applying the framework to optimizing parallel compilers to support automatic, performance-guided program restructuring are discussed.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1180 (Optimisation techniques); C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "architecture-specific; compile-time performance prediction; complexity; control structures; cost model; dynamic behavior; languages; optimisation; optimizing compilers; parallel compiler optimisation; parallel compilers; parallel machines; parallel programming; performance; performance evaluation; performance prediction framework; performance-comparison; performance-guided program restructuring; premature guesses; program compilers; software cost estimation; straight line code cost; superscalar-based computers; symbolic comparison", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.5.1} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Large and Medium (``Mainframe'') Computers, IBM RS/6000. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Wagner:1994:ASE, author = "Tim A. Wagner and Vance Maverick and Susan L. Graham and Michael A. Harrison", title = "Accurate Static Estimators for Program Optimization", journal = j-SIGPLAN, volume = "29", number = "6", pages = "85--96", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178251", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p85-wagner/", abstract = "Determining the relative execution frequency of program regions is essential for many important optimization techniques, including register allocation, function inlining, and instruction scheduling. Estimates derived from profiling with sample inputs are generally regarded as the most accurate source of this information; static (compile-time) estimates are considered to be distinctly inferior. If static estimates were shown to be competitive, however, their convenience would outweigh minor gains from profiling, and they would provide a sound basis for optimization when profiling is impossible. We use quantitative metrics to compare estimates from static analysis to those derived from profiles. For C programs, simple techniques for predicting branches and loop counts suffice to estimate intraprocedural frequency patterns with high accuracy. To determine inter-procedural estimates successfully, we combine function-level information with a Markov model of control flow over the call graph to produce arc and basic block frequency estimates for the entire program. For a suite of 14 programs, including the C programs from the SPEC92 benchmark suite, we demonstrate that static estimates are competitive with those derived from profiles. Using simple heuristics, we can determine the most frequently executed blocks in each function with 81\% accuracy. With the Markov model, we identify 80\% of the frequently called functions. Combining the two techniques, we identify 76\% of the most frequently executed call sites.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; branches; C programs; call graph; control flow; execution frequency; experimentation; function frequency; function inlining; function-level information; heuristics; instruction scheduling; intra-procedural frequency patterns; languages; loop counts; Markov model; Markov processes; optimisation; performance; profiling; program compilers; program optimization; program regions; programming; programming theory; quantitative metrics; register allocation; software metrics; SPEC92 benchmark suite; static analysis; static compile-time estimates; static estimators", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\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.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures.", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Krall:1994:ISS, author = "Andreas Krall", title = "Improving Semi-static Branch Prediction by Code Replication", journal = j-SIGPLAN, volume = "29", number = "6", pages = "97--106", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178252", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p97-krall/", abstract = "Speculative execution on superscalar processors demands substantially better branch prediction than what has been previously available. In this paper we present code replication techniques that improve the accuracy of semi-static branch prediction to a level comparable to dynamic branch prediction schemes. Our technique uses profiling to collect information about the correlation between different branches and about the correlation between the subsequent outcomes of a single branch. Using this information and code replication the outcome of branches is represented in the program state. Our experiments have shown that the misprediction rate can almost be halved while the code size is increased by one third.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1180 (Optimisation techniques); C4240 (Programming and algorithm theory); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Inst. fur Computersprachen, Tech. Univ. Wien, Austria", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; branch prediction; code replication; code size; dynamic branch prediction scheme; measurement; misprediction rate; optimisation; parallel programming; performance; profiling; program compilers; program state; programming theory; semistatic branch prediction; speculative execution; superscalar processors", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\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.", treatment = "T Theoretical or Mathematical", } @Article{vonHanxleden:1994:GTB, author = "Reinhard {von Hanxleden} and Ken Kennedy", title = "{{\tt GIVE-N-TAKE}} --- a balanced code placement framework", journal = j-SIGPLAN, volume = "29", number = "6", pages = "107--120", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178253", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p107-von_hanxleden/", abstract = "GIVE-N-TAKE is a code placement framework which uses a general producer-consumer concept. An advantage of GIVE-N-TAKE over existing partial redundancy elimination techniques is its concept of production {\em regions\/}, instead of single locations, which can be beneficial for general latency hiding. GIVE-N-TAKE guaranteed {\em balanced\/} production, that is, each production will be started and stopped once. The framework can also take advantage of production coming ``for free,'' as induced by side effects, without disturbing balance. GIVE-N-TAKE can place production either before or after consumption, and it also provides the option to hoist code out of potentially zero-trip loop (nest) constructs. GIVE-N-TAKE uses a fast elimination method based on Tarjan intervals, with a complexity linear in the program size in most cases. We have implemented GIVE-N-TAKE as part of a Fortran D compiler prototype, where it solves various communication generation problems associated with compiling data-parallel languages onto distributed-memory architectures.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Center for Res. on Parallel Comput., Rice Univ., Houston, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; balanced code placement framework; communication generation problems; complexity; computational complexity; data-parallel languages; distributed memory systems; distributed-memory architectures; fast elimination method; FORTRAN; Fortran D compiler; general producer-consumer concept; GIVE-N-TAKE; languages; latency hiding; parallel languages; partial redundancy elimination techniques; performance; production regions; program compilers; redundancy; redundancy FORTRAN; Tarjan intervals; zero-trip loop constructs", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN.", treatment = "P Practical", } @Article{Pugh:1994:CSP, author = "William Pugh", title = "Counting Solutions to {Presburger} Formulas: How and Why", journal = j-SIGPLAN, volume = "29", number = "6", pages = "121--134", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178254", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p121-pugh/", abstract = "We describe methods that are able to count the number of integer solutions to selected free variables of a Presburger formula, or sum a polynomial over all integer solutions of selected free variables of a Presburger formula. This answer is given symbolically, in terms of symbolic constants (the remaining free variables in the Presburger formula). For example, we can create a Presburger formula who's solutions correspond to the iterations of a loop. By counting these, we obtain an estimate of the execution time of the loop. In more complicated applications, we can create Presburger formulas who's solutions correspond to the distinct memory locations or cache lines touched by a loop, the flops executed by a loop, or the array elements that need to be communicated at a particular point in a distributed computation. By counting the number of solutions, we can evaluate the computation/memory balance of a computation, determine if a loop is load balanced and evaluate message traffic and allocate message buffers.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240P (Parallel programming and algorithm theory); C6120 (File organisation)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; buffer storage; cache lines; computational complexity; counting solutions; distinct memory locations; distributed algorithms; distributed computation; distributed distinct memory locations; integer solutions; message buffers; message traffic; Presburger formulas; storage allocation; theory; verification", sponsororg = "ACM", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices.", treatment = "T Theoretical or Mathematical", } @Article{Fisher:1994:PCS, author = "Allan L. Fisher and Anwar Mohammed Ghuloum", title = "Parallelizing complex scans and reductions", journal = j-SIGPLAN, volume = "29", number = "6", pages = "135--146", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178255", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p135-fisher/", abstract = "We present a method for automatically extracting parallel prefix programs from sequential loops, even in the presence of complicated conditional statements. Rather than searching for associative operators in the loop body directly, the method rests on the observation that functional composition itself is associative. Accordingly, we model the loop body as a multivalued function of multiple parameters, and look for a closed-form representation of arbitrary compositions of loop body instances. Careful analysis of conditionals allows this search to succeed in cases where existing automatic methods fail. The method has been implemented and used to generate code for the iWarp parallel computer.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; complex scans; computational complexity; conditional statements; functional composition; iWarp parallel computer; multivalued function; parallel prefix programs; parallel programming; performance; program; program compilers; programming theory; reductions; sequential loops", sponsororg = "ACM", 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, Trees. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Knoop:1994:PDC, author = "Jens Knoop and Oliver R{\"u}thing and Bernhard Steffen", title = "Partial Dead Code Elimination", journal = j-SIGPLAN, volume = "29", number = "6", pages = "147--158", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178256", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p147-knoop/", abstract = "A new aggressive algorithm for the elimination of partially dead code is presented, i.e., of code which is only dead on some program paths. Besides being more powerful than the usual approaches to dead code elimination, this algorithm is {\em optimal\/} in the following sense: partially dead code remaining in the resulting program cannot be eliminated without changing the branching structure or the semantics of the program, or without impairing some program executions. Our approach is based on techniques for partial redundancy elimination. Besides some new technical problems there is a significant difference here: partial dead code elimination introduces second order effects, which we overcome by means of exhaustive motion and elimination steps. The optimality and the uniqueness of the program obtained is proved by means of a new technique which is universally applicable and particularly useful in the case of mutually interdependent program optimizations.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240 (Programming and algorithm theory); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Fakultat fur Math. und Inf., Passau Univ., Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; assignment motion; bit-vector data flow analyses; branching structure; code motion; data flow analyses; data flow analyses program optimization; data flow analysis; dead code elimination; design; mutually interdependent program optimizations; partial dead code elimination; partial redundancy elimination; performance; program compilers; program executions; program optimization; programming theory; redundancy; semantics", sponsororg = "ACM", 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. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", treatment = "T Theoretical or Mathematical", } @Article{Briggs:1994:EPR, author = "Preston Briggs and Keith D. Cooper", title = "Effective Partial Redundancy Elimination", journal = j-SIGPLAN, volume = "29", number = "6", pages = "159--170", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178257", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p159-briggs/", abstract = "Partial redundancy elimination is a code optimization with a long history of literature and implementation. In practice, its effectiveness depends on issues of naming and code shape. This paper shows that a combination of {\em global reassociation\/} and {\em global value numbering\/} can increase the effectiveness of partial redundancy elimination. By imposing a discipline on the choice of names and the shape of expressions, we are able to expose more redundancies. As part of the work, we introduce a new algorithm for global reassociation of expressions. It uses global information to reorder expressions, creating opportunities for other optimizations. The new algorithm generalizes earlier work (R. G. Scarborough and H. G. Kolsky, IBM J. of Res. and Dev., pp. 660-676, Nov. 1980) that ordered FORTRAN array address expressions to improve optimization.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1180 (Optimisation techniques); C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "20-24 June 1994", conflocation = "Orlando, FL, USA; 20-24 June 1994", confsponsor = "ACM", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Code optimization; code optimization; Code shape; code shape; experimentation; Expression reordering; expression reordering; Expression shape; expression shape; FORTRAN; FORTRAN array address expressions; Global reassociation; global reassociation; Global value numbering; global value numbering; languages; Naming; naming; optimisation; Partial redundancy elimination; partial redundancy elimination; program compilers; programming; redundancy", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", thesaurus = "FORTRAN; Optimisation; Program compilers; Programming; Redundancy", treatment = "P Practical", } @Article{Johnson:1994:PST, author = "Richard Johnson and David Pearson and Keshav Pingali", title = "The Program Structure Tree: Computing Control Regions in Linear Time", journal = j-SIGPLAN, volume = "29", number = "6", pages = "171--185", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178258", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p171-johnson/", abstract = "In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flow graph. We give a linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones). Next, we establish a connection between SESE regions and control dependence equivalence classes, and show how to use the algorithm to find control regions in linear time. Finally, we discuss some applications of the PST. Many control flow algorithms, such as construction of Static Single Assignment form, can be speeded up by applying the algorithms in a divide-and-conquer style to each SESE region on its own. The PST is also used to speed up data flow analysis by exploiting ``sparsity''. Experimental results from the Perfect Club and SPEC89 benchmarks confirm that the PST approach finds and exploits program structure.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; computational complexity; control dependence equivalence classes; control flow graph; control regions computation; data flow analysis; directed graphs; divide-and-conquer style; equivalence classes; hierarchical representation; irreducible graphs; linear; linear time computation; Perfect Club benchmarks; performance; performance evaluation; program diagnostics; program structure tree; programming theory; single-entry, single-exit regions; sparsity; SPEC89 benchmarks; static single assignment form; theory; tree data structures", sponsororg = "ACM", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\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.", treatment = "P Practical; T Theoretical or Mathematical; X Experimental", } @Article{Davidson:1994:MAC, author = "Jack W. Davidson and Sanjay Jinturkar", title = "Memory Access Coalescing: {A} Technique for Eliminating Redundant Memory Accesses", journal = j-SIGPLAN, volume = "29", number = "6", pages = "186--195", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178259", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p186-davidson/", abstract = "As microprocessor speeds increase, memory bandwidth is increasingly the performance bottleneck for microprocessors. This has occurred because innovation and technological improvements in processor design have outpaced advances in memory design. Most attempts at addressing this problem have involved hardware solutions. Unfortunately, these solutions do little to help the situation with respect to current microprocessors. In previous work, we developed, implemented, and evaluated an algorithm that exploited the ability of newer machines with wide-buses to load/store multiple floating-point operands in a single memory reference. This paper describes a general code improvement algorithm that transforms code to better exploit the available memory bandwidth on existing microprocessors as well as wide-bus machines. Where possible and advantageous, the algorithm coalesces narrow memory references into wide ones. An interesting characteristic of the algorithm is that some decisions about the applicability of the transformation are made at run time. This dynamic analysis significantly increases the probability of the transformation being applied. The code improvement transformation was implemented and added to the repertoire of code improvements of an existing retargetable optimizing back end. Using three current architectures as evaluation platforms, the effectiveness of the transformation was measured on a set of compute- and memory-intensive programs. Interestingly, the effectiveness of the transformation varied significantly with respect to the instruction-set architecture of the tested platform. For one of the tested architectures, improvements in execution speed ranging from 5 to 40 percent were observed. For another, the improvements in execution speed ranged from 5 to 20 percent, while for yet another, the transformation resulted in slower code for all programs.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C5220 (Computer architecture); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; code improvement algorithm; code transformation; computationally-intensive programs; computer architecture; design; dynamic analysis; evaluation platforms; execution speed; instruction sets; instruction-set architecture; memory access coalescing; memory bandwidth; memory-intensive programs; microprocessors; narrow memory references; performance; performance bottleneck; program interpreters; redundancy; redundant memory access; redundant memory access elimination; retargetable optimizing back end; storage management; wide-bus machines", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical; X Experimental", } @Article{Srivastava:1994:ASB, author = "Amitabh Srivastava and Alan Eustace", title = "{ATOM}: {A} System for Building Customized Program Analysis Tools", journal = j-SIGPLAN, volume = "29", number = "6", pages = "196--205", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178260", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p196-srivastava/", abstract = "ATOM (Analysis Tools with OM) is a single framework for building a wide range of customized program analysis tools. It provides the common infrastructure present in all code-instrumenting tools; this is the difficult and time-consuming part. The user simply defines the tool-specific details in instrumentation and analysis routines. Building a basic block counting tool like Pixie with ATOM requires only a page of code. ATOM, using OM link-time technology, organizes the final executable such that the application program and user's analysis routines run in the same address space. Information is directly passed from the application program to the analysis routines through simple procedure calls instead of inter-process communication or files on disk. ATOM takes care that analysis routines do not interfere with the program's execution, and precise information about the program is presented to the analysis routines at all times. ATOM uses no simulation or interpretation. ATOM has been implemented on the Alpha AXP under OSF/1. It is efficient and has been used to build a diverse set of tools for basic block counting, profiling, dynamic memory recording, instruction and data cache simulation, pipeline simulation, evaluating branch prediction, and instruction scheduling.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6115 (Programming support); C6150G (Diagnostic, testing, debugging and evaluating systems); C7430 (Computer engineering)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Western Res. Lab., Digital Equipment Corp., Palo Alto, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "address space; algorithms; Alpha AXP; analysis routines; application program; ATOM; basic block counting; code-instrumenting tools; customized program analysis tools; data cache simulation; design; dynamic memory recording; evaluating branch prediction; executable program organization; instruction scheduling; instruction simulation; intermodule code optimization; measurement; OM link-time technology; OSF/1; performance; pipeline simulation; procedure calls; profiling; program diagnostics; software tools; tool-specific detail; virtual machines", sponsororg = "ACM", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Tracing. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", treatment = "P Practical", } @Article{Reinhold:1994:CPG, author = "Mark B. Reinhold", title = "Cache Performance of Garbage-Collected Programs", journal = j-SIGPLAN, volume = "29", number = "6", pages = "206--217", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178261", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p206-reinhold/", abstract = "As processor speeds continue to improve relative to main-memory access times, cache performance is becoming an increasingly important component of program performance. Prior work on the cache performance of garbage-collected programs either argues or assumes that conventional garbage-collection methods will yield poor performance, and has therefore concentrated on new collection algorithms designed specifically to improve cache-level reference locality. This paper argues to the contrary: Many programs written in garbage-collected languages are naturally well-suited to the direct-mapped caches typically found in modern computer systems. Garbage-collected programs written in a mostly-functional style should perform well when simple linear storage allocation and an infrequently-run generational compacting collector are employed; sophisticated collectors intended to improve cache performance are unlikely to be necessary. As locality becomes ever more important to program performance, programs of this kind may turn out to have a significant performance advantage over programs written in traditional languages.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "NEC Res. Inst., Princeton, NJ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; buffer storage; cache performance; cache-level reference locality; design; direct-mapped caches; functional programming; garbage-collected languages; garbage-collected programs; high level languages; infrequently-run generational compacting collector; languages; linear storage allocation; performance; program performance; storage allocation; storage management; storage management languages", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", treatment = "P Practical", } @Article{Hummel:1994:GDD, author = "Joseph Hummel and Laurie J. Hendren and Alexandru Nicolau", title = "A General Data Dependence Test for Dynamic, Pointer-Based Data Structures", journal = j-SIGPLAN, volume = "29", number = "6", pages = "218--229", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178262", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p218-hummel/", abstract = "Optimizing compilers require accurate dependence testing to enable numerous, performance-enhancing transformations. However, data dependence testing is a difficult problem, particularly in the presence of pointers. Though existing approaches work well for pointers to named memory locations (i.e. other variables), they are overly conservative in the case of pointers to unnamed memory locations. The latter occurs in the context of dynamic, pointer-based data structures, used in a variety of applications ranging from system software to computational geometry to N-body and circuit simulations. In this paper we present a new technique for performing more accurate data dependence testing in the presence of dynamic, pointer-based data structures. We will demonstrate its effectiveness by breaking false dependences that existing approaches cannot, and provide results which show that removing these dependences enables significant parallelization of a real application.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "California Univ., Irvine, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; circuit simulations; computational geometry; data dependence testing; data structures; design; dynamic pointer-based data; dynamic pointer-based data structures; false dependences; N- body simulations; named memory locations; optimizing compilers; parallel programming; parallelization; performance-enhancing transformations; program compilers; program testing; system software; theory; unnamed memory locations; variables; verification", sponsororg = "ACM", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf E.1} Data, DATA STRUCTURES, Trees. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices.", treatment = "P Practical", } @Article{Deutsch:1994:IMA, author = "Alain Deutsch", title = "Interprocedural may-alias analysis for pointers: beyond $k$-limiting", journal = j-SIGPLAN, volume = "29", number = "6", pages = "230--241", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178263", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p230-deutsch/", abstract = "Existing methods for alias analysis of recursive pointer data structures are based on two approximation techniques: {\em k-limiting\/}, and {\em store-based\/} (or equivalently location or region-based) approximations, which blur distinction between elements of recursive data structures. Although notable progress in inter-procedural alias analysis has been recently accomplished, very little progress in the precision of analysis of recursive pointer data structures has been seen since the inception of these approximation techniques by Jones and Muchnick a decade ago. As a result, optimizing, verifying and parallelizing programs with pointers has remained difficult. We present a new parametric framework for analyzing recursive pointer data structures which can express a new natural class of alias information not accessible to existing methods. The key idea is to represent alias information by pairs of {\em symbolic access paths\/} which are qualified by symbolic descriptions of the positions for which the alias pair holds. Based on this result, we present an algorithm for interprocedural may-alias analysis with pointers which on numerous examples that occur in practice is much more precise than recently published algorithms [CWZ90, He90, LR92, CBC93].", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6120 (File organisation)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Inst. Nat. de Recherche d'Inf. et d'Autom., Le Chesnay, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; alias pair; data structures; interprocedural may-alias analysis; k-limiting; location-based approximations; parametric framework; performance; program optimization; program parallelization; program verification; recursive pointer data structures; region-based approximations; store-based approximations; sub-objects; symbolic access parallelization; symbolic access paths; symbolic descriptions", sponsororg = "ACM", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", treatment = "P Practical", } @Article{Emami:1994:CIP, author = "Maryam Emami and Rakesh Ghiya and Laurie J. Hendren", title = "Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers", journal = j-SIGPLAN, volume = "29", number = "6", pages = "242--256", month = jun, year = "1994", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p242-emami/", abstract = "This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C. The method is based on approximating the points-to relationships between accessible stack locations, and can be used to generate alias pairs, or used directly for other analyses and transformations. Our method provides context-sensitive interprocedural information based on analysis over invocation graphs that capture all calling contexts including recursive and mutually-recursive calling contexts. Furthermore, the method allows the smooth integration for handling general function pointers in C. We illustrate the effectiveness of the method with empirical results from an implementation in the McCAT optimizing/parallelizing C compiler.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "accessible stack locations; alias pairs; aliasing problem; C language; context-sensitive interprocedural points-to analysis; data structures; design; function pointers; general function pointers; invocation graphs; languages; McCAT optimizing/parallelizing C compiler; McCAT optimizing/parallelizing C compiler function pointers; mutually-recursive calling contexts; performance; program compilers; program diagnostics; smooth integration", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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 D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", treatment = "P Practical", } @Article{Emami:1994:CSI, author = "Maryam Emami and Rakesh Ghiya and Laurie J. Hendren", title = "Context-sensitive interprocedural points-to analysis in the presence of function pointers", journal = j-SIGPLAN, volume = "29", number = "6", pages = "242--256", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178264", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "This paper reports on the design, implementation, and empirical results of a new method for dealing with the aliasing problem in C. The method is based on approximating the points-to relationships between accessible stack locations, and can be used to generate alias pairs, or used directly for other analyses and transformations. Our method provides context-sensitive interprocedural information based on analysis over invocation graphs that capture all calling contexts including recursive and mutually-recursive calling contexts. Furthermore, the method allows the smooth integration for handling general function pointers in C. We illustrate the effectiveness of the method with empirical results from an implementation in the McCAT optimizing/parallelizing C compiler.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kurlander:1994:ZCR, author = "Steven M. Kurlander and Charles N. Fischer", title = "Zero-cost range splitting", journal = j-SIGPLAN, volume = "29", number = "6", pages = "257--265", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178420", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "This paper presents a new optimization technique that uses empty delay slots to improve code scheduling. We are able to split live ranges for free, by inserting spill code into empty delay slots. Splitting a live range can reduce interferences with other live ranges and can sometimes free registers. Live ranges no longer interfering with the split live range can sometimes make use of the extra register. Our algorithm, as a final pass over the code, exploits empty delay slots that would remain unused if spill code was not inserted. This paper proposes a variety of optimizations that use the extra registers generated from live range splitting, including coalescing live ranges and improving code scheduling. We present an algorithm for improving code scheduling and present implementation results.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kurlander:1994:ZRS, author = "Steven M. Kurlander and Charles N. Fischer", title = "Zero-cost Range Splitting", journal = j-SIGPLAN, volume = "29", number = "6", pages = "257--265", month = jun, year = "1994", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p257-kurlander/", abstract = "This paper presents a new optimization technique that uses empty delay slots to improve code scheduling. We are able to split live ranges for free, by inserting spill code into empty delay slots. Splitting a live range can reduce interferences with other live ranges and can sometimes free registers. Live ranges no longer interfering with the split live range can sometimes make use of the extra register. Our algorithm, as a final pass over the code, exploits empty delay slots that would remain unused if spill code was not inserted. This paper proposes a variety of optimizations that use the extra registers generated from live range splitting, including coalescing live ranges and improving code scheduling. We present an algorithm for improving code scheduling and present implementation results.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1180 (Optimisation techniques); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; code scheduling; data integrity; delays; empty delay slots; interference reduction; live ranges; optimisation; optimization technique; performance; program compilers; register freeing; scheduling; spill code; storage allocation; zero-cost range splitting", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", treatment = "P Practical", } @Article{Norris:1994:RAP, author = "Cindy Norris and Lori L. Pollock", title = "Register Allocation over the Program Dependence Graph", journal = j-SIGPLAN, volume = "29", number = "6", pages = "266--277", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178427", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p266-norris/", abstract = "This paper describes RAP, a Register Allocator that allocates registers over the Program Dependence Graph (PDG) representation of a program in a hierarchical manner. The PDG program representation has been used successfully for scalar optimizations, the detection and improvement of parallelism for vector machines, multiple processor machines, and machines that exhibit instruction level parallelism, as well as debugging, the integration of different versions of a program, and translation of imperative programs for data flow machines. By basing register allocation on the PDG, the register allocation phase may be more easily integrated and intertwined with other optimization analyses and transformations. In addition, the advantages of a hierarchical approach to global register allocation can be attained without constructing an additional structure used solely for register allocation. Our experimental results have shown that on average, code allocated registers via RAP executed 2.7\% faster than code allocated registers via a standard global register allocator.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1180 (Optimisation techniques); C6110P (Parallel programming); C6120 (File organisation)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. and Inf. Sci., Delaware Univ., Newark, DE, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; data flow machines; debugging; experimentation; global register allocation; graph theory; hierarchical approach; imperative program translation; instruction level parallelism; multiple processor machines; optimisation; optimization analyses; optimization transformations; parallel programming; parallelism; PDG program representation; performance; program dependence graph; program versions integration; RAP; register allocator; scalar optimizations; storage; storage allocation; vector machines", sponsororg = "ACM", 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 G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", treatment = "P Practical", } @Article{Wismuller:1994:DGO, author = "Roland Wism{\"u}ller", title = "Debugging of Globally Optimized Programs Using Data Flow Analysis", journal = j-SIGPLAN, volume = "29", number = "6", pages = "278--289", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178430", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p278-wismuller/", abstract = "Advanced processor and machine architectures need optimizing compilers to be efficiently programmed in high level languages. Therefore the need for source level debuggers that can handle optimized programs is rising. One difficulty in debugging optimized code arises from the problem to determine the values of source code variables. To ensure correct debugger behaviour with optimized programs, the debugger not only has to determine the variable's storage location or associated register. It must also verify that the variable is {\em current\/}, i.e. the value determined from that location is really the value that the variable would have in unoptimized code. We will deduce requirements on algorithms for currentness determination and present an algorithm meeting this requirements that is more general than previous work. We will also give first experiences with an implementation. To our knowledge this is the first implementation of a currentness determination algorithm for globally optimized code.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240P (Parallel programming and algorithm theory); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Inst. fur Inf., Tech. Univ. Munchen, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; associated register; correct debugger behaviour; currentness determination algorithm; data flow analysis; globally optimized code; globally optimized programs; high level languages; languages; machine; machine architectures; optimizing compilers; parallel algorithms; performance; program compilers; program debugging; source code variables; source level debuggers; storage location", sponsororg = "ACM", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, DEBUG. {\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. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", treatment = "P Practical", } @Article{Austin:1994:EDA, author = "Todd M. Austin and Scott E. Breach and Gurindar S. Sohi", title = "Efficient Detection of All Pointer and Array Access Errors", journal = j-SIGPLAN, volume = "29", number = "6", pages = "290--301", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178446", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p290-austin/", abstract = "We present a pointer and array access checking technique that provides complete error coverage through a simple set of program transformations. Our technique, based on an extended safe pointer representation, has a number of novel aspects. Foremost, it is the first technique that detects all spatial and temporal access errors. Its use is not limited by the expressiveness of the language; that is, it can be applied successfully to compiled or interpreted languages with subscripted and mutable pointers, local references, and explicit and typeless dynamic storage management, e.g., C. Because it is a source level transformation, it is amenable to both compile- and run-time optimization. Finally, its performance, even without compile-time optimization, is quite good. We implemented a prototype translator for the C language and analyzed the checking overheads of six non-trivial, pointer intensive programs. Execution overheads range from 130\% to 540\%; with text and data size overheads typically below 100\%.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages); C6140D (High level systems); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "array access checking technique; array access errors; C language; checking overheads; compile-time optimization; data size overheads; data structures; error; error coverage; execution overheads; experimentation; extended safe pointer representation; high level languages; interpreted languages; languages; local references; mutable pointers; performance; pointer access errors; pointer intensive programs; program testing; program transformations; run-time optimizatio; source level transformation; storage management; temporal access errors; typeless dynamic storage management", sponsororg = "ACM", 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. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", treatment = "P Practical", } @Article{Agrawal:1994:SPJ, author = "Hiralal Agrawal", title = "On Slicing Programs with Jump Statements", journal = j-SIGPLAN, volume = "29", number = "6", pages = "302--312", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178456", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p302-agrawal/", abstract = "Program slices have potential uses in many software engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump statements. Two similar algorithms were proposed recently to alleviate this problem. Both require the flowgraph and the program dependence graph of the program to be modified. In this paper, we propose an alternative algorithm that leaves these graphs intact and uses a separate graph to store the additional required information. We also show that this algorithm permits an extremely efficient, conservative adaptation for use with programs that contain only ``structured'' jump statements.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110B (Software engineering techniques); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Bellcore, Morristown, NJ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; conservative adaptation; flowgraph; graphs; jump statements; languages; program dependence graph; program diagnostics; slicing programs; software engineering; software engineering applications; structured jumps", sponsororg = "ACM", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\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.", treatment = "P Practical", } @Article{Netzer:1994:OTI, author = "Robert H. B. Netzer and Mark H. Weaver", title = "Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs", journal = j-SIGPLAN, volume = "29", number = "6", pages = "313--325", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178477", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p313-netzer/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Dept. of Comput. Sci., Brown Univ., Providence, RI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "adaptive tracing strategies; algorithms; bitvector segment pointer table; dedicated registers; experimentation; incremental reexecution; interactive programming; interactive programs; long-running program debugging; measurement; multi-processor workstation; optimal tracing; program; program debugging; program diagnostics; run-time slowdowns; short-term improvements; static analysis; trace generation; trace-and-replay debugging; write hooks", sponsororg = "ACM", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Tracing. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, DEBUG. {\bf C.0} Computer Systems Organization, GENERAL, SPARC.", treatment = "P Practical", } @Article{Holzle:1994:ODD, author = "Urs H{\"o}lzle and David Ungar", title = "Optimizing Dynamically-Dispatched Calls with Run-Time Type Feedback", journal = j-SIGPLAN, volume = "29", number = "6", pages = "326--336", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178478", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p326-holzle/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; call frequency; compiler; dynamically-dispatched calls; feedback; generic arithmetic; generic statically-typed; languages; large SELF applications; object-oriented languages; object-oriented programming; performance; program compilers; run-time type feedback; statically-typed; type feedback; type information; type theory; type-dependent operations", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", treatment = "P Practical", } @Article{Hentenryck:1994:TAP, author = "P. {Van Hentenryck} and A. Cortesi and B. {Le Charlier}", title = "Type analysis of {Prolog} using type graphs", journal = j-SIGPLAN, volume = "29", number = "6", pages = "337--348", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178479", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract interpretation and type graphs (i.e. disjunctive rational trees) with this functionality. The system (about 15,000 lines of C) consists of the combination of a generic fixpoint algorithm, a generic pattern domain, and a type graph domain. The main contribution of the paper is to show that this approach can be engineered to be practical for medium-sized programs without sacrificing accuracy. The main technical contributions to achieve this result are (1) a novel widening operator for type graphs which appears to be accurate and effective in keeping the sizes of the graphs, and hence the computation time, reasonably small; (2) the use of the generic pattern domain to obtain a compact representation of equality constraints between subterms and to factor out sure structural information.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{VanHentenryck:1994:TAP, author = "P. {Van Hentenryck} and A. Cortesi and B. {Le Charlier}", title = "Type Analysis of {Prolog} using Type Graphs", journal = j-SIGPLAN, volume = "29", number = "6", pages = "337--348", month = jun, year = "1994", CODEN = "SINODQ", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p337-van_hentenryck/", abstract = "Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract interpretation and type graphs (i.e. disjunctive rational trees) with this functionality. The system (about 15,000 lines of C) consists of the combination of a generic fixpoint algorithm, a generic pattern domain, and a type graph domain. The main contribution of the paper is to show that this approach can be engineered to be practical for medium-sized programs without sacrificing accuracy. The main technical contributions to achieve this result are (1) a novel widening operator for type graphs which appears to be accurate and effective in keeping the sizes of the graphs, and hence the computation time, reasonably small; (2) the use of the generic pattern domain to obtain a compact representation of equality constraints between subterms and to factor out sure structural information.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C4240 (Programming and algorithm theory); C6110L (Logic programming); C6120 (File organisation); C6140D (High level languages)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Brown Univ., Providence, RI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract interpretation; algorithms; built-in predicates; compact representation; computation; computation time; data structures; disjunctive rational trees; equality constraints; generic fixpoint algorithm; generic pattern domain; high-performance compilers; languages; logic programming; medium-sized programs; performance; PROLOG; Prolog; recursive types; sophisticated type inference system; structural information; structural information equality constraints; type analysis; type analysis system; type graphs; type theory", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog.", treatment = "P Practical", } @Article{VanHentenryck:1994:BTC, author = "Pascal {Van Hentenryck} and Viswanath Ramachandran", title = "Backtracking without trailing in {CLP($ R_{\rm Lin}$)}", journal = j-SIGPLAN, volume = "29", number = "6", pages = "349--360", month = jun, year = "1994", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/178243.178488", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:26:55 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p349-van_hentenryck/", abstract = "Constraint logic programming (CLP) is a generalization of logic programming where unification is replaced by constraint solving as the basic operation of the language. The combination of constraint solving and nondeterminism (approximated by backtracking) makes these languages appealing for a variety of combinatorial search problems. Existing CLP languages support backtracking by generalizing traditional Prolog implementations: modifications to the constraint system are trailed and restored on backtracking. Although simple and efficient, trailing may be very demanding in memory space, since the constraint system may potentially be saved at each choice point. This paper proposes a fundamentally new implementation scheme for backtracking in CLP languages over linear (rational or real) arithmetic. The new scheme, called semantic backtracking, does not use trailing but rather exploits the semantics of the constraints to undo the effect of newly added constraints. Semantic backtracking reduces the space complexity by an order of magnitude compared to implementations based on trailing and makes space complexity essentially independent of the number of choice points. In addition, semantic backtracking introduces negligible space and time overhead on deterministic programs. The price for this improvement is an increase in backtracking time, although constraint-solving time may actually decrease. The scheme has been implemented as part of a complete CLP system CLP({\em R\/}{\em Lin\/}) and compared analytically and experimentally with an optimized trailing implementation. Experimental results indicate that semantic backtracking produces significant reduction in memory space, while keeping the time overhead reasonably small.", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'94.", classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6110L (Logic programming); C6140D (High level languages)", conflocation = "Orlando, FL, USA; 20-24 June 1994", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", corpsource = "Brown Univ., Providence, RI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; backtracking; CLP languages; combinatorial search problems; computational complexity; constraint handling; constraint logic programming; constraint solving; deterministic programs; experimentation; languages; logic programming languages; memory space; nondeterminism; search problems; semantic backtracking; semantic CLP languages; space complexity; trailing", sponsororg = "ACM", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf I.2.8} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Backtracking. {\bf G.1.3} Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods).", treatment = "P Practical", } @Article{Kuhne:1994:HOO, author = "Thomas K{\"u}hne", title = "Higher Order Objects in pure Object-Oriented Languages", journal = j-SIGPLAN, volume = "29", number = "7", pages = "15--20", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Darmstadt Univ., Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract data types; currying; functional programs; higher order functions; locality; object-oriented languages; object-oriented programming; object-oriented programs; partial parameterization; pure object-oriented languages; reusability; software portability; strong typing", treatment = "P Practical", } @Article{Grogono:1994:GMO, author = "Peter Grogono and Mark Gargul", title = "A Graph Model for Object Oriented Programming", journal = j-SIGPLAN, volume = "29", number = "7", pages = "21--28", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming)", corpsource = "Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "aliasing; compile-time; cyclic data structures; delegation; dynamic binding; graph model; graph theory; inheritance; local state; object identity; object oriented programming; object-oriented programming; programming; programming theory; recursion; salient features; side-effects", treatment = "P Practical; T Theoretical or Mathematical", } @Article{vanderLinden:1994:FMO, author = "Frank J. van der Linden", title = "Formal methods: from object-based to object-oriented", journal = j-SIGPLAN, volume = "29", number = "7", pages = "29--38", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming)", corpsource = "Philips Res. Labs., Eindhoven, Netherlands", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "equational specification; executable specifications; formal object-based design method; formal specification; formality; inheritance; object-oriented development; object-oriented methods; reusable executable specifications; reusable object-classes; software reusability; specification techniques; SPRINT; subtyping", treatment = "P Practical", xxauthor = "Frank J. {Van der Linden}", } @Article{Davison:1994:KED, author = "Andrew Davison", title = "{KL1} and the Early Days of the {FGCS} Project", journal = j-SIGPLAN, volume = "29", number = "7", pages = "39--41", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wu:1994:CPA, author = "Pei-Chi Wu and Feng-Jian Wang", title = "Is Circularity Problem for Attribute Grammars Exponential-Time Complete?", journal = j-SIGPLAN, volume = "29", number = "7", pages = "42--42", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Comput. Sci. and Inf. Eng., National Chiao Tung Univ., Taiwan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "attribute grammars; circularity problem; complexity structure; computational complexity; deterministic Turing machine; exponential time completeness; space-effective algorithm", treatment = "T Theoretical or Mathematical", } @Article{Kirner:1994:DCR, author = "Tereza G. Kirner", title = "Detection of Cycle in Real-Time System Specification", journal = j-SIGPLAN, volume = "29", number = "7", pages = "43--50", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques)", corpsource = "Dept. of Comput. Sci., Federal Univ. of Sao Carlos, Sao Paulo, Brazil", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cycle detection; data flows; direct graph; directed graphs; formal specification; real-time system specification; real-time systems; software tool; software tools; specification graph", treatment = "P Practical", } @Article{Wolfe:1994:CFG, author = "M. Wolfe", title = "{$J^+=J$} (control flow graphs)", journal = j-SIGPLAN, volume = "29", number = "7", pages = "51--53", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Oregon Graduate Inst., Portland, OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithm theory; analysis; analysis algorithms; control flow graphs; correctness; directed graphs; join set; Static Single Assignment", treatment = "T Theoretical or Mathematical", } @Article{Wolfe:1994:J, author = "Michael Wolfe", title = "{J}+={J}", journal = j-SIGPLAN, volume = "29", number = "7", pages = "51--53", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dyadkin:1994:MP, author = "Lev J. Dyadkin", title = "Multibox Parsers", journal = j-SIGPLAN, volume = "29", number = "7", pages = "54--60", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150C (Compilers, interpreters and other processors)", corpsource = "Lahey Comput. Syst., Incline Village, NV, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "compiler front end generating tools; Fortran; grammars; Lahey Fortran 90 compiler; LALR grammar; Lex; lexical box; multibox parser; parser generator; program compilers; right linear grammar; syntax box; Yacc", treatment = "P Practical", } @Article{Baquero:1994:CAC, author = "Carlos Baquero and Francisco Moura", title = "Concurrency Annotations in {C++}", journal = j-SIGPLAN, volume = "29", number = "7", pages = "61--67", month = jul, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:53 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages)", corpsource = "DI/INESC, Minho Univ., Portugal", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "access flag; C language; C++; concurrency annotations; inheritance; inheritance chain; language extension; method code; method invocations; method predicates; multiple threads; object-oriented languages; parallel languages; shared-memory multiprocessor system; synchronisation; synchronization code; synchronization mechanisms", treatment = "P Practical", } @Article{Auerbach:1994:CSR, author = "Joshua S. Auerbach and James R. Russell", title = "The {Concert Signature Representation}: {IDL} as Intermediate Language", journal = j-SIGPLAN, volume = "29", number = "8", pages = "1--12", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p1-auerbach/", abstract = "In the Concert multilanguage distributed programming system, interface specification is the responsibility of programming languages, not separate IDL. However, an IDL is still necessary in order to define equivalence between declarations in different languages. A single representation is also desirable internally to economize on aspects of the implementation. Consequently, Concert has an IDL as an intermediate language, produced by compiler front-ends and not normally manipulated by programmers. It is formally separated into a {\em contract\/}, which defines interoperability and an {\em endpoint modifier\/}, which captures the local choice of representation. Only contracts are used to define interface equivalence. Our choice of what kinds of information to put in the contract was motivated by a desire to be minimal, thereby enabling maximum feasible interoperability between different expressions of the same abstraction in the same or different languages.", acknowledgement = ack-nhfb, classification = "C6115 (Programming support); C6140D (High level languages); C6180 (User interfaces)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "IBM T.J. Watson Res. Centere, Yorktown Heights, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "compiler front-ends; Concert; contract; design; endpoint modifier; high level languages; IDL; interface equivalence interface equivalence; interface specification; interoperability; languages; multilanguage distributed programming; signature representation; theory; user interface management systems", sponsororg = "ACM", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, IDL. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming.", treatment = "P Practical", } @Article{Sankar:1994:AID, author = "Sriram Sankar and Roger Hayes", title = "{ADL} --- an interface definition language for specifying and testing software", journal = j-SIGPLAN, volume = "29", number = "8", pages = "13--21", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p13-sankar/", abstract = "This paper describes an interface definition language called ADL which extends OMG's CORBA interface definition language with formal specification constructs. In addition to ADL's use in formal documentation, ADL's primary use is for testing software. ADL can be adapted for use with most programming languages. This paper also presents an overview of a testing technology based on ADL and presents the highlights of a test-data description language (TDD) used to describe test-data.", acknowledgement = ack-nhfb, classification = "C6115 (Programming support); C6140D (High level languages)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Sun Microsyst. Lab. Inc., Mountain View, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ADL; CORBA; design; formal specification; high level languages; interface definition language; languages; program testing; test-data description language; test-data description specification; testing software; theory; user interface management systems", sponsororg = "ACM", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages.", treatment = "P Practical", } @Article{Katiyar:1994:PSI, author = "Dinesh Katiyar and David Luckham and John Mitchell and Sigurd Meldal", title = "Polymorphism and Subtyping in Interfaces", journal = j-SIGPLAN, volume = "29", number = "8", pages = "22--34", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p22-katiyar/", abstract = "RAPIDE is a programming language framework designed for the development of large, concurrent, real-time systems by prototyping. The framework consists of a type of language and default executable, specification and architecture languages, along with associated programming tools. {\em Interfaces\/} are the central construct of the type system. This document describes RAPIDE interfaces, their expressiveness and their use as a typing construct.", acknowledgement = ack-nhfb, classification = "C6115 (Programming support); C6140D (High level languages)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "architecture languages; data structures; default executable; design; high level languages; interfaces; languages; performance; programming language framework; programming tools; prototyping; RAPIDE; RAPIDE interfaces; real-time systems; software prototyping; specification; subtyping; theory; type language", sponsororg = "ACM", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous, Rapid prototyping**. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", treatment = "P Practical", } @Article{Allen:1994:BDU, author = "Robert Allen and David Garlan", title = "Beyond Definition\slash Use: Architectural Interconnection", journal = j-SIGPLAN, volume = "29", number = "8", pages = "35--45", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p35-allen/", abstract = "Large software systems require decompositional mechanisms in order to make them tractable. Traditionally, MILs and IDLs have played this role by providing notations based on definition/use bindings. In this paper we argue that current MIL/IDLS based on definition/use have some serious drawbacks. A significant problem is that they fail to distinguish between ``implementation'' and ``interaction'' relationships between modules. We propose an alternative model in which components interact along well-defined lines of communication---or connectors. Connectors are defined as protocols that capture the expected patterns of communication between modules. We show how this leads to a scheme that is much more expressive for architectural relationships, that allows the formal definition of module interaction, and that supports its own form of automated checks and formal reasoning.", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6180 (User interfaces)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "architectural interconnection; automated checks; connectors; decompositional mechanisms; design; formal definition; formal reasoning; IDLs; languages; MILs; module interaction; performance; program testing; protocols; software engineering; software systems; theory; user interfaces", sponsororg = "ACM", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, CSP.", treatment = "P Practical", } @Article{Freitag:1994:PAS, author = "Burkhard Freitag and Tiziana Margaria and Bernhard Steffen", title = "A Pragmatic Approach to Software Synthesis", journal = j-SIGPLAN, volume = "29", number = "8", pages = "46--58", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p46-freitag/", abstract = "We present a practice oriented tool for software synthesis that supports the interface-correct configuration of complex systems from a library of reusable software components. Besides simply checking the interface-correctness of a link by means of type constraints, the tool is also designed to propose software components for solving a (loosely) specified problem within a certain context. In particular, it identifies possible interfacing modules that in case of an interface-conflict may serve for the right conversion, transformation or parameter configuration. We illustrate our tool, which is based on the deductive database system {\em LOLA\/}, in three application specific settings.", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6115 (Programming support)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Tech. Univ., Munchen, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; deductive database; design; interface-; interface-correct configuration; interface-correctness; languages; LOLA; performance; practice oriented tool; reusable software; software reusability; software synthesis; software tools; theory; type constraints; verification", sponsororg = "ACM", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous, Reusable software**. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification.", treatment = "P Practical", } @Article{Russell:1994:CIL, author = "James R. Russell and Robert E. Strom and Daniel M. Yellin", title = "A Checkable Interface Language for Pointer-Based Structures", journal = j-SIGPLAN, volume = "29", number = "8", pages = "59--73", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p59-russell/", abstract = "We present a technique for analyzing structural constraints on data aggregates in high-level languages. Our technique includes a formal constraint language and a dataflow algorithm for automatically checking equality constraints. The constraint language is used to augment the type information on program interfaces. For example, one can specify that a procedure must return aggregates A and B where each element in aggregate A points to some element in aggregate B, and that parameter C will have the properties of a rooted tree both on input and output. Our dataflow algorithm tracks the constraints which must apply at each statement in order for the procedure to satisfy its interface, and detects invalid programs which fail to satisfy the constraints on their interfaces. We apply our technique to several examples. Our work is motivated by the requirements for expressive interface definition languages for distributed systems, and by the desire to mechanically check program modules against their interfaces. Our analysis techniques also yield information which may enable compilers and stub generators to produce better implementations.", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6140D (High level languages)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Distributed Syst. Software Technol., IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "data aggregates; data structures; dataflow algorithm; design; distributed systems; equality constraints; formal constraint language; high level languages; high-level languages; interface definition languages; languages; performance; pointer-based structures; program testing; structural constraints; theory; type information; verification", sponsororg = "ACM", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", treatment = "P Practical", } @Article{Tan:1994:ILS, author = "Yang Meng Tan", title = "Interface Language for Supporting Programming Styles", journal = j-SIGPLAN, volume = "29", number = "8", pages = "74--83", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p74-tan/", abstract = "We suggest a novel application of a formal specification language: we use it to support some programming conventions and encourage certain styles of programming. The Larch/C Interface Language (LCL) is a language for documenting the interfaces of ANSI C programs. It is designed to support a style of C programming where a program is organized around a set of software modules. Even though C does not support abstract data types, LCL supports the specifications of abstract data types, and provides guidelines on how abstract types can be implemented in C. A {\em lint\/}-like program checks for some conformance of C code to its LCL specification.", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract data types; ANSI C programs; C programming; design; formal specification language; languages; Larch/C Interface Language; LCL; programming; programming conventions; specification languages; theory", sponsororg = "ACM", subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Larch. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types.", treatment = "P Practical", } @Article{Cohen:1994:API, author = "Don Cohen and Neil Goldman and K. Narayanaswamy", title = "Adding Performance Information to {ADT} Interfaces: Why and How", journal = j-SIGPLAN, volume = "29", number = "8", pages = "84--93", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p84-cohen/", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques); C6120 (File organisation)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "USC/Inf. Sci. Inst., Marina del Rey, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract data types; ADT interface; algorithms; design; languages; management; performance; performance information; program verification; relational abstraction; theory", sponsororg = "ACM", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software maintenance.", treatment = "P Practical", } @Article{Kessler:1994:CSI, author = "Peter B. Kessler", title = "A Client-Side Stub Interpreter", journal = j-SIGPLAN, volume = "29", number = "8", pages = "94--100", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p94-kessler/", abstract = "We have built a research operating system in which all services are presented through interfaces described by an interface description language. The system consists of a micro-kernel that supports a small number of these interfaces, and a large number of interfaces that are implemented by user level code. A typical service implements one or more interfaces, but it is a client of many other interfaces that are implemented elsewhere in the system. We have an interface compiler that generates client-side and server-side stubs to deliver calls from clients to servers, providing location transparency if the client and server are in different address spaces. The code for client-side stubs was occupying a large amount of the text space of our clients, so a stub interpreter was written to replace the client-side stub methods. The result was that we traded 125K bytes of stub code for 13K bytes of stub descriptions and 4K bytes of stub interpreter. This paper describes the stub interpreter, the stub descriptions, and discusses some alternatives.", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "SunSoft, Inc., Mountain View, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "client-side; design; experimentation; interface compiler; interface description language; languages; micro-kernel; operating systems (computers); performance; research operating system; server-side; specification languages; stub descriptions; stub descriptions stub interpreter; stub interpreter; theory", sponsororg = "ACM", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, IDL. {\bf D.4.0} Software, OPERATING SYSTEMS, General. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems.", treatment = "P Practical", } @Article{Gay:1994:IDL, author = "David E. Gay", title = "Interface Definition Language Conversions: Recursive Types", journal = j-SIGPLAN, volume = "29", number = "8", pages = "101--110", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p101-gay/", abstract = "A large heterogeneous network contains many applications developed in different environments, each with its own incompatible interface definition language. One way of dealing with this diversity is to define a conversion from the interfaces of one system into another, thus giving access from the second system to the first. This presents a number of difficulties, amongst which is the different representation of recursive types in different languages. This paper gives two algorithms for converting the representation of such recursive types between different styles of interface definition languages.", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6140D (High level languages)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Dept. of Comput. Eng., Swiss Federal Inst. of Technol., Lausanne, Switzerland", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; conversion; data structures; design; heterogeneous network; high level languages; interface definition; interface definition languages; languages; performance; recursive types; representation of recursive types; theory", sponsororg = "ACM", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, IDL. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes.", treatment = "P Practical", } @Article{Kahrs:1994:IEM, author = "Stefan Kahrs and Donald Sannella and Andrzej Tarlecki", title = "Interfaces and Extended {ML}", journal = j-SIGPLAN, volume = "29", number = "8", pages = "111--118", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p111-kahrs/", abstract = "This is a position paper giving our views on the usages and makeup of module interfaces. The position espoused is inspired by our work on the Extended ML (EML) formal software development framework and by ideas in the algebraic foundations of specification and formal development. The present state of interfaces in EML is outlined and set in the context of plans for a more general EML-like framework with axioms in interfaces taken from an arbitrary logical system formulated as an {\em institution\/}. Some more speculative plans are sketched concerning the simultaneous use of multiple institutions in specification and development.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Lab. for Found. of Comput. Sci., Edinburgh Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algebraic; algebraic foundations; arbitrary logical system; design; Extended ML; formal development; formal software development; formal specification; Interfaces; languages; management; performance; specification; specification languages; theory", sponsororg = "ACM", subject = "{\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces.", treatment = "G General Review; P Practical", } @Article{Hamilton:1994:UII, author = "Graham Hamilton and Sanjay Radia", title = "Using Interface Inheritance to Address Problems in System Software Evolution", journal = j-SIGPLAN, volume = "29", number = "8", pages = "119--128", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p119-hamilton/", abstract = "Two specific problems faced in large distributed systems are (1) evolving and managing different versions of an interface while minimizing the impact on existing clients, and (2) supporting the addition of auxiliary interfaces that are orthogonal to the main interface of an abstraction. In the context of the Spring distributed system, we addressed both problems using an object-oriented interface definition language. Different versions of an interface are represented as different types with an inheritance relationship that minimizes the impact on existing clients and allows easy management of versions. We distinguish between fundamental and auxiliary properties each of which are defined as separate types. Rather than use simple root inheritance, we use a combination of root and leaf inheritance. This provides flexibility in supporting auxiliary properties and allows us to add new auxiliary properties as the system evolves without forcing the system to be recompiled. The solutions have been tested and refined through their use in the Spring system.", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6140D (High level languages); C6150N (Distributed systems)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Sun Microsyst., Inc., Mountain View, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; distributed processing; experimentation; inheritance; interface inheritance; languages; large distributed systems; leaf inheritance; management; object-oriented interface definition language; object-oriented languages; performance; root inheritance; Spring distributed system; system software; system software evolution; theory", sponsororg = "ACM", subject = "{\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management. {\bf D.2.6} Software, SOFTWARE ENGINEERING, Programming Environments. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages.", treatment = "P Practical", } @Article{Leavens:1994:IIS, author = "Gary T. Leavens", title = "Inheritance of interface specifications (extended abstract)", journal = j-SIGPLAN, volume = "29", number = "8", pages = "129--138", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:04 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/185084/p129-leavens/", abstract = "Four alternatives for the semantics of inheritance of specifications are discussed. The information loss and frame axiom problems for inherited specifications are also considered.", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", conflocation = "Portland, OR, USA; 20 Jan. 1994", conftitle = "ACM Workshop on Interface Definition Languages", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; formal specification; frame axiom; information loss; inheritance; interface specifications; languages; performance; semantics; theory", sponsororg = "ACM", subject = "{\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages.", treatment = "P Practical", } @Article{Bevan:1994:LEC, author = "Stephen J. Bevan", title = "Letter to the Editor: {SIGPLAN Notices 27(12) 1992: ``The Calculation of Easter''}", journal = j-SIGPLAN, volume = "29", number = "9", pages = "8--8", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 09 21:28:03 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Stansifer:1992:CE}.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Conway:1994:PCD, author = "Damian Conway", title = "Parsing with {C++} Deferred Expressions", journal = j-SIGPLAN, volume = "29", number = "9", pages = "9--16", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Monash Univ., Clayton, Vic., Australia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C++; embedded grammar-based parsers; function calls; grammars; object-oriented languages; object-oriented programming; parsing actions; program compilers; programming theory; specification", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Romanovsky:1994:ACC, author = "A. Romanovsky", title = "About Conversations for Concurrent {OO} Languages", journal = j-SIGPLAN, volume = "29", number = "9", pages = "17--21", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages)", corpsource = "Dept. of Comput., Newcastle upon Tyne Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "backward error recovery; concurrent object oriented languages; concurrent object oriented programs; conversation scheme; COOLs; object-oriented languages; object-oriented programming; parallel languages; parallel programming; software diversity; software fault tolerance", treatment = "P Practical", } @Article{Giraud-Carrier:1994:RDF, author = "Christophe Giraud-Carrier", title = "A Reconfigurable Data Flow Machine for Implementing Functional Programming Languages", journal = j-SIGPLAN, volume = "29", number = "9", pages = "22--28", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessor systems and techniques); C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Brigham Young Univ., Provo, UT, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "data flow machine; data-driven architecture; functional programming; functional programming languages; graphical programming; high level languages; hypercube; inherent parallelism; massive parallelism; parallel architectures; parallel machines; reconfigurability; reconfigurable architectures; reconfigurable data flow machine; referential transparency; smart memories", treatment = "P Practical", } @Article{Giraud-Carrier:1994:RDM, author = "Christophe Giraud-Carrier", title = "A reconfigurable dataflow machine for implementing functional programming languages", journal = j-SIGPLAN, volume = "29", number = "9", pages = "22--28", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Justice:1994:MAC, author = "Timothy P. Justice and Rajeev K. Pandey and Timothy A. Budd", title = "A Multiparadigm Approach to Compiler Construction", journal = j-SIGPLAN, volume = "29", number = "9", pages = "29--37", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Oregon State Univ., OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C; compiler construction; compiler programming; diverse problem solving strategies; functional programming; high level languages; imperative programming; implementation language; Leda; logic programming; multiparadigm language; multiparadigm programming languages; object oriented programming; program compilers; programming; programming problem", treatment = "P Practical", } @Article{Baker:1994:MRC, author = "Henry G. Baker", title = "Minimizing Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structures", journal = j-SIGPLAN, volume = "29", number = "9", pages = "38--43", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C1180 (Optimisation techniques); C6120 (File organisation)", corpsource = "Nimble Comput. Corp., Encino, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "anchored pointers; borrowed pointers; cache lines; count storage; data structures; deferred pointers; derived pointer problem; dynamic storage management; functional data structures; garbage collection; garbage stack; linear logic; linear programming; normal pointers; phantom pointers; real-time; reference count increment; reference count updating; storage management", treatment = "P Practical", } @Article{Klug:1994:BOV, author = "Michael Klug", title = "Basic Operations of the {VisiCola} Scope Model", journal = j-SIGPLAN, volume = "29", number = "9", pages = "44--50", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6115 (Programming support); C6140D (High level languages)", corpsource = "Siemens Corporate Res. and Dev., Munich, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C++; executable specification method; formal specification; high level languages; incremental scope resolution system; object oriented version; programming; programming environments; Programming System Generator; semantics; specifications; syntax; Visibility Control in Programming Languages; visibility rules; VisiCola", treatment = "P Practical", } @Article{Yuen:1994:BFS, author = "C. K. Yuen and M. D. Feng", title = "Breadth-first search in the {Eight Queens Problem}", journal = j-SIGPLAN, volume = "29", number = "9", pages = "51--55", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C1230 (Artificial intelligence); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming)", corpsource = "DISCS, National Univ. of Singapore, Kent Ridge, Singapore", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "backtracking program; breadth-first algorithm; data structure; dynamic storage management; Eight Queens Problem; games of skill; iteration; iteration structure; Lisp; LISP; node search; parallel processing; programming; programming theory; recursion; recursive programming; search problems; tree; trees (mathematics); unsatisfactory queen placement", treatment = "T Theoretical or Mathematical", } @Article{Desainte-Catherine:1994:UAG, author = "M. Desainte-Catherine and K. Barbar", title = "Using attribute grammars to find solutions for musical equational programs", journal = j-SIGPLAN, volume = "29", number = "9", pages = "56--63", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C7820 (Humanities)", corpsource = "Bordeaux I Univ., Talence, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "attribute evaluation algorithms evaluation algorithms; attribute grammars; music; musical equational programs", treatment = "T Theoretical or Mathematical", } @Article{Wu:1994:PST, author = "Pei-Chi Wu and Feng-Jian Wang", title = "Padded String: Treating String as Sequence of Machine Words", journal = j-SIGPLAN, volume = "29", number = "9", pages = "64--67", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", corpsource = "Inst. of Comput. Sci. and Inf. Eng., National Chiao Tung Univ., Hsinchu, Taiwan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; character sequence; comparison; copy; data structure; data structures; data type; machine instruction; machine words; padded string; programming; sorting; string type", treatment = "P Practical", } @Article{Wu:1994:PUA, author = "Pei-Chi Wu and Feng-Jian Wang", title = "{Pool}: an unbounded array", journal = j-SIGPLAN, volume = "29", number = "9", pages = "68--71", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Inst. of Comput. Sci. and Inf. Eng., National Chiao Tung Univ., Hsinchu, Taiwan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "collection; collection objects; data handling; data structures; hybrid data structure; index; index operation; index table; indexed data structures; linked structures; memory space; pool; stack; storage allocation; tabular data structures; tabular representation; unbounded array; unbounded space", treatment = "P Practical", } @Article{Li:1994:PSL, author = "Jing Li and Yulin Feng", title = "A Production System Language {KDOPS}", journal = j-SIGPLAN, volume = "29", number = "9", pages = "72--76", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6170 (Expert systems)", corpsource = "Dept. of Comput. Sci., Univ. of Sci. and Technol. of China, Anhui, China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "direct function calls; expert systems; general-purpose production system language; heuristic inference; high level languages; inference mechanisms; KDOPS; LISP; LISP programming; OPS5; programming; rule oriented programming; structured programming", treatment = "P Practical", } @Article{Elmstrom:1994:IVS, author = "Ren{\'{e}} Elmstr{\o}m and Peter Gorm Larsen and Poul B{\o}gh Lassen", title = "The {IFAD VDM-SL} Toolbox: {A} Practical Approach to Formal Specifications", journal = j-SIGPLAN, volume = "29", number = "9", pages = "77--80", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6115 (Programming support)", corpsource = "IFAD, Inst. of Appl. Comput. Sci., Odense, Denmark", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "debugging; documentation support; formal specification; formal specifications development; IFAD; industrial settings; module-based specifications development; module-based structuring; program debugging; programming environments; real-life specifications; semantics checking; software tools; standards; test coverage analysis; VDM-SL standard; VDM-SL Toolbox; Vienna Development Method; Vienna development method", treatment = "P Practical", } @Article{Kristensen:1994:CMP, author = "Bent Bruun Kristensen and Kasper {\O}sterbye", title = "Conceptual Modeling and Programming Languages", journal = j-SIGPLAN, volume = "29", number = "9", pages = "81--90", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Aalborg Univ., Denmark", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstraction mechanisms; concept formation; conceptual modeling; epistemology; high level languages; human conceptualization; human factors; modeling process; object-oriented languages; program; program comprehension; program development; programming; programming language; programming language analysis; programming languages; software maintenance; systems analysis; users expectations", treatment = "P Practical", } @Article{Dekker:1994:GLC, author = "Anthony H. Dekker", title = "The Game of {Life}: {A CLEAN} Programming Tutorial and Case Study", journal = j-SIGPLAN, volume = "29", number = "9", pages = "91--104", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6180G (Graphical user interfaces); C7830D (Computer games); C7830D (programming)", corpsource = "Dept. of Inf. Syst. and Comput. Sci., National Univ. of Singapore, Kent Ridge, Singapore", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "applications software; CLEAN; computer games; functional programming; functional programming language; Game of Life; graphical user interface; graphical user interfaces; high level languages; input output facilities; programming style; stepwise development", treatment = "P Practical", } @Article{Maruyama:1994:COO, author = "Katsumi Maruyama and Nicholas Raguideau", title = "Concurrent Object-Oriented Language ``{COOL}''", journal = j-SIGPLAN, volume = "29", number = "9", pages = "105--114", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "NTT Commun. Switching Lab., Tokyo, Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "active objects; C; C++; Chill; compile-time checking; compiler; COOL; data types; distributed concurrent object-oriented language; distributed processing; gcc compiler; message passing; Modula-2; multiprocessing; network-transparent message passing; Oberon; object-oriented languages; object-oriented programming; parallel languages; parallel programming; Pascal; passive objects; program compilers; program readability; realtime applications; runtime efficiency; strongly typed language; system programming", treatment = "P Practical", } @Article{Neto:1994:AAC, author = "Jo{\~a}o Jos{\'{e}} Neto", title = "Adaptive automata for context-dependent languages", journal = j-SIGPLAN, volume = "29", number = "9", pages = "115--124", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Escola Politecnica, Sao Paulo Univ., Brazil", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "adaptive automata; automata theory; context-dependent languages; formal languages; grammars; hierarchical structure; input text; language description; parser; parsing", treatment = "T Theoretical or Mathematical", } @Article{Shelekhov:1994:OAP, author = "Vladimir I. Shelekhov and Sergey V. Kuksenko", title = "Object Analysis of Program", journal = j-SIGPLAN, volume = "29", number = "9", pages = "125--134", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", corpsource = "Inst. of Inf. Syst., Novosibirsk, Russia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "industrial programs; language-oriented dataflow analysis; Modula; Modula-2 language; Modula-U language; object analysis algorithm; object program scheme; programming; source code; systems analysis; type compatibility; type transfer constructs", treatment = "P Practical", } @Article{Umrigar:1994:FSD, author = "Zerksis D. Umrigar", title = "Fully Static Dimensional Analysis with {C++}", journal = j-SIGPLAN, volume = "29", number = "9", pages = "135--139", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6140D (High level languages); C6150C (Compilers, interpreters and other languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C++; C++ compiler; language construct; language definition; object-oriented languages; object-oriented programming; program compilers; programming errors; programming language; run-time costs; run-time overhead; static dimensional analysis", treatment = "P Practical", } @Article{Gu:1994:ABI, author = "Weiming Gu and Jeffrey Vetter and Karsten Schwan", title = "An Annotated Bibliography of Interactive Program Steering", journal = j-SIGPLAN, volume = "29", number = "9", pages = "140--148", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "bibliography; data storage; distributed machines; interactive program steering; language systems; operating systems; operating systems (computers); parallel programming; parallel target machines; program adaptation; program monitoring; system monitoring", treatment = "B Bibliography; G General Review", } @Article{Sankaran:1994:BGC, author = "Nandakumar Sankaran", title = "A Bibliography on Garbage Collection and Related Topics", journal = j-SIGPLAN, volume = "29", number = "9", pages = "149--158", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Clemson Univ., SC, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cross references; garbage collection; generational collection; mark-sweep compact collection; real-time collection; reference counting; storage management", treatment = "B Bibliography", } @Article{Meek:1994:TD, author = "Brian Meek", title = "A taxonomy of datatypes", journal = j-SIGPLAN, volume = "29", number = "9", pages = "159--167", month = sep, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:54 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation)", corpsource = "King's Coll., London, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "data handling; data structures; international standards working group; ISO/IEC; JTC1/SC22; language-independent standardisation; standards", treatment = "P Practical", } @Article{Chambers:1994:TMM, author = "Craig Chambers and Gary T. Leavens", title = "Typechecking and Modules for Multi-Methods", journal = j-SIGPLAN, volume = "29", number = "10", pages = "1--15", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract classes; Cecil language; completeness; conformance; consistency; data encapsulation; encapsulation; graph-based method lookup semantics; inheritance hierarchies; link-time; message signatures; modularity; modules; multi-method-based languages; multi-methods; object-oriented languages; object-oriented programming; polynomial-time static typechecking algorithm; static typechecking; type theory; typechecking", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Eifrig:1994:AOT, author = "Jonathan Eifrig and Scott Smith and Valery Trifonov and Amy Zwarico", title = "Application of {OOP} Type Theory: State, Decidability, Integration", journal = j-SIGPLAN, volume = "29", number = "10", pages = "16--30", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore, MD, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "decidability; decidable; F-bounded quantification; F-bounded view; global state; integration; object oriented programming; object-oriented languages; object-oriented programming; object-oriented programming languages; soundness properties; state; subclasses; subtypes; type systems; type theory; type-checking", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Kobayashi:1994:TFC, author = "N. Kobayashi and A. Yonezawa", title = "Type-Theoretic Foundations for Concurrent Object-Oriented Programming", journal = j-SIGPLAN, volume = "29", number = "10", pages = "31--45", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110J (Object-oriented programming); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Inf. Sci., Tokyo Univ., Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "automatically type-checked; basic concurrent calculus; concurrent calculus; concurrent object-oriented programming; concurrent programming; Higher-Order ACL; inheritance; lambda-calculus; method overriding; object-oriented languages; object-oriented programming; parallel programming; polymorphic type inference mechanism; record operations; static type system; strong type system; type systems; type theory; type-theoretic foundations", sponsororg = "ACM", treatment = "P Practical", } @Article{Kobayashi:1994:TTF, author = "Naoki Kobayashi and Akinori Yonezawa", title = "Type-theoretic foundations for concurrent object-oriented programming", journal = j-SIGPLAN, volume = "29", number = "10", pages = "31--45", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cohen:1994:TPO, author = "Judy Cohen and Mary Lynn Manns and Susan Lilly and Richard P. Gabriel and Janet Conway and Desmond D'Souza", title = "Training Professionals in Object Technology (panel)", journal = j-SIGPLAN, volume = "29", number = "10", pages = "46--50", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Robertson:1994:OSG, author = "Scott P. Robertson and John M. Carroll and Robert L. Mack and Mary Beth Rosson and Sherman R. Alpert and J{\"u}rgen Koenenmann-Belliveau", title = "{ODE}: {A} Self-Guided, Scenario-Based Learning Environment for Object-Oriented Design Principles", journal = j-SIGPLAN, volume = "29", number = "10", pages = "51--64", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0220 (Education and training); C6110J (Object-oriented programming)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "IBM Thomas J. Watson Res. Center, Hawthorne, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "computer science education; discovery learning; education; experimental learning environment experimental learning environment; meaningful tasks; object analysis; Object Design Exploratorium; object identification; object-oriented design principles; object-oriented methods; object-oriented programming; ODE; problem domain; self-guided, scenario-based learning environment; students; training", sponsororg = "ACM", treatment = "P Practical", } @Article{Vion-Dury:1994:VII, author = "Jean-Yves Vion-Dury and Miguel Santana", title = "Virtual Images: Interactive Visualization of Distributed Object-Oriented Systems", journal = j-SIGPLAN, volume = "29", number = "10", pages = "65--84", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6130B (Graphics techniques); C6160B (Distributed DBMS)C6150G (Diagnostic, testing, debugging and evaluating systems); C6160J (Object-oriented databases); C6180G (Graphical user interfaces)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Bull-IMAG/Syst., Gieres, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "3D interactive animations; complex relationships; computer animation; concurrent activities; data visualisation; debugging tools; distributed; distributed databases; distributed object-oriented systems; dynamic execution; graphical interfaces; graphical user interfaces; interactive visualization; management tools; monitoring tools; nonspecialized workstations; object-oriented databases; program debugging; system monitoring; virtual images", sponsororg = "ACM", treatment = "P Practical", } @Article{Gronbaek:1994:BTH, author = "Kaj Gr{\o}nb{\ae}k and Jawahar Malhotra", title = "Building Tailorable Hypermedia Systems: the embedded interpreter approach", journal = j-SIGPLAN, volume = "29", number = "10", pages = "85--101", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented interpreters and other processors); C6110J (Object-oriented programming); C6150C (Compilers, interpreters and other processors); C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., Aarhus Univ., Denmark", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "alternating editors; compile-time tailoring; DEVISE Hypermedia; dynamically tailorable hypermedia systems; embeddable interpreter; embedded-interpreter approach; executable program; graphical objects; hypermedia; hypermedia application framework; hypermedia link end-points; hypermedia system instantiation; media-types; object-oriented databases; object-oriented environment; object-oriented programming; open points; persistent interpreted objects; persistent object-store; program interpreters; real-time systems; run-time tailoring", sponsororg = "ACM", treatment = "P Practical", } @Article{Smith:1994:PBL, author = "Randall B. Smith and Mark Lentczner and Walter R. Smith and Antero Taivalsaari and David Ungar", title = "Prototype-Based Languages: Object Lessons from Class-Free Programming (Panel)", journal = j-SIGPLAN, volume = "29", number = "10", pages = "102--112", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Puaut:1994:DGC, author = "Isabelle Puaut", title = "A Distributed Garbage Collector for Active Objects", journal = j-SIGPLAN, volume = "29", number = "10", pages = "113--128", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5620L (Local area networks); C6110J (Object-oriented programming); C6110P (Parallel languages); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150N (Distributed systems)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "IRISA/INSA, Rennes, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "active objects; algorithm; algorithm theory; concurrent object-oriented language; distributed garbage collector; fault tolerant computing; faulty communication channels; faulty sites; languages; local area networks; local area workstation network; local garbage collectors; logically centralized global garbage collector; marking algorithm; network operating systems; object-oriented languages; object-oriented programming; parallel languages; parallel programming; storage management; system state; workstations", sponsororg = "ACM", treatment = "P Practical", } @Article{Hagimont:1994:PSO, author = "Daniel Hagimont and P.-Y. Chevalier and A. Freyssinet and S. Krakowiak and S. Lacourte and J. Mossi{\`e}re and X. Rousset de Pina", title = "Persistent Shared Object Support in the {Guide} System: Evaluation and Related Work", journal = j-SIGPLAN, volume = "29", number = "10", pages = "129--144", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6160B (Distributed DBMS); C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Bull/IMAG Syst., Gieres, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design choices; distributed cooperative applications; distributed databases; distributed object-oriented systems; distributed system communication; efficiency; fine grained objects; generic interface; Guide system; Mach 3.0; object-oriented databases; object-oriented languages; persistent shared object support; protection enforcement; resistant share; system layer; Unix", sponsororg = "ACM", treatment = "P Practical", } @Article{Shan:1994:SBW, author = "Yen-Ping Shan and Ken Auer and Andrew J. Bear and Jim Adamczyk and Adele Goldberg and Tom Love and Dave Thomas", title = "{Smalltalk} in the Business World: the Good, the Bad, and the Future (panel)", journal = j-SIGPLAN, volume = "29", number = "10", pages = "145--152", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Seidewitz:1994:GVI, author = "Ed Seidewitz", title = "Genericity versus Inheritance Reconsidered: Self-Reference Using Generics", journal = j-SIGPLAN, volume = "29", number = "10", pages = "153--163", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6120 (File organisation)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "NASA Goddard Space Flight Center, Greenbelt, MD, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "dynamic binding; genericity; generics; implementation technique; inheritance; object-oriented programming; parameterization mechanism; polymorphic typing; self-reference; self-referential operation calls; simulation; static binding; type theory", sponsororg = "ACM", treatment = "T Theoretical or Mathematical", } @Article{Ducournau:1994:PMM, author = "R. Ducournau and M. Habib and M. Huchard and M. L. Mugnier", title = "Proposal for a Monotonic Multiple Inheritance Linearization", journal = j-SIGPLAN, volume = "29", number = "10", pages = "164--175", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Sema Group, Montrouge, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithm; automatic programming; CLOS; conflict resolution mechanisms; design choices; inheritance; LOOPS; monotonic multiple inheritance linearization; object-oriented programming; programming theory", sponsororg = "ACM", treatment = "T Theoretical or Mathematical", } @Article{Yellin:1994:IPS, author = "Daniel M. Yellin and Robert E. Strom", title = "Interfaces, Protocols, and the Semi-Automatic Construction of Software Adaptors", journal = j-SIGPLAN, volume = "29", number = "10", pages = "176--190", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "code; enhanced specifications; errors; formal specification; high-level description; interface compatibility; interface mapping; messages; object-oriented application interfaces; object-oriented programming; protocols; semi-automatic construction; sequencing constraints; software adaptors; textual comments; type system; type theory; type theory protocols", sponsororg = "ACM", treatment = "T Theoretical or Mathematical", } @Article{Karpovich:1994:EFS, author = "John F. Karpovich and Andrew S. Grimshaw and James C. French", title = "{ExtensibLe File Systems} ({ELFS}): An Object-Oriented Approach to High Performance File {I/O}", journal = j-SIGPLAN, volume = "29", number = "10", pages = "191--204", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6130 (Data handling techniques); C7300 (Natural sciences)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "2D dense matrix file class; access patterns; buffer storage; caching; data handling; data structures; data type; disk storage device performance; extensible file systems; file asynchronous file access; file operations; file structure; flexible extensible file classes; high performance file I/O; multidimensional range searching file class; object-oriented approach; object-oriented methods; object-oriented programming; parallel asynchronous file access; persistent data sets; prefetching; run times; scientific applications; storage management; typed objects; user interface", sponsororg = "ACM", treatment = "P Practical", } @Article{Rothering:1994:DOI, author = "Darryl James Rothering", title = "Development of an {OO} Infrastructure for Mainframe Database Applications", journal = j-SIGPLAN, volume = "29", number = "10", pages = "205--211", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Object Oriented Software and Consulting, Santa Monica, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "British Telecom; British Telecom delivery time scales; CICS; COBOL; DB2; delivery time scales; development tools; execution infrastructure; language support; large mainframe installations; legacy environments; mainframe database applications; mainframes; object technology; object-oriented databases; object-oriented programming; performance requirements; software engineering; testing utilities", sponsororg = "ACM", treatment = "P Practical", } @Article{Spinelli:1994:MOO, author = "Andrea Spinelli and Paolo Salvaneschi and Mauro Cadei and Marino Rocca", title = "{MI}: an object oriented environment for integration of scientific applications", journal = j-SIGPLAN, volume = "29", number = "10", pages = "212--222", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation); C6140D (High level languages); C7300 (Natural sciences)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "ISMES SpA, Bergamo, Italy", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract data types; abstraction; architecture; C++ class libraries; engineering software; integration layer; MI; object oriented environment; object-oriented languages; object-oriented programming; retrofitting; reusability; scientific applications; scientific software; software component integration; software component layer; software reusability; software tools; software tools oriented programming; user model", sponsororg = "ACM", treatment = "P Practical", } @Article{Monarchi:1994:MSH, author = "David Monarchi and Grady Booch and Brian Henderson-Sellers and Ivar Jacobson and Steve Mellor and James Rumbaugh and Rebecca Wirfs-Brock", title = "Methodology Standards: Help or Hindrance?", journal = j-SIGPLAN, volume = "29", number = "10", pages = "223--228", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Holzle:1994:TGS, author = "Urs H{\"o}lzle and David Ungar", title = "A Third Generation {SELF} Implementation: Reconciling Responsiveness with Performance", journal = j-SIGPLAN, volume = "29", number = "10", pages = "229--243", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented interpreters and other processors); C6110J (Object-oriented programming); C6115 (Programming support); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "clustering; interactive responsiveness; nonoptimizing compiler; nonoptimizing dynamic compilation; object-oriented languages; object-oriented programming; optimisation; optimization; pause clustering; pause time distribution; performance; program compilers; program execution; programming environments; programming systems; pure object-oriented languages; responsiveness; SELF-93; Smalltalk systems; Smalltalk-80 environment; third-generation SELF implementation; unresponsive programming environments", sponsororg = "ACM", treatment = "P Practical", } @Article{Amiel:1994:OMD, author = "E. Amiel and O. Gruber and E. Simon", title = "Optimizing Multi-Method Dispatch Using Compressed Dispatch Tables", journal = j-SIGPLAN, volume = "29", number = "10", pages = "244--244", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "INRIA, Le Chesnay, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C++; coloring; compressed dispatch tables; constant time performance; mono-methods; multi-method dispatch; object oriented programming object oriented programming; object-oriented language; object-oriented languages; object-oriented programming; optimisation; optimization; programming theory; signature analysis", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Amiel:1994:OMM, author = "Eric Amiel and Olivier Gruber and Eric Simon", title = "Optimizing multi-method dispatch using compressed dispatch tables", journal = j-SIGPLAN, volume = "29", number = "10", pages = "244--258", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lopez:1994:ICI, author = "Gus Lopez and Bjorn Freeman-Benson and Alan Borning", title = "Implementing Constraint Imperative Programming Languages: The {Kaleidoscope} '93 Virtual Machine", journal = j-SIGPLAN, volume = "29", number = "10", pages = "259--271", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6110J (Object-oriented programming); C6110L (Logic programming); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "CIP languages; constraint handling; constraint imperative programming; constraint imperative programming languages; constraint languages; constraint-based data store; declarative constraints; destructive assignment; high level languages; imperative machine; imperative programming; imperative state; incremental constraint solver; K-machine; Kaleidoscope'93 virtual machine; logic programming languages; object-oriented languages; pointers; programming; user-defined constraints; virtual machines", sponsororg = "ACM", treatment = "P Practical", } @Article{Kristensen:1994:CAA, author = "Bent Bruun Kristensen", title = "Complex Associations: Abstractions in Object-Oriented Modeling", journal = j-SIGPLAN, volume = "29", number = "10", pages = "272--286", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6120 (File organisation)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Inst. of Electron. Syst., Aalborg Univ., Denmark", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstractions; associations; complex associations; component relations; data encapsulation; encapsulation; object-oriented; object-oriented analysis; object-oriented design; object-oriented methods; object-oriented modeling; object-oriented programming; references", sponsororg = "ACM", treatment = "P Practical", } @Article{Jordan:1994:SPC, author = "Richard Jordan and Ruth Smilan and Alex Wilkinson", title = "Streamlining the Project Cycle with Object-Oriented Requirements", journal = j-SIGPLAN, volume = "29", number = "10", pages = "287--300", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0310F (Software development management); C6110J (Object-oriented programming); C6115 (Programming support)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "AT and T Bell Labs., Columbus, OH, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "formal specification; methodology; object-oriented methods; object-oriented programming; object-oriented requirements; object-oriented systems oriented systems; object-oriented technology; product development cycle; project cycle; project management; requirements definition phase; requirements specifications; software tools", sponsororg = "ACM", treatment = "P Practical", } @Article{Buhr:1994:TMO, author = "R. J. A. Buhr and R. S. Casselman", title = "Timethread-Role Maps for Object-Oriented Design of Real-Time-and-Distributed Systems", journal = j-SIGPLAN, volume = "29", number = "10", pages = "301--301", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6150N (Distributed systems)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Syst. and Comput. Eng., Carleton Univ., Ottawa, Ont., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "concurrency; distributed processing; distributed systems; dynamic structure; end-to-end responsibility paths; object-oriented approach; object-oriented design; object-oriented design methods; object-oriented methods; object-oriented programming; real-time systems; real-time systems oriented programming; responsibility-driven design; timethread-role maps", sponsororg = "ACM", treatment = "P Practical", } @Article{Buhr:1994:TRM, author = "R. J. A. Buhr and R. S. Casselman", title = "Timethread-role maps for object-oriented design of real-time-and-distributed systems", journal = j-SIGPLAN, volume = "29", number = "10", pages = "301--316", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Heuser:1994:DDC, author = "Lutz Heuser and John Dilley and Hari Madduri and Steven Rabin and Shawn Woods", title = "Development of distributed and client\slash server object-oriented applications: industry solutions", journal = j-SIGPLAN, volume = "29", number = "10", pages = "317--323", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Plevyak:1994:PCT, author = "John Plevyak and Andrew A. Chien", title = "Precise Concrete Type Inference for Object-Oriented Languages", journal = j-SIGPLAN, volume = "29", number = "10", pages = "324--340", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "computational expense; concrete type information; concurrent object oriented programs; constraint-based type inference systems; cost; dynamic dispatch; first class functions; flow sensitive global data flow problem; incremental constraint-based type inference; object-oriented languages; object-oriented programming; optimisation; optimization; performance results; precision; program optimization; program structures; running time; selectors; type complexity; type inference; type theory; virtual function global data flow problem; virtual function invocation", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Bogle:1994:RCD, author = "Phillip Bogle and Barbara Liskov", title = "Reducing Cross Domain Call Overhead Using Batched Futures", journal = j-SIGPLAN, volume = "29", number = "10", pages = "341--354", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6150J (Operating systems); C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "batched futures; benchmarks; client code; cost; cross domain call overhead; databases; domain crossings; interrelated client calls; object-oriented database system; object-oriented databases; operating systems; operating systems (computers); performance evaluation; performance results; protection domain; server; Thor object-oriented database system", sponsororg = "ACM", treatment = "P Practical", } @Article{Agesen:1994:SGD, author = "Ole Agesen and David Ungar", title = "Sifting out the gold. {Delivering} compact applications from an exploratory object-oriented programming environment", journal = j-SIGPLAN, volume = "29", number = "10", pages = "355--370", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C4240 (Programming support); C6110J (Object-oriented programming); C6115 (Programming support); C6140D (High level languages)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "application extractor; computed selectors; dynamically-typed programming environment; object-oriented languages; object-oriented programming; object-oriented programming environment; programming environments; reflection; Self; sends; Smalltalk; type inference; type theory", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Atwood:1994:ODP, author = "Thomas Atwood and Jnan Dash and Jacob Stein and Michael Stonebraker and Mary Loomis", title = "Objects and Databases (Panel)", journal = j-SIGPLAN, volume = "29", number = "10", pages = "371--372", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", xxnote = "Yes, second author name really is `Jnan'.", } @Article{Beck:1994:PSW, author = "Bob Beck and Steve Hartley", title = "Persistent Storage for a Workflow Tool Implemented in {Smalltalk}", journal = j-SIGPLAN, volume = "29", number = "10", pages = "373--387", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6160D (Relational DBMS); C6160J (Object-oriented databases); C7100 (Business and administration)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Sequent Comput. Syst., Beaverton, OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "legacy corporate data; object oriented database; object-oriented databases; object-oriented programming; ODBMS; office automation; persistent storage; process description; RDBMS; relational database; relational databases; Smalltalk; workflow; workflow model; workflow status data; workflow tool", sponsororg = "ACM", treatment = "P Practical", } @Article{Resende:1994:SLO, author = "Rodolfo F. Resende and Divyakant Agrawal and Amr El Abbadi", title = "Semantic Locking in Object-Oriented Database Systems", journal = j-SIGPLAN, volume = "29", number = "10", pages = "388--402", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6110 (Systems analysis and programming); C6130 (Data handling techniques); C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "UFMG-ICEx-DCC, Belo Horizonte, Brazil", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "complex objects; composition; computational linguistics; dynamic conflicts; modularity; nested executions; nonstandard applications; object-oriented database systems; object-oriented databases; protocols; rapid prototyping; referentially shared objects; semantic locking protocol; software prototyping; transaction management; transaction processing", sponsororg = "ACM", treatment = "P Practical", } @Article{Onodera:1994:ERC, author = "Tamiya Onodera", title = "Experience with Representing {C++} Program Information in an Object-Oriented Database", journal = j-SIGPLAN, volume = "29", number = "10", pages = "403--413", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems); C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Tokyo Res. Lab., IBM Res., Kanagawa, Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "birth-order clients; birth-order clusterings; C language; C++ program information representation; clients; clustering; death-order clusterings; multiple program translation units; object-oriented database; object-oriented databases; object-oriented languages; object-oriented programming; program compilers; program debugging; program interpreters; programming environments; sharing; sharing-oriented clusterings; storage management; storing program information", sponsororg = "ACM", treatment = "P Practical", } @Article{Carey:1994:SRO, author = "Michael J. Carey and David J. DeWitt and Chander Kant and Jeffrey F. Naughton", title = "A status report on the {OO7 OODBMS} benchmarking effort", journal = j-SIGPLAN, volume = "29", number = "10", pages = "414--426", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6160J (Object-oriented databases)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "007 OODBMS benchmarking effort; faults; multi-user front; multi-user workloads; object-oriented databases; performance evaluation; single-user front; status report", sponsororg = "ACM", treatment = "P Practical", } @Article{Forman:1994:CBA, author = "Ira R. Forman and Scott Danforth and Hari Madduri", title = "Composition of {Before\slash After} metaclasses in {SOM}", journal = j-SIGPLAN, volume = "29", number = "10", pages = "427--439", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6120 (File organisation)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "IBM Object Technol. Products, Austin, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract data types; Before/After Metaclass; class; enabling element; execution; IBM System Object Model; instance method table; instances; invocation; metaclass constraint; object-oriented programming; parents; programming theory; runtime object; SOM", sponsororg = "ACM", treatment = "T Theoretical or Mathematical", } @Article{Danforth:1994:RMP, author = "Scott Danforth and Ira R. Forman", title = "Reflections on Metaclass Programming in {SOM}", journal = j-SIGPLAN, volume = "29", number = "10", pages = "440--452", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6120 (File organisation)", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "IBM Object Technol. Products, Austin, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "constraint; explicit metaclasses; IBM System Object Model; inheritance; metaclass declaration; metaclass incompatibilities; metaclass programming; object-oriented programming; programming theory; SOM", sponsororg = "ACM", treatment = "P Practical", } @Article{Lortz:1994:CCE, author = "Victor B. Lortz and Kang G. Shin", title = "Combining Contracts and Exemplar-Based Programming for Class Hiding and Customization", journal = j-SIGPLAN, volume = "29", number = "10", pages = "453--467", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C5640 (Protocols); C6110J (Object-oriented programming); C6120 (File organisation); C6160 (Database management systems (DBMS))", conflocation = "Portland, OR, USA; 23-27 Oct. 1994", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", corpsource = "Real-Time Comput. Lab., Michigan Univ., Ann Arbor, MI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "class hiding; client applications; client-side software contracts; customization; customized server objects; data encapsulation; database management systems; errors; exemplar-based class factories; exemplar-based programming; libraries; multiple service classes; object-oriented library; object-oriented programming; optimisation; optimizations; priorities; protocols; real-time database system; real-time systems; requirements; service implementations; subroutines; usage patterns", sponsororg = "ACM", treatment = "P Practical", } @Article{Fraser:1994:HDT, author = "Steven Fraser and Kent Beck and Grady Booch and Derek Coleman and Jim Coplien and Richard Helm and Kenny Rubin", title = "How Do Teams Shape Objects? --- How Do Objects Shape Teams?", journal = j-SIGPLAN, volume = "29", number = "10", pages = "468--473", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Thekkath:1994:SDC, author = "Chandramohan A. Thekkath and Henry M. Levy and Edward D. Lazowska", title = "Separating data and control transfer in distributed operating systems", journal = j-SIGPLAN, volume = "29", number = "11", pages = "2--11", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p2-thekkath/", abstract = "Advances in processor architecture and technology have resulted in workstations in the 100+ MIPS range. As well, newer local-area networks such as ATM promise a ten- to hundred-fold increase in throughput, much reduced latency, greater scalability, and greatly increased reliability, when compared to current LANs such as Ethernet. We believe that these new network and processor technologies will permit tighter coupling of distributed systems at the hardware level, and that distributed systems software should be designed to benefit from that tighter coupling. In this paper, we propose an alternative way of structuring distributed systems that takes advantage of a communication model based on remote network access (reads and writes) to protected memory segments. A key feature of the new structure, directly supported by the communication model, is the separation of {\em data transfer\/} and {\em control transfer\/}. This is in contrast to the structure of traditional distributed systems, which are typically organized using message passing or remote procedure call (RPC). In RPC-style systems, data and control are inextricably linked---all RPCs must transfer both data and control, even if the control transfer is unnecessary. We have implemented our model on DECstation hardware connected by an ATM network. We demonstrate how separating data transfer and control transfer can eliminate unnecessary control transfers and facilitate tighter coupling of the client and server. This has the potential to increase performance and reduce server load, which supports scaling in the face of an increasing number of clients. For example, for a small set of file server operations, our analysis shows a 50\% decrease in server load when we switched from a communications mechanism requiring both control transfer and data transfer, to an alternative structure based on pure data transfer.", acknowledgement = ack-nhfb, classification = "B6210L (Computer communications); C5620L (Local area networks); C5630 (Networking equipment); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "asynchronous transfer mode; ATM network; client-server systems; communication model; control transfer; data transfer; DECstation hardware; design; distributed operating systems; distributed systems software; file server operations; file servers; hardware level; local area networks; local-area networks; measurement; network operating systems; performance; processor architecture; protected memory segments; reliability; remote network access; scalability; server load; theory; workstations", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", treatment = "P Practical", } @Article{Chandra:1994:SPM, author = "Rohit Chandra and Scott Devine and Ben Verghese and Anoop Gupta and Mendel Rosenblum", title = "Scheduling and page migration for multiprocessor compute servers", journal = j-SIGPLAN, volume = "29", number = "11", pages = "12--24", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p12-chandra/", abstract = "Several cache-coherent shared-memory multiprocessors have been developed that are scalable and offer a very tight coupling between the processing resources. They are therefore quite attractive for use as compute servers for multiprogramming and parallel application workloads. Process scheduling and memory management, however, remain challenging due to the distributed main memory found on such machines. This paper examines the effects of OS scheduling and page migration policies on the performance of such compute servers. Our experiments are done on the Stanford DASH, a distributed-memory cache-coherent multiprocessor. We show that for our multiprogramming workloads consisting of sequential jobs, the traditional Unix scheduling policy does very poorly. In contrast, a policy incorporating cluster and cache affinity along with a simple page-migration algorithm offers up to two-fold performance improvement. For our workloads consisting of multiple parallel applications, we compare space-sharing policies that divide the processors among the applications to time-slicing policies such as standard Unix or gang scheduling. We show that space-sharing policies can achieve better processor utilization due to the operating point effect, but time-slicing policies benefit strongly from user-level data distribution. Our initial experience with automatic page migration suggests that policies based only on TLB miss information can be quite effective, and useful for addressing the data distribution problems of space-sharing schedulers.", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C6120 (File organisation); C6150J (Operating systems); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; cache affinity; cache coherent shared memory multiprocessors; design; distributed main memory; distributed memory cache coherent multiprocessor; distributed memory systems; experimentation; gang scheduling; measurement; memory management; multiple parallel applications; multiprocessor compute servers; multiprogramming; operating point effect; OS scheduling; page migration; paged storage; parallel application workloads; performance; performance improvement; process scheduling; processing resources; processor scheduling; processor utilization; scheduling policy; sequential jobs; shared memory systems; space sharing policies; Stanford DASH; storage management; theory; time slicing policies; Unix scheduling policy", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling.", treatment = "P Practical", } @Article{Lim:1994:RSA, author = "Beng-Hong Lim and Anant Agarwal", title = "Reactive synchronization algorithms for multiprocessors", journal = j-SIGPLAN, volume = "29", number = "11", pages = "25--35", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p25-lim/", abstract = "Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable run-time factors. The designer of a synchronization algorithm has a choice of {\em protocols\/} to use for implementing the synchronization operation. For example, candidate protocols for locks include test-and-set protocols and queueing protocols. Frequently, the best choice of protocols depends on the level of contention: previous research has shown that test-and-set protocols for locks outperform queueing protocols at low contention, while the opposite is true at high contention. This paper investigates reactive synchronization algorithms that dynamically choose protocols in response to the level of contention. We describe reactive algorithms for spin locks and fetch-and-op that choose among several shared-memory and message-passing protocols. Dynamically choosing protocols presents a challenge: a reactive algorithm needs to select and change protocols efficiently, and has to allow for the possibility that multiple processes may be executing different protocols at the same time. We describe the notion of {\em consensus objects\/} that the reactive algorithms use to preserve correctness in the face of dynamic protocol changes. Experimental measurements demonstrate that reactive algorithms perform close to the {\em best\/} static choice of protocols at all levels of contention. Furthermore, with mixed levels of contention, reactive algorithms outperform passive algorithms with fixed protocols, provided that contention levels do not change too frequently. Measurements of several parallel applications show that reactive algorithms result in modest performance gains for spin locks and significant gains for fetch-and-op.", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C5640 (Protocols); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; consensus objects; contention levels; correctness; design; dynamic protocol changes; experimentation; fetch-and-op; measurement; message passing; message-passing protocols; multiprocessors; parallel applications; performance; protocols; reactive synchronization algorithms; shared memory systems; spin locks; standardization; static choice; synchronisation; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", treatment = "P Practical", } @Article{Heinlein:1994:IMP, author = "John Heinlein and Kourosh Gharachorloo and Scott Dresser and Anoop Gupta", title = "Integration of message passing and shared memory in the {Stanford FLASH} multiprocessor", journal = j-SIGPLAN, volume = "29", number = "11", pages = "38--50", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p38-heinlein/", abstract = "The advantages of using message passing over shared memory for certain types of communication and synchronization have provided an incentive to integrate both models within a single architecture. A key goal of the FLASH (FLexible Architecture for SHared memory) project at Stanford is to achieve this integration while maintaining a simple and efficient design. This paper presents the hardware and software mechanisms in FLASH to support various message passing protocols. We achieve low overhead message passing by delegating protocol functionality to the programmable node controllers in FLASH and by providing direct user-level access to this messaging subsystem. In contrast to most earlier work, we provide an integrated solution that handles the interaction of the messaging protocols with virtual memory, protected multiprogramming, and cache coherence. Detailed simulation studies indicate that this system can sustain message-transfers rates of several hundred megabytes per second, effectively utilizing projected network bandwidths for next generation multiprocessors.", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C5640 (Protocols); C6120 (File organisation); C6150J (Operating systems); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cache coherence; design; direct user-level access; Flexible Architecture for Shared Memory; integrated solution; measurement; message passing; message passing protocols; message transfer rates; messaging subsystem; multiprogramming; next generation multiprocessors; performance; programmable node controllers; protected multiprogramming; protocol functionality; protocols; shared memory; shared memory systems; software mechanisms; standardization; Stanford FLASH multiprocessor; theory; virtual memory; virtual storage", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", treatment = "P Practical", } @Article{Karamcheti:1994:SOM, author = "Vijay Karamcheti and Andrew A. Chien", title = "Software overhead in messaging layers: where does the time go?", journal = j-SIGPLAN, volume = "29", number = "11", pages = "51--60", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p51-karamcheti/", abstract = "Despite improvements in network interfaces and software messaging layers, software communication overhead still dominates the hardware routing cost in most systems. In this study, we identify the sources of this overhead by analyzing software costs of typical communication protocols built atop the active messages layer on the CM-5. We show that up to 50-70\% of the software messaging costs are a direct consequence of the gap between specific network features such as arbitrary delivery order, finite buffering, and limited fault-handling, and the user communication requirements of in-order delivery, end-to-end flow control, and reliable transmission. However, virtually all of these costs can be eliminated if routing networks provide higher-level services such as in-order delivery, end-to-end flow control, and packet-level fault-tolerance. We conclude that significant cost reductions require changing the constraints on messaging layers: we propose designing networks and network interfaces which simplify or replace software for implementing user communication requirements.", acknowledgement = ack-nhfb, classification = "B6150M (Protocols); B6210L (Computer communications); C5440 (Multiprocessing systems); C5610N (Network interfaces); C5640 (Protocols); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "active messages layer; arbitrary delivery order finite buffering; CM-5; communication protocols; cost reductions; cost reductions packet level fault tolerance; design; end-to-end flow control; hardware routing cost; in-order delivery; limited fault handling; measurement; message passing; messaging layers; network features; network interfaces; packet level fault tolerance; parallel machines; performance; protocols; reliable transmission; software communications overhead; software messaging costs; software messaging layers; software overhead; standardization; theory; user communication requirements", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management, Message sending. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**.", treatment = "P Practical", } @Article{Chandra:1994:WTS, author = "Satish Chandra and James R. Larus and Anne Rogers", title = "Where is time spent in message-passing and shared-memory programs?", journal = j-SIGPLAN, volume = "29", number = "11", pages = "61--73", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p61-chandra/", abstract = "Message passing and shared memory are two techniques parallel programs use for coordination and communication. This paper studies the strengths and weaknesses of these two mechanisms by comparing equivalent, well-written message-passing and shared-memory programs running on similar hardware. To ensure that our measurements are comparable, we produced two carefully tuned versions of each program and measured them on closely-related simulators of a message-passing and a shared-memory machine, both of which are based on same underlying hardware assumptions. We examined the behavior and performance of each program carefully. Although the cost of computation in each pair of programs was similar, synchronization and communication differed greatly. We found that message-passing's advantage over shared-memory is not clear-cut. Three of the four shared-memory programs ran at roughly the same speed as their message-passing equivalent, even though their communication patterns were different.", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C6110P (Parallel programming); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "communication patterns; design; hardware assumptions; measurement; message passing; message passing machine; message-passing; parallel programming; parallel programs; performance; shared memory machine; shared memory programs; shared memory systems; shared-memory programs; software performance evaluation; software performance evaluation systems; synchronization; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management, Message sending. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Schmidt:1994:PHA, author = "William J. Schmidt and Kelvin D. Nilsen", title = "Performance of a hardware-assisted real-time garbage collector", journal = j-SIGPLAN, volume = "29", number = "11", pages = "76--85", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schmidt:1994:PHR, author = "William J. Schmidt and Kelvin D. Nilsen", title = "Performance of a hardware-assisted real-time garbage collector", journal = j-SIGPLAN, volume = "29", number = "11", pages = "76--85", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:17 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p76-schmidt/", abstract = "Hardware-assisted real-time garbage collection offers high throughput and small worst-case bounds on the times required to allocate dynamic objects and to access the memory contained within previously allocated objects. Whether the proposed technology is cost effective depends on various choices between configuration alternatives. This paper reports the performance of several different configurations of the hardware-assisted real-time garbage collection system subjected to several different workloads. Reported measurements demonstrate that hardware-assisted real-time garbage collection is a viable alternative to traditional explicit memory management techniques, even for low-level languages like C++.", acknowledgement = ack-nhfb, classification = "C5310 (Storage system design); C5470 (Performance evaluation and testing); C6120 (File organisation)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; configuration alternatives; design; dynamic objects; experimentation; explicit memory management techniques; hardware-assisted real-time garbage collector; languages; measurement; memory architecture; performance; performance evaluation; previously allocated objects; real-time systems; storage allocation; storage management; theory; worst case bounds", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems.", treatment = "P Practical", } @Article{Wu:1994:ENM, author = "Michael Wu and Willy Zwaenepoel", title = "{eNVy}: a non-volatile, main memory storage system", journal = j-SIGPLAN, volume = "29", number = "11", pages = "86--97", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:17 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p86-wu/", abstract = "This paper describes the architecture of eNVy, a large non-volatile main memory storage system built primarily with Flash memory. eNVy presents its storage space as a linear, memory mapped array rather than as an emulated disk in order to provide an efficient and easy to use software interface. Flash memories provide persistent storage with solid-state memory access times at a lower cost than other solid-state technologies. However, they have a number of drawbacks. Flash chips are write-once, bulk-erase devices whose contents cannot be updated in-place. They also suffer from slow program times and a limit on the number of program/erase cycles. eNVy uses a copy-on-write scheme, page remapping, a small amount of battery backed SRAM, and high bandwidth parallel data transfers to provide low latency, in-place update semantics. A cleaning algorithm optimized for large Flash arrays is used to reclaim space. The algorithm is designed to evenly wear the array, thereby extending its lifetime. Software simulations of a 2 gigabyte eNVy system show that it can support I/O rates corresponding to approximately 30,000 transactions per second on the TPC-A database benchmark. Despite the added work done to overcome the deficiencies associated with Flash memories, average latencies to the storage system are as low as 180ns for reads and 200ns for writes. The estimated lifetime of this type of storage system is in the 10 year range when exposed to a workload of 10,000 transactions per second.", acknowledgement = ack-nhfb, classification = "C5310 (Storage system design); C5320G (Semiconductor storage)C6120 (File organisation)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Electr. and Comput. Eng., Rice Univ., Houston, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "battery backed SRAM; cleaning algorithm; copy-on-write scheme; design; emulated disk; eNVy; file organisation; Flash memory; high bandwidth parallel data transfers; large Flash arrays; linear memory mapped array; measurement; memory architecture; nonvolatile main memory storage system; page remapping; performance; performance evaluation; persistent storage; program erase cycles; random-access storage; reliability; slow program times; software interface; solid-state memory access times; storage space; theory; user interfaces; user interfaces evaluation; write-once bulk-erase devices", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Main memory.", treatment = "P Practical", } @Article{Wu:1994:ENV, author = "Michael Wu and Willy Zwaenepoel", title = "{eNVy}: a non-volatile, main memory storage system", journal = j-SIGPLAN, volume = "29", number = "11", pages = "86--97", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Upton:1994:RAH, author = "Michael Upton and Thomas Huff and Trevor Mudge and Richard Brown", title = "Resource allocation in a high clock rate microprocessor", journal = j-SIGPLAN, volume = "29", number = "11", pages = "98--109", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p98-upton/", abstract = "This paper discusses the design of a high clock rate (300 MHz) processor. The architecture is described, and the goals for the design are explained. The performance of three processor models is evaluated using trace-driven simulation. A cost model is used to estimate the resources required to build processors with varying sizes of on-chip memories, in both single and dual issue models. Recommendations are then made to increase the effectiveness of each of the models.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI, USA", classification = "C5130 (Microprocessor chips); C5220 (Computer architecture); C5230 (Digital arithmetic methods); C6150J (Operating systems)", confdate = "4-7 Oct. 1994", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", confsponsor = "ACM; IEEE Comput. Soc", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "computer architecture; Cost model; cost model; design; floating point arithmetic; Floating point latency; floating point latency; High clock rate microprocessor; high clock rate microprocessor; measurement; microprocessor chips; Nonblocking cache; nonblocking cache; On-chip memories; on-chip memories; performance; performance evaluation; Pipelining; pipelining; Prefetching; prefetching; Processor model performance; processor model performance; Resource allocation; resource allocation; theory; Trace-driven simulation; trace-driven simulation; virtual machines", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Pipeline processors**. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", thesaurus = "Computer architecture; Floating point arithmetic; Microprocessor chips; Performance evaluation; Resource allocation; Virtual machines", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Thekkath:1994:HSS, author = "Chandramohan A. Thekkath and Henry M. Levy", title = "Hardware and software support for efficient exception handling", journal = j-SIGPLAN, volume = "29", number = "11", pages = "110--119", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p110-thekkath/", abstract = "Program-synchronous exceptions, for example, breakpoints, watchpoints, illegal opcodes, and memory access violations, provide information about {\em exceptional\/} conditions, interrupting the program and vectoring to an operating system handler. Over the last decade, however, programs and run-time systems have increasingly employed these mechanisms as a performance optimization to detect {\em normal\/} and {\em expected\/} conditions. Unfortunately, current architecture and operating system structures are designed for exceptional or erroneous conditions, where performance is of secondary importance, rather than normal conditions. Consequently, this has limited the practicality of such hardware-based detection mechanisms. We propose both hardware and software structures that permit efficient handling of synchronous exceptions by user-level code. We demonstrate a software implementation that reduces exception-delivery cost by an order-of-magnitude on current RISC processors, and show the performance benefits of that mechanism for several example applications.", acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6130 (Data handling techniques); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "breakpoints; design; erroneous conditions; exception delivery cost; exception delivery synchronous exceptions; exception handling; hardware support; hardware-based detection mechanisms; illegal opcodes; languages; measurement; memory access violation; operating system handler; operating systems (computers); optimisation; performance; performance benefits; performance optimization; program-synchronous exceptions; reduced instruction set computing; RISC processors; run-time systems; software support; synchronous exceptions; theory; user-level code; watchpoints", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Argade:1994:TMR, author = "Pramod V. Argade and David K. Charles and Craig Taylor", title = "A technique for monitoring run-time dynamics of an operating system and a microprocessor executing user applications", journal = j-SIGPLAN, volume = "29", number = "11", pages = "122--131", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p122-argade/", abstract = "In this paper, we present a non-invasive and efficient technique for simulating applications complete with their operating system interaction. The technique involves booting and initiating an application on a hardware development system, capturing the entire state of the application and the microprocessor at a well defined point in execution and then simulating the application on microprocessor simulators. Extensive statistics generated from the simulators on run-time dynamics of the application, the operating system as well as the microprocessor enabled us to tune the operating system and the microprocessor architecture and implementation. The results also enabled us to optimize system level design choices by anticipating/predicting the performance of the target system. Lastly, the results were used to adjust and refocus the evolution of the architecture of both the operating system and the microprocessor.", acknowledgement = ack-nhfb, classification = "C5430 (Microcomputers); C5470 (Performance evaluation and testing); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "AT and T Bell Labs., Allentown, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "application simulation; computer architecture; design; hardware development system; measurement; microcomputers; microprocessor; microprocessor architecture; microprocessor simulators; operating system; operating system interaction; operating systems (computers); performance; performance evaluation; reliability; run-time dynamics; run-time dynamics monitoring; statistics; system level design; system monitoring; theory; user applications; virtual machines virtual machines", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Monitors. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Uhlig:1994:TDS, author = "Richard Uhlig and David Nagle and Trevor Mudge and Stuart Sechrest", title = "Trap-driven simulation with {Tapeworm II}", journal = j-SIGPLAN, volume = "29", number = "11", pages = "132--144", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Uhlig:1994:TST, author = "Richard Uhlig and David Nagle and Trevor Mudge and Stuart Sechrest", title = "Trap-driven simulation with {Tapeworm II}", journal = j-SIGPLAN, volume = "29", number = "11", pages = "132--144", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:17 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p132-uhlig/", abstract = "Tapeworm II is a software-based simulation tool that evaluates the cache and TLB performance of multiple-task and operating system intensive workloads. Tapeworm resides in an OS kernel and causes a host machine's hardware to drive simulations with kernel traps instead of with address traces, as is conventionally done. This allows Tapeworm to quickly and accurately capture complete memory referencing behavior with a limited degradation in overall system performance. This paper compares trap-driven simulation, as implemented in Tapeworm, with the more common technique of trace-driven memory simulation with respect to speed, accuracy, portability and flexibility.", acknowledgement = ack-nhfb, classification = "C5470 (Performance evaluation and testing); C6150J (Operating systems); C6185 (Simulation techniques); C7430 (Computer engineering)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "accuracy; address traces; algorithms; cache; cache storage; design; flexibility; host machine; kernel traps; measurement; memory referencing behavior; multiple-task; operating system intensive workloads; operating system kernel; operating system kernels; performance; performance evaluation; portability; reliability; software portability; software-based simulation tool; speed; system performance; Tapeworm II; theory; trace-driven memory simulation; trap-driven simulation; virtual machines", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Modeling and prediction. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", treatment = "P Practical", } @Article{Maynard:1994:CCC, author = "Ann Marie Grizzaffi Maynard and Colette M. Donnelly and Bret R. Olszewski", title = "Contrasting characteristics and cache performance of technical and multi-user commercial workloads", journal = j-SIGPLAN, volume = "29", number = "11", pages = "145--156", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p145-maynard/", abstract = "Experience has shown that many widely used benchmarks are poor predictors of the performance of systems running commercial applications. Research into this anomaly has long been hampered by a lack of address traces from representative multi-user commercial workloads. This paper presents research, using traces of industry-standard commercial benchmarks, which examines the characteristic differences between technical and commercial workloads and illustrates how those differences affect cache performance. Commercial and technical environments differ in their respective branch behavior, operating system activity, I/O, and dispatching characteristics. A wide range of uniprocessor instruction and data cache geometries were studied. The instruction cache results for commercial workloads demonstrate that instruction cache performance can no longer be neglected because these workloads have much larger code working sets than technical applications. For database workloads, a breakdown of kernel and user behavior reveals that the application component can exhibit behavior similar to the operating system and therefore, can experience miss rates equally high. This paper also indicates that ``dispatching'' or process switching characteristics must be considered when designing level-two caches. The data presented shows that increasing the associativity of second-level caches can reduce miss rates significantly. Overall, the results of this research should help system designers choose a cache configuration that will perform well in commercial markets.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C5470 (Performance evaluation and testing); C6120 (File organisation); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "IBM Corp., Austin, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "address traces; cache performance; cache storage; commercial applications; commercial workloads; data cache geometries; database workloads; design; dispatching; experimentation; industry-standard commercial benchmark; instruction cache; instruction cache performance; level-two cache design; measurement; multi-access systems; multi-user commercial workloads; operating system; operating system activity; operating systems (computers); performance; performance evaluation; process switching; systems performance; theory; uniprocessor instruction; user behavior", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance.", treatment = "P Practical", } @Article{Bershad:1994:ACM, author = "Brian N. Bershad and Dennis Lee and Theodore H. Romer and J. Bradley Chen", title = "Avoiding conflict misses dynamically in large direct-mapped caches", journal = j-SIGPLAN, volume = "29", number = "11", pages = "158--170", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p158-bershad/", abstract = "This paper describes a method for improving the performance of a large direct-mapped cache by reducing the number of conflict misses. Our solution consists of two components: an inexpensive hardware device called a Cache Miss Lookaside (CML) buffer that detects conflicts by recording and summarizing a history of cache misses, and a software policy within the operating system's virtual memory system that removes conflicts by dynamically remapping pages whenever large numbers of conflict misses are detected. Using trace-driven simulation of applications and the operating system, we show that a CML buffer enables a large direct-mapped cache to perform nearly as well as a two-way set associative cache of equivalent size and speed, although with lower hardware cost and complexity.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C5470 (Performance evaluation and testing); C6120 (File organisation); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "associative cache; Cache Miss Lookaside buffer; cache performance; cache storage; CML buffer; complexity; conflict detection; conflict misses; design; hardware cost; hardware device; large direct-mapped cache; large direct-mapped caches; measurement; operating system; operating systems (computers); performance; performance evaluation; software policy; theory; trace-driven simulation; virtual machines; virtual memory system; virtual storage", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management, Buffering.", treatment = "P Practical", } @Article{Talluri:1994:STP, author = "Madhusudhan Talluri and Mark D. Hill", title = "Surpassing the {TLB} performance of superpages with less operating system support", journal = j-SIGPLAN, volume = "29", number = "11", pages = "171--182", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p171-talluri/", abstract = "Many commercial microprocessor architectures have added {\em translation lookaside buffer\/} (TLB) support for {\em superpages\/}. Superpages differ from segments because their size must be a power of two multiple of the base page size and they must be aligned in both virtual and physical address spaces. Very large superpages (e.g., 1MB) are clearly useful for mapping special structures, such as kernel data or frame buffers. This paper considers the architectural and operating system support required to exploit medium-sized superpages (e.g., 64KB, i.e., sixteen times a 4KB base page size). First, we show that superpages improve TLB performance only after invasive operating system modifications that introduce considerable overhead. We then propose two subblock TLB designs as alternate ways to improve TLB performance. Analogous to a subblock cache, a {\em complete-subblock TLB\/} associates a tag with a superpage-sized region but has valid bits, physical page number, attributes, etc., for each possible base page mapping. A {\em partial-subblock TLB\/} entry is much smaller than a complete-subblock TLB entry, because it shares physical page number and attribute fields across base page mappings. A drawback of a partial-subblock TLB is that base page mappings can share a TLB entry only if they map to consecutive physical pages and have the same attributes. We propose a physical memory allocation algorithm, {\em page reservation\/}, that makes this sharing more likely. When page reservation is used, experimental results show partial-subblock TLBs perform better than superpage TLBs, while requiring simpler operating system changes. If operating system changes are inappropriate, however, complete-subblock TLBs perform best.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C6120 (File organisation); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; attributes; base page mapping; base page size; cache storage; commercial microprocessor architectures; complete-subblock TLB entry; design; frame buffers; invasive operating system modification; kernel data; measurement; medium sized superpages; memory architecture; operating system support; operating systems (computers); paged storage; partial-subblock TLB entry; performance; physical address spaces; physical memory allocation algorithm physical memory allocation algorithm; physical page number; physical pages; software performance evaluation; storage allocation storage allocation; subblock cache; superpages; theory; TLB performance; translation lookaside buffer; valid bits; very large superpages; virtual address spaces", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management, Buffering. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance.", treatment = "P Practical", } @Article{Gallagher:1994:DMD, author = "David M. Gallagher and William Y. Chen and Scott A. Mahlke and John C. Gyllenhaal and Wen-mei W. Hwu", title = "Dynamic memory disambiguation using the memory conflict buffer", journal = j-SIGPLAN, volume = "29", number = "11", pages = "183--193", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p183-gallagher/", abstract = "To exploit instruction level parallelism, compilers for VLIW and superscalar processors often employ static code scheduling. However, the available code reordering may be severely restricted due to ambiguous dependences between memory instructions. This paper introduces a simple hardware mechanism, referred to as the {\em memory conflict buffer\/}, which facilitates static code scheduling in the presence of memory store/load dependences. Correct program execution is ensured by the memory conflict buffer and repair code provided by the compiler. With this addition, significant speedup over an aggressive code scheduling model can be achieved for both non-numerical and numerical programs.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Center for Reliable and High Performance Comput., Illinois Univ., Urbana, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "aggressive code scheduling model; algorithms; buffer storage; code reordering; compiler; design; dynamic memory disambiguation; experimentation; instruction level parallelism; languages; load dependences; measurement; memory conflict buffer; memory instructions; memory static code scheduling; memory store; nonnumerical programs; numerical programs; parallel programming; performance; program compilers; program execution; repair code; scheduling; simple hardware mechanism; static code scheduling; storage management; superscalar processors; theory; VLIW", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management, Buffering. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Hayashi:1994:AAS, author = "Kenichi Hayashi and Tsunehisa Doi and Takeshi Horie and Yoichi Koyanagi and Osamu Shiraki and Nobutaka Imamura and Toshiyuki Shimizu and Hiroaki Ishihata and Tatsuya Shindo", title = "{AP1000+}: architectural support of {PUT\slash GET} interface for parallelizing compiler", journal = j-SIGPLAN, volume = "29", number = "11", pages = "196--207", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p196-hayashi/", abstract = "The scalability of distributed-memory parallel computers makes them attractive candidates for solving large-scale problems. New languages, such as HPF, FortranD, and VPP Fortran, have been developed to enable existing software to be easily ported to such machines. Many distributed-memory parallel computers have been built, but none of them support the mechanisms required by such languages. We studied the mechanisms required by parallelizing compilers and proposed a new architecture to support them. Based on this proposed architecture, we developed a new distributed-memory parallel computer, the AP1000+, which is an enhanced version of the AP1000. Using scientific applications in VPP Fortran and C, such as NAS parallel benchmarks, we simulated the performance of the AP1000+.", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C6150C (Compilers, interpreters and other processors)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Fujitsu Labs. Ltd., Kawasaki, Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "AP1000; AP1000+; architectural support; C; design; distributed memory systems; distributed-memory parallel computers; FortranD; HPF; languages; large-scale problem solving; measurement; NAS parallel benchmarks; parallel architectures; parallel machines; parallelising compilers; parallelizing compiler; performance; performance evaluation; performance simulation; PUT/GET interface; reconfigurable architectures; scalability; scientific applications; software portability; theory; VPP Fortran", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Distributed memories. {\bf C.0} Computer Systems Organization, GENERAL, Hardware/software interfaces.", treatment = "P Practical", } @Article{Larus:1994:LMS, author = "James R. Larus and Brad Richards and Guhan Viswanathan", title = "{LCM}: memory system support for parallel language implementation", journal = j-SIGPLAN, volume = "29", number = "11", pages = "208--218", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p208-larus/", abstract = "Higher-level parallel programming languages can be difficult to implement efficiently on parallel machines. This paper shows how a flexible, compiler-controlled memory system can help achieve good performance for language constructs that previously appeared too costly to be practical. Our compiler-controlled memory system is called Loosely Coherent Memory (LCM). It is an example of a larger class of Reconcilable Shared Memory (RSM) systems, which generalize the replication and merge policies of cache-coherent shared-memory. RSM protocols differ in the action taken by a processor in response to a {\em request\/} for a location and the way in which a processor {\em reconciles\/} multiple outstanding copies of a location. LCM memory becomes temporarily inconsistent to implement the semantics of C** parallel functions efficiently. RSM provides a compiler with control over memory-system policies, which it can use to implement a language's semantics, improve performance, or detect errors. We illustrate the first two points with LCM and our compiler for the data-parallel language C**.", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6130 (Data handling techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C** data-parallel language; C** parallel functions; C** protocols; cache-coherent shared-memory; design; error detection; flexible compiler-controlled memory system; higher-level parallel programming languages; language constructs; language semantics; languages; LCM; Loosely Coherent Memory; measurement; memory system support; merge policies; merging; multiple outstanding copies; parallel language implementation; parallel languages; parallel machines; performance; processor; program compilers; reconcilable shared memory systems; replication policies; RSM protocols; shared memory systems; software performance evaluation; standardization; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent C. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", treatment = "P Practical", } @Article{Woo:1994:PAI, author = "Steven Cameron Woo and Jaswinder Pal Singh and John L. Hennessy", title = "The performance advantages of integrating block data transfer in cache-coherent multiprocessors", journal = j-SIGPLAN, volume = "29", number = "11", pages = "219--229", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p219-woo/", abstract = "Integrating support for block data transfer has become an important emphasis in recent cache-coherent shared address space multiprocessors. This paper examines the potential performance benefits of adding this support. A set of ambitious hardware mechanisms is used to study performance gains in five important scientific computations that appear to be good candidates for using block transfer. Our conclusion is that the benefits of block transfer are not substantial for hardware cache-coherent multiprocessors. The main reasons for this are (i) the relatively modest fraction of time applications spend in communication amenable to block transfer, (ii) the difficulty of finding enough independent computation to overlap with the communication latency that remains after block transfer, and (iii) long cache lines often capture many of the benefits of block transfer in efficient cache-coherent machines. In the cases where block transfer improves performance, prefetching can often provide comparable, if not superior, performance benefits. We also examine the impact of varying important communication parameters and processor speed on the effectiveness of block transfer, and comment on useful features that a block transfer facility should support for real applications.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C6120 (File organisation)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; block data transfer integration; cache storage; cache-coherent shared address space multiprocessors; communication latency; communication parameters; design; experimentation; hardware mechanisms; measurement; performance; performance advantages; performance evaluation; prefetching; processor speed; scientific computations; shared memory systems; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories.", treatment = "P Practical", } @Article{Young:1994:IAS, author = "Cliff Young and Michael D. Smith", title = "Improving the accuracy of static branch prediction using branch correlation", journal = j-SIGPLAN, volume = "29", number = "11", pages = "232--241", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p232-young/", abstract = "Recent work in history-based branch prediction uses novel hardware structures to capture branch correlation and increase branch prediction accuracy. We present a profile-based code transformation that exploits branch correlation to improve the accuracy of static branch prediction schemes. Our general method encodes branch history information in the program counter through the duplication and placement of program basic blocks. For correlation histories of eight branches, our experimental results achieve up to a 14.7\% improvement in prediction accuracy over conventional profile-based prediction without any increase in the dynamic instruction count of our benchmark applications. In the majority of these applications, code duplication increases code size by less than 30\%. For the few applications with code segments that exhibit exponential branching paths and no branch correlation, simple compile-time heuristics can eliminate these branches as code-transformation candidates.", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150G (Diagnostic, testing, debugging and software); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Div. of Appl. Sci., Harvard Univ., Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; benchmark application; branch correlation; branch prediction accuracy; code duplication; code segments; code size; code transformation candidates; compile-time heuristics; correlation histories; design; dynamic instruction count; exponential branching paths; hardware structures; history based branch prediction; measurement; parallel programming; performance; profile based code transformation; program basic block; program counter; program diagnostics; reliability; static branch prediction; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Calder:1994:RBC, author = "Brad Calder and Dirk Grunwald", title = "Reducing branch costs via branch alignment", journal = j-SIGPLAN, volume = "29", number = "11", pages = "242--251", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p242-calder/", abstract = "Several researchers have proposed algorithms for basic block reordering. We call these {\em branch alignment\/} algorithms. The primary emphasis of these algorithms has been on improving instruction cache locality, and the few studies concerned with branch prediction reported small or minimal improvements. As wide-issue architectures become increasingly popular the importance of reducing branch costs will increase, and branch alignment is one mechanism which can effectively reduce these costs. In this paper, we propose an improved branch alignment algorithm that takes into consideration the architectural cost model and the branch prediction architecture when performing the basic block reordering. We show that branch alignment algorithms can improve a broad range of static and dynamic branch prediction architectures. We also show that a program performance can be improved by approximately 5\% even when using recently proposed, highly accurate branch prediction architectures. The programs are compiled by any existing compiler and then transformed via binary transformations. When implementing these algorithms on a Alpha AXP 21604 up to a 16\% reduction in total execution time is achieved.", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture)C6150C (Compilers, interpreters and other processors); C5440 (Multiprocessing systems); C6110P (Parallel programming)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Alpha AXP 21604; Alpha AXP 21604 transformations; architectural cost model; basic block reordering; binary transformations; branch alignment algorithms; branch costs; branch prediction architecture; compiler; design; experimentation; instruction cache locality; measurement; parallel architectures; parallel programming; performance; pipeline processing; program compilers; program performance; theory; wide-issue architectures", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Carr:1994:COI, author = "Steve Carr and Kathryn S. McKinley and Chau--Wen Tseng", title = "Compiler optimizations for improving data locality", journal = j-SIGPLAN, volume = "29", number = "11", pages = "252--262", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p252-carr/", abstract = "In the past decade, processor speed has become significantly faster than memory speed. Small, fast cache memories are designed to overcome this discrepancy, but they are only effective when programs exhibit {\em data locality\/}. In this paper, we present compiler optimizations to improve data locality based on a simple yet accurate cost model. The model computes both {\em temporal\/} and {\em spatial\/} reuse of cache lines to find desirable loop organizations. The cost model drives the application of compound transformations consisting of loop permutation, loop fusion, loop distribution, and loop reversal. We demonstrate that these program transformations are useful for optimizing many programs. To validate our optimization strategy, we implemented our algorithms and ran experiments on a large collection of scientific programs and kernels. Experiments with kernels illustrate that our model and algorithm can select and achieve the best performance. For over thirty complete applications, we executed the original and transformed versions and simulated cache hit rates. We collected statistics about the inherent characteristics of these programs and our ability to improve their data locality. To our knowledge, these studies are the first of such breadth and depth. We found performance improvements were difficult to achieve because benchmark programs typically have high hit rates even for small data caches; however, our optimizations significantly improved several programs.", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Michigan Technol. Univ., Houghton, MI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; benchmark programs; cache lines; cache storage; compiler optimizations; compound transformations; cost model; data locality; design; desirable loop organizations; languages; loop distribution; loop fusion; loop permutation; loop reversal; measurement; optimising compilers; optimization strategy; performance; scientific programs; simulated cache hit rates; software cost estimation; spatial; spatial reuse; storage management; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Engler:1994:DER, author = "Dawson R. Engler and Todd A. Proebsting", title = "{DCG}: an efficient, retargetable dynamic code generation system", journal = j-SIGPLAN, volume = "29", number = "11", pages = "263--272", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p263-engler/", abstract = "Dynamic code generation allows aggressive optimization through the use of runtime information. Previous systems typically relied on ad hoc code generators that were not designed for retargetability, and did not shield the client from machine-specific details. We present a system, {\em dcg\/}, that allows clients to specify dynamically generated code in a machine-independent manner. Our one-pass code generator is easily retargeted and extremely efficient (code generation costs approximately 350 instructions per generated instruction). Experiments show that dynamic code generation increases some application speeds by over an order of magnitude.", acknowledgement = ack-nhfb, classification = "C6115 (Programming support); C6150C (Compilers, interpreters and other processors)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "aggressive optimization; application generators; automatic programming; DCG; design; dynamically generated code; experimentation; languages; machine-independent; measurement; one-pass code generator; optimising compilers; performance; retargetable dynamic code generation system; runtime information; theory", remark = "{\tt dcg} is based on {\tt lcc}.", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", treatment = "P Practical", } @Article{Heinrich:1994:PIF, author = "Mark Heinrich and Jeffrey Kuskin and David Ofelt and John Heinlein and Joel Baxter and Jaswinder Pal Singh and Richard Simoni and Kourosh Gharachorloo and David Nakahira and Mark Horowitz and Anoop Gupta and Mendel Rosenblum and John Hennessy", title = "The performance impact of flexibility in the {Stanford FLASH} multiprocessor", journal = j-SIGPLAN, volume = "29", number = "11", pages = "274--285", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p274-heinrich/", abstract = "A flexible communication mechanism is a desirable feature in multiprocessors because it allows support for multiple communication protocols, expands performance monitoring capabilities, and leads to a simpler design and debug process. In the Stanford FLASH multiprocessor, flexibility is obtained by requiring all transactions in a node to pass through a programmable node controller, called MAGIC. In this paper, we evaluate the performance costs of flexibility by comparing the performance of FLASH to that of an idealized hardwired machine on representative parallel applications and a multiprogramming workload. To measure the performance of FLASH, we use a detailed simulator of the FLASH and MAGIC designs, together with the code sequences that implement the cache-coherence protocol. We find that for a range of optimized parallel applications the performance differences between the idealized machine and FLASH are small. For these programs, either the miss rates are small or the latency of the programmable protocol can be hidden behind the memory access time. For applications that incur a large number of remote misses or exhibit substantial hot-spotting, performance is poor for both machines, though the increased remote access latencies or the occupancy of MAGIC lead to lower performance for the flexible design. In most cases, however, FLASH is only 2\%-12\% slower than the idealized machine.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing); C6120 (File organisation); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cache storage; cache-coherence protocol; code sequences; design; experimentation; flexible communication mechanism; hardwired machine; MAGIC; measurement; multiple communication protocols; multiprogramming; multiprogramming workload; optimized parallel applications; parallel applications; performance; performance costs; performance differences; performance evaluation; performance impact; performance monitoring capabilities; programmable node controller; remote access latencies; shared memory systems; Stanford FLASH multiprocessor; storage management; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", treatment = "P Practical", } @Article{Skeppstedt:1994:SCA, author = "Jonas Skeppstedt and Per Stenstr{\"o}m", title = "Simple compiler algorithms to reduce ownership overhead in cache coherence protocols", journal = j-SIGPLAN, volume = "29", number = "11", pages = "286--296", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p286-skeppstedt/", abstract = "We study in this paper the design and efficiency of compiler algorithms that remove ownership overhead in shared-memory multiprocessors with write-invalidate protocols. These algorithms detect loads followed by stores to the same address. Such loads are marked and constitute a hint to the cache to obtain an exclusive copy of the block. We consider three algorithms where the first one focuses on load-store sequences within each basic block of code and the other two analyse the existence of load-store sequences across basic blocks at the intra-procedural level. Since the dataflow analysis we adopt is a trivial variation of live-variable analysis, the algorithms are easily incorporated into a compiler. Through detailed simulations of a cache-coherent NUMA architecture using five scientific parallel benchmark programs, we find that the algorithms are capable of removing over 95\% of the separate ownership acquisitions. Moreover, we also find that even the simplest algorithm is comparable in efficiency with previously proposed hardware-based adaptive cache coherence protocols to attack the same problem.", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Eng., Lund Univ., Sweden", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; cache coherence protocols; cache storage; cache-coherent NUMA architecture; compiler algorithms; dataflow analysis; design; exclusive copy; experimentation; hardware based adaptive protocols; hardware parallel benchmark programs; intraprocedural level; languages; live variable analysis; load-store sequences; measurement; ownership acquisitions; ownership overhead; parallel programming; performance; program compilers; protocols; scientific parallel benchmark programs; shared memory multiprocessors; shared memory systems; standardization; storage management; theory; write-invalidate protocols", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories.", treatment = "P Practical", } @Article{Schoinas:1994:FAC, author = "Ioannis Schoinas and Babak Falsafi and Alvin R. Lebeck and Steven K. Reinhardt and James R. Larus and David A. Wood", title = "Fine-grain access control for distributed shared memory", journal = j-SIGPLAN, volume = "29", number = "11", pages = "297--306", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:17 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p297-schoinas/", abstract = "This paper discusses implementations of fine-grain memory access control, which selectively restricts reads and writes to cache-block-sized memory regions. Fine-grain access control forms the basis of efficient cache-coherent shared memory. This paper focuses on low-cost implementations that require little or no additional hardware. These techniques permit efficient implementation of shared memory on a wide range of parallel systems, thereby providing shared-memory codes with a portability previously limited to message passing. This paper categorizes techniques based on where access control is enforced and where access conflicts are handled. We incorporated three techniques that require no additional hardware into Blizzard, a system that supports distributed shared memory on the CM-5. The first adds a software lookup before each shared-memory reference by modifying the program's executable. The second uses the memory's error correcting code (ECC) as cache-block valid bits. The third is a hybrid. The software technique ranged from slightly faster to two times slower than the ECC approach. Blizzard's performance is roughly comparable to a hardware shared-memory machine. These results argue that clusters of workstations or personal computers with networks comparable to the CM-5's will be able to support the same shared-memory interfaces as supercomputers.", acknowledgement = ack-nhfb, classification = "C5220P (Parallel architecture); C5320G (Semiconductor storage); C5440 (Multiprocessing systems); C6120 (File organisation)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "access conflicts; Blizzard; block-sized memory regions; cache block valid bits; cache storage; cache-block-sized memory regions; cache-coherent shared memory; CM-5; design; distributed memory systems; distributed shared memory; ECC approach; error correcting code; fine-grain access control; low-cost implementations; measurement; parallel machines; parallel systems; performance; portability; security; shared memory codes; shared memory interfaces; shared memory reference; shared memory systems; software lookup; storage management; supercomputers; theory", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Distributed memories. {\bf D.4.6} Software, OPERATING SYSTEMS, Security and Protection, Access controls.", treatment = "P Practical", } @Article{Schoinas:1994:FGA, author = "Ioannis Schoinas and Babak Falsafi and Alvin R. Lebeck and Steven K. Reinhardt and James R. Larus and David A. Wood", title = "Fine-grain access control for distributed shared memory", journal = j-SIGPLAN, volume = "29", number = "11", pages = "297--306", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Laudon:1994:IMT, author = "James Laudon and Anoop Gupta and Mark Horowitz", title = "Interleaving: a multithreading technique targeting multiprocessors and workstations", journal = j-SIGPLAN, volume = "29", number = "11", pages = "308--318", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p308-laudon/", abstract = "There is an increasing trend to use commodity microprocessors as the compute engines in large-scale multiprocessors. However, given that the majority of the microprocessors are sold in the workstation market, not in the multiprocessor market, it is only natural that architectural features that benefit only multiprocessors are less likely to be adopted in commodity microprocessors. In this paper, we explore multiple-context processors, an architectural technique proposed to hide the large memory latency in multiprocessors. We show that while current multiple-context designs work reasonably well for multiprocessors, they are ineffective in hiding the much shorter uniprocessor latencies using the limited parallelism found in workstation environments. We propose an alternative design that combines the best features of two existing approaches, and present simulation results that show it yields better performance for both multiprogrammed workloads on a workstation and parallel applications on a multiprocessor. By addressing the needs of the workstation environment, our proposal makes multiple contexts more attractive for commodity microprocessors.", acknowledgement = ack-nhfb, classification = "C5430 (Microcomputers); C5440 (Multiprocessing systems); C6120 (File organisation); C6150J (Operating systems)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "architectural features; commodity microprocessors; compute engines; design; interleaved storage; interleaving; large memory latency; large-scale multiprocessors; measurement; multiple-context designs; multiple-context processors; multiprocessing systems; multiprogrammed workloads; multiprogramming; multithreading technique; parallel applications; parallel uniprocessor latencies; performance; theory; uniprocessor latencies; workstations", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.5.3} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Microcomputers. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Carter:1994:HSF, author = "Nicholas P. Carter and Stephen W. Keckler and William J. Dally", title = "Hardware support for fast capability-based addressing", journal = j-SIGPLAN, volume = "29", number = "11", pages = "319--327", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p319-carter/", abstract = "Traditional methods of providing protection in memory systems do so at the cost of increased context switch time and/or increased storage to record access permissions for processes. With the advent of computers that supported cycle-by-cycle multithreading, protection schemes that increase the time to perform a context switch are unacceptable, but protecting unrelated processes from each other is still necessary if such machines are to be used in non-trusting environments. This paper examines {\em guarded pointers\/}, a hardware technique which uses tagged 64-bit pointer objects to implement capability-based addressing. Guarded pointers encode a segment descriptor into the upper bits of every pointer, eliminating the indirection and related performance penalties associated with traditional implementations of capabilities. All processes share a single 54-bit virtual address space, and access is limited to the data that can be referenced through the pointers that a process has been issued. Only one level of address translation is required to perform a memory reference. Sharing data between processes is efficient, and protection states are defined to allow fast protected subsystem calls and create unforgeable data keys.", acknowledgement = ack-nhfb, classification = "C5310 (Storage system design); C6120 (File organisation); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "54- bit virtual address space; address translation; capability based addressing; cycle-by-cycle multithreading; design; fast capability-based addressing; fast protected subsystem calls; guarded pointers; hardware support; hardware technique; memory architecture; memory bit virtual address space; memory reference; memory systems; multiprocessing programs; performance; protection schemes; protection states; segment descriptor; storage allocation; tagged 64-bit pointer objects; theory; unforgeable data keys; virtual storage", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Thekkath:1994:EMH, author = "Radhika Thekkath and Susan J. Eggers", title = "The effectiveness of multiple hardware contexts", journal = j-SIGPLAN, volume = "29", number = "11", pages = "328--337", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:57 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p328-thekkath/", abstract = "Multithreaded processors are used to tolerate long memory latencies. By executing threads loaded in multiple hardware contexts, an otherwise idle processor can keep busy, thus increasing its utilization. However, the larger size of a multi-thread working set can have a negative effect on cache conflict misses. In this paper we evaluate the two phenomena together, examining their combined effect on execution time. The usefulness of multiple hardware contexts depends on: program data locality, cache organization and degree of multiprocessing. Multiple hardware contexts are most effective on programs that have been optimized for data locality. For these programs, execution time dropped with increasing contexts, over widely varying architectures. With unoptimized applications, multiple contexts had limited value. The best performance was seen with only two contexts, and only on uniprocessors and small multiprocessors. The behavior of the unoptimized applications changed more noticeably with variations in cache associativity and cache hierarchy, unlike the optimized programs. As a mechanism for exploiting program parallelism, an additional processor is clearly better than another context. However, there were many configurations for which the addition of a few hardware contexts brought as much or greater performance than a larger multiprocessor with fewer than the optimal number of contexts.", acknowledgement = ack-nhfb, classification = "C5320G (Semiconductor storage); C5440 (Multiprocessing systems); C6110P (Parallel programming); C6120 (File organisation); C6150N (Distributed systems software)", conflocation = "San Jose, CA, USA; 4-7 Oct. 1994", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "cache associativity; cache conflict misses; cache hierarchy; cache organization; cache storage; data locality; design; long; long memory latencies; measurement; multi-thread working set; multiple hardware contexts; multiprocessing; multiprocessing systems; multithreaded processors; parallel programming; performance; program data locality; program parallelism; storage management; theory; unoptimized applications", sponsororg = "ACM; IEEE Comput. Soc", subject = "{\bf C.5.3} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Microcomputers. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", treatment = "P Practical", } @Article{Kielmann:1994:WDS, author = "Thilo Kielmann and Mira Mezini and Arjan Loeffen", title = "4th {Workshop} for {Doctoral Students} in {Object-Oriented Systems}", journal = j-SIGPLAN, volume = "29", number = "12", pages = "7--10", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bestavros:1994:WLC, author = "Azer Bestavros and Richard Gerber and Stephen P. Masticola", title = "Workshop on language, compiler, and tool support for real-time systems", journal = j-SIGPLAN, volume = "29", number = "12", pages = "11--17", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergin:1994:ROO, author = "Joseph Bergin", title = "A report on object-oriented extensions to {Pascal}", journal = j-SIGPLAN, volume = "29", number = "12", pages = "18--24", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ganesh:1994:FLB, author = "Amit Ganesh", title = "Fusing loops with backward inter loop data dependence", journal = j-SIGPLAN, volume = "29", number = "12", pages = "25--30", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Bombay, India", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "backward inter-loop data dependence; loop fusion; loop unrolling; nesting level; optimising compilers; parallelising compilers; program control structures", treatment = "T Theoretical or Mathematical", } @Article{Wilson:1994:SIR, author = "Robert P. Wilson and Robert S. French and Christopher S. Wilson and Saman P. Amarasinghe and Jennifer M. Anderson and Steve W. K. Tjiang and Shih-Wei Liao and Chau-Wen Tseng and Mary W. Hall and Monica S. Lam and John L. Hennessy", title = "{SUIF}: an infrastructure for research on parallelizing and optimizing compilers", journal = j-SIGPLAN, volume = "29", number = "12", pages = "31--37", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; FORTRAN; Fortran front ends; high-performance computing; infrastructure; instructional use; locality optimizer; loop-level parallelism; optimising compilers; optimizing compilers; optimizing MIPS back end; parallelising compilers; parallelizing compilers; SUIF; SUIF software", treatment = "P Practical", } @Article{Malloy:1994:EPR, author = "Brian A. Malloy and John D. McGregor and Anand Krishnaswamy and Murali Medikonda", title = "An extensible program representation for object-oriented software", journal = j-SIGPLAN, volume = "29", number = "12", pages = "38--47", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6115 (Programming support); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Dept. of Comput. Sci., Clemson Univ., SC, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "control flow information; data flow information; dynamic information; extensible program representation; interactive debuggers; object-oriented programming; object-oriented software; program debugging; program dependency graph; runtime tools; software tools; tools", treatment = "G General Review", } @Article{Codenie:1994:AMP, author = "Wim Codenie and Koen De Hondt and Theo D'Hondt and Patrick Steyaert", title = "{Agora}: message passing as a foundation for exploring {OO} language concepts", journal = j-SIGPLAN, volume = "29", number = "12", pages = "48--57", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6150N (Distributed systems software)", corpsource = "Programming Technol. Lab., Brussels Free Univ., Brussels, Belgium", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Agora; cloning; FTP-site; inheritance; inline objects; message passing; mixin-based approach; object-oriented languages; OO language concepts; prototype-based instance; reification; semantics; slot access; Smalltalk; Smalltalk implementation; syntax", treatment = "T Theoretical or Mathematical", } @Article{Shang:1994:CS, author = "David L. Shang", title = "Covariant specification", journal = j-SIGPLAN, volume = "29", number = "12", pages = "58--65", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110F (Formal methods); C6120 (File organisation); C6140D (High level languages)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "compiler; component type; constrained parameterized class; covariant specification; data encapsulation; encapsulation; enclosing type; formal specification; input interface; instance variable; natural description; object-oriented languages; operation; output interface; parameterized class; static type check; subclass; type intra-dependency; type safe convariant specification; type theory", treatment = "T Theoretical or Mathematical", } @Article{Nelson:1994:CCC, author = "Michael L. Nelson", title = "Considerations in choosing a concurrent\slash distributed object-oriented programming language", journal = j-SIGPLAN, volume = "29", number = "12", pages = "66--71", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C0310H (Equipment and Distributed systems software); C0310H (Equipment and software evaluation methods); C6110J (Object-oriented programming); C6110P (Parallel programming); C6140D (High level languages); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "communication costs; communication models; concurrent object-oriented programming language; distributed object management; distributed object-oriented programming language; distributed processing; object-oriented languages; object-oriented programming; parallel languages; software selection; variables sharing", treatment = "G General Review", } @Article{Weisert:1994:CPP, author = "Conrad Weisert", title = "Comment on poor practice in coding examples", journal = j-SIGPLAN, volume = "29", number = "12", pages = "72--72", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Butt:1994:RDS, author = "Farooq Butt", title = "Rapid development of a source-level debugger for {PowerPC} microprocessors", journal = j-SIGPLAN, volume = "29", number = "12", pages = "73--77", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C5130 (Microprocessor chips); C6115 (Programming support); C6140B (Machine-oriented languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Compiler and Tools Group, RISC Software Group, Austin, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "compile-edit-debug environment; design cycle times; emergent microprocessors; gdb; instruction sets; microprocessor chips; Motorola PowerPC 601 microprocessor; Motorola PowerPC 603 microprocessor; PowerPC instruction set; PowerPC microprocessors; program compilers; program debugging; rapid development; software microprocessor simulator; software tools; software-development environment; source-level debugger; virtual machines", treatment = "P Practical", } @Article{Agarwal:1994:CIO, author = "Rakesh Agarwal", title = "The {C++} interface in objectivity", journal = j-SIGPLAN, volume = "29", number = "12", pages = "78--86", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation); C6140D (High level languages); C6160J (Object-oriented databases); organisation", corpsource = "Dipartimento di Autom. e Inf., Politecnico di Torino, Italy", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "access; architectural issues; C language; C++ interface; computer aided software engineering; computer aided software engineering system; computer integrated software engineering systems; computerized databases; consistent information; control; database system support; information systems; inheritance; logical centralized database support; management; object-oriented database management system technology; object-oriented databases; object-oriented languages; object-oriented programming; objectivity; production; research; software engineering; user-defined life cycles", treatment = "G General Review", } @Article{Skudlarek:1994:RMI, author = "Joseph P. Skudlarek", title = "Remarks on {``A methodology for implementing highly concurrent data''}", journal = j-SIGPLAN, volume = "29", number = "12", pages = "87--93", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C5440 (Multiprocessing systems); C5470 (Performance evaluation and testing)", corpsource = "Mentor Graphics Corp., Wilsonville, OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "clarity; completeness; correctness; fault tolerant computing; fault-tolerant processing; highly concurrent data objects; load-linked instructions; lock-free protocol; multiprocessing systems; process synchronization instructions; store-conditional instructions; synchronisation; wait-free protocol", treatment = "T Theoretical or Mathematical", } @Article{Hahne:1994:UYL, author = "Bruce Hahne and Hiroyuki Sat{\=o}", title = "Using {YACC} and {Lex} with {C++}", journal = j-SIGPLAN, volume = "29", number = "12", pages = "94--103", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Mitsubishi Electr. Corp., Kanagawa, Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C++ classes; C++ constructors; compiler design; compiler generators; formal specification; individual terminals; inheritance; inherited attributes; Lex lexical analysis tool; nonterminals; object-oriented languages; syntax tree; synthesized attributes; tree data structures; tree traversal; virtual functions; YACC parser; YACC parser generator tool; YACC specification", treatment = "P Practical", } @Article{Wang:1994:BCO, author = "Thomas Wang", title = "{Better C}: an {Object-Oriented C} language with automatic memory manager suitable for interactive applications", journal = j-SIGPLAN, volume = "29", number = "12", pages = "104--111", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6150 (Systems software); C6180 (User interfaces)", corpsource = "Hewlett--Packard Co., Cupertino, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "abstract data types; abstraction; automatic memory manager; Better C; C language; exception handling; implementation; interactive applications; interactive systems; memory corruption; memory leakage; object-oriented C language; object-oriented languages; storage management", treatment = "P Practical", } @Article{Wang:1994:EMF, author = "Thomas Wang", title = "Eliminate memory fragmentation through holes in the heap", journal = j-SIGPLAN, volume = "29", number = "12", pages = "112--113", month = dec, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:58 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6150 (Systems software)", corpsource = "Hewlett--Packard Co., Cupertino, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "holes; memory allocators; memory fragmentation elimination; paging I/O activity reduction; storage allocation; unmapped pages", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Xu:1995:LOC, author = "Dianxiang Xu and Guoliang Zheng", title = "Logical Objects with Constraints", journal = j-SIGPLAN, volume = "30", number = "1", pages = "5--10", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zhu:1995:PTC, author = "Ming-Yuan Zhu", title = "Program Transformation in Constructive Type Theory", journal = j-SIGPLAN, volume = "30", number = "1", pages = "11--19", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kim:1995:NIM, author = "Myung Ho Kim", title = "A New Iteration Mechanism for the {C++} Programming Language", journal = j-SIGPLAN, volume = "30", number = "1", pages = "20--26", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tin:1995:TSO, author = "Erkan Tin and Varol Akman and Murat Ersan", title = "Towards situation-oriented programming languages", journal = j-SIGPLAN, volume = "30", number = "1", pages = "27--36", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tin:1995:TSP, author = "E. Tin and V. Akman and M. Ersan", title = "Towards Situation-Oriented Programming Languages", journal = j-SIGPLAN, volume = "30", number = "1", pages = "27--??", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Copperman:1995:PMW, author = "Max Copperman and Jeff Thomas", title = "Poor Man's Watchpoints", journal = j-SIGPLAN, volume = "30", number = "1", pages = "37--44", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1995:UOV, author = "Henry G. Baker", title = "``Use-once'' variables and linear objects: storage management, reflection and multi-threading", journal = j-SIGPLAN, volume = "30", number = "1", pages = "45--52", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1995:VLO, author = "H. G. Baker", title = "`Use-Once' Variables and Linear Objects-Storage Management, Reflection and Multi-Threading", journal = j-SIGPLAN, volume = "30", number = "1", pages = "45--??", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mellier:1995:OTD, author = "Pierre Mellier and Fran{\c{c}}ois Grize", title = "{OVIDE}: {A} Tool for Data Acquisition and Validation", journal = j-SIGPLAN, volume = "30", number = "1", pages = "53--61", month = jan, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Maruyama:1995:NCS, author = "Katsumi Maruyama", title = "A name change from {``COOL''} to {``ACOOL''}", journal = j-SIGPLAN, volume = "30", number = "2", pages = "2--2", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Castagna:1995:FOO, author = "Giuseppe Castagna and Gary T. Leavens", title = "Foundations of {Object-Oriented Languages}: 2nd {Workshop} report", journal = j-SIGPLAN, volume = "30", number = "2", pages = "5--11", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Raiha:1995:BLA, author = "L. Raiha", title = "A Brief Look at Extension Programming Before and Now", journal = j-SIGPLAN, volume = "30", number = "2", pages = "12--20", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Tampere Univ., Finland", classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6140D (High level languages)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Ada 9x; C++; Design; Extension facilities; Extension programming; Languages; Macro Language; Oberon; Software reuse", thesaurus = "Ada; Object-oriented languages; Object-oriented programming; Software reusability", } @Article{Raiha:1995:BLE, author = "Liisa R{\"a}ih{\"a}", title = "A brief look at extension programming before and now", journal = j-SIGPLAN, volume = "30", number = "2", pages = "12--20", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gallud:1995:SGM, author = "J. A. Gallud and J. M. Garc{\'\i}a", title = "The Specification of a Generic Multicomputer Using {Lotos}", journal = j-SIGPLAN, volume = "30", number = "2", pages = "21--24", month = feb, year = "1995", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/199873.199877", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Beaty:1995:PUO, author = "Steven J. Beaty", title = "{ParsesraP}: Using one grammar to specify both input and output", journal = j-SIGPLAN, volume = "30", number = "2", pages = "25--32", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Boulanger:1995:OOM, author = "Jean-Louis Boulanger", title = "Object Oriented Method for {Axiom}", journal = j-SIGPLAN, volume = "30", number = "2", pages = "33--41", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wu:1995:SRM, author = "Youfeng Wu", title = "Strength Reduction of Multiplications by Integer Constants", journal = j-SIGPLAN, volume = "30", number = "2", pages = "42--48", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ferenczi:1995:GMV, author = "Szabolcs Ferenczi", title = "Guarded methods vs. inheritance anomaly: inheritance anomaly solved by nested guarded method calls", journal = j-SIGPLAN, volume = "30", number = "2", pages = "49--58", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nourani:1995:IMA, author = "Cyrus F. Nourani", title = "Intelligent and multi agent object level computing: the preliminary overview", journal = j-SIGPLAN, volume = "30", number = "2", pages = "59--64", month = feb, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:00 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sreedhar:1995:ICD, author = "Vugranam C. Sreedhar and Guang R. Gao and Yong-fong Lee", title = "Incremental Computation of Dominator Trees", journal = j-SIGPLAN, volume = "30", number = "3", pages = "1--12", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p1-sreedhar/", abstract = "Data flow analysis based on an incremental approach may require that the dominator tree be correctly maintained at all times (M. Carroll and B. G. Ryder, 1988). Previous solutions to the problem of incrementally maintaining dominator trees were restricted to reducible flowgraphs (G. Ramalingam and T. Reps, 1994). We present a new algorithm for incrementally maintaining the dominator tree of an arbitrary flowgraph, either reducible or irreducible, based on a program representation called the DJ-graph (Vugranam C. Sreedhar and Guang R. Gao, 1995). For the case where an edge is inserted, our algorithm is also faster than previous approaches (in the worst case). For the deletion case, our algorithm is likely to run fast on the average cases.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", classification = "C1160 (Combinatorial mathematics); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Arbitrary flowgraph; Data flow analysis; Deletion case; design; DJ-graph; Dominator trees; Incremental approach; Incremental computation; languages; performance; Program representation; reliability; theory; verification", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\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.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**.", thesaurus = "Data flow analysis; Incremental compilers; Trees [mathematics]", } @Article{Kelsey:1995:CBC, author = "Richard A. Kelsey", title = "A Correspondence Between Continuation Passing Style and Static Single Assignment Form", journal = j-SIGPLAN, volume = "30", number = "3", pages = "13--22", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p13-kelsey/", abstract = "We define syntactic transformations that convert continuation passing style (CPS) programs into static single assignment form (SSA) and vice versa. Some CPS programs cannot be converted to SSA, but these are not produced by the usual CPS transformation. The CPS$\rightarrow$SSA transformation is especially helpful for compiling functional programs. Many optimizations that normally require flow analysis can be performed directly on functional CPS programs by viewing them as SSA programs. We also present a simple program transformation that merges CPS procedures together and by doing so greatly increases the scope of the SSA flow information. This transformation is useful for analyzing loops expressed as recursive procedures.", acknowledgement = ack-nhfb, affiliation = "Res. Inst., NEC Corp., Tokyo, Japan", classification = "C4210L (Formal languages and computational linguistics); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Continuation passing style; CPS programs; CPS transformation; design; Functional program compilation; languages; performance; Recursive procedures; Simple program transformation; SSA; SSA flow information; SSA programs; Static single assignment form; Syntactic transformations; theory", subject = "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", thesaurus = "Computational linguistics; Functional programming; Program compilers", } @Article{Berson:1995:GGU, author = "David A. Berson and Rajiv Gupta and Mary Lou Soffa", title = "{GURRR}: {A} Global Unified Resource Requirements Representation", journal = j-SIGPLAN, volume = "30", number = "3", pages = "23--34", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p23-berson/", abstract = "When compiling for instruction level parallelism (ILP), the integration of the optimization phases can lead to an improvement in the quality of code generated. However, since several different representations of a program are used in the various phases, only a partial integration has been achieved to date. We present a program representation that combines resource requirements and availability information with control and data dependence information. The representation enables the integration of several optimizing phases, including transformations, register allocation, and instruction scheduling. The basis of this integration is the simultaneous allocation of different types of resources. We define the representation and show how it is constructed. We then formulate several optimization phases to use the representation to achieve better integration.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA", classification = "C1160 (Combinatorial mathematics); C6150C (Compilers, interpreters and other processors)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Availability information; Data dependence information; design; Global Unified Resource Requirements Representation; GURRR; ILP; Instruction level parallelism; Instruction scheduling; languages; Optimization phases; Optimizing phases; Partial integration; performance; Program representation; Register allocation; Resource allocation; theory", subject = "{\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", thesaurus = "Graph theory; Optimising compilers; Parallelising compilers; Resource allocation", } @Article{Click:1995:SGB, author = "Cliff Click and Michael Paleczny", title = "A Simple Graph-Based Intermediate Representation", journal = j-SIGPLAN, volume = "30", number = "3", pages = "35--49", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p35-click/", abstract = "We present a graph-based intermediate representation (IR) with simple semantics and a low-memory-cost C++ implementation. The IR uses a directed graph with labeled vertices and ordered inputs but unordered outputs. Vertices are labeled with opcodes, edges are unlabeled. We represent the CFG and basic blocks with the same vertex and edge structures. Each opcode is defined by a C++ class that encapsulates opcode-specific data and behavior. We use inheritance to abstract common opcode behavior, allowing new opcodes to be easily defined from old ones. The resulting IR is simple, fast and easy to use.", acknowledgement = ack-nhfb, affiliation = "Hewlett--Packard Co., Cambridge, MA, USA", classification = "C1160 (Combinatorial mathematics); C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6140E (Other programming languages); C6150C (Compilers, interpreters and other processors)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C++ class; CFG; Common opcode behavior; design; Directed graph; experimentation; Inheritance; IR; Labeled vertices; languages; Low memory cost C++ implementation; measurement; Opcode-specific data; Ordered inputs; performance; Simple graph-based intermediate representation; Simple semantics; theory; Unordered outputs", subject = "{\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", thesaurus = "C language; Directed graphs; Inheritance; Object-oriented languages; Program compilers", } @Article{Ruf:1995:OSR, author = "Erik Ruf", title = "Optimizing Sparse Representations for Dataflow Analysis", journal = j-SIGPLAN, volume = "30", number = "3", pages = "50--61", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p50-ruf/", abstract = "Sparse program representations allow inter-statement dependences to be represented explicitly, enabling dataflow analyzers to restrict the propagation of information to paths where it could potentially affect the dataflow solution. This paper describes the use of a single sparse program representation, the value dependence graph, in both general and analysis-specific contexts, and demonstrates its utility in reducing the cost of dataflow analysis. We find that several semantics-preserving transformations are beneficial in both contexts.", acknowledgement = ack-nhfb, affiliation = "Microsoft Corp., Redmond, WA, USA", classification = "C1160 (Combinatorial mathematics); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Analysis-specific contexts; Dataflow analysis; Dataflow analyzers; Dataflow solution; design; Interstatement dependences; languages; measurement; performance; Semantics-preserving transformations; Single sparse program representation; Sparse program representations; Sparse representation optimization; theory; Value dependence graph", subject = "{\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Data-flow languages. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", thesaurus = "Data flow analysis; Graph theory; Optimising compilers", } @Article{Steensgaard:1995:SFS, author = "Bjarne Steensgaard", title = "Sparse Functional Stores for Imperative Programs", journal = j-SIGPLAN, volume = "30", number = "3", pages = "62--70", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p62-steensgaard/", abstract = "In recent years, the trend in program representations for imperative programs has been to make them more functional, or to make them more sparse. However, new sparse representations have been non-functional, and new functional representations have not been sparse in the presence of pointer operations. In this paper, we present a functional representation that is sparse even in the presence of pointer operations.\par Conventionally, a store is represented in a functional program representation by a single object---typically a mapping from locations to values. We show how such a store object may be fragmented into several objects, each representing part of the store. The result is a sparser representation, which has not only the usual benefit of directly linking producers to consumers, but which also for static program analysis often leads to smaller domains of abstract values for store objects. Store fragmentation corresponds to assignment factored SSA form (a factorization of SSA form introduced in this paper). We report on experiments with a thorough fragmentation based on a data flow points-to analysis and an intermediate level fragmentation based on an almost linear time complexity points-to analysis by type inference.", acknowledgement = ack-nhfb, affiliation = "Microsoft Corp., Redmond, WA, USA", classification = "C4210L (Formal languages and computational linguistics); C6110 (Systems analysis and programming); C6120 (File organisation); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Almost linear time complexity points-to analysis; Assignment factored SSA form; Data flow points-to analysis; design; experimentation; Functional program representation; Imperative programs; Intermediate level fragmentation; languages; performance; Pointer operations; Program representations; Sparse functional stores; Static program analysis; Store fragmentation; Store object; theory; Type inference", subject = "{\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages.", thesaurus = "Data flow analysis; Functional programming; Storage management; Type theory", } @Article{OBrien:1995:XYI, author = "Kevin O'Brien and Kathryn M. O'Brien and Martin Hopkins and Arvin Shepherd and Ron Unrau", title = "{XIL} and {YIL}: The Intermediate Languages of {TOBEY}", journal = j-SIGPLAN, volume = "30", number = "3", pages = "71--82", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p71-o_brien/", abstract = "Typically, the choice of intermediate representation by a particular compiler implementation seeks to address a specific goal. The intermediate language of the TOBEY compilers, XIL, was initially chosen to facilitate the production of highly optimal scalar code, yet, it was easily extended to a higher level form YIL in order to support a new suite of optimizations which in most existing compilers are done at the level of source to source translation. In this paper we will discuss those design features of XIL that were important factors in the production of optimal scalar code. In addition we will demonstrate how the strength of the YIL abstraction lay in its ability to access the underlying low level representation.", acknowledgement = ack-nhfb, classification = "C6140E (Other programming languages); C6150C (Compilers, interpreters and other processors)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compiler implementation; design; Highly optimal scalar code; Intermediate languages; Intermediate representation; languages; ML abstraction; Optimal scalar code; performance; theory; TOBEY; Toronto Optimizing Back End with Yorktown; Underlying low level representation; XIL; YIL", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", thesaurus = "Optimising compilers; Programming languages", } @Article{Aubry:1995:GDF, author = "Pascal Aubry and Thierry Gautier", title = "{GC}: The Data-Flow Graph Format of Synchronous Programming", journal = j-SIGPLAN, volume = "30", number = "3", pages = "83--93", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p83-aubry/", abstract = "Based on an abstraction of the time as a discrete logical time, the synchronous languages, armed with a strong semantics, enable the design of safe real-time applications. Some of them are of imperative style, while others are declarative. Academic and industrial teams involved in synchronous programming defined together three intermediate representations, on the way to standardization: \begin{itemize} \item IC, a parallel format of imperative style, \item GC, a parallel format of data-flow style, \item OC, a sequential format to describe automata. \end{itemize} In this paper, we describe more specifically the format GC, and its links with the synchronous data-flow language SIGNAL. Thanks to the first experimentations, GC reveals itself as a powerful representation for graph transformations, code production, optimization, hardware synthesis, etc.", acknowledgement = ack-nhfb, affiliation = "INRIA, IRISA, Rennes, France", classification = "C1160 (Combinatorial mathematics); C4210L (Formal languages and computational linguistics); C6110P (Parallel programming); C6140D (High level languages); C6150N (Distributed systems software)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Academic teams; Code production; Data-flow graph format; Declarative style; design; Discrete logical time; GC data-flow graph format; GC parallel format; Graph transformations; Hardware synthesis; IC parallel format; Imperative style; Industrial teams; Intermediate representations; languages; OC sequential format; Optimization; performance; Safe real-time applications; SIGNAL synchronous data-flow language; Standardization; Strong semantics; Synchronous languages; Synchronous programming; theory; Time abstraction", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**. {\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", thesaurus = "Computational linguistics; Data flow computing; Graph theory; Parallel languages; Parallel programming; Real-time systems", } @Article{Chitnis:1995:RTI, author = "Sachin V. Chitnis and Manoranjan Satpathy and Sundeep Oberoi", title = "Rationalized Three Instruction Machine", journal = j-SIGPLAN, volume = "30", number = "3", pages = "94--102", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p94-chitnis/", abstract = "The declarative nature of functional programming languages causes many difficulties in their efficient implementation on conventional machines. The problem is much harder when the language has non-strict (lazy) semantics. Abstract machines serve as an intellectual aid in bridging the semantic gap between such languages and the conventional von Neumann architecture. However they become more and more complex with time as efficiency considerations force the instruction set of the machine to grow in size. In this paper we explain the phenomenon in context of the Three Instruction Machine (TIM). We then define a rationalized instruction set for TIM that allows us to view all enhancements to TIM in a uniform way. This instruction set is quite close to RISC instructions and clearly identifies the key operations on closures. Translation of functional programs to our rationalized instruction set opens up scope for various local and global optimizations. We illustrate this by showing how to build control flow graphs and perform optimizations on it. Lazy arguments in functional programs make it hard to predict evaluation order statistically. We define the notion of {\em pseudo-lazy\/} arguments to statically expose the control flow information, wherever possible, for doing better flow analysis.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Indian Inst. of Technol., Bombay, India", classification = "C1160 (Combinatorial mathematics); C4210L (Formal languages and computational linguistics); C6110 (Systems analysis and programming); C6140B (Machine-oriented languages); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Abstract machines; Closures; Control flow graphs; design; Efficiency considerations; Evaluation order; Flow analysis; Functional program translation; Functional programming languages; Global optimizations; Instruction set; languages; Lazy semantics; Local optimizations; Nonstrict semantics; performance; Pseudo-lazy arguments; Rationalized instruction set; Rationalized three instruction machine; RISC instructions; Semantic gap; Static analysis; theory; Von Neumann architecture", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", thesaurus = "Computational linguistics; Data flow analysis; Data flow graphs; Functional languages; Functional programming; Instruction sets; Optimising compilers; Reduced instruction set computing", } @Article{Broustaut:1995:VAC, author = "Fr{\'e}d{\'e}ric Broustaut and Christian Fabre and Fran{\c{c}}ois de Ferri{\`e}re and {\'E}ric Ivanov and Mauro Fiorentini", title = "Verification of {ANDF} Components", journal = j-SIGPLAN, volume = "30", number = "3", pages = "103--110", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p103-broustaut/", abstract = "This paper presents validation work done on ANDF at the Open Software Foundation Research Institute. The ultimate ANDF scenario splits a compiler into two separate components (producer/installer). This changes the compiler validation process as the two components have to be validated separately. This paper presents the originality and the difficulties of such an approach and summarizes the status of two pieces of software to which the OSF-RI has contributed: the {\em ANDF Validation Suite\/} and the {\em General ANDF Interpreter\/}.", acknowledgement = ack-nhfb, affiliation = "OSF Res. Inst., Gieres, France", classification = "C6110B (Software engineering techniques); C6110F (Formal methods); C6150C (Compilers, interpreters and other processors); C6150E (General utility programs); C6150N (Distributed systems software)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ANDF component validation; ANDF Validation Suite; Compiler; Compiler validation process; design; experimentation; General ANDF Interpreter; Installer; languages; Open Software Foundation Research Institute; OSF-RI; Producer; Software; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.7} Software, SOFTWARE ENGINEERING, Distribution, Maintenance, and Enhancement, Portability.", thesaurus = "Application program interfaces; Formal verification; Open systems; Program compilers; Program interpreters; Software portability", } @Article{Gosling:1995:JIB, author = "James Gosling", title = "{Java} intermediate bytecodes: {ACM SIGPLAN} workshop on intermediate representations {(IR'95)}", journal = j-SIGPLAN, volume = "30", number = "3", pages = "111--118", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p111-gosling/", abstract = "Java is a programming language loosely related to C++. Java originated in a project to produce a software development environment for small distributed embedded systems. Programs needed to be small, fast, ``safe'' and portable. These needs led to a design that is rather different from standard practice. In particular, the form of compiled programs is machine independent bytecodes. But we needed to manipulate programs in ways usually associated with higher level, more abstract intermediate representations. This lets us build systems that are safer, less fragile, more portable, and yet show little performance penalty while still being simple.", acknowledgement = ack-nhfb, affiliation = "Sun Microsystems Lab., Mountain View, CA, USA", classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6115 (Programming support); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM SIGPLAN workshop; C++-like language; Compiled programs; design; Intermediate representations; Java intermediate bytecodes; languages; Machine independent bytecodes; performance; Performance; Portability; Programming language; Safe programs; Small distributed embedded systems; Small programs; Software development environment; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.2.6} Software, SOFTWARE ENGINEERING, Programming Environments. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", thesaurus = "Development systems; Distributed processing; High level languages; Object-oriented languages; Program compilers; Programming environments; Real-time systems; Software portability", } @Article{Lewis:1995:CMR, author = "Brian T. Lewis and L. Peter Deutsch and Theodore C. Goldstein", title = "Clarity {MC}ode: {A} Retargetable Intermediate Representation for Compilation", journal = j-SIGPLAN, volume = "30", number = "3", pages = "119--128", month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:02 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/202529/p119-lewis/", abstract = "To support the compilation of Clarity, we have developed a high-level, machine-independent intermediate representation that we call MCode (middle code). We use MCode to compile Clarity programs at execution time (i.e., on-the-fly) into SPARC 1 code for the Solaris operating system. This code generator is designed to be largely machine-independent: besides the SPARC code generator, an Intel x86 version is being developed. MCode includes a small amount of optimization information that enables the runtime code generator to produce good quality code. Our SPARC code generator produces code about as good as that produced by the SunPRO C compiler at the -O2 optimization level. A significant advantage of MCode over native machine code is that it can be represented more compactly; MCode is stack-based, and the encoding of most instructions can be a single byte. We also support an interpreter for MCode that supports full interoperation with C and existing C libraries. Although MCode includes instructions and data structures needed to implement some Clarity language-specific constructs such as its exceptions and method calls, the core of MCode is suitable for representing code for C and many other languages.", acknowledgement = ack-nhfb, affiliation = "Sun Microsystems Labs., Mountain View, CA, USA", classification = "C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", confname = "ACM SIGPLAN workshop on Intermediate representations, January 22, 1995, San Francisco, CA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "C language; C libraries; Clarity C++ programming language; Clarity language-specific constructs; Clarity MCode; Clarity programs; Code generator; Compilation; Data structures; design; Exceptions; Execution time; Good quality code; Instructions; Intel x86 version; Interoperation; Interpreter; languages; Method calls; Optimization information; performance; Retargetable intermediate representation; Solaris operating system; SPARC 1 code; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Representation**.", thesaurus = "Application generators; C language; Data structures; Object-oriented languages; Open systems; Optimising compilers; Program interpreters", } @Article{Krauter:1995:BRTa, author = "Klaus Krauter", title = "Book Review: {Tool Integration: Environments and Frameworks, Edited by: D. Schefstrom and G. van den Broek}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "7--7", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Falanga:1995:BRO, author = "Rod Falanga", title = "Book Review: {ObjectWindows for C++: A Shortcut to Windows Programming by Robert J. Traister}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "8--8", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grogono:1995:BRV, author = "Peter Grogono", title = "Book Review: {Visual Basic Professional 3.9 Programming by Thomas W. Torgerson}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "9--9", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Noble:1995:BRP, author = "James Noble", title = "Book Review: {Parallel Logic Programming by Akikazu Takeuchi}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "10--10", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Spinellis:1995:BRHa, author = "Diomidis Spinellis", title = "Book Review: {High-Speed Windows Applications: Multitasking Design Methods by Dr. Bruce E. Krell}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "11--11", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Youngblut:1995:BRU, author = "Christine Youngblut", title = "Book Review: {User Interface Software, edited by Len Bass and Prasun Dewan}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "12--12", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schilling:1995:DCU, author = "Jonathan Schilling", title = "Dynamically-Valued Constants: An Underused Language Feature", journal = j-SIGPLAN, volume = "30", number = "4", pages = "13--20", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Languages such as Ada and C++ allow programmers to declare an object as a constant, even though the object has a dynamic initial value. The benefits of using this construct are given. A sample of actual C++ code is measured to see how often dynamically-valued constants are used, and how often they could be used. This result is compared to previously published results for Ada sample code, and to some Ada code where this feature was consciously employed. The comparisons indicate that this language feature is generally underused. Possible reasons for this underuse are discussed.", acknowledgement = ack-nhfb, affiliation = "UNIX Syst. Group, Novell Inc., Summit, NJ, USA", classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Ada sample code; C++ code; Dynamic initial value; Dynamically valued constants; Dynamically-valued constants; Underused language feature", thesaurus = "Ada; C language; Object-oriented languages; Program compilers; Programming", } @Article{Schilling:1995:DVC, author = "Jonathan L. Schilling", title = "Dynamically-valued constants: an underused language feature", journal = j-SIGPLAN, volume = "30", number = "4", pages = "13--20", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{English:1995:MC, author = "John English", title = "Multithreading in {C++}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "21--28", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Trono:1995:CTS, author = "John A. Trono", title = "A Comparison of Three Strategies for Computing Letter Oriented, Minimal Perfect Hashing Functions", journal = j-SIGPLAN, volume = "30", number = "4", pages = "29--35", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper introduces a simple modification that produces dramatic speedups to the algorithms of Cichelli \cite{Cichelli:1980:MPH} and Cook and Oldehoeft \cite{Cook:1982:LOM}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kokol:1995:UIM, author = "Peter Kokol and Ivan Rozman and Vlado Venuti", title = "User Interface Metrics", journal = j-SIGPLAN, volume = "30", number = "4", pages = "36--38", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wong:1995:PQA, author = "Limsoon Wong", title = "Polymorphic Queries Across Sets, Bags, and Lists", journal = j-SIGPLAN, volume = "30", number = "4", pages = "39--44", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tessman:1995:AGF, author = "Thant Tessman", title = "Adding Generic Functions to {Scheme}", journal = j-SIGPLAN, volume = "30", number = "4", pages = "45--50", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Becker:1995:EEP, author = "George Becker and Neil V. Murray", title = "Efficient Execution of Programs with Static Semantics", journal = j-SIGPLAN, volume = "30", number = "4", pages = "51--60", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kleinrubatscher:1995:FPS, author = "Paul Kleinrubatscher and Albert Kriegshaber and Robert Z{\"o}chling and Robert Gl{\"u}ck", title = "{Fortran} Program Specialization", journal = j-SIGPLAN, volume = "30", number = "4", pages = "61--70", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mernik:1995:LAT, author = "Marjan Mernik and Nikolay Korbar and Viljem {\v{Z}}umer", title = "{LISA}: {A} Tool for Automatic Language Implementation", journal = j-SIGPLAN, volume = "30", number = "4", pages = "71--79", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mernik:1995:LTA, author = "Marjan Mernik and Nikolaj Korbar and Viljem {\v{Z}}umer", title = "{LISA}: a tool for automatic language implementation", journal = j-SIGPLAN, volume = "30", number = "4", pages = "71--79", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cigas:1995:PPP, author = "John F. {\v{C}}igas", title = "Proper Packaging Promotes Parameter Passing Proficiency", journal = j-SIGPLAN, volume = "30", number = "4", pages = "80--80", month = apr, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stiglic:1995:HEO, author = "Bruno Stiglic and Marjan Heri{\v{c}}ko and Ivan Rozman", title = "How to Evaluate Object-Oriented Software Development?", journal = j-SIGPLAN, volume = "30", number = "5", pages = "3--10", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Terry:1995:UAM, author = "P. D. Terry", title = "Umbriel --- another minimal programming language", journal = j-SIGPLAN, volume = "30", number = "5", pages = "11--17", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Syropoulos:1995:BIW, author = "Apostolos Syropoulos and Alexandros Karakos", title = "Bottom in the Imperative World", journal = j-SIGPLAN, volume = "30", number = "5", pages = "18--20", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shang:1995:CDS, author = "David L. Shang", title = "Covariant Deep Subtyping Reconsidered", journal = j-SIGPLAN, volume = "30", number = "5", pages = "21--28", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Butt:1995:IFS, author = "Farooq Butt", title = "Implementing {FORTRAN77} Support in the {GNU} gdb Debugger", journal = j-SIGPLAN, volume = "30", number = "5", pages = "29--36", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kokol:1995:PSM, author = "Peter Kokol and Viljem {\v{Z}}umer and Janez Brest and Marjan Mernik", title = "{PROMIS}: {A} Software Metrics Tool Generator", journal = j-SIGPLAN, volume = "30", number = "5", pages = "37--42", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Borovikov:1995:SIO, author = "Igor A. Borovikov", title = "{L}-systems with inheritance: an object-oriented extension of {L-systems}", journal = j-SIGPLAN, volume = "30", number = "5", pages = "43--60", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Borovikov:1995:LIO, author = "Igor A. Borovikov", title = "{L}-Systems with Inheritance: An Object-Oriented Extension of {L}-Systems", journal = j-SIGPLAN, volume = "30", number = "5", pages = "43--??", month = may, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wilson:1995:ECP, author = "Robert P. Wilson and Monica S. Lam", title = "Efficient context-sensitive pointer analysis for {C} programs", journal = j-SIGPLAN, volume = "30", number = "6", pages = "1--12", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p1-wilson/", abstract = "This paper proposes an efficient technique for context-sensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using {\em partial transfer functions\/}. A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called. We can reuse a PTF in many calling contexts as long as the aliases among the inputs to the procedure are the same. Our empirical results demonstrate that this technique is successful---a single PTF per procedure is usually sufficient to obtain completely context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm in the SUIF compiler system and we show that it runs efficiently for a set of C benchmarks.", acknowledgement = ack-nhfb, affiliation = "Comput. Syst. Lab., Stanford Univ., CA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Alias relationships; C benchmarks; C programs; Compiler system; Context-sensitive pointer analysis; High-level type system; languages; Memory locations; Partial transfer functions; Pointer arithmetic; Procedure call; SUIF; Type casts", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", thesaurus = "C language; Program compilers; Remote procedure calls", } @Article{Wilson:1995:ECS, author = "Robert P. Wilson and Monica S. Lam", title = "Efficient context-sensitive pointer analysis for {C} programs", journal = j-SIGPLAN, volume = "30", number = "6", pages = "1--12", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ruf:1995:CAA, author = "Erik Ruf", title = "Context-insensitive alias analysis reconsidered", journal = j-SIGPLAN, volume = "30", number = "6", pages = "13--22", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p13-ruf/", abstract = "Recent work on alias analysis in the presence of pointers has concentrated on {\em context-sensitive\/} interprocedural analyses, which treat multiple calls to a single procedure independently rather than constructing a single approximation to a procedure's effect on all of its callers. While context-sensitive modeling offers the potential for greater precision by considering only realizable call-return paths, its empirical benefits have yet to be measured. This paper compares the precision of a simple, efficient, {\em context-insensitive\/} points-to analysis for the C programming language with that of a maximally context-sensitive version of the same analysis. We demonstrate that, for a number of pointer-intensive benchmark programs, context-insensitivity exerts little to no precision penalty. We also describe techniques for using the output of context-insensitive analysis to improve the efficiency of context-sensitive analysis without affecting precision.", acknowledgement = ack-nhfb, affiliation = "Microsoft Corp., Redmond, WA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; C programming language; Call-return paths; Compilers; Context-insensitive alias analysis; Context-insensitive analysis; Context-insensitivity; Context-sensitive analysis; Context-sensitive interprocedural analyses; Context-sensitive modeling; languages; Multiple procedure calls; Pointer-intensive benchmark programs; Pointers; Precision penalty", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", thesaurus = "C language; Data flow analysis; Program compilers; Remote procedure calls; Software performance evaluation", } @Article{Ruf:1995:CIA, author = "Erik Ruf", title = "Context-insensitive alias analysis reconsidered", journal = j-SIGPLAN, volume = "30", number = "6", pages = "13--22", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Carini:1995:FIC, author = "Paul R. Carini and Michael Hind", title = "Flow-sensitive interprocedural constant propagation", journal = j-SIGPLAN, volume = "30", number = "6", pages = "23--31", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p23-carini/", abstract = "We present a flow-sensitive interprocedural constant propagation algorithm, which supports recursion while only performing one flow-sensitive analysis of each procedure. We present experimental results which show that this method finds substantially more constants than previous methods and is efficient in practice. We introduce new metrics for evaluating interprocedural constant propagation algorithms which measure the number of interprocedural constant values that are propagated. We use these metrics to provide further experimental results for our algorithm.", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Constants; experimentation; Flow-sensitive analysis; Flow-sensitive interprocedural constant propagation; Intraprocedural control flow; languages; measurement; Metrics; Procedure analysis; Recursion", 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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes.", thesaurus = "Data flow analysis; Program compilers; Program control structures; Remote procedure calls; Software metrics", } @Article{Carini:1995:FSI, author = "Paul R. Carini and Michael Hind", title = "Flow-sensitive interprocedural constant propagation", journal = j-SIGPLAN, volume = "30", number = "6", pages = "23--31", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pingali:1995:ADS, author = "Keshav Pingali and Gianfranco Bilardi", title = "{APT}: a data structure for optimal control dependence computation", journal = j-SIGPLAN, volume = "30", number = "6", pages = "32--46", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p32-pingali/", abstract = "The {\em control dependence\/} relation is used extensively in restructuring compilers. This relation is usually represented using the {\em control dependence graph\/}; unfortunately, the size of this data structure can be quadratic in the size of the program, even for some structured programs. In this paper, we introduce a data structure called the {\em augmented post-dominator tree (APT)\/} which is constructed in space and time proportional to the size of the program, and which can answer control dependence queries in time proportional to the size of the output. Therefore, {\em APT\/} is an {\em optimal representation of control dependence\/}. We also show that using {\em APT\/}, we can compute SSA graphs, as well as sparse dataflow evaluator graphs, in time proportional to the size of the program. Finally, we put {\em APT\/} in perspective by showing that it can be viewed as a factored representation of control dependence graph in which {\em filtered search\/} is used to answer queries.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; APT; Augmented post-dominator tree; Control dependence graph; Control dependence queries; Control dependence relation; Data structure; Filtered search; languages; Optimal control dependence computation; Restructuring compilers; Sparse dataflow evaluator graphs; SSA graphs", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control 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, 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 D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Data-flow languages.", thesaurus = "Data flow analysis; Directed graphs; Program compilers; Program control structures; Tree data structures", } @Article{Tu:1995:EBP, author = "Peng Tu and David Padua", title = "Efficient building and placing of gating functions", journal = j-SIGPLAN, volume = "30", number = "6", pages = "47--55", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p47-tu/", abstract = "In this paper, we present an almost-linear time algorithm for constructing Gated Single Assignment (GSA), which is SSA augmented with gating functions at {$\phi$}-nodes. The gating functions specify the control dependences for each reaching definition at a {$\phi$}-node. We introduce a new concept of {\em gating path\/}, which is path in the control flow graph from the immediate dominator {\em u\/} of a node {\em v\/} to {\em v\/}, such that every node in the path is dominated by {\em u\/}. Previous algorithms start with {$\phi$}-function placement, and then traverse the control flow graph to compute the gating functions. By formulating the problem into gating path construction, we are able to identify not only a {$\phi$}-node, but also a gating path expression which defines a gating function for the {$\phi$}-node.", acknowledgement = ack-nhfb, affiliation = "Center for Supercomput. Res. and Dev., Illinois Univ., Urbana, IL, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Almost-linear time algorithm; Control dependences; Control flow graph; Gated single assignment; Gating functions; Gating path; languages; measurement; Phi-function placement; theory; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", thesaurus = "Data flow graphs; Program compilers; Program control structures; Programming theory", } @Article{Mueller:1995:ACB, author = "Frank Mueller and David B. Whalley", title = "Avoiding conditional branches by code replication", journal = j-SIGPLAN, volume = "30", number = "6", pages = "56--66", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p56-mueller/", abstract = "On-chip instruction caches are increasing in size. Compiler writers are exploiting this fact by applying a variety of optimizations that improve the execution performance of a program at the expense of increasing its code size. The paper describes a new optimization that can be used to avoid conditional branches by replicating code. The central idea is to determine if there are paths where the result of a conditional branch is known and to replicate code to exploit it. Algorithms are described for detecting when branches are avoidable, for restructuring the control flow to avoid these branches, and for positioning the replicated blocks in the restructured code. The results indicate that the optimization can be frequently applied with reductions in both the number of instructions executed and total instruction cache work.", acknowledgement = ack-nhfb, affiliation = "Fachbereich Inf., Humboldt-Univ., Berlin, Germany", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Algorithms; Code replication; Compiler writers; Conditional branch avoidance; Control flow restructuring; Execution performance; languages; On-chip instruction caches; Optimizations; performance; Program; Replicated blocks; Restructured code; Total instruction cache work", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\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.", thesaurus = "Cache storage; Optimising compilers", } @Article{Patterson:1995:ASB, author = "Jason R. C. Patterson", title = "Accurate static branch prediction by value range propagation", journal = j-SIGPLAN, volume = "30", number = "6", pages = "67--78", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p67-patterson/", abstract = "The ability to predict at compile time the likelihood of a particular branch being taken provides valuable information for several optimizations, including global instruction scheduling, code layout, function inlining, interprocedural register allocation and many high level optimizations. Previous attempts at static branch prediction have either used simple heuristics, which can be quite inaccurate, or put the burden onto the programmer by using execution profiling data or source code hints.\par This paper presents a new approach to static branch prediction called {\em value range propagation\/}. This method tracks the weighted value ranges of variables through a program, much like constant propagation. These value ranges may be either numeric of symbolic in nature. Branch prediction is then performed by simply consulting the value range of the appropriate variable. Heuristics are used as a fallback for cases where the value range of the variable cannot be determined statically. In the process, {\em value range propagation\/}subsumes both constant propagation and copy propagation.\par Experimental results indicate that this approach produces significantly more accurate predictions than the best existing heuristic techniques. The {\em value range propagation\/} method can be implemented over any ``factored'' dataflow representation with a static single assignment property (such as SSA form or a dependence flow graph where the variables have been renamed to achieve single assignment). Experimental results indicate that the technique maintains the linear runtime behavior of constant propagation experienced in practice.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Queensland Univ. of Technol., Brisbane, Qld., Australia", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C1140 (Probability and statistics); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Accurate static branch prediction; algorithms; Branch likelihood; Code layout; Compile time; Constant propagation; Copy propagation; experimentation; Factored dataflow representation; Function inlining; Global instruction scheduling; Heuristics; High level optimizations; Interprocedural register allocation; Linear runtime behavior; Optimizations; performance; Program; Static single assignment property; Value range propagation; Weighted value variable ranges", 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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", thesaurus = "Optimising compilers; Probability; Processor scheduling; System monitoring", } @Article{Calder:1995:CBS, author = "Brad Calder and Dirk Grunwald and Donald Lindsay and James Martin and Michael Mozer and Benjamin Zorn", title = "Corpus-based static branch prediction", journal = j-SIGPLAN, volume = "30", number = "6", pages = "79--92", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Calder:1995:CSB, author = "Brad Calder and Dirk Grunwald and Donald Lindsay and James Martin and Michael Mozer and Benjamin G. Zorn", title = "Corpus-based static branch prediction", journal = j-SIGPLAN, volume = "30", number = "6", pages = "79--92", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p79-calder/", abstract = "Correctly predicting the direction that branches will take is increasingly important in today's wide-issue computer architectures. The name {\em program-based\/} branch prediction is given to static branch prediction techniques that base their prediction on a program's structure. In this paper, we investigate a new approach to program-based branch prediction that uses a body of existing programs to predict the branch behavior in a new program. We call this approach to program-based branch prediction, {\em evidence-based static prediction\/}, or ESP. The main idea of ESP is that the behavior of a {\em corpus\/} of programs can be used to infer the behavior of new programs. In this paper, we use a neural network to map static features associated with each branch to the probability that the branch will be taken. ESP shows significant advantages over other prediction mechanisms. Specifically, it is a program-based technique, it is effective across a range of programming languages and programming styles, and it does not rely on the use of expert-defined heuristics. In this paper, we describe the application of ESP to the problem of branch prediction and compare our results to existing program-based branch predictors. We also investigate the applicability of ESP across computer architectures, programming languages, compilers, and run-time systems. Averaging over a body of 43 C and Fortran programs, ESP branch prediction results in a miss rate of 20\%, as compared with the 25\% miss rate obtained using the best existing program-based heuristics.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; C programs; Compilers; Corpus-based static branch prediction; Evidence-based static prediction; Fortran programs; languages; Miss rate; Neural network; New program behaviour; performance; Program structure; Program-based branch prediction; Programming languages; Programming styles; Run-time systems; Static feature mapping; Wide-issue computer architectures", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\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, C. {\bf C.1.3} Computer Systems Organization, PROCESSOR ARCHITECTURES, Other Architecture Styles, Neural nets.", thesaurus = "Computer architecture; High level languages; Optimising compilers; System monitoring", } @Article{Dean:1995:SSO, author = "Jeffrey Dean and Craig Chambers and David Grove", title = "Selective specialization for object-oriented languages", journal = j-SIGPLAN, volume = "30", number = "6", pages = "93--102", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p93-dean/", abstract = "Dynamic dispatching is a major source of run-time overhead in object-oriented languages, due both to the direct cost of method lookup and to the indirect effect of preventing other optimizations. To reduce this overhead, optimizing compilers for object-oriented languages analyze the classes of objects stored in program variables, with the goal of bounding the possible classes of message receivers enough so that the compiler can uniquely determine the target of a message send at compile time and replace the message send with a direct procedure call. {\em Specialization\/} is one important technique for improving the precision of this static class information: by compiling multiple versions of a method, each applicable to a subset of the possible argument classes of the method, more precise static information about the classes of the method's arguments is obtained. Previous specialization strategies have not been selective about where this technique is applied, and therefore tended to significantly increase compile time and code space usage, particularly for large applications. In this paper, we present a more general framework for specialization in object-oriented languages and describe a goal directed specialization algorithm that makes selective decisions to apply specialization to those cases where it provides the highest benefit. Our results show that our algorithm improves the performance of a group of sizeable programs by 65\% to 275\% while increasing compiled code space requirements by only 4\% to 10\%. Moreover, when compared to the previous state-of-the-art specialization scheme, our algorithm improves performance by 11\% to 67\% while simultaneously reducing code space requirements by 65\% to 73\%.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Compiled code space requirements; Direct procedure call; Dynamic dispatching; Goal-directed specialization algorithm; languages; Message receivers; Message send; Method lookup; Multiple versions; Object classes; Object-oriented languages; Optimizations; Optimizing compilers; performance; Program performance; Program variables; Run-time overhead; Selective decisions; Selective specialization; Static class information; Static information", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", thesaurus = "Abstract data types; Message passing; Object-oriented languages; Object-oriented programming; Optimising compilers; System monitoring", } @Article{Fernandez:1995:SEL, author = "Mary F. Fern{\'a}ndez", title = "Simple and effective link-time optimization of {Modula-3} programs", journal = j-SIGPLAN, volume = "30", number = "6", pages = "103--115", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p103-fernandez/", abstract = "Modula-3 supports development of modular programs by separating an object's interface from its implementation. This separation induces a runtime overhead in the implementation of objects, because it prevents the compiler from having complete information about a program's type hierarchy. This overhead can be reduced at link time, when the entire type hierarchy becomes available. We describe opportunities for link-time optimization of Modula-3, present two link-time optimizations that reduce the runtime costs of Modula-3's opaque types and methods, and show how link-time optimization could provide C++ with the benefits of opaque types at no additional runtime cost. Our optimization techniques are implemented in mld, a retargetable linker for the MIPS, SPARC, and Intel 486. mld links a machine-independent intermediate code that is suitable for link-time optimization and code generation. Linking intermediate code simplifies implementation of the optimizations and makes it possible to evaluate them on a wide range of architectures. mld's optimizations are effective: they reduce the total number of instructions executed by up to 14\% and convert as many as 79\% of indirect calls to direct calls.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Princeton Univ., NJ, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6115 (Programming support); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Architectures; C++; Code generation; Compiler; Direct calls; Executed instructions; Indirect calls; Intel 486; Intermediate code linking; languages; Link-time optimization; Machine-independent intermediate code; measurement; MIPS; Mld retargetable linker; Modula-3 programs; Modular programs; Object interface; Opaque types; performance; Program type hierarchy; Runtime costs; Runtime overhead; SPARC", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Modula-3. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces.", thesaurus = "Abstract data types; Modula; Object-oriented languages; Object-oriented programming; Optimisation; Optimising compilers; Software libraries; Software reusability", } @Article{Shao:1995:TBC, author = "Zhong Shao and Andrew W. Appel", title = "A type-based compiler for {Standard ML}", journal = j-SIGPLAN, volume = "30", number = "6", pages = "116--129", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p116-shao/", abstract = "Compile-time type information should be valuable in efficient compilation of statically typed functional languages such as Standard ML. But how should type-directed compilation work in real compilers, and how much performance gain will type-based optimizations yield? In order to support more efficient data representations and gain more experience about type-directed compilation, we have implemented a new type-based middle end and back end for the Standard ML of New Jersey compiler. We describe the basic design of the new compiler, identify a number of practical issues, and then compare the performance of our new compiler with the old non-type-based compiler. Our measurement shows that a combination of several simple type-based optimizations reduces heap allocation by 36\%, and improves the already-efficient code generated by the old non-type-based compiler by about 19\% on a DECstation 5000.", acknowledgement = ack-nhfb, affiliation = "Yale Univ., New Haven, CT, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", generalterms = "algorithms; languages; performance", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compile-time type information; Data representations; DECstation 5000; Efficient code generation; Heap allocation; Performance gain; Standard ML; Standard ML of New Jersey compiler; Statically typed functional languages; Type-based back end; Type-based compiler; Type-based middle end; Type-directed compilation", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Standard ML. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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 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.", thesaurus = "Data structures; Functional languages; Optimising compilers", } @Article{Burger:1995:RAU, author = "Robert G. Burger and Oscar Waddell and R. Kent Dybvig", title = "Register allocation using lazy saves, eager restores, and greedy shuffling", journal = j-SIGPLAN, volume = "30", number = "6", pages = "130--138", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p130-burger/", abstract = "This paper presents a fast and effective linear intraprocedural register allocation strategy that optimizes register usage across procedure calls. It capitalizes on our observation that while procedures that do not contain calls ({\em syntactic leaf routines\/}) account for under one third of all procedure activations, procedures that actually make no calls ({\em effective leaf routines\/}) account for over two thirds of all procedure activations. Well-suited for both caller-and calle-save registers, our strategy employs a ``lazy'' save mechanism that avoids saves for all effective leaf routines, an ``eager'' restore mechanism that reduces the effect of memory latency, and a ``greedy'' register shuffling algorithm that does a remarkbly good job of minimizing the need for temporaries in setting up procedure calls.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Callee-save registers; Caller-save registers; Eager restores; Effective leaf routines; Fast end effective linear intraprocedural register allocation strategy; Greedy register shuffling algorithm; Greedy shuffling; languages; Lazy saves; measurement; Memory latency; performance; Procedure activations; Procedure calls; Register allocation; Register usage optimisation; Syntactic leaf routines", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", thesaurus = "Optimising compilers; Storage allocation", } @Article{Altman:1995:SMS, author = "Erik R. Altman and R. Govindarajan and Guang R. Gao", title = "Scheduling and mapping: software pipelining in the presence of structural hazards", journal = j-SIGPLAN, volume = "30", number = "6", pages = "139--150", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p139-altman/", abstract = "Recently, software pipelining methods based on an ILP (Integer Linear Programming) framework have been successfully applied to derive rate-optimal schedules for architectures involving clean pipelines --- pipelines without structural hazards. The problem for architectures beyond such clean pipelines remains open. One challenge is how, under a unified ILP framework, to simultaneously represent resource constraints for unclean pipelines, and the assignment or mapping of operations from a loop to those pipelines. In this paper we provide a framework which does exactly this, and in addition constructs rate-optimal software pipelined schedules. The proposed formulation and a solution method have been implemented and tested on a set of 1006 loops taken from various scientific and integer benchmark suites. The formulation found a rate-optimal schedule for 75\% of the loops, and required a median time of only 2 seconds per loop on a SPARC 10/30.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng., McGill Univ., Montreal, Que., Canada", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C1180 (Optimisation techniques); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Architectures; experimentation; Integer benchmark suites; Integer linear programming framework; languages; Loop; Mapping; Operations; performance; Rate-optimal schedules; Rate-optimal software pipelined schedules; Resource constraints; Scheduling; Scientific benchmark suites; Software pipelining; SPARC 10/30; Structural hazards; Unclean pipelines", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Linear programming. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems.", thesaurus = "Integer programming; Linear programming; Pipeline processing; Processor scheduling", } @Article{Lo:1995:IBS, author = "Jack L. Lo and Susan J. Eggers", title = "Improving balanced scheduling with compiler optimizations that increase instruction-level parallelism", journal = j-SIGPLAN, volume = "30", number = "6", pages = "151--162", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p151-lo/", abstract = "Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory latency caused by cache hits and misses on non-blocking architectures. In contrast, balanced scheduling schedules instructions based on an estimate of the amount of instruction-level parallelism in the program. By scheduling independent instructions behind loads based on what the program can provide, rather than what the implementation stipulates in the best case (i.e., a cache hit), balanced scheduling can hide variations in memory latencies more effectively.\par Since its success depends on the amount of instruction-level parallelism in the code, balanced scheduling should perform even better when more parallelism is available. In this study, we combine balanced scheduling with three compiler optimizations that increase instruction-level parallelism: loop unrolling, trace scheduling and cache locality analysis. Using code generated for the DEC Alpha by the Multiflow compiler, we simulated a non-blocking processor architecture that closely models the Alpha 21164. Our results show that balanced scheduling benefits from all three optimizations, producing average speedups that range from 1.15 to 1.40, across the optimizations. More importantly, because of its ability to tolerate variations in load interlocks, it improves its advantage over traditional scheduling. Without the optimizations, balanced scheduled code is, on average, 1.05 times faster than that generated by a traditional scheduler; with them, its lead increases to 1.18.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Alpha 21164; Average speedups; Balanced scheduled code; Cache locality analysis; Compiler optimizations; DEC Alpha; Improved balanced scheduling; Independent instruction scheduling; Instruction-level parallelism; languages; List schedulers; Load interlocks; Loads; Loop unrolling; measurement; Memory latency variation hiding; Multiflow compiler; Nonblocking processor architecture; performance; Program; Trace scheduling", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", thesaurus = "Cache storage; Optimising compilers; Processor scheduling; Resource allocation", } @Article{Amagbegnon:1995:IDF, author = "Pascalin Amagb{\'e}gnon and Lo{\"\i}c Besnard and Paul Le Guernic", title = "Implementation of the data-flow synchronous language {SIGNAL}", journal = j-SIGPLAN, volume = "30", number = "6", pages = "163--173", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Amagbegnon:1995:IDS, author = "Pascalin Amagb{\'e}gnon and Lo{\"\i}c Besnard and Paul Le Guernic", title = "Implementation of the data-flow synchronous language {SIGNAL}", journal = j-SIGPLAN, volume = "30", number = "6", pages = "163--173", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p163-amagbegnon/", abstract = "This paper presents the techniques used for the compilation of the data-flow, synchronous language SIGNAL. The key feature of the compiler is that it performs formal calculus on systems of boolean equations. The originality of the implementation of the compiler lies in the use of a tree structure to solve the equations.", acknowledgement = ack-nhfb, affiliation = "IRISA, Rennes, France", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C4210 (Formal logic); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Boolean equations; Compilation; Equation solving; Formal calculus; languages; SIGNAL data-flow synchronous language; Tree structure", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Data-flow languages. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\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.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", thesaurus = "Boolean algebra; Parallel languages; Process algebra; Program compilers; Tree data structures", } @Article{Aiken:1995:BSM, author = "Alexander Aiken and Manuel F{\"a}hndrich and Raph Levien", title = "Better static memory management: improving region-based analysis of higher-order languages", journal = j-SIGPLAN, volume = "30", number = "6", pages = "174--185", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p174-aiken/", abstract = "Static memory management replaces runtime garbage collection with compile time annotations that make all memory allocation and deallocation explicit in a program. We improve upon the Tofte/Talpin region based scheme for compile time memory management (M. Tofte and J.-P. Talpin, 1994). In the Tofte/Talpin approach, all values, including closures, are stored in regions. Region lifetimes coincide with lexical scope, thus forming a runtime stack of regions and eliminating the need for garbage collection. We relax the requirement that region lifetimes be lexical. Rather, regions are allocated late and deallocated as early as possible by explicit memory operations. The placement of allocation and deallocation annotations is determined by solving a system of constraints that expresses all possible annotations. Experiments show that our approach reduces memory requirements significantly, in some cases asymptotically.", acknowledgement = ack-nhfb, affiliation = "Comput. Sci. Div., California Univ., Berkeley, CA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Closures; Compile time annotations; Compile time memory management; Deallocation annotations; experimentation; Explicit memory operations; Higher order languages; Higher-order languages; languages; Lexical scope; Memory allocation; Region based analysis; Region lifetimes; Region-based analysis; Runtime garbage collection; Runtime stack; Static memory management; Tofte/Talpin region based scheme", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\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.", thesaurus = "High level languages; Program compilers; Storage allocation; Storage management", } @Article{Liao:1995:SAD, author = "Stan Liao and Srinivas Devadas and Kurt Keutzer and Steve Tjiang and Albert Wang", title = "Storage assignment to decrease code size", journal = j-SIGPLAN, volume = "30", number = "6", pages = "186--195", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p186-liao/", abstract = "DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, general-purpose registers. Hence, it is necessary to use address registers and perform address arithmetic to access automatic variables. Subsuming the address arithmetic into auto-increment and auto-decrement modes improves the size of the generated code. In this paper we present a formulation of the problem of optimal storage assignment such that explicit instructions for address arithmetic are minimized. We prove that for the case of a single address register the decision problem is NP-complete. We then generalize the problem to multiple address registers. For both cases heuristic algorithms are given. Our experimental results indicate an improvement of 3.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng. and Comput. Sci., MIT, Cambridge, MA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "B1265F (Microprocessors and microcomputers); C4240C (Computational complexity); C5135 (Digital signal processing chips); C5260 (Digital signal processing); C6120 (File organisation)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Address arithmetic; Address registers; algorithms; Auto decrement modes; Auto increment; Automatic variables; Code size decreasing; Decision problem; DSP architectures; experimentation; Explicit instructions; Heuristic algorithms; Indirect addressing modes; languages; Multiple address registers; NP complete; Optimal storage assignment; Single address register; Storage assignment; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", thesaurus = "Computational complexity; Digital signal processing chips; Storage allocation; Storage management", } @Article{Krishnamurthy:1995:OPP, author = "Arvind Krishnamurthy and Katherine Yelick", title = "Optimizing parallel programs with explicit synchronization", journal = j-SIGPLAN, volume = "30", number = "6", pages = "196--204", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p196-krishnamurthy/", abstract = "We present compiler analyses and optimizations for explicitly parallel programs that communicate through a shared address space. Any type of code motion on explicitly parallel programs requires a new kind of analysis to ensure that operations reordered on one processor cannot be observed by another. The analysis, based on work by Shasha and Snir, checks for cycles among interfering accesses. We improve the accuracy of their analysis by using additional information from post-wait synchronization, barriers, and locks. We demonstrate the use of this analysis by optimizing remote access on distributed memory machines. The optimizations include {\em message pipelining\/}, to allow multiple outstanding remote memory operations, conversion of two-way to one-way communication, and elimination of communication through data re-use. The performance improvements are as high as 20-35\% for programs running on a CM-5 multiprocessor using the Split-C language as a global address layer.", acknowledgement = ack-nhfb, affiliation = "Comput. Sci. Div., California Univ., Berkeley, CA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C5440 (Multiprocessing systems); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; CM-5 multiprocessor; Code motion; Compiler analyses; Data reuse; design; Distributed memory machines; experimentation; Explicit synchronization; Explicitly parallel programs; Global address layer; Interfering accesses; Message pipelining; Multiple outstanding remote memory operations; Parallel program optimization; Performance improvements; Post wait synchronization; Remote access; Shared address space; Split-C language", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\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, Concurrent, distributed, and parallel languages.", thesaurus = "Distributed memory systems; Parallel programming; Parallelising compilers; Synchronisation", } @Article{Cierniak:1995:UDC, author = "Micha{\l} Cierniak and Wei Li", title = "Unifying data and control transformations for distributed shared-memory machines", journal = j-SIGPLAN, volume = "30", number = "6", pages = "205--217", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p205-cierniak/", abstract = "We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Control transformations involve changing the execution order of programs. We have developed new techniques for compiler optimizations for distributed shared-memory machines, although the same techniques can be used for sequential machines with a memory hierarchy. Our compiler optimizations are based on an algebraic representation of data mappings and a new data locality model. We present a pure data transformation algorithm and an algorithm unifying data and control transformations. While there has been much work on control transformations, the opportunities for data transformations have been largely neglected. In fact, data transformations have the advantage of being applicable to programs that cannot be optimized with control transformations. The unified algorithm, which performs data and control transformations {\em simultaneously\/}, offers improvement over optimizations obtained by applying data and control transformations separately. The experimental results using a set of applications on a parallel machine show that the new optimizations improve performance significantly. These results are further analyzed using locality metrics with instrumentation and simulation.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rochester Univ., NY, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C5440 (Multiprocessing systems); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Algebraic representation; algorithms; Array layout; Compiler optimizations; Control transformations; Data locality model; Data mappings; Distributed shared memory machines; Distributed shared-memory machines; experimentation; Locality metric; Locality optimization; Parallel machine; performance; Pure data transformation algorithm; Unified approach", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", thesaurus = "Distributed memory systems; Optimising compilers; Parallel programming; Shared memory systems", } @Article{Rauchwerger:1995:LTS, author = "Lawrence Rauchwerger and David Padua", title = "The {LRPD} test: speculative run-time parallelization of loops with privatization and reduction parallelization", journal = j-SIGPLAN, volume = "30", number = "6", pages = "218--232", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p218-rauchwerger/", abstract = "Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or statically insufficiently defined access patterns. As parallelizable loops arise frequently in practice, we advocate a novel framework for their identification: speculatively execute the loop as a doall, and apply a fully parallel data dependence test to determine if it had any cross-iteration dependences; if the test fails, then the loop is re-executed serially. Since, from our experience, a significant amount of the available parallelism in Fortran programs can be exploited by loops transformed through {\em privatization\/} and {\em reduction parallelization\/}, our methods can speculatively apply these transformations and then check their validity at run-time. Another important contribution of this paper is a novel method for {\em reduction recognition\/} which goes beyond syntactic pattern matching; it detects at run-time if the values stored in an array participate in a reduction operation, even if they are transferred through private variables and/or are affected by statically unpredictable control flow. We present experimental results on loops from the PERFECT Benchmarks which substantiate our claim that these techniques can yield significant speedups which are often superior to those obtainable by inspector/executor methods.", acknowledgement = ack-nhfb, affiliation = "Illinois Univ., Urbana, IL, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Access patterns; algorithms; Cross iteration dependences; experimentation; Fortran programs; Fully parallel data dependence test; languages; LRPD test; Parallelizable loops; Parallelizing compilers; PERFECT Benchmarks; performance; Private variables; Privatization; Reduction parallelization; Reduction recognition; Speculative run time parallelization; Speculative run-time parallelization; Statically unpredictable control flow; Syntactic pattern matching", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", thesaurus = "Parallel programming; Parallelising compilers; Program testing", } @Article{Knoop:1995:PAM, author = "Jens Knoop and Oliver R{\"u}thing and Bernhard Steffen", title = "The power of assignment motion", journal = j-SIGPLAN, volume = "30", number = "6", pages = "233--245", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p233-knoop/", abstract = "{\em Assignment motion (AM)\/} and {\em expression motion (EM)\/} are the basis of powerful and at the first sight incomparable techniques for removing partially redundant code from a program. Whereas AM aims at the elimination of complete assignments, a transformation which is always desirable, the more flexible EM requires temporaries to remove partial redundancies. Based on the observation that a simple program transformation enhances AM to subsume EM, we develop an algorithm that for the first time captures all second order effects between AM and EM transformations. Under usual structural restrictions, the worst case time complexity of our algorithm is essentially quadratic, a fact which explains the promising experience with our implementation.", acknowledgement = ack-nhfb, affiliation = "Passau Univ., Germany", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C4240C (Computational complexity); C6110 (Systems analysis and programming); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; AM; Assignment motion; Code motion; Data flow analysis; EM; Expression motion; Partial redundancies; Partially redundant code removal; Program optimization; Second order effects; Simple program transformation; Structural restrictions; theory; Transformation; verification; Worst case time complexity", 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, Functional constructs. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", thesaurus = "Computational complexity; Data flow analysis; Redundancy", } @Article{Click:1995:GCM, author = "Cliff Click", title = "Global code motion: global value numbering", journal = j-SIGPLAN, volume = "30", number = "6", pages = "246--257", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p246-click/", abstract = "Optimizing compilers should treat the machine independent optimizations (e.g., conditional constant propagation, global value numbering) and code motion issues separately. Removing the code motion requirements from the machine independent optimizations allows stronger optimizations using simpler algorithms. Preserving a legal schedule is one of the prime sources of complexity in algorithms like PRE (E. Morel and C. Renvoise, 1979) or global congruence finding (B. Alpern et al., 1988). We present a straightforward near linear time algorithm for performing global code motion (GCM). Our GCM algorithm hoists code out of loops and pushes it into more control dependent (and presumably less frequently executed) basic blocks. GCM is not optimal in the sense that it may lengthen some paths; it hoists control dependent code out of loops. This is profitable if the loop executes at least once; frequently it is very profitable. GCM relies only on dependences between instructions; the original schedule order is ignored. GCM moves instructions, but it does not alter the control flow graph (CFG) nor remove redundant code. GCM benefits from CFG shaping (such as splitting control dependent edges, or inserting loop landing pads). GCM allows us to use a simple hash based technique for global value numbering (GVN).", acknowledgement = ack-nhfb, affiliation = "Hewlett--Packard Lab., Cambridge, MA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; CFG; CFG shaping; Code motion issues; Code motion requirements; Complexity; Control dependent code; Control dependent edges; Control flow graph; experimentation; GCM; GCM algorithm; Global code motion; Global value numbering; Legal schedule; Loop landing pads; Machine independent optimizations; Near linear time algorithm; Optimizing compilers; Simple hash based technique", 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, Program and recursion schemes. {\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, Trees.", thesaurus = "File organisation; Optimising compilers; Programming", } @Article{Agrawal:1995:IPR, author = "Gagan Agrawal and Joel Saltz and Raja Das", title = "Interprocedural partial redundancy elimination and its application to distributed memory compilation", journal = j-SIGPLAN, volume = "30", number = "6", pages = "258--269", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p258-agrawal/", abstract = "Partial Redundancy Elimination (PRE) is a general scheme for suppressing partial redundancies which encompasses traditional optimizations like loop invariant code motion and redundant code elimination. In this paper we address the problem of performing this optimization interprocedurally. We use interprocedural partial redundancy elimination for placement of communication and communication preprocessing statements while compiling for distributed memory parallel machines.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C5440 (Multiprocessing systems); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Communication preprocessing statements; Distributed memory compilation; Distributed memory parallel machines; General scheme; Interprocedural partial redundancy elimination; Loop invariant code motion; Partial redundancy suppression; performance; PRE; Redundant code elimination", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes.", thesaurus = "Data flow analysis; Distributed memory systems; Optimising compilers; Parallel programming; Redundancy", } @Article{Kolte:1995:ERA, author = "Priyadarshan Kolte and Michael Wolfe", title = "Elimination of redundant array subscript range checks", journal = j-SIGPLAN, volume = "30", number = "6", pages = "270--278", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p270-kolte/", abstract = "This paper presents a compiler optimization algorithm to reduce the run time overhead of array subscript range checks in programs without compromising safety. The algorithm is based on partial redundancy elimination and it incorporates previously developed algorithms for range check optimization. We implemented the algorithm in our research compiler, Nascent, and conducted experiments on a suite of 10 benchmark programs to obtain four results: (1) the execution overhead of naive range checking is high enough to merit optimization, (2) there are substantial differences between various optimizations, (3) loop-based optimizations that hoist checks out of loops are effective in eliminating about 98\% of the range checks, and (4) more sophisticated analysis and optimization algorithms produce very marginal benefits.", acknowledgement = ack-nhfb, affiliation = "Oregon Graduate Inst. of Sci. and Technol., Beaverton, OR, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Benchmark programs; Compiler optimization algorithm; Execution overhead; experimentation; languages; Loop based optimizations; measurement; Naive range checking; Nascent; Optimization algorithms; Partial redundancy elimination; performance; Range check optimization; Redundant array subscript range check elimination; Research compiler; Run time overhead", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN.", thesaurus = "Optimising compilers; Program diagnostics; Redundancy", } @Article{Coleman:1995:TSS, author = "Stephanie Coleman and Kathryn S. McKinley", title = "Tile size selection using cache organization and data layout", journal = j-SIGPLAN, volume = "30", number = "6", pages = "279--290", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p279-coleman/", abstract = "When dense matrix computations are too large to fit in cache, previous research proposes tiling to reduce or eliminate capacity misses. This paper presents a new algorithm for choosing problem-size dependent tile sizes based on the cache size and cache line size for a direct-mapped cache. The algorithm eliminates both capacity and self-interference misses and reduces cross-interference misses. We measured simulated miss rates and execution times for our algorithm and two others on a variety of problem sizes and cache organizations. At higher set associativity, our algorithm does not always achieve the best performance. However on direct-mapped caches, our algorithm improves simulated miss rates and measured execution times when compared with previous work.", acknowledgement = ack-nhfb, affiliation = "Intermetrics Inc., Cambridge, MA, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C4140 (Linear algebra); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Algorithm; algorithms; Cache line size; Cache organization; Cache size; Capacity misses; Compiler optimisation; Cross-interference misses; Data layout; Dense matrix computations; Direct-mapped cache; Execution times; experimentation; languages; measurement; performance; Problem-size dependent tile size selection; Self-interference misses; Set associativity; Simulated miss rates; Tile size selection", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices.", thesaurus = "Cache storage; Matrix algebra; Optimising compilers", } @Article{Larus:1995:EME, author = "James R. Larus and Eric Schnarr", title = "{EEL}: machine-independent executable editing", journal = j-SIGPLAN, volume = "30", number = "6", pages = "291--300", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:27 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p291-larus/", abstract = "EEL (Executable Editing Library) is a library for building tools to analyze and modify an executable (compiled) program. The systems and languages communities have built many tools for error detection, fault isolation, architecture translation, performance measurement, simulation, and optimization using this approach of modifying executables. Currently, however, tools of this sort are difficult and time-consuming to write and are usually closely tied to a particular machine and operating system. EEL supports a machine- and system-independent editing model that enables tool builders to modify an executable without being aware of the details of the underlying architecture or operating system or being concerned with the consequences of deleting instructions or adding foreign code.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6110B (Software engineering techniques); C6115 (Programming support); C6150G (Diagnostic, testing, debugging and evaluating systems)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Architecture translation; EEL; Error detection; Executable Editing Library; Executable program analysis; Executable program modification; Fault isolation; Machine-independent executable editing; Optimization; performance; Performance measurement; Simulation; System-independent editing model; Tool builders", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Software libraries. {\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, Optimization.", thesaurus = "Software libraries; Software tools; System monitoring", } @Article{Larus:1995:EMI, author = "James R. Larus and Eric Schnarr", title = "{EEL}: machine-independent executable editing", journal = j-SIGPLAN, volume = "30", number = "6", pages = "291--300", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Barrett:1995:GCU, author = "David A. Barrett and Benjamin G. Zorn", title = "Garbage collection using a dynamic threatening boundary", journal = j-SIGPLAN, volume = "30", number = "6", pages = "301--314", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p301-barrett/", abstract = "Generational techniques have been very successful in reducing the impact of garbage collection algorithms upon the performance of programs. However, all generational algorithms occasionally promote objects that later become garbage, resulting in an accumulation of garbage in older generations. Reclaiming this {\em tenured\/} garbage without resorting to collecting the entire heap is a difficult problem. In this paper, we describe a mechanism that extends existing generational collection algorithms by allowing them to reclaim tenured garbage more effectively. In particular, our {\em dynamic threatening boundary\/} mechanism divides memory into two spaces, one for shortlived, and another for long-lived objects. Unlike previous work, our collection mechanism can dynamically adjust the boundary between these two spaces either forward or backward in time, essentially allowing data to become untenured. We describe an implementation of the dynamic threatening boundary mechanism and quantify its associated costs. We also describe a policy for setting the threatening boundary and evaluate its performance relative to existing generational collection algorithms. Our results show that a policy that uses the dynamic threatening boundary mechanism is effective at reclaiming tenured garbage.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Colorado Univ., Boulder, CO, USA", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Costs; Dynamic threatening boundary; Garbage collection; Generational collection algorithms; languages; Long-lived objects; Memory; performance; Performance; Short-lived objects; Tenured garbage reclaiming", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", thesaurus = "Algorithm theory; Storage management", } @Article{Ertl:1995:SCI, author = "M. Anton Ertl", title = "Stack caching for interpreters", journal = j-SIGPLAN, volume = "30", number = "6", pages = "315--327", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p315-ertl/", abstract = "An interpreter can spend a significant part of its execution time on accessing arguments of virtual machine instructions. This paper explores two methods to reduce this overhead for virtual stack machines by caching top-of-stack values in (real machine) registers. The {\em dynamic method\/} is based on having, for every possible state of the cache, one specialized version of the whole interpreter; the execution of an instruction usually changes the state of the cache and the next instruction is executed in the version corresponding to the new state. In the {\em static method\/} a state machine that keeps track of the cache state is added to the compiler. Common instructions exist in specialized versions for several states, but it is not necessary to have a version of every instruction for every cache state. Stack manipulation instructions are optimized away.", acknowledgement = ack-nhfb, affiliation = "Inst. fur Comput., Tech. Univ. Wien, Austria", annote = "Published as part of the Proceedings of PLDI'95.", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Cache state; Common instructions; Compiler; Dynamic method; Execution time; Instruction execution; Interpreters; languages; performance; Real machine registers; Specialized version; Stack caching; Stack manipulation instructions; State machine; Top-of-stack value caching; Virtual machine instruction argument access; Virtual stack machines", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", thesaurus = "Cache storage; Program compilers; Program interpreters", } @Article{Krauter:1995:BRTb, author = "Klaus Krauter", title = "Book Review: {Tool Integration: Environments and Frameworks, Edited by: D. Schefstrom and G. van den Broek}", journal = j-SIGPLAN, volume = "30", number = "7", pages = "2--2", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Na:1995:BRD, author = "Piaw Na", title = "Book Review: {Debugging: Creative Techniques and Tools for Software Repair, by Martin Stitt}", journal = j-SIGPLAN, volume = "30", number = "7", pages = "3--3", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Spinellis:1995:BRHb, author = "Diomidis Spinellis", title = "Book Review: {High-Speed Windows Applications: Multitasking Design Methods, by Dr. Bruce E. Krell}", journal = j-SIGPLAN, volume = "30", number = "7", pages = "4--4", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Raghavachari:1995:BRH, author = "Mukund Raghavachari", title = "Book Review: {The High Performance Fortran Handbook by Charles Koelbel, David Loveman, Robert Schreiber, Guy Steele Jr., and Mary Zosel}", journal = j-SIGPLAN, volume = "30", number = "7", pages = "5--5", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sankaran:1995:BRC, author = "Nandakumar Sankaran", title = "Book Review: {Categories for Types by Roy L. Crole}", journal = j-SIGPLAN, volume = "30", number = "7", pages = "6--6", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Parsons:1995:BRP, author = "Peter Parsons", title = "Book Review: {Parallel Algorithms for Digital image Processing, Computer Vision and Neural Networks, by Ed. I. Pitas}", journal = j-SIGPLAN, volume = "30", number = "7", pages = "7--7", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kamin:1995:RWF, author = "Samuel Kamin and Eric Golin", title = "Report of a workshop on future directions in programming languages and compilers", journal = j-SIGPLAN, volume = "30", number = "7", pages = "9--28", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1995:RFD, author = "Anonymous", title = "Report: Future Directions Workshop", journal = j-SIGPLAN, volume = "30", number = "7", pages = "9--??", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deVivo:1995:BEC, author = "Marco {de Vivo} and Gabriela O. de Vivo and Luis Gonzalez", title = "A Brief {ESSAY} on Capabilities", journal = j-SIGPLAN, volume = "30", number = "7", pages = "29--36", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Howatt:1995:PBA, author = "James Howatt", title = "A project-based approach to programming language evaluation", journal = j-SIGPLAN, volume = "30", number = "7", pages = "37--40", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Howatt:1995:PAP, author = "James Howatt", title = "A Project-Based Approach to Programming Language Evaluation", journal = j-SIGPLAN, volume = "30", number = "7", pages = "37--??", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hallett:1995:FUM, author = "Jon Hallett", title = "Formulating Update Messages", journal = j-SIGPLAN, volume = "30", number = "7", pages = "41--44", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Navrat:1995:RCA, author = "Pavol N{\'a}vrat and Maria Bielikov{\'a}", title = "Representing Calendrical Algorithms and Data in {Prolog} and {Prolog III} Languages", journal = j-SIGPLAN, volume = "30", number = "7", pages = "45--51", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{XueDong:1995:IVI, author = "Li XueDong and Zheng Guoliang", title = "Introducing virtual instance variables in classes to provide sufficient support for encapsulation", journal = j-SIGPLAN, volume = "30", number = "7", pages = "52--56", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:07 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Li:1995:IVI, author = "XueDong Li and GuoLiang Zheng", title = "Introducing Virtual Instance Variables in Classes to Provide Sufficient Support for Encapsulation", journal = j-SIGPLAN, volume = "30", number = "7", pages = "52--??", month = jul, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bordawekar:1995:MCS, author = "Rajesh Bordawekar and Alok Choudhary and Ken Kennedy and Charles Koelbel and Michael Paleczny", title = "A model and compilation strategy for out-of-core data parallel programs", journal = j-SIGPLAN, volume = "30", number = "8", pages = "1--10", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "It is widely acknowledged in high-performance computing circles that parallel input-output needs substantial improvement in order to make scalable computers truly usable. We present a data storage model that allows processors independent access to their own data and a corresponding compilation strategy that integrates data-parallel computation with data distribution for out-of-core problems. Our results compare several communication methods and I/O optimizations using two out-of-core problems, Jacobi iteration and LU factorization.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. and Comput. Eng., Syracuse Univ., NY, USA", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Communication methods; Compilation strategy; Data distribution; Data storage model; High-performance computing; I/O optimizations; Independent access; Jacobi iteration; LU factorization; Out-of-core data parallel programs; Parallel input-output; Scalable computers", thesaurus = "Input-output programs; Iterative methods; Matrix decomposition; Parallel programming; Parallelising compilers", } @Article{Gotwals:1995:PSL, author = "Jacob Gotwals and Suresh Srinivas and Dennis Gannon", title = "{pC++}\slash streams: {A} Library for {I/O} on Complex Distributed Data Structures", journal = j-SIGPLAN, volume = "30", number = "8", pages = "11--18", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The design and implementation of portable, efficient and expressive mechanisms for I/O on complex distributed data structures-such as found in adaptive parallel applications-is a challenging problem that we address in this paper. We describe the design, programmer interface, implementation and performance of pC++/streams, a library that provides an expressive mechanism for I/O on distributed arrays of variable-sized objects in pC++, an object-parallel language. pC++/streams is intended for developers of parallel programs requiring efficient high-level I/O abstractions for checkpointing, scientific visualization and debugging. pC++/streams is an implementation of d/streams, a language-independent abstraction for buffered I/O on distributed data structures. We describe the d/streams abstraction and present performance results on the Intel Paragon and SGI Challenge showing that d/streams can be implemented efficiently and portably.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", classification = "C6110B (Software engineering techniques); C6110J (Object-oriented programming); C6110P (Parallel programming); C6115 (Programming support); C6120 (File organisation); C6130B (Graphics techniques); C6140D (High level languages); C6150G (Diagnostic, testing, debugging and evaluating systems); C6150J (Operating systems); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Adaptive parallel applications; Buffered I/O; Checkpointing; Complex distributed data structures; D/streams; Debugging; Distributed arrays; Efficient high-level I/O abstractions; I/O primitives library; Intel Paragon; Language-independent abstraction; Object-parallel language; Parallel programs; PC++; PC++/streams; Performance; Portable expressive mechanisms; Programmer interface; Scientific visualization; SGI Challenge; Variable-sized objects", thesaurus = "Application program interfaces; Arrays; C language; Data structures; Data visualisation; Input-output programs; Object-oriented languages; Object-oriented programming; Parallel languages; Parallel programming; Program debugging; Software libraries; Software performance evaluation; Software portability", } @Article{Darlington:1995:PSS, author = "John Darlington and Yi-ke Guo and Hing Wing To and Jin Yang", title = "Parallel skeletons for structured composition", journal = j-SIGPLAN, volume = "30", number = "8", pages = "19--28", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Proposes a straightforward solution to the problems of compositional parallel programming by using skeletons as the uniform mechanism for structured composition. In our approach, parallel programs are constructed by composing procedures in a conventional base language using a set of high-level, predefined, functional, parallel computational forms known as skeletons. The ability to compose skeletons provides us with the essential tools for building further and more complex application-oriented skeletons specifying important aspects of parallel computation. Compared with the process network-based composition approaches, such as PCN (Program Composition Notation), the skeleton approach abstracts away the fine details of connecting communication ports to the higher level mechanism of making data distributions conform, thus avoiding the complexity of using lower level ports as the means of interaction. Thus, the framework provides a natural integration of the compositional programming approach with the data parallel programming paradigm.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput., Imperial Coll. of Sci., Technol. and Med., London, UK", classification = "C6110B (Software engineering techniques); C6110P (Parallel programming)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Application-oriented skeletons; Base language; Communication port connection; Compositional parallel programming; Data distribution conformity; Data parallel programming paradigm; High-level predefined functional parallel computational forms; Lower level ports; Parallel skeletons; PCN; Process network-based composition; Program Composition Notation; Structured composition", thesaurus = "Parallel programming; Software portability", } @Article{Carlisle:1995:SCC, author = "Martin C. Carlisle and Anne Rogers", title = "Software caching and computation migration in {Olden}", journal = j-SIGPLAN, volume = "30", number = "8", pages = "29--38", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The goal of the Olden project is to build a system that provides parallelism for general-purpose C programs with minimal programmer annotations. We focus on programs using dynamic structures such as trees, lists and directed acyclic graphs (DAGs). We demonstrate that providing both software caching and computation migration can improve the performance of these programs, and provide a compile-time heuristic that selects between them for each pointer dereference. We have implemented a prototype system on the Thinking Machines CM-5. We describe our implementation and report on experiments with 10 benchmarks.", acknowledgement = ack-nhfb, affiliation = "Princeton Univ., NJ, USA", classification = "C6110B (Software engineering techniques); C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Benchmarks; Compile-time heuristic; Computation migration; Connection Machine CM-5; Directed acyclic graphs; Dynamic structures; General-purpose C programs; Lists; Minimal programmer annotations; Olden project; Parallelism; Pointer dereference; Program performance improvement; Software caching; Thinking Machines CM-5; Trees", thesaurus = "Cache storage; Data structures; Parallel programming; Parallelising compilers; Software performance evaluation; Software portability", } @Article{Carlson:1995:DDA, author = "William W. Carlson and Jesse M. Draper", title = "Distributed data access in {AC}", journal = j-SIGPLAN, volume = "30", number = "8", pages = "39--47", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "We have modified the C language to support a programming model based on a shared address space with physically distributed memory. With this model, called AC, users can write programs in which the nodes of a massively parallel processor can access remote memory without message passing. AC provides support for distributed arrays as well as pointers to distributed data. Simple array references and pointer dereferencing are sufficient to generate low-overhead remote reads and writes. We have implemented these ideas in a compiler based on the GNU C compiler and targeted at Cray Research's T3D. Initial performance measurements show that AC generates code for remote accesses which is considerably faster than that of the native compiler for structures up to about 16 words in size and virtually equivalent for larger transfers.", acknowledgement = ack-nhfb, affiliation = "IDA Supercomput. Res. Center, Bowie, MD, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "AC language; Array references; C language; Cray T3D; Distributed arrays; Distributed data access; GNU C compiler; Low-overhead remote read/write operations; Massively parallel processor; Performance measurements; Physically distributed memory; Pointer dereferencing; Programming model; Remote memory access; Shared address space", thesaurus = "Arrays; C language; Data structures; Distributed memory systems; Parallel languages; Parallelising compilers; Shared memory systems", } @Article{Andersson:1995:GPC, author = "Niclas Andersson and Peter Fritzson", title = "Generating parallel code from object oriented mathematical models", journal = j-SIGPLAN, volume = "30", number = "8", pages = "48--57", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "For a long time, efficient use of parallel computers has been hindered by dependencies introduced in software through low-level implementation practice. In this paper, we present a programming environment and language called Object-Math (an object-oriented mathematical language for scientific computing), which aims at eliminating this problem by allowing the user to represent mathematical equation-based models directly in the system. The system performs an analysis of mathematical models to extract parallelism and automatically generates parallel code for numerical solution. In the context of industrial applications in mechanical analysis, we have so far primarily explored the generation of parallel code for solving systems of ordinary differential equations (ODEs), in addition to preliminary work on generating code for solving partial differential equations. Two approaches to extracting parallelism have been implemented and evaluated: extracting parallelism at the equation system level and at the single equation level, respectively. We found that for several applications, the corresponding systems of equations do not partition well into subsystems. This means that the equation system-level approach is of restricted general applicability. Thus, we focused on the equation-level approach, which yielded significant parallelism for the solution of ODE systems. For the bearing simulation applications which we present in this paper, the achieved speedup is, however, critically dependent on low communication latency of the parallel computer.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. and Inf. Sci., Link{\"o}ping Univ., Sweden", classification = "C4170 (Differential equations); C6110J (Object-oriented programming); C6110P (Parallel programming); C6115 (Programming support); C6140D (High level languages); C7310 (Mathematics computing); C7440 (Civil and mechanical engineering computing)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Bearing simulation; Equation system level; Equation system partitioning; Industrial applications; Low communication latency; Mathematical equation-based models; Mechanical analysis; Numerical solution; Object-Math; Object-oriented mathematical language; Ordinary differential equations; Parallel code generation; Parallelism extraction; Partial differential equations; Programming environment; Scientific computing; Single equation level; Software dependencies; Speedup", thesaurus = "Application generators; Differential equations; Mathematics computing; Mechanical engineering computing; Numerical analysis; Object-oriented languages; Object-oriented programming; Parallel languages; Parallel programming; Programming environments", } @Article{Ghuloum:1995:FPI, author = "Anwar M. Ghuloum and Allan L. Fisher", title = "Flattening and parallelizing irregular, recurrent loop nests", journal = j-SIGPLAN, volume = "30", number = "8", pages = "58--67", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Irregular loop nests in which the loop bounds are determined dynamically by indexed arrays are difficult to compile into expressive parallel constructs, such as segmented scans and reductions. In this paper, we describe a suite of transformations to automatically parallelize such irregular loop nests, even in the presence of recurrences. We describe a simple, general loop flattening transformation, along with new optimizations which make it a viable compiler transformation. A robust recurrence parallelization technique is coupled to the loop flattening transformation, allowing parallelization of segmented reductions, scans and combining-sends over arbitrary associative operators. We discuss the implementation and performance results of the transformations in a parallelizing Fortran 77 compiler for the Cray C90 supercomputer. In particular, we focus on important sparse matrix-vector multiplication kernels, for one of which we are able to automatically derive an algorithm used by one of the fastest library routines available.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Associative operators; Automatic parallelization; Combining-sends; Compiler transformation; Cray C90 supercomputer; Dynamically determined loop bounds; Expressive parallel constructs; Indexed arrays; Irregular recurrent loop nests; Library routines; Loop flattening transformation; Optimizations; Parallelizing Fortran 77 compiler; Performance; Recurrence parallelization technique; Segmented reductions; Segmented scans; Sparse matrix-vector multiplication kernels", thesaurus = "FORTRAN; Mathematics computing; Matrix multiplication; Parallelising compilers; Program control structures; Sparse matrices; Vectors", } @Article{Mukherjee:1995:ESI, author = "Shubhendu S. Mukherjee and Shamik D. Sharma and Mark D. Hill and James R. Larus and Anne Rogers and Joel Saltz", title = "Efficient support for irregular applications on distributed-memory machines", journal = j-SIGPLAN, volume = "30", number = "8", pages = "68--79", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Irregular computation problems underlie many important scientific applications. Although these problems are computationally expensive, and so would seem appropriate for parallel machines, their irregular and unpredictable run-time behavior makes this type of parallel program difficult to write and adversely affects run-time performance. This paper explores three issues-partitioning, mutual exclusion and data transfer-which are crucial to the efficient execution of irregular problems on distributed-memory machines. Unlike previous work, we studied the same programs running in three alternative systems on the same hardware base (a Thinking Machines CM-5): the CHAOS irregular application library, TSM (Transparent Shared Memory), and XSM (eXtensible Shared Memory). CHAOS and XSM performed equivalently for all three applications. Both systems were somewhat (13\%) to significantly faster (991\%) than TSM.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", classification = "C6110P (Parallel programming); C6115 (Programming support); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "CHAOS irregular application library; Connection Machine CM-5; Data transfer; Distributed-memory machines; Efficient execution; Extensible shared memory; Irregular applications support; Irregular computation problems; Mutual exclusion; Parallel program; Partitioning; Performance; Run-time performance; Scientific applications; Thinking Machines CM-5; Transparent shared memory; TSM; Unpredictable run-time behavior; XSM", thesaurus = "Distributed memory systems; Parallel programming; Shared memory systems; Software libraries; Software performance evaluation", } @Article{Brewer:1995:HLO, author = "Eric A. Brewer", title = "High-level optimization via automated statistical modeling", journal = j-SIGPLAN, volume = "30", number = "8", pages = "80--91", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Brewer:1995:HOA, author = "E. A. Brewer", title = "High-level optimization via automated statistical modeling", journal = j-SIGPLAN, volume = "30", number = "8", pages = "80--91", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "We develop the use of statistical modeling for portable high-level optimizations such as data layout and algorithm selection. We build the models automatically from profiling information which ensures robust and accurate models that reflect all aspects of the target platform. We use the models to select among several data layouts for an iterative PDE solver and to select among several sorting algorithms. The selection is correct more than 99\% of the time on each of four platforms. In the few cases it selects suboptimally, the selected implementation performs nearly as well; that is, it always makes at least a very good choice. Correct selection is platform- and workload-dependent and can improve the performance by nearly a factor of three. We also use the models to optimize parameters of these applications automatically. In all cases, the models predicted the optimal parameter setting, resulting in improvements ranging up to factor of three. Finally, we use the models to construct portable high-level libraries, which contain multiple implementations and support for automatic selection and parameter optimization of the fastest implementation for the target platform and workload.", acknowledgement = ack-nhfb, affiliation = "California Univ., Berkeley, CA, USA", classification = "C1140Z (Other topics in statistics); C1180 (Optimisation techniques); C4170 (Differential equations); C6110B (Software engineering techniques); C6115 (Programming support); C6130 (Data handling techniques); C7310 (Mathematics computing)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Accurate models; Algorithm selection; Automated statistical modeling; Automatic parameter optimization; Data layout; High-level optimization; Iterative PDE solver; Multiple implementations; Partial differential equations; Performance improvement; Platform-dependent selection; Portable high-level libraries; Portable high-level optimizations; Profiling information; Robust models; Sorting algorithm selection; Workload-dependent selection", thesaurus = "Iterative methods; Mathematics computing; Optimisation; Partial differential equations; Software libraries; Software performance evaluation; Software portability; Sorting; Statistics", } @Article{Collard:1995:FAD, author = "Jean-Fran{\c{c}}ois Collard and Denis Barthou and Paul Feautrier", title = "Fuzzy array dataflow analysis", journal = j-SIGPLAN, volume = "30", number = "8", pages = "92--101", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Exact array dataflow analysis can be achieved in the general case if the only control structures are do-loops and structural ifs, and if loop counter bounds and array subscripts are affine expressions of englobing loop counters and possibly some integer constants. In this paper, we begin the study of dataflow analysis of dynamic control programs, where arbitrary ifs and whiles are allowed. In the general case, this dataflow analysis can only be fuzzy.", acknowledgement = ack-nhfb, affiliation = "ENS, Lyon, France", classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6120 (File organisation)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Affine expressions; Arbitrary ifs; Arbitrary whiles; Array subscripts; Control structures; Do-loops; Dynamic control programs; Englobing loop counters; Fuzzy array dataflow analysis; Integer constants; Loop counter bounds; Structural ifs", thesaurus = "Arrays; Data flow analysis; Data structures; Fuzzy logic; Program control structures; Programming theory", } @Article{Kennedy:1995:LTA, author = "Ken Kennedy and Nenad Nedeljkovic and Ajay Sethi", title = "A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs", journal = j-SIGPLAN, volume = "30", number = "8", pages = "102--111", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Data-parallel languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. Novel features of these languages call for the development of new techniques in both compilers and run-time systems. In this paper, we present an improved algorithm for finding the local memory access sequence in computations involving regular sections of arrays with cyclic(k) distributions. After establishing the fact that regular section indices correspond to elements of an integer lattice, we show how to find a lattice basis that allows for simple and fast enumeration of memory accesses. The complexity of our algorithm is shown to be lower than that of the previous solution for the same problem. In addition, the experimental results demonstrate the efficiency of our method in practice.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compilers; Data-parallel programs; Distributed-memory machines; High Performance Fortran; Linear-time algorithm; Memory access sequence; Portable programs; Regular section indices; Run-time systems", thesaurus = "Parallel algorithms; Parallel programming; Processor scheduling; Program compilers", } @Article{Hwang:1995:AOS, author = "Gwan-Hwan Hwang and Jenq Kuen Lee and Dz-Ching Ju", title = "An array operation synthesis scheme to optimize {Fortran} 90 programs", journal = j-SIGPLAN, volume = "30", number = "8", pages = "112--122", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "An increasing number of programming languages, such as Fortran 90 and APL, are providing a rich set of intrinsic array functions and array expressions. These constructs which constitute an important part of data parallel languages provide excellent opportunities for compiler optimizations. In this paper, we present a new approach to combine consecutive data access patterns of array constructs into a composite access function to the source arrays. Our scheme is based on the composition of access functions; which is similar to a composition of mathematic functions. Our new scheme can handle not only data movements of arrays of different numbers of dimensions and segmented array operations but also masked array expressions and multiple sources array operations. As a result, our proposed scheme is the first synthesis scheme which can synthesize Fortran 90 RESHAPE, EOSHIFT, MERGE, and WHERE constructs together. Experimental results show speedups from 1.21 to 2.95 for code fragments from real applications on a Sequent multiprocessor machine by incorporating the proposed optimizations.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan", classification = "C6130 (Data handling techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Array expressions; Array operation synthesis scheme; Compiler optimizations; Composite access function; Consecutive data access patterns; Data parallel languages; Fortran 90 program optimisation; Intrinsic array functions; Masked array expressions; Multiple sources array operations; Segmented array operations; Sequent multiprocessor machine", thesaurus = "Data handling; FORTRAN; Optimising compilers", } @Article{Bader:1995:PAI, author = "David A. Bader and Joseph J{\'a}J{\'a}", title = "Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract)", journal = j-SIGPLAN, volume = "30", number = "8", pages = "123--133", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and connected components. Our general framework is a single-address space, distributed memory programming model. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. Our connected components algorithm uses a novel approach for parallel merging which performs drastically limited updating during iterative steps, and concludes with a total consistency update at the final step. The algorithms have been coded in SPLIT-C and run on a variety of platforms. Our experimental results are consistent with the theoretical analysis and provide the best known execution times for these two primitives, even when compared with machine-specific implementations. More efficient implementations of SPLIT-C will likely result in even faster execution times.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA", classification = "C4240P (Parallel programming and algorithm theory); C5260B (Computer vision and image processing techniques); C6110P (Parallel programming)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Connected components algorithm; Image histogramming; Image processing algorithms; Image understanding; Machine-specific implementations; Parallel algorithms; Portable implementations; Primitives; Scalable parallel processing; Single-address space distributed memory programming model", thesaurus = "Image processing; Parallel algorithms", } @Article{Subhlok:1995:OMS, author = "Jaspal Subhlok and Gary Vondran", title = "Optimal mapping of sequences of data parallel tasks", journal = j-SIGPLAN, volume = "30", number = "8", pages = "134--143", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Many applications in a variety of domains including digital signal processing, image processing, and computer vision are composed of a sequence of tasks that act on a stream of input data sets in a pipelined manner. Recent research has established that these applications are best mapped to a massively parallel machine by dividing the tasks into modules and assigning a subset of the available processors to each module. This paper addresses the problem of optimally mapping such applications onto a massively parallel machine. We formulate the problem of optimizing throughput in task pipelines and present two new solution algorithms. The formulation uses a general and realistic model for inter-task communication, takes memory constraints into account, and addresses the entire problem of mapping which includes clustering tasks into modules, assignment of processors to modules, and possible replication of modules. The first algorithm is based on dynamic programming and finds the optimal mapping of k tasks onto P processors in O(P/sup 4/k/sup 2/) time. We also present a heuristic algorithm that is linear in the number of processors and establish with theoretical and practical results that the solutions obtained are optimal in practical situations. The entire framework is implemented as an automatic mapping tool for the Fx parallelizing compiler for High Performance Fortran. We present experimental results that demonstrate the importance of choosing a good mapping and show that the methods presented yield efficient mappings and predict optimal performance accurately.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C1180 (Optimisation techniques); C4240C (Computational complexity); C6110P (Parallel programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Automatic mapping tool; Computer vision; Data parallel tasks; Digital signal processing; Fx parallelizing compiler; Heuristic algorithm; High Performance Fortran; Image processing; Inter-task communication; Massively parallel machine; Optimal mapping; Task pipelines", thesaurus = "Computational complexity; Dynamic programming; FORTRAN; Parallel languages; Parallelising compilers; Pipeline processing; Processor scheduling", } @Article{Tseng:1995:COE, author = "Chau-Wen Tseng", title = "Compiler optimizations for eliminating barrier synchronization", journal = j-SIGPLAN, volume = "30", number = "8", pages = "144--155", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "This paper presents novel compiler optimizations for reducing synchronization overhead in compiler-parallelized scientific codes. A hybrid programming model is employed to combine the flexibility of the fork-join model with the precision and power of the single-program, multiple data (SPMD) model. By exploiting compile-time computation partitions, communication analysis can eliminate barrier synchronization or replace it with less expensive forms of synchronization. We show computation partitions and data communication can be represented as systems of symbolic linear inequalities for high flexibility and precision. These optimizations has been implemented in the Stanford SUIF compiler. We extensively evaluate their performance using standard benchmark suites. Experimental results show barrier synchronization is reduced 29\% on average and by several orders of magnitude for certain programs.", acknowledgement = ack-nhfb, affiliation = "Comput. Syst. Lab., Stanford Univ., CA, USA", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Barrier synchronization; Communication analysis; Compile-time computation partitions; Compiler optimization; Compiler-parallelized scientific codes; Computation partitions; Data communication; Fork-join model; Hybrid programming model; Performance evaluation; Single-program multiple data; Standard benchmark suites; Stanford SUIF compiler; Symbolic linear inequalities; Synchronization overhead", thesaurus = "Optimising compilers; Parallel programming; Parallelising compilers; Software performance evaluation; Synchronisation", } @Article{Philippsen:1995:AAA, author = "Michael Philippsen", title = "Automatic alignment of array data and processes to reduce communication time on {DMPPs}", journal = j-SIGPLAN, volume = "30", number = "8", pages = "156--165", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "This paper investigates the problem of aligning array data and processes in a distributed-memory implementation. We present complete algorithms for compile-time analysis, the necessary program restructuring, and subsequent code-generation, and discuss their complexity. We finally evaluate the practical usefulness by quantitative experiments. The technique presented analyzes complete programs, including branches, loops, and nested parallelism. Alignment is determined with respect to offset, stride, and general axis relations. Process placement of both data and processes are computed in a unifying framework based on an extended preference graph and its analysis. Dynamic redistributions are derived. The experimental results are very encouraging. The optimization algorithms implemented in our Modula-2 compiler improved the execution times of the programs by an average over 40\% on a MasPar MP-1 with 16384 processors.", acknowledgement = ack-nhfb, affiliation = "Int. Comput. Sci. Inst., Berkeley, CA, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Array data alignment; Branches; Code-generation; Communication time; Compile-time analysis; Complexity; Distributed memory parallel processors; DMPP; Execution times; Extended preference graph; Loops; MasPar MP-1; Modula-2 compiler; Nested parallelism; Optimization algorithms; Process alignment; Program restructuring", thesaurus = "Automatic programming; Data structures; Distributed memory systems; Optimising compilers; Parallel machines; Parallel programming", } @Article{Anderson:1995:DCT, author = "Jennifer M. Anderson and Saman P. Amarasinghe and Monica S. Lam", title = "Data and computation transformations for multiprocessors", journal = j-SIGPLAN, volume = "30", number = "8", pages = "166--178", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Effective memory hierarchy utilization is critical to the performance of modern multiprocessor architectures. We have developed the first compiler system that fully automatically parallelizes sequential programs and changes the original array layouts to improve memory system performance. Our optimization algorithm consists of two steps. The first step chooses the parallelization and computation assignment such that synchronization and data sharing are minimized. The second step then restructures the layout of the data in the shared address space with an algorithm that is based on a new data transformation framework. We ran our compiler on a set of application programs and measured their performance on the Stanford DASH multiprocessor. Our results show that the compiler can effectively optimize parallelism in conjunction with memory subsystem performance.", acknowledgement = ack-nhfb, affiliation = "Comput. Syst. Lab., Stanford Univ., CA, USA", classification = "C5440 (Multiprocessing systems); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Array layouts; Computation transformation; Data sharing; Data transformation; Memory hierarchy utilization; Memory subsystem performance; Memory system performance; Multiprocessors; Optimization algorithm; Optimizing compiler; Parallelizing compiler; Performance; Sequential programs; Shared address space; Stanford DASH multiprocessor; Synchronization", thesaurus = "Data structures; Multiprocessing systems; Optimising compilers; Parallelising compilers; Software performance evaluation; Synchronisation", } @Article{Jeremiassen:1995:RFS, author = "Tor E. Jeremiassen and Susan J. Eggers", title = "Reducing false sharing on shared memory multiprocessors through compile time data transformations", journal = j-SIGPLAN, volume = "30", number = "8", pages = "179--188", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "We have developed compiler algorithms that analyze explicitly parallel programs and restructure their shared data to reduce the number of false sharing misses. The algorithms analyze per-process shared data accesses, pinpoint the data structures that are susceptible to false sharing and choose an appropriate transformation to reduce it. The transformations either group data that is accessed by the same processer or separate individual data items that are shared. We evaluates that technique. We show through simulation that our analysis successfully identifies the data structures that are responsible for most false sharing misses, and then transforms them without unduly decreasing spatial locality. The reduction in false sharing positively impacts both execution time and program scalability when executed on a KSR2. Both factors combine to increase the maximum achievable speedup for all programs, more than doubling it for several. Despite being able to only approximate actual inter-processor memory accesses, the compiler-directed transformations always outperform programmer efforts to eliminate false sharing.", acknowledgement = ack-nhfb, affiliation = "AT and T Bell Labs., Murray Hill, NJ, USA", classification = "C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Compile time data transformations; Compiler algorithms; Data structures; Execution time; False sharing; False sharing misses; Inter-processor memory access; KSR2; Maximum achievable speedup; Parallelizing compilers; Program scalability; Shared data access; Shared memory multiprocessors; Simulation; Spatial locality", thesaurus = "Data structures; Parallel programming; Program compilers; Shared memory systems; Virtual machines", } @Article{Spertus:1995:ELB, author = "Ellen Spertus and William J. Dally", title = "Evaluating the locality benefits of active messages", journal = j-SIGPLAN, volume = "30", number = "8", pages = "189--198", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A major challenge in fine-grained computing is achieving locality without excessive scheduling overhead. We built two J-Machine implementations of a fine-grained programming model, the Berkeley Threaded Abstract Machine. One implementation takes an active messages approach, maintaining a scheduling hierarchy in software in order to improve data cache performance. Another approach relies on the J-Machine's message queues and fast task switch, lowering the control costs at the expense of data locality. Our analysis measures the costs and benefits of each approach, for a variety of programs and cache configurations. The active messages implementation is strongest when miss penalties are high and for the finest-grained programs. The hardware-buffered implementation is strongest in direct-mapped caches, where it achieves substantially better instruction cache performance.", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", classification = "C6110P (Parallel programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Active messages; Benefits; Berkeley Threaded Abstract Machine; Cache configuration; Costs; Data cache performance; Data locality; Direct-mapped caches; Fast task switch; Fine-grained computing; Fine-grained programming model; Hardware-buffered; Instruction cache performance; J-Machine; Locality benefits; Message queues; Miss penalties; Scheduling hierarchy; Scheduling overhead", thesaurus = "Cache storage; Cost-benefit analysis; Parallel programming; Program compilers; Scheduling; Software performance evaluation", } @Article{Wisniewski:1995:HPS, author = "Robert W. Wisniewski and Leonidas I. Kontothanassis and Michael L. Scott", title = "High performance synchronization algorithms for multiprogrammed multiprocessors", journal = j-SIGPLAN, volume = "30", number = "8", pages = "199--206", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Scalable busy-wait synchronization algorithms are essential for achieving good parallel program performance on large scale multiprocessors. Such algorithms include mutual exclusion locks, reader-writer locks, and barrier synchronization. Unfortunately, scalable synchronization algorithms are particularly sensitive to the effects of multiprogramming: their performance degrades sharply when processors are shared among different applications, or even among processes of the same application. We describe the design and evaluation of scalable scheduler-conscious mutual exclusion locks, reader-writer locks, and barriers, and show that by sharing information across the kernel/application interface we can improve the performance of scheduler-oblivious implementations by more than an order of magnitude.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rochester Univ., NY, USA", classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessing systems); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Barrier synchronization; High performance synchronization algorithms; Kernel/application interface; Large scale multiprocessors; Multiprogrammed multiprocessors; Multiprogramming; Mutual exclusion locks; Parallel program performance; Reader-writer locks; Scalable busy-wait synchronization; Scalable synchronization algorithms", thesaurus = "Application program interfaces; Concurrency control; Multiprogramming; Parallel algorithms; Processor scheduling; Software performance evaluation; Synchronisation", } @Article{Blumofe:1995:CEM, author = "Robert D. Blumofe and Christopher F. Joerg and Bradley C. Kuszmaul and Charles E. Leiserson and Keith H. Randall and Yuli Zhou", title = "{Cilk}: an efficient multithreaded runtime system", journal = j-SIGPLAN, volume = "30", number = "8", pages = "207--216", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Cilk (pronounced `silk') is a C-based runtime system for multithreaded parallel programming. In this paper, we document the efficiency of the Cilk work-stealing scheduler, both empirically and analytically. We show that on real and synthetic applications, the `work' and `critical path' of a Cilk computation can be used to accurately model performance. Consequently, a Cilk programmer can focus on reducing the work and critical path of his computation, insulated from load balancing and other runtime scheduling issues. We also prove that for the class of `fully strict' (well-structured) programs, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal. The Cilk runtime system currently runs on the Connection Machine CM5 massively parallel processor (MPP), the Intel Paragon MPP, the Silicon Graphics Power Challenge symmetric multiprocessor (SMP), and the MIT Phish network of workstations. Applications written in Cilk include protein folding, graphic rendering, backtrack searching, and the *Socrates chess program, which won third prize in the 1994 ACM International Computer Chess Championship.", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", classification = "C6110P (Parallel programming); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "*Socrates chess program; Accurate performance modelling; Backtrack searching; C-based multithreaded runtime system; Cilk; Communication bounds; Connection Machine CM5; Critical path; Efficiency; Fully strict programs; Graphic rendering; Intel Paragon; Load balancing; MIT Phish workstation network; Parallel programming; Protein folding; Runtime scheduling issues; Silicon Graphics Power Challenge; Space bounds; Time bounds; Well-structured programs; Work-stealing scheduler", thesaurus = "Backtracking; Biology computing; Molecular configurations; Parallel programming; Processor scheduling; Program interpreters; Proteins; Rendering [computer graphics]", } @Article{Wallach:1995:OAM, author = "Deborah A. Wallach and Wilson C. Hsieh and Kirk L. Johnson and M. Frans Kaashoek and William E. Weihl", title = "Optimistic active messages: a mechanism for scheduling communication with computation", journal = j-SIGPLAN, volume = "30", number = "8", pages = "217--226", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:08 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Low-overhead message passing is critical to the performance of many applications. Active messages (AMs) reduce the software overhead for message handling: messages are run as handlers instead of as threads, which avoids the overhead of thread management and the unnecessary data copying of other communication models. Scheduling the execution of AMs is typically done by disabling and enabling interrupts or by polling the network. This primitive scheduling control puts severe restrictions on the code that can be run in a message handler. This paper describes a new software mechanism, optimistic active messages (OAM), that eliminates these restrictions; OAMs allow arbitrary user code to execute in handlers, and also allow handlers to block. Despite this gain in expressiveness, OAMs perform as well as AMs. We used OAM as the base for a remote procedure calling (RPC) system, Optimistic RPC (ORPC), for the CM-5 multiprocessor; it consists of an optimized thread package and a stub compiler that hides communication details from the programmer. ORPC is 1.5 to 5 times faster than traditional RPC (TRPC) for small messages and performs as well as AMs. Applications that primarily communicate using large data transfers or are fairly coarse-grained perform equally well. For applications that send many short messages, however, the ORPC and AM implementations are up to 3 times faster than the TRPC implementations. Using ORPC, programmers obtain the benefits of well-proven programming abstractions, do not have to be concerned with communication details, and yet obtain nearly the performance of hand-coded AM programs.", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", classification = "C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Application performance; Arbitrary user code; Blocking; CM-5 multiprocessor; Coarse-grained applications; Communication detail hiding; Communication scheduling; Computation scheduling; Expressiveness; Large data transfers; Low-overhead message passing; Message handlers; Optimistic active messages; Optimistic remote procedure calls; Optimized thread package; Programming abstractions; Software overhead; Stub compiler", thesaurus = "Message passing; Remote procedure calls; Scheduling", } @Article{Anonymous:1995:CO, author = "Anonymous", title = "Conference Organization", journal = j-SIGPLAN, volume = "30", number = "8", pages = "III--??", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1995:ER, author = "Anonymous", title = "External Referees", journal = j-SIGPLAN, volume = "30", number = "8", pages = "IV--??", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Maclean:1995:OOP, author = "Stuart Maclean and Sean Smith", title = "Object-oriented programming for embedded systems", journal = j-SIGPLAN, volume = "30", number = "9", pages = "3--8", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{MacLean:1995:OPE, author = "Stuart MacLean and Sean Smith", title = "Object-Oriented Programming for Embedded Systems", journal = j-SIGPLAN, volume = "30", number = "9", pages = "3--??", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deVivo:1995:PAC, author = "Gabriela O. de Vivo and Marco de Vivo", title = "A Pragmatic Approach to {C++}, {Eiffel} and {Ada 9X} Programming", journal = j-SIGPLAN, volume = "30", number = "9", pages = "9--16", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1995:CSC, author = "Henry G. Baker", title = "{CONS} Should Not {CONS} Its Arguments, {Part II}: {Cheney} on the {M.T.A.}", journal = j-SIGPLAN, volume = "30", number = "9", pages = "17--20", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuen:1995:FL, author = "C. K. Yuen", title = "A Functional {FOR} Loop", journal = j-SIGPLAN, volume = "30", number = "9", pages = "21--24", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Traunmuller:1995:CPS, author = "Karl Traunm{\"u}ller", title = "The checkers problem --- a solution with linear time complexity", journal = j-SIGPLAN, volume = "30", number = "9", pages = "25--32", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Meek:1995:WPC, author = "Brian L. Meek", title = "What is a procedure call?", journal = j-SIGPLAN, volume = "30", number = "9", pages = "33--40", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Meek:1995:WIP, author = "Brian L. Meek", title = "What is a Procedure Call?", journal = j-SIGPLAN, volume = "30", number = "9", pages = "33--??", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lu:1995:IDD, author = "Jian Lu", title = "Introducing Data Decomposition into {VDM} for Tractable Development of Programs", journal = j-SIGPLAN, volume = "30", number = "9", pages = "41--50", month = sep, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Allen:1995:ESF, author = "Arthur Allen and Dennis de Champeaux", title = "Extending the Statechart Formalism: Event Scheduling and Disposition", journal = j-SIGPLAN, volume = "30", number = "10", pages = "1--16", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Sane:1995:OOS, author = "Aamod Sane and Roy Campbell", title = "Object-oriented state machines: subclassing, composition, delegation, and genericity", journal = j-SIGPLAN, volume = "30", number = "10", pages = "17--32", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sane:1995:OSM, author = "A. Sane and R. Campbell", title = "Object-Oriented State Machines: Subclassing, Composition, Delegation and Genericity", journal = j-SIGPLAN, volume = "30", number = "10", pages = "17--32", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Malan:1995:LEL, author = "Ruth Malan and Derek Coleman and Reed Letsinger", title = "Lessons from the Experiences of Leading-Edge Object Technology Projects in {Hewlett--Packard}", journal = j-SIGPLAN, volume = "30", number = "10", pages = "33--46", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Smith:1995:SUI, author = "Randall B. Smith and John Maloney and David Ungar", title = "The {Self-4.0} User Interface: Manifesting a System-wide Vision of Concreteness, Uniformity, and Flexibility", journal = j-SIGPLAN, volume = "30", number = "10", pages = "47--60", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Smith:1995:UPB, author = "Walter R. Smith", title = "Using a prototype-based language for user interface: the {Newton} project's experience", journal = j-SIGPLAN, volume = "30", number = "10", pages = "61--72", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Smith:1995:UPL, author = "W. R. Smith", title = "Using a Prototype-based Language for User Interface: The {Newton Project}'s Experience", journal = j-SIGPLAN, volume = "30", number = "10", pages = "61--72", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Ungar:1995:AOT, author = "David Ungar", title = "Annotating Objects for Transport to Other Worlds", journal = j-SIGPLAN, volume = "30", number = "10", pages = "73--87", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Hill:1995:MOO, author = "Laura Hill and Kenny Rubin and John Daniels and Charles Berman and James Coplien and Doug Johnson", title = "Managing object oriented projects (panel session)", journal = j-SIGPLAN, volume = "30", number = "10", pages = "88--90", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agesen:1995:TFV, author = "Ole Agesen and Urs H{\"o}lzle", title = "Type Feedback vs. Concrete Type Inference: {A} Comparison of Optimization Techniques for Object-Oriented Languages", journal = j-SIGPLAN, volume = "30", number = "10", pages = "91--107", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Grove:1995:PGR, author = "David Grove and Jeffrey Dean and Charles Garrett and Craig Chambers", title = "Profile-guided receiver class prediction", journal = j-SIGPLAN, volume = "30", number = "10", pages = "108--123", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grove:1995:PRC, author = "D. Grove and J. Dean and C. Garrett and C. Chambers", title = "Profile-Guided Receiver Class Prediction", journal = j-SIGPLAN, volume = "30", number = "10", pages = "108--123", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Myers:1995:BOL, author = "Andrew C. Myers", title = "Bidirectional Object Layout for Separate Compilation", journal = j-SIGPLAN, volume = "30", number = "10", pages = "124--139", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{McGregor:1995:OTR, author = "John D. McGregor and Ed Berard and Don Firesmith and Brian Marick and Dave Thomson", title = "{OO} testing in the real world (panel): lessons for all", journal = j-SIGPLAN, volume = "30", number = "10", pages = "140--140", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Driesen:1995:MRD, author = "Karel Driesen and Urs H{\"o}lzle", title = "Minimizing Row Displacement Dispatch Tables", journal = j-SIGPLAN, volume = "30", number = "10", pages = "141--155", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Day:1995:SVW, author = "Mark Day and Robert Gruber and Barbara Liskov and Andrew C. Myers", title = "Subtypes vs. Where Clauses: Constraining Parametric Polymorphism", journal = j-SIGPLAN, volume = "30", number = "10", pages = "156--168", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Eifrig:1995:SPT, author = "Jonathan Eifrig and Scott Smith and Valery Trifonov", title = "Sound Polymorphic Type Inference for Objects", journal = j-SIGPLAN, volume = "30", number = "10", pages = "169--184", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Armour:1995:TOA, author = "Frank Armour and Todd Cotton and Geoff Hambrick and Barbara Moo and Dennis Mancl", title = "Tailoring {OO} analysis and design methods (panel)", journal = j-SIGPLAN, volume = "30", number = "10", pages = "185--186", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rossie:1995:ASS, author = "Jonathan G. {Rossie, Jr.} and Daniel P. Friedman", title = "An Algebraic Semantics of Subobjects", journal = j-SIGPLAN, volume = "30", number = "10", pages = "187--199", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Stata:1995:MRP, author = "Raymie Stata and John V. Guttag", title = "Modular Reasoning in the Presence of Subclassing", journal = j-SIGPLAN, volume = "30", number = "10", pages = "200--214", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Malenfant:1995:SDD, author = "J. Malenfant", title = "On the Semantic Diversity of Delegation-Based Programming Languages", journal = j-SIGPLAN, volume = "30", number = "10", pages = "215--230", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Fraser:1995:PCCb, author = "Steven Fraser and Grady Booch and Frank Buschmann and Jim Coplien and Norm Kerth and Ivar Jacobson and Mary Beth Rosson", title = "Patterns: cult to culture?", journal = j-SIGPLAN, volume = "30", number = "10", pages = "231--234", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ossher:1995:SCR, author = "H. Ossher and M. Kaplan and W. Harrison and A. Katz", title = "Subject-Oriented Composition Rules", journal = j-SIGPLAN, volume = "30", number = "10", pages = "235--250", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Ossher:1995:SOC, author = "Harold Ossher and Matthew Kaplan and William Harrison and Alexander Katz and Vincent Kruskal", title = "Subject-oriented composition rules", journal = j-SIGPLAN, volume = "30", number = "10", pages = "235--250", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Riehle:1995:HWE, author = "Dirk Riehle", title = "How and Why to Encapsulate Class Trees", journal = j-SIGPLAN, volume = "30", number = "10", pages = "251--264", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Ducasse:1995:RMF, author = "S. Ducasse and M. Blay-Fornarino and A. M. Pinna-Dery", title = "A Reflective Model for First Class Dependencies", journal = j-SIGPLAN, volume = "30", number = "10", pages = "265--280", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Griss:1995:SSR, author = "Martin Griss and Ted Biggerstaff and Sallie Henry and Ivar Jacobson and Doug Lea and Will Tracz", title = "Systematic software reuse (panel session): objects and frameworks are not enough", journal = j-SIGPLAN, volume = "30", number = "10", pages = "281--282", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marcus:1995:FDO, author = "Bob Marcus and Bob Atkinson and Chris Horn and Hari Madduri", title = "The future of distributed object computing (Panel Session)", journal = j-SIGPLAN, volume = "30", number = "10", pages = "283--284", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chiba:1995:MPC, author = "Shigeru Chiba", title = "A Metaobject Protocol for {C++}", journal = j-SIGPLAN, volume = "30", number = "10", pages = "285--299", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Masuhara:1995:CML, author = "Hidehiko Masuhara and Satoshi Matsuoka and Kenichi Asai and Akinori Yonezawa", title = "Compiling away the meta-level in object-oriented concurrent reflective languages using partial evaluation", journal = j-SIGPLAN, volume = "30", number = "10", pages = "300--315", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Masuhara:1995:CMO, author = "H. Masuhara and S. Matsuoka and K. Asai and Yonezawa and A.", title = "Compiling Away the Meta-Level in Object-Oriented Concurrent Reflective Languages Using Partial Evaluation", journal = j-SIGPLAN, volume = "30", number = "10", pages = "300--315", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Mulet:1995:TME, author = "Philippe Mulet and Jacques Malenfant and Pierre Cointe", title = "Towards a Methodology for Explicit Composition of {MetaObjects}", journal = j-SIGPLAN, volume = "30", number = "10", pages = "316--330", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Cattell:1995:ODS, author = "Rick Cattell and Frank Manola and Richard Soley and Jeff Sutherland and Mary Loomis", title = "Objects and database standards (panel)", journal = j-SIGPLAN, volume = "30", number = "10", pages = "331--332", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gossain:1995:ODE, author = "Sanjiv Gossain and Don Batory and Hassan Gomaa and Mitch Lubars and Christopher Pidgeon and Ed Seidewitz", title = "Objects and domain engineering (panel)", journal = j-SIGPLAN, volume = "30", number = "10", pages = "333--336", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Helm:1995:PP, author = "Richard Helm", title = "``Patterns in Practice''", journal = j-SIGPLAN, volume = "30", number = "10", pages = "337--341", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Lange:1995:IVD, author = "Danny B. Lange and Yuichi Nakamura", title = "Interactive Visualization of Design Patterns Can Help in Framework Understanding", journal = j-SIGPLAN, volume = "30", number = "10", pages = "342--357", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Hueni:1995:FNP, author = "H. Hueni and R. Johnson and R. Engel", title = "A Framework for Network Protocol Software", journal = j-SIGPLAN, volume = "30", number = "10", pages = "358--369", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Huni:1995:FNP, author = "Hermann H{\"u}ni and Ralph Johnson and Robert Engel", title = "A framework for network protocol software", journal = j-SIGPLAN, volume = "30", number = "10", pages = "358--369", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{AlbrechtSchmid:1995:CAM, author = "H. {Albrecht Schmid}", title = "Creating the Architecture of a Manufacturing Framework by Design Patterns", journal = j-SIGPLAN, volume = "30", number = "10", pages = "370--384", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Schmid:1995:CAM, author = "Hans Albrecht Schmid", title = "Creating the architecture of a manufacturing framework by design patterns", journal = j-SIGPLAN, volume = "30", number = "10", pages = "370--384", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Itoh:1995:SUC, author = "Jun-ichiro Itoh and Yasuhiko Yokote and Mario Tokoro", title = "{SCONE}: Using Concurrent Objects For Low-level Operating System Programming", journal = j-SIGPLAN, volume = "30", number = "10", pages = "385--398", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Kristensen:1995:POM, author = "A. Kristensen and C. Low", title = "Problem-Oriented Object Memory: Customizing Consistency", journal = j-SIGPLAN, volume = "30", number = "10", pages = "399--413", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Kristensen:1995:POO, author = "Anders Kristensen and Colin Low", title = "Problem-oriented object memory: customizing consistency", journal = j-SIGPLAN, volume = "30", number = "10", pages = "399--413", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Barton:1995:EOW, author = "Don Barton and Tom Arnold", title = "Evolving to objects --- the {Witches}' {Brew}", journal = j-SIGPLAN, volume = "30", number = "10", pages = "414--425", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Forman:1995:IFR, author = "I. R. Forman and M. H. Conner and S. H. Danforth and L. K. Raper", title = "{Ira Forman}, {``Release-to-Release Binary Compatibility in SOM''}", journal = j-SIGPLAN, volume = "30", number = "10", pages = "426--438", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Forman:1995:RRB, author = "Ira R. Forman and Michael H. Conner and Scott H. Danforth and Larry K. Raper", title = "Release-to-release binary compatibility in {SOM}", journal = j-SIGPLAN, volume = "30", number = "10", pages = "426--438", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vayda:1995:LB, author = "Thomas P. Vayda", title = "``Lessons from the Battlefield''", journal = j-SIGPLAN, volume = "30", number = "10", pages = "439--452", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Haines:1995:SOA, author = "Matthew Haines and Piyush Mehrotra and John {Van Rosendale}", title = "{SmartFiles}: An {OO} Approach to Data File Interoperability", journal = j-SIGPLAN, volume = "30", number = "10", pages = "453--466", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Kiernan:1995:ESO, author = "Jerry Kiernan and Michael J. Carey", title = "Extending {SQL-92} for {OODB} Access: Design and Implementation Experience", journal = j-SIGPLAN, volume = "30", number = "10", pages = "467--480", month = oct, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:10 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "ACM; object-oriented programming systems; OOPSLA; programming languages; SIGPLAN", } @Article{Huang:1995:PWE, author = "T.-Y. Huang and W.-S. Liu", title = "Predicting the worst-case execution time of the concurrent execution of instructions and cycle-stealing {DMA I/O} operations", journal = j-SIGPLAN, volume = "30", number = "11", pages = "1--6", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The paper describes an efficient algorithm which gives a bound on the worst-case execution times of the concurrent execution of CPU instructions and cycle-stealing DMA I/O operations. Simulations of several programs were conducted to evaluate this algorithm. Compared with the traditional pessimistic approach, the bound on the worst-case execution time produced by the algorithm is significantly tighter. For a sample program that multiplies two matrices while the I/O bus is fully utilized, our algorithm achieves a 39\% improvement in the accuracy of the prediction.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", classification = "C4140 (Linear algebra); C4240C (Computational complexity); C4240P (Parallel programming and algorithm theory); C6120 (File organisation); C6150J (Operating systems); C6150N (Distributed systems software)", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Algorithm evaluation; Concurrent execution; CPU instructions; Cycle-stealing DMA I/O operations; I/O bus; Matrix multiplication; Program simulation; Worst-case execution time prediction", thesaurus = "Computational complexity; File organisation; Input-output programs; Matrix multiplication; Parallel processing; Processor scheduling; Real-time systems; Simulation; Timing", } @Article{Lee:1995:SHA, author = "Jongwon Lee and Sungyoung Lee and Hyungill Kim", title = "Scheduling of hard aperiodic tasks in hybrid static\slash dynamic priority systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "7--19", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p7-lee/", abstract = "We present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended the Critical Task Indicating (CTI) algorithm which shows a considerable performance improvement over the other soft aperiodic task schedulings, especially under a heavy transient overload. Since a hard deadline aperiodic task has its own deadline, the proposed algorithm has a decision making mechanism that performs the online acceptance/rejection test upon its arrival. For simplicity and good performance, the algorithm reuses the original CTI table being used in the CTI algorithm as a slack search domain. Moreover, by searching the CTI table similarly to a circular list, it has removed the problem of search space limitation caused by the hyperperiod bound.", acknowledgement = ack-nhfb, affiliation = "Korea Telecom, Seoul, South Korea", classification = "C6150J (Operating systems)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Critical Task Indicating algorithm; Deadline aperiodic tasks; Deadline periodic tasks; design; Hard aperiodic task scheduling; Heavy transient overload; Hybrid static/dynamic priority systems; Hyperperiod bound; measurement; Online acceptance/rejection test; performance; Performance improvement; Preemptive joint scheduling; Slack search; Soft aperiodic task schedulings; theory; Uniprocessor real-time system", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms.", thesaurus = "Online operation; Real-time systems; Scheduling; Search problems", } @Article{Nilsen:1995:WCE, author = "Kelvin D. Nilsen and Bernt Rygg", title = "Worst-case execution time analysis on modern processors", journal = j-SIGPLAN, volume = "30", number = "11", pages = "20--30", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nilsen:1995:WET, author = "Kelvin D. Nilsen and Bernt Rygg", title = "Worst-case execution time analysis on modern processors", journal = j-SIGPLAN, volume = "30", number = "11", pages = "20--30", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:46 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p20-nilsen/", abstract = "Many of the trends that have dominated recent evolution and advancement within the computer architecture community have complicated the analysis of task execution times. Most of the difficulties result from two particular emphases: instruction-level parallelism; and optimization of average-case behavior rather than worst-case latencies. Both of these trends have resulted in increased nondeterminism in the time required to execute particular code sequences. Since the analysis required to determine worst-case task execution times on modern processors is so complicated, it is not practical for programmers to perform all of the necessary analyses by hand. Tools must aid them. This paper describes ongoing research on a collection of tools intended to automate the analyses that must be performed in order to build reliable real-time software for modern computing environments. Emphasis is given to the interplay between components of the development environment.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", classification = "C5470 (Performance evaluation and testing); C6110B (Software engineering techniques); C6150G (Diagnostic, testing, debugging and evaluating systems)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Average-case behavior; Computer architecture; design; Instruction-level parallelism; measurement; Modern processors; Nondeterminism; Optimization; performance; Reliable real-time software; Software development environment; Software engineering; System analysis; Task execution times; theory; Worst-case execution time analysis; Worst-case latencies", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", thesaurus = "Program diagnostics; Programming environments; Real-time systems; Software performance evaluation; Software reliability", } @Article{Bonfatti:1995:RSD, author = "Flavio Bonfatti and Gianni Gadda and Paola Daniela Monari", title = "Re-usable software design for programmable logic controllers", journal = j-SIGPLAN, volume = "30", number = "11", pages = "31--40", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:46 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p31-bonfatti/", abstract = "It is the aim of this paper to present a model conceived for supporting the initial, critical phases of PLC software life cycle, namely requirement specification, requirement analysis and software design, to obtain reusable code. The model, named EASIER, is based on an object-oriented paradigm where the message-method mechanism is replaced by the law and action primitives, since they are more suitable to cope with the real-time, cyclic nature of PLC software. Software reusability is pursued by identifying independent control modules through a proper bedded encapsulation mechanism, representing system dynamics by means of synchronized state diagrams, expressing context-free behaviour of system components by introducing virtual objects. The EASIER approach is presently validated with respect to relevant reverse and forward engineering applications; from one of these cases we derive the examples used in the paper.", acknowledgement = ack-nhfb, affiliation = "Fac. of Eng., Modena Univ., Italy", classification = "C3220B (Programmable controllers); C6110B (Software engineering techniques); C6110J (Object-oriented programming); C7420 (Control engineering computing)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Context-free behaviour; design; EASIER; Encapsulation; Forward engineering; Independent control modules; management; Message-method mechanism; Object-oriented paradigm; performance; PLC software life cycle; Programmable logic controllers; Real-time; Requirement analysis; Requirement specification; Reusable software design; Reverse engineering; Software design; Synchronized state diagrams; theory; Virtual objects", subject = "{\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous, Reusable software**. {\bf B.4.2} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices, Channels and controllers. {\bf D.2.9} Software, SOFTWARE ENGINEERING, Management, Life cycle. {\bf B.6.1} Hardware, LOGIC DESIGN, Design Styles. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf J.7} Computer Applications, COMPUTERS IN OTHER SYSTEMS, Industrial control.", thesaurus = "Data encapsulation; Formal specification; Object-oriented programming; Programmable controllers; Real-time systems; Reverse engineering; Software reusability; Systems analysis", } @Article{Bonfatti:1995:RUS, author = "Flavio Bonfatti and Gianni Gadda and Paola Daniela Monari", title = "Re-usable software design for programmable logic controllers", journal = j-SIGPLAN, volume = "30", number = "11", pages = "31--40", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chung:1995:LCT, author = "Tai M. Chung and Hank G. Dietz", title = "Language constructs and transformation for hard real-time systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "41--49", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p41-chung/", abstract = "In practice, time critical portions of hard real-time systems are still implemented in low-level programming languages and manually tuned to meet all the timing requirements. Without a real-time language that supports an appropriate way of specifying timing constraints for a generic hard real-time systems, and high precision timing analysis that is transparent to users, the users will ever suffer from the complex coding and analysis, particularly for systems requiring fast turnaround responses. We propose novel language constructs that can be added to any imperative programming language so that the extended language provides users a way to specify relative timing constraints between arbitrary operations at instruction-level. The compilation techniques unique to transformation of the proposed language are also presented as a part of CHaRTS, the Compiler for Hard Real-Time Systems, which generates a valid instruction sequence for a target execution model.", acknowledgement = ack-nhfb, affiliation = "Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA", classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "CHaRTS; Compilation techniques; Compiler for Hard Real-Time Systems; design; Hard real-time systems; High precision timing analysis; Imperative programming language; Instruction sequence; Instruction-level; languages; Low-level programming languages; Real-time language; theory; Time critical; Timing constraints; Timing requirements; Turnaround responses", subject = "{\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", thesaurus = "High level languages; Program compilers; Programming; Real-time systems", } @Article{Ren:1995:RLS, author = "Shangping Ren and Gul A. Agha", title = "{RTsynchronizer}: language support for real-time specifications in distributed systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "50--59", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p50-ren/", abstract = "We argue that the specification of an object's functional behavior and the timing constraints imposed on it may be separated. Specifically, we describe RTsynchronizer, a high-level programming language construct for specifying real-time constraints between objects in a distributed concurrent system. During program execution, RTsynchronizers affect the scheduling of distributed objects to enforce real-time relations between events. Objects in our system are defined in terms of the actor model extended with timing assumptions. Separation of the functional behaviors of actors and the timing constraints on patterns of actor invocation provides at least three important advantages. First, it simplifies code development by separating design concerns. Second, multiple timing constraints can be independently specified and composed. And finally, a specification of timing constraints can be reused even if the representation of the functional behavior of actors has changed, and conversely. A number of examples are given to illustrate the use of RTsynchronizers. These examples illustrate how real-time constraints for periodic events, simultaneous events, exception handling, and producer-consumer may be specified.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA", classification = "C6110F (Formal methods); C6110J (Object-oriented programming); C6110P (Parallel programming); C6115 (Programming support); C6130 (Data handling techniques); C6140D (High level languages); C6150N (Distributed systems software)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Actor invocation; Actor model; Code development; design; Design concerns; Distributed concurrent system; Distributed object scheduling; Events; Exception handling; High-level programming language construct; Language support; languages; Object functional behavior; performance; Periodic events; Producer-consumer; Program execution; Real-time constraints; Real-time relations; Real-time specifications; RTsynchronizer; Simultaneous events; Specification reuse; theory; Timing constraints", subject = "{\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization.", thesaurus = "Exception handling; Formal specification; Object-oriented programming; Parallel programming; Processor scheduling; Real-time systems; Specification languages; Timing", } @Article{Thoen:1995:SSR, author = "Filip Thoen and Marco Cornero and Gert Goossens and Hugo De Man", title = "Software synthesis for real-time information processing systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "60--69", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p60-thoen/", abstract = "Software synthesis is a new approach which focuses on the support of embedded systems without the use of operating-systems. Compared to traditional design practices, a better utilization of the available time and hardware resources can be achieved with software synthesis, because the static information provided by the system specification is fully exploited and an application specific solution is automatically generated. On-going research on a software synthesis approach for real-time information processing systems is presented which starts from a concurrent process system specification and tries to automate the mapping of this description to a single processor. An internal representation model which is well suited for the support of concurrency and timing constraints is proposed, together with flexible execution models for multi-tasking with real-time constraints. The method is illustrated on a personal terminal receiver demodulator for mobile satellite communication.", acknowledgement = ack-nhfb, affiliation = "IMEC, Leuven, Belgium", classification = "C6110B (Software engineering techniques); C6110F (Formal methods); C6110P (Parallel programming); C6150J (Operating systems); C6150N (Distributed systems software); C7410F (Communications computing)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Application specific solution; Concurrency; Concurrent process system specification; design; Embedded system support; Flexible execution models; Hardware resources; Internal representation model; management; Mobile satellite communication; Multitasking; performance; Personal terminal receiver demodulator; Processor; Real-time constraints; Real-time information processing systems; Software synthesis; Static information; System specification; theory; Time resources; Timing constraints", subject = "{\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling.", thesaurus = "Demodulators; Formal specification; Mobile satellite communication; Operating system kernels; Parallel programming; Real-time systems; Telecommunication computing; Timing", } @Article{Campos:1995:VTQ, author = "S. Campos and E. Clarke and W. Marrero and M. Minea", title = "{Verus}: a tool for quantitative analysis of finite-state real-time systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "70--78", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p70-campos/", abstract = "Symbolic model checking is a technique for verifying finite-state concurrent systems. Models with up to 10/sup 30/ states can often be verified in minutes. We present a new tool to analyse real-time systems, based on this technique. We have designed a language, called Verus, for the description of real-time systems. Such a description is compiled into a state-transition graph and represented symbolically using binary decision diagrams. We have developed new algorithms for exploring the state space and computing quantitative information about the system. In addition to determining the exact bounds on the length of the time interval between two specified events, we compute the number of occurrences of an event in such an interval. This technique allows us to determine performance measures such as schedulability, response time, and system load. Our algorithms produce more detailed information than traditional methods. This information leads to a better understanding of the behavior of the system, in addition to verifying if its timing requirements are satisfied. We integrate these ideas into the Verus tool, currently under development. To demonstrate how our technique works, we have verified a robotics control system. The results obtained demonstrate that our method can be successfully applied in the analysis of real-time system designs.", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", classification = "C1140E (Game theory); C1310 (Control system analysis and synthesis methods); C3390 (Robotics); C6110F (Formal methods); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software); C7420D (Control system design and analysis)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Algorithms; algorithms; Binary decision diagrams; design; Event occurrence counting; Finite-state concurrent system verification; Finite-state real-time systems; languages; measurement; performance; Performance measures; Quantitative analysis tool; Real-time system design; reliability; Response time; Robotics control system; Schedulability; State space; State-transition graph; Symbolic model checking; System behavior; System load; theory; Timing requirements; verification; Verus language", subject = "{\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf I.2.9} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics.", thesaurus = "Control system CAD; Decision theory; Finite state machines; Formal verification; Parallel processing; Processor scheduling; Program compilers; Real-time systems; Robots; Specification languages; Symbol manipulation", } @Article{Jourdan:1995:STA, author = "M. Jourdan and F. Maraninchi", title = "Static timing analysis of real-time systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "79--87", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p79-jourdan/", abstract = "The approach we propose consists in describing a real-time system with a timed extension of a synchronous language. The formal semantics of the language describes how programs can be translated into a wide class of models, usually labeled transition systems, but whose labels can range from pure boolean information to complex assignments to real-valued variables. In particular, timed graphs may be obtained. We then use a tool which implements a symbolic model-checking algorithm for TCTL properties of timed graphs. We illustrate the approach with an example taken from robotics. Several real-time tasks are involved in a synchronization scheme, sending and receiving messages, according to various protocols. They are periodically re-activated by an external controller, and should not be re-activated if they are still communicating with each other. We show how to statically determine whether a particular choice of the re-activation delays would allow a deadlock.", acknowledgement = ack-nhfb, affiliation = "VERIMAG, Montbonnot-St. Martin, France", classification = "C3390 (Robotics); C4210L (Formal languages and computational linguistics); C5640 (Protocols); C6110F (Formal methods); C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems); C7420 (Control engineering computing)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Deadlock; design; External controller; Formal semantics; Labeled transition systems; languages; Message receipt; Message sending; performance; Program translation; Protocols; Reactivation delays; Real-time systems; Robotics; standardization; Static timing analysis; Symbolic model-checking algorithm; Synchronization scheme; Synchronous language timed extension; TCTL properties; theory; Timed graphs", subject = "{\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf B.4.2} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, Input/Output Devices, Channels and controllers. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", thesaurus = "Computational linguistics; Formal verification; Program compilers; Program interpreters; Protocols; Real-time systems; Robot programming; Symbol manipulation; Synchronisation; System monitoring; Timing", } @Article{Li:1995:PAE, author = "Yau-Tsun Steven Li and Sharad Malik", title = "Performance analysis of embedded software using implicit path enumeration", journal = j-SIGPLAN, volume = "30", number = "11", pages = "88--98", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p88-li/", abstract = "Embedded computer systems are characterized by the presence of a processor running application specific dedicated software. A large number of these systems must satisfy real-time constraints. The paper examines the problem of determining the extreme (best and worst) case bounds on the running time of a given program on a given processor. This has several applications in the design of embedded systems with real-time constraints. An important aspect of this problem is determining which paths in the program are exercised in the extreme cases. The state of the art solution relies on an explicit enumeration of program paths. This runs out of steam rather quickly since the number of feasible program paths is typically exponential in the size of the program. We present a solution for this problem that does not require an explicit enumeration of program paths, i.e., the paths are considered implicitly. This solution is implemented in the program cinderella which currently targets a popular embedded processor-the Intel i960. The preliminary results of using this tool are also presented.", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng., Princeton Univ., NJ, USA", classification = "C6150G (Diagnostic, testing, debugging and evaluating systems)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Application specific dedicated software; Cinderella program; design; Embedded computer systems; Embedded software; Embedded system design; experimentation; Implicit path enumeration; Intel i960; measurement; performance; Performance analysis; Processor; Program running time; Real-time constraints; theory", subject = "{\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", thesaurus = "Real-time systems; Software performance evaluation; System monitoring", } @Article{Ko:1995:SUF, author = "Lo Ko and David B. Whalley and Marion G. Harmon", title = "Supporting user-friendly analysis of timing constraints", journal = j-SIGPLAN, volume = "30", number = "11", pages = "99--107", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p99-ko/", abstract = "Real-time programmers have to deal with the problem of relating timing constraints associated with source code lines to sequences of machine instructions. The paper describes an interface that was developed to assist users in this task. Portions of programs can be quickly selected and the corresponding bounded times, source code lines, and machine instructions are automatically displayed. In addition, users are restricted to only selecting portions of the program for which timing bounds can be obtained. The result is a user-friendly interface that assists programmers in the analysis of timing constraints within a program.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA", classification = "C6115 (Programming support); C6150G (Diagnostic, testing, debugging and evaluating systems); C6180 (User interfaces)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Automatic display; Bounded times; design; human factors; Machine instruction sequences; performance; Program portion selection; Programmer assistance; Real-time programmers; Source code lines; theory; Timing constraint analysis; User-friendly analysis support", subject = "{\bf H.1.2} Information Systems, MODELS AND PRINCIPLES, User/Machine Systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, User interfaces. {\bf H.5.2} Information Systems, INFORMATION INTERFACES AND PRESENTATION, User Interfaces.", thesaurus = "Real-time systems; System monitoring; Timing; User interfaces", } @Article{Kopetz:1995:CCT, author = "Hermann Kopetz and Roman Nossal", title = "The {Cluster Compiler} --- a tool for the design of time-triggered real-time systems", journal = j-SIGPLAN, volume = "30", number = "11", pages = "108--116", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p108-kopetz/", abstract = "An off-line planning tool that supports the programmer in developing his real-time application is mandatory in the design of time-triggered real-time systems. The paper describes the architecture and the functions of such a tool, the Cluster Compiler, that is in development at our institute. We emphasize on the principle of a strict separation of the local from the global parts of a distributed system and on the consequences for the structure of the design tool arising from this principle.", acknowledgement = ack-nhfb, affiliation = "Inst. fur Tech. Inf., Tech. Univ. Wien, Austria", classification = "C6110 (Systems analysis and programming); C6115 (Programming support); C6120 (File organisation); C6150C (Compilers, interpreters and other processors); C6150N (Distributed systems software)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Cluster Compiler; design; Global distributed system parts; Local distributed system parts; measurement; Off-line planning tool; performance; Programmer support; Real-time application; standardization; theory; Time-triggered real-time system design tool; Tool architecture; Tool functions", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", thesaurus = "Data structures; Planning; Processor scheduling; Program compilers; Real-time systems; Software tools; Systems analysis", } @Article{Wilner:1995:WTU, author = "David Wilner", title = "{WindView}: a tool for understanding real-time embedded software through system vizualization", journal = j-SIGPLAN, volume = "30", number = "11", pages = "117--123", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p117-wilner/", abstract = "While advances in hardware, operating systems, and application frameworks have provided the facilities for building complex machines, the development environments have not provided the tools to manage such complexity during development, testing, and debugging. The tool described in the paper, WindView, is designed to fill this need. WindView is based on three principles that are essential for the next generation of development tools: system-level development, system visualization, and system dynamics.", acknowledgement = ack-nhfb, affiliation = "Wind River Syst. Inc., Emeryville, CA, USA", classification = "C6110 (Systems analysis and programming); C6115 (Programming support); C6130B (Graphics techniques); C6150G (Diagnostic, testing, debugging and evaluating systems); C6180G (Graphical user interfaces)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Complex machines; Complexity; Debugging; design; Development environments; Development tools; Real-time embedded software understanding; System development; System dynamics; System testing; System vizualization; System-level development; theory; WindView tool", subject = "{\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development.", thesaurus = "Data visualisation; Graphical user interfaces; Program debugging; Program testing; Real-time systems; Software tools; System monitoring; Systems analysis", } @Article{Gerber:1995:AIB, author = "Rich Gerber and Steve Tjiang and David Whalley and David Wilner and Mike Wolfe", title = "Appropriate interfaces between design tools, languages, compilers and runtimes in real-time systems (panel)", journal = j-SIGPLAN, volume = "30", number = "11", pages = "124--124", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p124-gerber/", acknowledgement = ack-nhfb, confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; theory", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, User interfaces. {\bf D.3.0} Software, PROGRAMMING LANGUAGES, General. {\bf D.4.0} Software, OPERATING SYSTEMS, General.", } @Article{Mueller:1995:CSS, author = "Frank Mueller", title = "Compiler support for software-based cache partitioning", journal = j-SIGPLAN, volume = "30", number = "11", pages = "125--133", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p125-mueller/", abstract = "Cache memories have become an essential part of modern processors to bridge the increasing gap between fast processors and slower main memory. Until recently, cache memories were thought to impose unpredictable execution time behavior for hard real-time systems. But recent results show that the speedup of caches can be exploited without a significant sacrifice of predictability. These results were obtained under the assumption that real-time tasks be scheduled non-preemptively. The paper introduces a method to maintain predictability of execution time within preemptive, cached real-time systems and discusses the impact on compilation support for such a system. Preemptive systems with caches are made predictable via software-based cache partitioning. With this approach, the cache is divided into distinct portions associated with a real-time task, such that a task may only use its portion. The compiler has to support instruction and data partitioning for each task. Instruction partitioning involves non-linear control-flow transformations, while data partitioning involves code transformations of data references. The impact on execution time of these transformations is also discussed.", acknowledgement = ack-nhfb, affiliation = "Inst. fur Inf., Humboldt-Univ., Berlin, Germany", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Cache memories; Cache speedup; Code transformations; Compilation support; Compiler support; Data partitioning; Data references; design; Execution time; Hard real-time systems; Instruction partitioning; Nonlinear control-flow transformations; Nonpreemptive scheduling; performance; Predictability; Preemptive cached real-time systems; Real-time tasks; Software-based cache partitioning; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", thesaurus = "Cache storage; Processor scheduling; Program compilers; Program control structures; Real-time systems", } @Article{Bakkers:1995:AGS, author = "Andr{\'e} Bakkers and Johan Sunter and Evert Ploeg", title = "Automatic generation of scheduling and communication code in real-time parallel programs", journal = j-SIGPLAN, volume = "30", number = "11", pages = "134--145", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p134-bakkers/", abstract = "Inter-process communication and scheduling are notorious problem areas in the design of real-time systems. Using CASE tools, the system design phase in general results in a system description in the form of parallel processes. Manual allocation of these processes to processors may result in error prone and/or slow communication code. Scheduling of the processes, necessary to meet timing constraints, is also a tedious task that takes many iterations. The described design tools result in code that is comparable in quality and performance with expert manual realization. Many network layers have been implemented to relieve the user from the low-level programming of communication software. However, the increase in user-friendliness usually results in performance degradation. The proposed approach combines user-friendliness with high performance by generating communication software that is tailor-made for the application. A similar approach is followed with the scheduling software. Schedulers in the form of a built-in kernel are available all the time and cause overhead all the time. The proposed preprocessor tool generates scheduling software after analyzing the timing requirements of the particular application. This results in simple code for simple timing requirements and more complicated code for complex timing requirements. The tools have been implemented in Occam for use on a transputer. However, the results are valid for any distributed memory machine.", acknowledgement = ack-nhfb, affiliation = "Control Lab., Twente Univ., Enschede, Netherlands", classification = "C6110B (Software engineering techniques); C6110P (Parallel programming); C6115 (Programming support); C6150N (Distributed systems software)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; Automatic communication code generation; Automatic scheduling code generation; Built-in kernel; CASE tools; Communication software; design; Design tools; Distributed memory machine; Interprocess communication; Interprocess scheduling; measurement; Network layers; Occam; Overhead; performance; Performance; Preprocessor tool; Real-time parallel programs; Real-time system design; Scheduling software; System description; theory; Timing constraints; Transputer; User-friendliness", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", thesaurus = "Automatic programming; Computer aided software engineering; Distributed memory systems; Parallel programming; Processor scheduling; Real-time systems; Software tools; Timing", } @Article{Schneider:1995:CCB, author = "Stan Schneider and Vincent Chen and Jay Steele and Gerardo Pardo-Castellote", title = "The {ControlShell} component-based real-time programming system, and its application to the {Marsokhod Martian Rover}", journal = j-SIGPLAN, volume = "30", number = "11", pages = "146--155", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:12 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schneider:1995:CCR, author = "Stan Schneider and Vincent Chen and Jay Steele and Gerardo Pardo-Castellote", title = "The {ControlShell} component-based real-time programming system, and its application to the {Marsokhod Martian Rover}", journal = j-SIGPLAN, volume = "30", number = "11", pages = "146--155", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue May 4 05:55:46 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p146-schneider/", abstract = "Real-time system software is notoriously hard to share and reuse. This paper walks through the methodology and application of ControlShell, a component-based programming system for real-time system software development. ControlShell combines graphical system-building tools, an execution-time configuration manager a real-time matrix package, and an object name service into an integrated development environment. It targets complex systems that require online reconfiguration and strategic control. ControlShell takes advantage of functional object hierarchies to enable code sharing and reuse. It gains flexibility by supporting easy interconnectivity of these objects. It features a unique configuration control system for changing operating modes. The paper concludes by examining the application of this framework to a teleoperated rover under development as a joint effort by NASA, several Russian space research institutes, and US industry. The rover is able to function remotely under control of a virtual reality interface.", acknowledgement = ack-nhfb, affiliation = "Real-Time Innovations Inc., Sunnyvale, CA, USA", classification = "C3250 (Telecontrol and telemetering components); C3360L (Aerospace control); C6110B (Software engineering techniques); C6115 (Programming support); C6130B (Graphics techniques); C7420 (Control engineering computing)", confname = "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, \& tools for real-time systems, June 21--22, 1995, La Jolla, California", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "Code sharing; Component-based programming system; ControlShell; design; Execution-time configuration manager; experimentation; Functional object hierarchies; Graphical system-building tools; Integrated development environment; Marsokhod Martian rover; measurement; NASA; Object name service; performance; Real-time matrix package; Real-time programming system; Real-time system software development; Remote control; Russian space research; Software reuse; Strategic control; Teleoperated rover; theory; US industry; Virtual reality interface", subject = "{\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf K.6.3} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Software Management, Software development. {\bf J.7} Computer Applications, COMPUTERS IN OTHER SYSTEMS, Command and control. {\bf I.2.9} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Robotics.", thesaurus = "Aerospace control; Configuration management; Programming environments; Real-time systems; Software reusability; Software tools; Space vehicles; Telecontrol; Virtual reality", } @Article{Weisert:1995:MCP, author = "Conrad Weisert", title = "Making {C++} Practical for Business Applications: 3 essential classes", journal = j-SIGPLAN, volume = "30", number = "12", pages = "4--8", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Information Disciplines Inc., Chicago, IL, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1995:EPR, author = "Per Brinch Hansen", title = "Efficient Parallel Recursion", journal = j-SIGPLAN, volume = "30", number = "12", pages = "9--16", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. and Inf. Sci., Syracuse Univ., NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Li:1995:RBO, author = "Tao Li", title = "A Rule-based and Object-Oriented {AI} Programming Language", journal = j-SIGPLAN, volume = "30", number = "12", pages = "17--24", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Lab. of Software, Chengdu Univ. of Sci. and Technol., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Li:1995:NAE, author = "Gansheng Li", title = "A New Approach for Efficient Implementation of {Ada} Multi-Tasking", journal = j-SIGPLAN, volume = "30", number = "12", pages = "25--31", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Zhejiang Univ., Hangzhou, China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ramsdell:1995:CCS, author = "John D. Ramsdell", title = "{CST}: {C} State Transformers", journal = j-SIGPLAN, volume = "30", number = "12", pages = "32--36", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "MITRE Corp., Bedford, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Genjiang:1995:NMD, author = "Zhu Genjiang and Xie Li and Sun Zhongxiu", title = "A New Methodology of Data Dependence Analysis for Parallelizing {C++}", journal = j-SIGPLAN, volume = "30", number = "12", pages = "37--42", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Nanjing Univ., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Noyelle:1995:DC, author = "Yves L. Noyelle", title = "Disciplined {C}", journal = j-SIGPLAN, volume = "30", number = "12", pages = "43--50", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Ecole Sup{\'e}rieure d`Electr., Gif-sur-Yvette, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xinger:1995:AES, author = "Zhang Xinger", title = "An Approach to Executable Specifications, Based on Formal Source-To-Source Conversion", journal = j-SIGPLAN, volume = "30", number = "12", pages = "51--58", month = dec, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:13 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Technique, Nanjing Univ., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1996:NEN, author = "Ron K. Cytron", title = "Notices: Editorial: {A} new look for an old friend", journal = j-SIGPLAN, volume = "31", number = "1", pages = "1--1", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:20 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Helm:1996:PAS, author = "Richard Helm", title = "Patterns, architecture and software", journal = j-SIGPLAN, volume = "31", number = "1", pages = "2--3", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Helm:1996:PLT, author = "Richard Helm", title = "Patterns: Language Trends: Patterns, Architecture and Software", journal = j-SIGPLAN, volume = "31", number = "1", pages = "2--3", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:47 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:PLPa, author = "Preston Briggs", title = "Programming: Literate Programming: Remembering", journal = j-SIGPLAN, volume = "31", number = "1", pages = "4--5", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:R, author = "Preston Briggs", title = "Remembering", journal = j-SIGPLAN, volume = "31", number = "1", pages = "4--5", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:LTCa, author = "G. Bowden Wise", title = "Language Tips: {C++} Toolbox: {A} New Resource for {C++} Programmers and an Invitation for Participation", journal = j-SIGPLAN, volume = "31", number = "1", pages = "6--8", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:NRC, author = "G. Bowden Wise", title = "A new resource for {C++} programmers and an invitation for participation", journal = j-SIGPLAN, volume = "31", number = "1", pages = "6--8", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stewart:1996:OHS, author = "Kate Stewart", title = "Online: {../SIGPLAN/Hotlist}: Starting Points", journal = j-SIGPLAN, volume = "31", number = "1", pages = "9--11", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stewart:1996:SP, author = "Kate Stewart", title = "Starting points", journal = j-SIGPLAN, volume = "31", number = "1", pages = "9--11", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1996:AEC, author = "Barbara Ryder", title = "Activities: Executive Committee News: Letter from the {Chair}: Changes to {ACM SIGPLAN Bylaws}", journal = j-SIGPLAN, volume = "31", number = "1", pages = "12--17", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1996:LCC, author = "Barbara Ryder", title = "Letter from the {Chair}: changes to {ACM SIGPLAN} bylaws", journal = j-SIGPLAN, volume = "31", number = "1", pages = "12--17", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CAM, author = "Anonymous", title = "Conference Announcements --- {MASPLAS'96}", journal = j-SIGPLAN, volume = "31", number = "1", pages = "18--18", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yuen:1996:TRP, author = "C. K. Yuen and M. D. Feng", title = "Tail-Recursive Parallel Summing of a Multi-List", journal = j-SIGPLAN, volume = "31", number = "1", pages = "20--21", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Inf. Syst. and Comput. Sci., Nat. Univ. of Singapore, Kent Ridge, Singapore", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zeller:1996:DFG, author = "Andreas Zeller and Dorothea L{\"u}tkehaus", title = "{DDD}---{A} Free Graphical Front-End for {UNIX} Debuggers", journal = j-SIGPLAN, volume = "31", number = "1", pages = "22--27", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Abteiling Softwaretechnol., Tech. Univ. Braunschweig, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gough:1996:BTR, author = "K. John Gough", title = "Bottom-up Tree Rewriting Tool {MBURG}", journal = j-SIGPLAN, volume = "31", number = "1", pages = "28--31", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Fac. of Inf. Technol., Queensland Univ. of Technol., Brisbane, Qld., Australia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Barrett:1996:NCC, author = "Myles F. Barrett and Marshall E. Giguere", title = "A Note on Covariance and Contravariance Unification", journal = j-SIGPLAN, volume = "31", number = "1", pages = "32--35", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Data Exchange Associates Inc., Groton, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hamilton:1996:MIO, author = "Jennifer Hamilton", title = "A Model for Implementing an Object-Oriented Design without Language Extensions", journal = j-SIGPLAN, volume = "31", number = "1", pages = "36--43", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IBM Canada Ltd., Toronto, Ont., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Klug:1996:TCV, author = "Michael Klug", title = "Towards a Classification of Visibility Rules", journal = j-SIGPLAN, volume = "31", number = "1", pages = "44--50", month = jan, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:14 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Corp. Res. and Dev., Siemens AG, Munich, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1996:CCCa, author = "Ron K. Cytron", title = "Conference Corner: Call for Participation: {MASPLAS} '96", journal = j-SIGPLAN, volume = "31", number = "2", pages = "1--1", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1996:AEC, author = "Mary Lou Soffa", title = "Activities: Executive Committee News: Letter from the {Vice Chair for Conferences}", journal = j-SIGPLAN, volume = "31", number = "2", pages = "2--3", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1996:CPOa, author = "A. Michael Berman", title = "Curricular Patterns: {OO} Techniques in the Classroom: Column Constructor", journal = j-SIGPLAN, volume = "31", number = "2", pages = "4--5", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1996:OTCa, author = "A. Michael Berman", title = "{OO} techniques in the classroom: column constructor", journal = j-SIGPLAN, volume = "31", number = "2", pages = "4--5", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agarwal:1996:LSL, author = "Pankaj Agarwal", title = "Languages: Special-Purpose Languages: Describing Biological Cells by Computer Program", journal = j-SIGPLAN, volume = "31", number = "2", pages = "6--7", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 11 12:28:00 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Software for modelling of {\em {Dictyostelium} discoideum} is available at \path=ftp://ibc.wustl.edu/pub/agarwal/cpl/cpl.tar.Z= and at \path=http://ibc.wustl.edu/~agarwal/cpl=.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agarwal:1996:SPL, author = "Pankaj Agarwal", title = "Special-purpose languages: describing biological cells by computer programs", journal = j-SIGPLAN, volume = "31", number = "2", pages = "6--7", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CCa, author = "Gabby Silberman", title = "Conference Corner: Conference Report: {The Third International Conference on PARALLEL COMPUTING TECHNOLOGIES (PaCT-95), Saint Petersburg, Russia}", journal = j-SIGPLAN, volume = "31", number = "2", pages = "8--9", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:51 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Silberman:1996:CRI, author = "Gabby Silberman", title = "Conference report: {The International Conference on Parallel Computing Technologies (PaCT-95), Saint Petersburg, Russia}", journal = j-SIGPLAN, volume = "31", number = "2", pages = "8--9", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPAa, author = "Anonymous", title = "Call for Participation: {ACM SIGPLAN International Conference on Functional Programming}", journal = j-SIGPLAN, volume = "31", number = "2", pages = "10--10", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Aug 17 16:39:41 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPAb, author = "Anonymous", title = "Call for Participation: {ACM SIGPLAN} Workshop on Functional Languages in Introductory Computing", journal = j-SIGPLAN, volume = "31", number = "2", pages = "11--11", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:31:51 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wexelblat:1996:TC, author = "Richard L. Wexelblat", title = "Technical Correspondence", journal = j-SIGPLAN, volume = "31", number = "2", pages = "12--12", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 12:42:38 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lastovetsky:1996:MMP, author = "Alexey L. Lastovetsky", title = "{mpC}: {A} Multi-Paradigm Programming Language for Massively Parallel Computers", journal = j-SIGPLAN, volume = "31", number = "2", pages = "13--20", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Inst. for Syst. Programming, Acad. of Sci., Moscow, Russia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tuovinen:1996:TSD, author = "Antti-Pekka Tuovinen and Jukka Paakki", title = "Translating {SQL} for Database Reengineering", journal = j-SIGPLAN, volume = "31", number = "2", pages = "21--26", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Parr:1996:LLT, author = "Terence J. Parr and Russell W. Quong", title = "{LL} and {LR} Translators Need $k > 1$ Lookahead", journal = j-SIGPLAN, volume = "31", number = "2", pages = "27--34", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Parr Res. Corp., San Francisco, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kokol:1996:SCA, author = "Peter Kokol and Janez Brest and Viljem {\v{Z}}umer", title = "Software complexity --- an alternative view", journal = j-SIGPLAN, volume = "31", number = "2", pages = "35--41", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "FERI, Maribor Univ., Slovenia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kristensen:1996:CPC, author = "Bent Bruun Kristensen and Kasper {\O}sterbye", title = "A Conceptual Perspective on the Comparison of Object-Oriented Programming Languages", journal = j-SIGPLAN, volume = "31", number = "2", pages = "42--54", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Inst. of Electron. Syst., Aalborg Univ., Denmark", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Appel:1996:IEC, author = "Andrew W. Appel", title = "Intensional Equality {;=)} for Continuations", journal = j-SIGPLAN, volume = "31", number = "2", pages = "55--57", month = feb, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:15 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Princeton Univ., NJ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hailpern:1996:AEC, author = "Brent Hailpern", title = "Activities: Executive Committee News: Awards Announcements", journal = j-SIGPLAN, volume = "31", number = "3", pages = "1--1", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1996:CPOb, author = "A. Michael Berman", title = "Curricular Patterns: {OO} Techniques in the Classroom: Philadelphia Dreaming", journal = j-SIGPLAN, volume = "31", number = "3", pages = "2--3", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1996:OTCb, author = "A. Michael Berman", title = "{OO} techniques in the classroom: {Philadelphia} dreaming", journal = j-SIGPLAN, volume = "31", number = "3", pages = "2--3", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rossen:1996:AEC, author = "Mary Beth Rossen", title = "Activities: Executive Committee News: The {SIGPLAN Professional Activities Committee}", journal = j-SIGPLAN, volume = "31", number = "3", pages = "4--4", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rossen:1996:SPA, author = "Mary Beth Rossen", title = "The {SIGPLAN Professional Activities Committee}", journal = j-SIGPLAN, volume = "31", number = "3", pages = "4--4", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yellin:1996:DPC, author = "Dan Yellin", title = "Debates: Point\slash Counterpoint: Do Programmers Need Seat Belts?", journal = j-SIGPLAN, volume = "31", number = "3", pages = "5--5", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yellin:1996:PCD, author = "Dan Yellin", title = "Point\slash counterpoint: do programmers need seatbelts?", journal = j-SIGPLAN, volume = "31", number = "3", pages = "5--5", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Strom:1996:DPD, author = "Rob Strom", title = "Debates: Point: Do Programmers Need Seat Belts?", journal = j-SIGPLAN, volume = "31", number = "3", pages = "6--7", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Strom:1996:PDP, author = "Rob Strom", title = "Point: do programmers need seatbelts?", journal = j-SIGPLAN, volume = "31", number = "3", pages = "6--7", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gabriel:1996:CDP, author = "Richard Gabriel", title = "Counterpoint: do programmers need seatbelts?", journal = j-SIGPLAN, volume = "31", number = "3", pages = "8--10", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gabriel:1996:DCD, author = "Richard Gabriel", title = "Debates: Counterpoint: Do Programmers Need Seat Belts?", journal = j-SIGPLAN, volume = "31", number = "3", pages = "8--10", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1996:CCCb, author = "Ron K. Cytron", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "31", number = "3", pages = "11--11", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:TCa, author = "Anonymous", title = "Technical Correspondence", journal = j-SIGPLAN, volume = "31", number = "3", pages = "13--13", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jia:1996:FTS, author = "Guoping Jia and Guoliang Zheng", title = "Fair Transition System Specification: An Integrated Approach", journal = j-SIGPLAN, volume = "31", number = "3", pages = "14--21", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Nanjing Univ., China", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vowels:1996:P, author = "Robin A. Vowels", title = "{PL/I} for {OS/2}", journal = j-SIGPLAN, volume = "31", number = "3", pages = "22--27", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "R. Melbourne Inst. of Technol., Vic., Australia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wang:1996:NSA, author = "Sunny Y. Wang", title = "A New Sort Algorithm: Self-Indexed Sort", journal = j-SIGPLAN, volume = "31", number = "3", pages = "28--36", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:16 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See comment \cite{Andersson:1996:CSI}.", acknowledgement = ack-nhfb, affiliation = "Comput. Lab., Oxford Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1996:BO, author = "A. Michael Berman", title = "On beyond {OOP}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "1--3", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1996:CPB, author = "A. Michael Berman", title = "Curricular Patterns: On Beyond {OOP}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "1--3", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 10:59:26 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:LTCb, author = "G. Bowden Wise", title = "Language Tips: {C++} Toolbox: An Overview of the {Standard Template Library}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "4--10", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:OST, author = "G. Bowden Wise", title = "An overview of the standard template library", journal = j-SIGPLAN, volume = "31", number = "4", pages = "4--10", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:AP, author = "Preston Briggs", title = "Automatic parallelization", journal = j-SIGPLAN, volume = "31", number = "4", pages = "11--15", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:PLPb, author = "Preston Briggs", title = "Programming: Literate Programming: Automatic Parallelization", journal = j-SIGPLAN, volume = "31", number = "4", pages = "11--15", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Tera Comput. Co., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CCC, author = "Anonymous", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "31", number = "4", pages = "16--17", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 10:59:33 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPPa, author = "Anonymous", title = "Call for Papers: Principles of Programming Languages", journal = j-SIGPLAN, volume = "31", number = "4", pages = "18--18", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 10:59:33 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:TCb, author = "Anonymous", title = "Technical Correspondence", journal = j-SIGPLAN, volume = "31", number = "4", pages = "19--19", month = mar, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jun 28 13:49:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bruccoleri:1996:TCW, author = "Robert E. Bruccoleri", title = "Technical Correspondence: {WRAPGEN} --- {A} Tool for the Use of {Fortran} and {C} Together in Portable Programs", journal = j-SIGPLAN, volume = "31", number = "4", pages = "20--27", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Bristol-Myers Squibb Pharm. Res. Inst., Princeton, NJ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bruccoleri:1996:WTU, author = "Robert E. Bruccoleri", title = "{WRAPGEN}: a tool for the use of {Fortran} and {C} together in portable programs", journal = j-SIGPLAN, volume = "31", number = "4", pages = "20--27", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Karr:1996:TCC, author = "Michael Karr", title = "A translator from {C} to a $\lambda$-calculus representation", journal = j-SIGPLAN, volume = "31", number = "4", pages = "28--31", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Software Options Inc., Cambridge, MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Karr:1996:TCS, author = "Michael Karr", title = "A translator from {C} to a $\lambda$-calculus representation", journal = j-SIGPLAN, volume = "31", number = "4", pages = "28--31", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Goldsack:1996:ADD, author = "S. J. Goldsack and K. Lano and E. H. D{\"u}rr", title = "Annealing and data decomposition in {VDM$^{++}$}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "32--38", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Imperial Coll. of Sci., Technol. and Med., London, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rodriguez:1996:SOO, author = "Bradford J. Rodriguez and W. F. S. Poehlman", title = "A Survey of Object-Oriented {Forths}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "39--42", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Syst., McMaster Univ., Hamilton, Ont., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rodriquez:1996:SOO, author = "Bradford J. Rodriquez and W. F. S. Poehlman", title = "A survey of object-oriented {Forths}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "39--42", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zettel:1996:TOO, author = "Leonard Zettel", title = "Toward an Object-Oriented {Forth}", journal = j-SIGPLAN, volume = "31", number = "4", pages = "43--44", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Whitty:1996:OOM, author = "Robin Whitty", title = "Object-Oriented Metrics: An Annotated Bibliography", journal = j-SIGPLAN, volume = "31", number = "4", pages = "45--75", month = apr, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:17 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Centre for Syst. and Software Eng., South Bank Univ., London, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ruttenberg:1996:SPS, author = "John Ruttenberg and G. R. Gao and A. Stoutchinin and W. Lichtenstein", title = "Software Pipelining Showdown: Optimal vs. Heuristic Methods in a Production Compiler", journal = j-SIGPLAN, volume = "31", number = "5", pages = "1--11", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p1-ruttenberg/", acknowledgement = ack-nhfb, affiliation = "Silicon Graphics Inc., Mountain View, CA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "experimentation; languages; measurement; performance", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General.", } @Article{Eichenberger:1996:RMM, author = "Alexandre E. Eichenberger and Edward S. Davidson", title = "A reduced multipipeline machine description that preserves scheduling constraints", journal = j-SIGPLAN, volume = "31", number = "5", pages = "12--22", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p12-eichenberger/", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng. and Comput. Sci., Michigan Univ., Ann Arbor, MI, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization.", } @Article{Flanagan:1996:CBW, author = "Cormac Flanagan and Matthew Flatt and Shriram Krishnamurthi and Stephanie Weirich and Matthias Felleisen", title = "Catching Bugs in the Web of Program Invariants", journal = j-SIGPLAN, volume = "31", number = "5", pages = "23--32", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p23-flanagan/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; languages", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Invariants. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.2.6} Software, SOFTWARE ENGINEERING, Programming Environments, Interactive environments.", } @Article{Adl-Tabatabai:1996:SLD, author = "Ali-Reza Adl-Tabatabai and Thomas Gross", title = "Source-Level debugging of Scalar Optimized Code", journal = j-SIGPLAN, volume = "31", number = "5", pages = "33--43", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p33-adl-tabatabai/", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", } @Article{Evans:1996:SDD, author = "David Evans", title = "Static Detection of Dynamic Memory Errors", journal = j-SIGPLAN, volume = "31", number = "5", pages = "44--53", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p44-evans/", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "management; reliability; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf B.3.m} Hardware, MEMORY STRUCTURES, Miscellaneous.", } @Article{Rinard:1996:CAN, author = "Martin C. Rinard and Pedro C. Diniz", title = "Commutativity Analysis: {A} New Analysis Framework for Parallelizing Compilers", journal = j-SIGPLAN, volume = "31", number = "5", pages = "54--67", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p54-rinard/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance; verification", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Chakrabarti:1996:GCA, author = "Soumen Chakrabarti and Manish Gupta and Jong-Deok Choi", title = "Global Communication Analysis and Optimization", journal = j-SIGPLAN, volume = "31", number = "5", pages = "68--78", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p68-chakrabarti/", acknowledgement = ack-nhfb, affiliation = "Div. of Comput. Sci., California Univ., Berkeley, CA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms. {\bf D.4.4} Software, OPERATING SYSTEMS, Communications Management. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @Article{Trinder:1996:GPP, author = "P. W. Trinder and K. Hammond and J. S. {Mattson, Jr.} and A. S. Partridge and S. L. Peyton Jones", title = "{GUM}: {A} Portable Parallel Implementation of {Haskell}", journal = j-SIGPLAN, volume = "31", number = "5", pages = "79--88", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p79-trinder/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Glasgow Univ., UK", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; management; performance; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf B.3.m} Hardware, MEMORY STRUCTURES, Miscellaneous. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", } @Article{Boehm:1996:SGC, author = "Hans-J. Boehm", title = "Simple Garbage-Collector-Safety", journal = j-SIGPLAN, volume = "31", number = "5", pages = "89--98", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p89-boehm/", acknowledgement = ack-nhfb, affiliation = "Xerox Palo Alto Res. Center, CA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; performance; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Diagnostics. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming.", } @Article{Bruggeman:1996:RCP, author = "Carl Bruggeman and Oscar Waddell and R. Kent Dybvig", title = "Representing Control in the Presence of One-Shot Continuations", journal = j-SIGPLAN, volume = "31", number = "5", pages = "99--107", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p99-bruggeman/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; management; measurement; performance", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.m} Software, PROGRAMMING LANGUAGES, Miscellaneous. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @Article{Burger:1996:PFP, author = "Robert G. Burger and R. Kent Dybvig", title = "Printing Floating-Point Numbers Quickly and Accurately", journal = j-SIGPLAN, volume = "31", number = "5", pages = "108--116", month = may, year = "1996", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/231379.231397", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper offers a significantly faster algorithm than that of \cite{Steele:1990:HPF}, together with a correctness proof and an implementation in Scheme. See also \cite{Clinger:1990:HRF,Abbott:1999:ASS,Steele:2004:RHP,Clinger:2004:RHR}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p108-burger/", abstract = "This paper presents a fast and accurate algorithm for printing floating-point numbers in both free- and fixed-format modes. In free-format mode, the algorithm generates the shortest, correctly rounded output string that converts to the same number when read back in, accommodating whatever rounding mode the reader uses. In fixed-format mode, the algorithm generates a correctly rounded output string using special # marks to denote insignificant trailing digits. For both modes, the algorithm employs a fast estimator to scale floating-point numbers efficiently.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; theory", subject = "{\bf I.3.3} Computing Methodologies, COMPUTER GRAPHICS, Picture/Image Generation, Display algorithms. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms.", } @Article{Dawson:1996:PPA, author = "Steven Dawson and C. R. Ramakrishnan and David S. Warren", title = "Practical Program Analysis Using General Purpose Logic Programming Systems --- {A} Case Study", journal = j-SIGPLAN, volume = "31", number = "5", pages = "117--126", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p117-dawson/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., State Univ. of New York, Stony Brook, NY, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "measurement; verification", subject = "{\bf D.1.6} Software, PROGRAMMING TECHNIQUES, Logic Programming. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @Article{Adl-Tabatabai:1996:ELI, author = "Ali-Reza Adl-Tabatabai and Geoff Langdale and Steven Lucco and Robert Wahbe", title = "Efficient and Language-Independent Mobile Programs", journal = j-SIGPLAN, volume = "31", number = "5", pages = "127--136", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p127-adl-tabatabai/", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Specialized application languages. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS.", } @Article{Lee:1996:OMR, author = "Peter Lee and Mark Leone", title = "Optimizing {ML} with Run-Time Code Generation", journal = j-SIGPLAN, volume = "31", number = "5", pages = "137--148", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p137-lee/", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", } @Article{Auslander:1996:FED, author = "Joel Auslander and Matthai Philipose and Craig Chambers and Susan J. Eggers and Brian N. Bershad", title = "Fast, Effective Dynamic Compilation", journal = j-SIGPLAN, volume = "31", number = "5", pages = "149--159", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p149-auslander/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Eng., Washington Univ., USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; measurement", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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.", } @Article{Engler:1996:VRE, author = "Dawson R. Engler", title = "{\sc VCODE}: {A} Retargetable, Extensible, Very Fast Dynamic Code Generation System", journal = j-SIGPLAN, volume = "31", number = "5", pages = "160--170", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p160-engler/", acknowledgement = ack-nhfb, affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", } @Article{Reppy:1996:SOS, author = "John Reppy and Jon Riecke", title = "Simple Objects for {Standard ML}", journal = j-SIGPLAN, volume = "31", number = "5", pages = "171--180", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p171-reppy/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; theory", subject = "{\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", } @Article{Tarditi:1996:TTD, author = "D. Tarditi and G. Morrisett and P. Cheng and C. Stone and R. Harper and P. Lee", title = "{TIL}: {A} Type-Directed Optimizing Compiler for {ML}", journal = j-SIGPLAN, volume = "31", number = "5", pages = "181--192", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p181-tarditi/", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "measurement; performance; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", } @Article{Jagannathan:1996:FDI, author = "Suresh Jagannathan and Andrew Wright", title = "Flow-directed Inlining", journal = j-SIGPLAN, volume = "31", number = "5", pages = "193--205", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p193-jagannathan/", acknowledgement = ack-nhfb, affiliation = "NEC Res. Inst., Princeton, NJ, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; management; performance", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf D.4.6} Software, OPERATING SYSTEMS, Security and Protection, Information flow controls.", } @Article{Sperber:1996:RCP, author = "Michael Sperber and Peter Thiemann", title = "Realistic Compilation by Partial Evaluation", journal = j-SIGPLAN, volume = "31", number = "5", pages = "206--214", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p206-sperber/", acknowledgement = ack-nhfb, affiliation = "Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "experimentation; measurement; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", } @Article{Knoblock:1996:DS, author = "Todd B. Knoblock and Erik Ruf", title = "Data Specialization", journal = j-SIGPLAN, volume = "31", number = "5", pages = "215--225", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p215-knoblock/", acknowledgement = ack-nhfb, affiliation = "Microsoft Corp., Redmond, WA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance; verification", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", } @Article{Ramsey:1996:RMI, author = "Norman Ramsey", title = "Relocating Machine Instructions by Currying", journal = j-SIGPLAN, volume = "31", number = "5", pages = "226--236", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p226-ramsey/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "experimentation; measurement", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @Article{Chandra:1996:TLS, author = "Satish Chandra and Brad Richards and James R. Larus", title = "{Teapot}: Language Support for Writing Memory Coherence Protocols", journal = j-SIGPLAN, volume = "31", number = "5", pages = "237--248", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p237-chandra/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "languages; management; measurement", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Specialized application languages. {\bf I.2.11} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Distributed Artificial Intelligence, Coherence and coordination. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory.", } @Article{Bailey:1996:TSC, author = "Mark W. Bailey and Jack W. Davidson", title = "Target-Sensitive Construction of Diagnostic Programs for Procedure Calling Sequence Generators", journal = j-SIGPLAN, volume = "31", number = "5", pages = "249--257", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p249-bailey/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Virginia Univ., Charlottesville, VA, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Diagnostics. {\bf I.6.8} Computing Methodologies, SIMULATION AND MODELING, Types of Simulation, Combined.", } @Article{Russinovich:1996:RCN, author = "Mark Russinovich and Bryce Cogswell", title = "Replay For Concurrent Non-Deterministic Shared-Memory Applications", journal = j-SIGPLAN, volume = "31", number = "5", pages = "258--266", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p258-russinovich/", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Oregon Univ., Eugene, OR, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; management; measurement; performance", subject = "{\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous, Reusable software**. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms. {\bf D.3.m} Software, PROGRAMMING LANGUAGES, Miscellaneous. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @Article{Ramalingam:1996:DFF, author = "G. Ramalingam", title = "Data Flow Frequency Analysis", journal = j-SIGPLAN, volume = "31", number = "5", pages = "267--277", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p267-ramalingam/", acknowledgement = ack-nhfb, affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; theory", subject = "{\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 D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Sreedhar:1996:NFE, author = "Vugranam C. Sreedhar and Guang R. Gao and Yong-Fong Lee", title = "A New Framework for Exhaustive and Incremental Data Flow Analysis using {DJ} Graphs", journal = j-SIGPLAN, volume = "31", number = "5", pages = "278--290", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p278-sreedhar/", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., McGill Univ., Montreal, Que., Canada", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; theory", subject = "{\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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Bilardi:1996:FGC, author = "Gianfranco Bilardi and Keshav Pingali", title = "A Framework for Generalized Control Dependence", journal = j-SIGPLAN, volume = "31", number = "5", pages = "291--300", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:18 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/231379/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/231379/p291-bilardi/", acknowledgement = ack-nhfb, affiliation = "Dipartimento di Elettronica e Inf., Padova Univ., Italy", annote = "Published as part of the Proceedings of PLDI'96.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; management; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @Article{Jones:1996:LFM, author = "Simon Peyton Jones and Will Partain and Andr{\'e} Santos", title = "Let-floating: Moving bindings to give faster programs", journal = j-SIGPLAN, volume = "31", number = "6", pages = "1--12", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Glasgow Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sabry:1996:RCV, author = "Amr Sabry and Philip Wadler", title = "A reflection on call-by-value", journal = j-SIGPLAN, volume = "31", number = "6", pages = "13--24", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Oregon Univ., Eugene, OR, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hardin:1996:FBE, author = "Th{\'e}r{\`e}se Hardin and Luc Maranget and Bruno Pagano", title = "Functional back-ends within the lambda-sigma calculus", journal = j-SIGPLAN, volume = "31", number = "6", pages = "25--33", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Paris VI Univ., France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rojemo:1996:LDV, author = "Niklas R{\"o}jemo and Colin Runciman", title = "Lag, drag, void and use --- Heap profiling and space-efficient compilation revisited", journal = j-SIGPLAN, volume = "31", number = "6", pages = "34--41", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., York Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:SDP, author = "David S. Wise and Joshua Walgenbach", title = "Static and dynamic partitioning of pointers as links and threads", journal = j-SIGPLAN, volume = "31", number = "6", pages = "42--49", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Serrano:1996:SUA, author = "Manuel Serrano and Marc Feeley", title = "Storage use analysis and its applications", journal = j-SIGPLAN, volume = "31", number = "6", pages = "50--61", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Montreal Univ., Que., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Okasaki:1996:RLE, author = "Chris Okasaki", title = "The role of lazy evaluation in amortized data structures", journal = j-SIGPLAN, volume = "31", number = "6", pages = "62--72", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Sch. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hu:1996:DSH, author = "Zhenjiang Hu and Hideya Iwasaki and Masato Takeichi", title = "Deriving structural hylomorphisms from recursive definitions", journal = j-SIGPLAN, volume = "31", number = "6", pages = "73--82", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Inf. Eng., Tokyo Univ., Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Abadi:1996:ACD, author = "Mart{\'\i}n Abadi and Butler Lampson and Jean-Jacques L{\'e}vy", title = "Analysis and caching of dependencies", journal = j-SIGPLAN, volume = "31", number = "6", pages = "83--91", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lawall:1996:OIW, author = "Julia L. Lawall and Harry G. Mairson", title = "Optimality and inefficiency: What isn't a cost model of the lambda calculus?", journal = j-SIGPLAN, volume = "31", number = "6", pages = "92--101", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "IRISA, Campus Univ. de Beaulieu, Rennes, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Howard:1996:ICP, author = "Brian T. Howard", title = "Inductive, coinductive, and pointed types", journal = j-SIGPLAN, volume = "31", number = "6", pages = "102--109", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. and Inf. Sci., Kansas State Univ., Manhattan, KS, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gostanza:1996:NLP, author = "Pedro Palao Gostanza and Ricardo Pe{\~n}a and Manuel N{\'u}{\~n}ez", title = "A new look at pattern matching in abstract data types", journal = j-SIGPLAN, volume = "31", number = "6", pages = "110--121", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. de Inf. y Autom., Complutense Univ., Madrid, Spain", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pottier:1996:SSC, author = "Fran{\c{c}}ois Pottier", title = "Simplifying subtyping constraints", journal = j-SIGPLAN, volume = "31", number = "6", pages = "122--133", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Inst. Nat. de Recherche en Inf. et Autom., France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ghelli:1996:CKF, author = "Giorgio Ghelli", title = "Complexity of kernel {Fun} subtype checking", journal = j-SIGPLAN, volume = "31", number = "6", pages = "134--145", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dipartimento Inf., Pisa, Italy", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Moreau:1996:SSF, author = "Luc Moreau", title = "The semantics of {Scheme} with future", journal = j-SIGPLAN, volume = "31", number = "6", pages = "146--156", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Southampton Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Turbak:1996:FCS, author = "Franklyn Turbak", title = "First-class synchronization barriers", journal = j-SIGPLAN, volume = "31", number = "6", pages = "157--168", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Wellesley Coll., MA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Flanagan:1996:PDP, author = "Cormac Flanagan and Rishiyur S. Nikhil", title = "{pHluid}: the design of a parallel functional language implementation on workstations", journal = j-SIGPLAN, volume = "31", number = "6", pages = "169--179", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Thiemann:1996:CSL, author = "Peter J. Thiemann", title = "{Cogen} in six lines", journal = j-SIGPLAN, volume = "31", number = "6", pages = "180--189", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Wilhelm-Schickard-Inst. fur Inf., Tubingen Univ., Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chuang:1996:PAP, author = "Tyng-Ruey Chuang and Wen L. Hwang", title = "A probabilistic approach to the problem of automatic selection of data representations", journal = j-SIGPLAN, volume = "31", number = "6", pages = "190--200", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ferreira:1996:TWB, author = "William Ferreira and Matthew Hennessy and Alan Jeffrey", title = "A theory of weak bisimulation for core {CML}", journal = j-SIGPLAN, volume = "31", number = "6", pages = "201--212", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Sussex Univ., Brighton, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Blelloch:1996:PTS, author = "Guy E. Blelloch and John Greiner", title = "A provable time and space efficient implementation of {NESL}", journal = j-SIGPLAN, volume = "31", number = "6", pages = "213--225", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Carnegie Mellon Univ., Pittsburgh, PA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Caspi:1996:SKN, author = "Paul Caspi and Marc Pouzet", title = "Synchronous {Kahn} networks", journal = j-SIGPLAN, volume = "31", number = "6", pages = "226--238", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Montbonnot St-Martin, VERIMAG, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lee:1996:ELC, author = "Shinn-Der Lee and Daniel P. Friedman", title = "Enriching the lambda calculus with contexts: Toward a theory of incremental program construction", journal = j-SIGPLAN, volume = "31", number = "6", pages = "239--250", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Indiana Univ., Bloomington, IN, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Queinnec:1996:SCT, author = "Christian Queinnec and David De Roure", title = "Sharing code through first-class environments", journal = j-SIGPLAN, volume = "31", number = "6", pages = "251--261", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Inst. Nat. de Recherche en Inf. et Autom., Rocquencourt, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Duggan:1996:MM, author = "Dominic Duggan and Constantinos Sourelis", title = "Mixin modules", journal = j-SIGPLAN, volume = "31", number = "6", pages = "262--273", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:20 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:ECN, author = "Anonymous", title = "{Executive Committee} News", journal = j-SIGPLAN, volume = "31", number = "7", pages = "1--??", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 6 05:56:21 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPPb, author = "Anonymous", title = "Call for Papers: {PLDI} '97", journal = j-SIGPLAN, volume = "31", number = "7", pages = "2--??", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 6 05:56:21 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hind:1996:URC, author = "Michael Hind and Phil Pfeiffer", title = "Using regional conferences to mentor student development: a case study", journal = j-SIGPLAN, volume = "31", number = "7", pages = "4--7", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hind:1996:CRM, author = "Michael Hind and Phil Pfeiffer", title = "Conference Report: Mentoring Student Development", journal = j-SIGPLAN, volume = "31", number = "7", pages = "4--??", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 6 05:56:21 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CCb, author = "Anonymous", title = "Conference Calendar", journal = j-SIGPLAN, volume = "31", number = "7", pages = "8--??", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 6 05:56:21 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gibbon:1996:LTC, author = "C. Gibbon and C. Higgins", title = "Language Tips: {C++} Toolbox: Teaching object-oriented design with heuristics", journal = j-SIGPLAN, volume = "31", number = "7", pages = "12--16", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 17:00:56 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Nottingham Univ., UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gibbon:1996:TOO, author = "C. Gibbon and C. Higgins", title = "Teaching object-oriented design with heuristics", journal = j-SIGPLAN, volume = "31", number = "7", pages = "12--16", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPJ, author = "Anonymous", title = "Call for Papers: {JMLC} '97", journal = j-SIGPLAN, volume = "31", number = "7", pages = "17--??", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 6 05:56:21 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Aiken:1996:CPP, author = "Alexander Aiken", title = "{Cool}: {A} Portable Project for Teaching Compiler Construction", journal = j-SIGPLAN, volume = "31", number = "7", pages = "19--24", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng. and Comput. Sci., California Univ., Berkeley, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sorkin:1996:SCP, author = "Arthur Sorkin", title = "Some Comments on `{The Priority-Based Coloring Approach to Register Allocation}'", journal = j-SIGPLAN, volume = "31", number = "7", pages = "25--29", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Tesuji Inc, Los Gatos, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chen:1996:EOO, author = "Jiun-Liang Chen and Feng-Jian Wang", title = "Encapsulation in Object-Oriented Programs", journal = j-SIGPLAN, volume = "31", number = "7", pages = "30--32", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Panti:1996:PPC, author = "M. Panti and A. Cucchiarelli and M. Mattiucci and S. Valenti", title = "Process to Process Communication in {Prolog}", journal = j-SIGPLAN, volume = "31", number = "7", pages = "33--39", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Comput. Sci. Dept., Ancona Univ., Italy", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Milanese:1996:IRS, author = "Vitaliano Milanese", title = "Interpreting {RSets}, {SSets} and Features by Denotational Semantics", journal = j-SIGPLAN, volume = "31", number = "7", pages = "40--47", month = jul, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:21 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Dipartimento di Matematica e Inf., Udine Univ., Italy", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:LC, author = "Anonymous", title = "Letter from the {Chair}", journal = j-SIGPLAN, volume = "31", number = "8", pages = "1--1", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:AR, author = "Anonymous", title = "1995--96 Annual Report", journal = j-SIGPLAN, volume = "31", number = "8", pages = "2--3", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:PR, author = "Anonymous", title = "Press Release", journal = j-SIGPLAN, volume = "31", number = "8", pages = "4--4", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:LPSa, author = "Preston Briggs", title = "Literate Programming: Sparse Matrix Manipulation", journal = j-SIGPLAN, volume = "31", number = "8", pages = "5--7", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Oct 24 06:44:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:SMMa, author = "Preston Briggs", title = "Sparse matrix manipulation", journal = j-SIGPLAN, volume = "31", number = "8", pages = "5--7", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Loui:1996:WGA, author = "Ronald P. Loui", title = "Why {GAWK} for {AI}?", journal = j-SIGPLAN, volume = "31", number = "8", pages = "8--9", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:CCB, author = "G. Bowden Wise", title = "Casting in {C++}: bringing safety and smartness to your programs", journal = j-SIGPLAN, volume = "31", number = "8", pages = "10--15", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1996:CT, author = "G. Bowden Wise", title = "{C++} Toolbox", journal = j-SIGPLAN, volume = "31", number = "8", pages = "10--15", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Papaspynou:1996:DSC, author = "Nikolaos S. Papaspynou", title = "Denotational Semantics in {C++}", journal = j-SIGPLAN, volume = "31", number = "8", pages = "16--25", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Papaspyrou:1996:FPD, author = "Nikolaos S. Papaspyrou", title = "A framework for programming denotational semantics in {C++}", journal = j-SIGPLAN, volume = "31", number = "8", pages = "16--25", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1996:FRT, author = "Paul Frenger", title = "{Forth} Report: Thoughts on the {1996 Rochester FORTH} Conference", journal = j-SIGPLAN, volume = "31", number = "8", pages = "26--27", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1996:TRF, author = "Paul Frenger", title = "Thoughts on the {1996 Rochester FORTH Conference}", journal = j-SIGPLAN, volume = "31", number = "8", pages = "26--27", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Norton:1996:IWP, author = "Charles D. Norton", title = "{The International Workshop on Parallel C++ (IWPC++) Kanazawa, Ishikawa prefecture, Japan}", journal = j-SIGPLAN, volume = "31", number = "8", pages = "28--30", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Norton:1996:WR, author = "Charles D. Norton", title = "Workshop Report: The {International Workshop on Parallel C++ (IWPC++), Kanazawa, Ishikawa Prefecturem, Japan}", journal = j-SIGPLAN, volume = "31", number = "8", pages = "28--30", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPS, author = "Anonymous", title = "Call for Papers: {SCM} 7", journal = j-SIGPLAN, volume = "31", number = "8", pages = "31--31", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CPPc, author = "Anonymous", title = "Call for Papers: {PPoPP} 97", journal = j-SIGPLAN, volume = "31", number = "8", pages = "32--33", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CCd, author = "Anonymous", title = "Conference Calendar", journal = j-SIGPLAN, volume = "31", number = "8", pages = "34--39", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Andersson:1996:CSI, author = "Arne Andersson and Andrej Brodnik", title = "Comment on ``Self-Indexed Sort''", journal = j-SIGPLAN, volume = "31", number = "8", pages = "40--42", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Wang:1996:NSA}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vialle:1996:PPP, author = "St{\'e}phane Vialle and Thierry Cornu and Yannick Lallement", title = "{ParCeL-1}: a parallel programming language based on autonomous and synchronous actors", journal = j-SIGPLAN, volume = "31", number = "8", pages = "43--51", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Abdullah:1996:HPA, author = "Mohd Hanafiah Abdullah", title = "hcc: a portable {ANSI C} compiler (with a code generator for the {PowerPCs})", journal = j-SIGPLAN, volume = "31", number = "8", pages = "52--59", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Syropoulos:1996:NTCa, author = "Apostolos Syropoulos", title = "A Note On Type Checking Linear Functional Languages", journal = j-SIGPLAN, volume = "31", number = "8", pages = "60--63", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Butt:1996:PMC, author = "Farooq Butt", title = "Porting the mcc Compiler into an Interactive Development Environment", journal = j-SIGPLAN, volume = "31", number = "8", pages = "64--73", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Butt:1996:PTP, author = "Farooq Butt", title = "Porting the mcc {PowerPC C\slash C++} compiler into an interactive development environment", journal = j-SIGPLAN, volume = "31", number = "8", pages = "64--73", month = aug, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } %%% %%% The vol. 30, no. 5, December 1996 issue of SIGOPS Operating Systems %%% Review was copublished as SIGPLAN Notices vol. 31, no. 9, September %%% 1996, and as SIGARCH Computer Architecture News, Vol. 24, special %%% issue, October 1996. %%% @Article{Pronk:1996:IIS, author = "C. Pronk and M. Sch{\"o}nhacker", title = "{ISO\slash IEC 10514-1, the Standard for Modula-2}: Process Aspects", journal = j-SIGPLAN, volume = "31", number = "8", pages = "74--83", month = aug, year = "1996", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/242903.242950", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:22 MST 2003", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", issuedate = "August 1996", journal-URL = "https://dl.acm.org/loi/sigplan", numpages = "10", } @Article{Schonhacker:1996:IIS, author = "M. Sch{\"o}nhacker and C. Pronk", title = "{ISO\slash IEC 10514-1, the Standard for Modula-2}: Changes, Clarifications and Additions", journal = j-SIGPLAN, volume = "31", number = "8", pages = "84--95", month = aug, year = "1996", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/242903.242951", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", issuedate = "August 1996", journal-URL = "https://dl.acm.org/loi/sigplan", numpages = "12", } @Article{Olukotun:1996:CSC, author = "Kunle Olukotun and Basem A. Nayfeh and Lance Hammond and Ken Wilson and Kunyung Chang", title = "The case for a single-chip multiprocessor", journal = j-SIGPLAN, volume = "31", number = "9", pages = "2--11", month = sep, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Olukotun:1996:CSM, author = "Kunle Olukotun and Basem A. Nayfeh and Lance Hammond and Ken Wilson and Kunyung Chang", title = "The Case for a Single-Chip Multiprocessor", journal = j-SIGPLAN, volume = "31", number = "9", pages = "2--11", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:57 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p2-olukotun/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance", subject = "{\bf C.5.3} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Microcomputers, Microprocessors. {\bf B.7.1} Hardware, INTEGRATED CIRCUITS, Types and Design Styles, Microprocessors and microcomputers. {\bf B.7.0} Hardware, INTEGRATED CIRCUITS, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors).", } @Article{Pai:1996:EMC, author = "Vijay S. Pai and Parthasarathy Ranganathan and Sarita V. Adve and Tracy Harton", title = "An Evaluation of Memory Consistency Models for Shared-Memory Systems with {ILP} Processors", journal = j-SIGPLAN, volume = "31", number = "9", pages = "12--23", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p12-pai/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; measurement; performance", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids**, Simulation**. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.1.0} Computer Systems Organization, PROCESSOR ARCHITECTURES, General.", } @Article{Scott:1996:SCT, author = "Steven L. Scott", title = "Synchronization and Communication in the {T3E} Multiprocessor", journal = j-SIGPLAN, volume = "31", number = "9", pages = "26--36", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p26-scott/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.5.1} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Large and Medium (``Mainframe'') Computers, Super (very large) computers. {\bf B.5.1} Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design, Memory design.", } @Article{Krishnamurthy:1996:EAS, author = "Arvind Krishnamurthy and Klaus E. Schauser and Chris J. Scheiman and Randolph Y. Wang and David E. Culler and Katherine Yelick", title = "Evaluation of Architectural Support for Global Address-Based Communication in Large-Scale Parallel Machines", journal = j-SIGPLAN, volume = "31", number = "9", pages = "37--48", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p37-krishnamurthy/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf C.5.1} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Large and Medium (``Mainframe'') Computers, Super (very large) computers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @Article{Grunwald:1996:WOT, author = "Dirk Grunwald and Richard Neves", title = "Whole-Program Optimization for Time and Space Efficient Threads", journal = j-SIGPLAN, volume = "31", number = "9", pages = "50--59", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:57 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p50-grunwald/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming.", } @Article{Grunwald:1996:WPO, author = "Dirk Grunwald and Richard Neves", title = "Whole-program optimization for time and space efficient threads", journal = j-SIGPLAN, volume = "31", number = "9", pages = "50--59", month = sep, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Philbin:1996:TSC, author = "James Philbin and Jan Edler and Otto J. Anshus and Craig C. Douglas and Kai Li", title = "Thread Scheduling for Cache Locality", journal = j-SIGPLAN, volume = "31", number = "9", pages = "60--71", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p60-philbin/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on matrices. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, User interfaces.", } @Article{Chen:1996:RFC, author = "Peter M. Chen and Wee Teck Ng and Subhachandra Chandra and Christopher Aycock and Gurushankar Rajamani and David Lowell", title = "The {Rio} File Cache: Surviving Operating System Crashes", journal = j-SIGPLAN, volume = "31", number = "9", pages = "74--83", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p74-chen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance; reliability; security", subject = "{\bf D.4.5} Software, OPERATING SYSTEMS, Reliability, Backup procedures. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf D.4.5} Software, OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf B.3.4} Hardware, MEMORY STRUCTURES, Reliability, Testing, and Fault-Tolerance**.", } @Article{Lee:1996:PDV, author = "Edward K. Lee and Chandramohan A. Thekkath", title = "{Petal}: Distributed Virtual Disks", journal = j-SIGPLAN, volume = "31", number = "9", pages = "84--92", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p84-lee/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance; reliability", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Virtual memory. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance.", } @Article{McKinley:1996:QAL, author = "Kathryn S. McKinley and Olivier Temam", title = "A Quantitative Analysis of Loop Nest Locality", journal = j-SIGPLAN, volume = "31", number = "9", pages = "94--104", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p94-mckinley/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids**.", } @Article{Huang:1996:IBR, author = "Andrew S. Huang and John Paul Shen", title = "The Intrinsic Bandwidth Requirements of Ordinary Programs", journal = j-SIGPLAN, volume = "31", number = "9", pages = "105--114", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p105-huang/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "experimentation; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids**.", } @Article{Seznec:1996:MAB, author = "Andr{\'e} Seznec and St{\'e}phan Jourdan and Pascal Sainrat and Pierre Michaud", title = "Multiple-Block Ahead Branch Predictors", journal = j-SIGPLAN, volume = "31", number = "9", pages = "116--127", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:57 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p116-seznec/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance", subject = "{\bf B.5.2} Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design Aids, Optimization. {\bf B.5.1} Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design, Control design. {\bf B.5.1} Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design, Memory design.", } @Article{Seznec:1996:MBA, author = "Andr{\'e} Seznec and St{\'e}phan Jourdan and Pascal Sainrat and Pierre Michaud", title = "Multiple-block ahead branch predictors", journal = j-SIGPLAN, volume = "31", number = "9", pages = "116--127", month = sep, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chen:1996:ABP, author = "I-Cheng K. Chen and John T. Coffey and Trevor N. Mudge", title = "Analysis of Branch Prediction Via Data Compression", journal = j-SIGPLAN, volume = "31", number = "9", pages = "128--137", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p128-chen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf E.4} Data, CODING AND INFORMATION THEORY, Data compaction and compression.", } @Article{Lipasti:1996:VLL, author = "Mikko H. Lipasti and Christopher B. Wilkerson and John Paul Shen", title = "Value Locality and Load Value Prediction", journal = j-SIGPLAN, volume = "31", number = "9", pages = "138--147", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p138-lipasti/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "performance; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids**. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Modeling techniques.", } @Article{Romer:1996:SPI, author = "Theodore H. Romer and Dennis Lee and Geoffrey M. Voelker and Alec Wolman and Wayne A. Wong and Jean-Loup Baer and Brian N. Bershad and Henry M. Levy", title = "The Structure and Performance of Interpreters", journal = j-SIGPLAN, volume = "31", number = "9", pages = "150--159", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p150-romer/", acknowledgement = ack-nhfb, annote = "Compares the MIPSI, Java, Perl, and Tcl interpreters on a DEC Alpha platform.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "languages; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Tcl. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", } @Article{Fox:1996:ANC, author = "Armando Fox and Steven D. Gribble and Eric A. Brewer and Elan Amir", title = "Adapting to Network and Client Variability via On-Demand Dynamic Distillation", journal = j-SIGPLAN, volume = "31", number = "9", pages = "160--170", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p160-fox/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance", subject = "{\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Internet. {\bf C.2.0} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General, Data communications. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes.", } @Article{Scales:1996:SLO, author = "Daniel J. Scales and Kourosh Gharachorloo and Chandramohan A. Thekkath", title = "{Shasta}: {A} Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory", journal = j-SIGPLAN, volume = "31", number = "9", pages = "174--185", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p174-scales/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; performance", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf C.2.4} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.", } @Article{Dwarkadas:1996:ICT, author = "Sandhya Dwarkadas and Alan L. Cox and Willy Zwaenepoel", title = "An Integrated Compile-Time\slash Run-Time Software Distributed Shared Memory System", journal = j-SIGPLAN, volume = "31", number = "9", pages = "186--197", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p186-dwarkadas/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; performance", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Bianchini:1996:HCL, author = "R. Bianchini and L. I. Kontothanassis and R. Pinto and M. De Maria and M. Abud and C. L. Amorim", title = "Hiding Communication Latency and Coherence Overhead in Software {DSMs}", journal = j-SIGPLAN, volume = "31", number = "9", pages = "198--209", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p198-bianchini/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; performance", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.5.3} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Microcomputers, Workstations.", } @Article{Erlichson:1996:SAP, author = "Andrew Erlichson and Neal Nuckolls and Greg Chesson and John Hennessy", title = "{SoftFLASH}: Analyzing the Performance of Clustered Distributed Virtual Shared Memory", journal = j-SIGPLAN, volume = "31", number = "9", pages = "210--220", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p210-erlichson/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance", subject = "{\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Distributed networks. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors).", } @Article{Luk:1996:CBP, author = "Chi-Keung Luk and Todd C. Mowry", title = "Compiler-based prefetching for recursive data structures", journal = j-SIGPLAN, volume = "31", number = "9", pages = "222--233", month = sep, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Luk:1996:CPR, author = "Chi-Keung Luk and Todd C. Mowry", title = "Compiler-Based Prefetching for Recursive Data Structures", journal = j-SIGPLAN, volume = "31", number = "9", pages = "222--233", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:57 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p222-luk/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf E.1} Data, DATA STRUCTURES, Graphs and networks. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Saghir:1996:EDD, author = "Mazen A. R. Saghir and Paul Chow and Corinna G. Lee", title = "Exploiting Dual Data-Memory Banks in Digital Signal Processors", journal = j-SIGPLAN, volume = "31", number = "9", pages = "234--243", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p234-saghir/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf I.5.4} Computing Methodologies, PATTERN RECOGNITION, Applications, Signal processing. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Bugnion:1996:CDP, author = "Edouard Bugnion and Jennifer M. Anderson and Todd C. Mowry and Mendel Rosenblum and Monica S. Lam", title = "Compiler-directed page coloring for multiprocessors", journal = j-SIGPLAN, volume = "31", number = "9", pages = "244--255", month = sep, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bugnion:1996:CPC, author = "Edouard Bugnion and Jennifer M. Anderson and Todd C. Mowry and Mendel Rosenblum and Monica S. Lam", title = "Compiler-Directed Page Coloring for Multiprocessors", journal = j-SIGPLAN, volume = "31", number = "9", pages = "244--255", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat May 1 15:50:57 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p244-bugnion/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming.", } @Article{Jamrozik:1996:RNL, author = "Herv{\'e} A. Jamrozik and Michael J. Feeley and Geoffrey M. Voelker and James {Evans, II} and Anna R. Karlin and Henry M. Levy and Mary K. Vernon", title = "Reducing Network Latency Using Subpages in a Global Memory Environment", journal = j-SIGPLAN, volume = "31", number = "9", pages = "258--267", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p258-jamrozik/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance; verification", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Modula-3. {\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes.", } @Article{Peir:1996:ICP, author = "Jih-Kwon Peir and Windsor W. Hsu and Honesty Young and Shauchi Ong", title = "Improving Cache Performance with Balanced Tag and Data Paths", journal = j-SIGPLAN, volume = "31", number = "9", pages = "268--278", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p268-peir/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; performance", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids**. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS, Performance attributes.", } @Article{Verghese:1996:OSS, author = "Ben Verghese and Scott Devine and Anoop Gupta and Mendel Rosenblum", title = "Operating System Support for Improving Data Locality on {CC-NUMA} Compute Servers", journal = j-SIGPLAN, volume = "31", number = "9", pages = "279--289", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:23 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/237090/p279-verghese/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Virtual memory. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Interconnection architectures. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Virtual memory.", } @Article{Anonymous:1996:AI, author = "Anonymous", title = "Author Index", journal = j-SIGPLAN, volume = "31", number = "9", pages = "290--290", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Oct 30 17:39:18 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:ARP, author = "Anonymous", title = "{ASPLOS-VI} Reviewers", journal = j-SIGPLAN, volume = "31", number = "9", pages = "v--v", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:CCP, author = "Anonymous", title = "{Conference Committee}", journal = j-SIGPLAN, volume = "31", number = "9", pages = "iv--iv", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 29 05:58:33 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nishimura:1996:EOO, author = "Susumu Nishimura and Atsushi Ohori and Keishi Tajima", title = "An equational object-oriented data model and its data-parallel query language", journal = j-SIGPLAN, volume = "31", number = "10", pages = "1--17", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nishimura:1996:EOD, author = "Susumu Nishimura and Atsushi Ohori and Keishi Tajima", title = "An Equational Object-Oriented Data Model and its Data-Parallel Query Language", journal = j-SIGPLAN, volume = "31", number = "10", pages = "1--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cameron:1996:PPR, author = "Lorette Cameron and Charles Berman and Brian {Henderson-Sellers} and Laura Hill and Randall Smith and Sanjiv Gossain", title = "Panel 1: Perspectives on Reuse", journal = j-SIGPLAN, volume = "31", number = "10", pages = "10--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yelland:1996:CHC, author = "Phillip M. Yelland", title = "Creating Host Compliance in a Portable Framework: {A} Study in the Use of Existing Design Patterns", journal = j-SIGPLAN, volume = "31", number = "10", pages = "18--29", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hassen:1996:FOE, author = "Saniya Ben Hassen and Irina Athanasiu and Henri E. Bal", title = "A Flexible Operation Execution Model for Shared Distributed Objects", journal = j-SIGPLAN, volume = "31", number = "10", pages = "30--50", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Adl-Tabatabai:1996:CRO, author = "Ali-Reza Adl-Tabatabai and Thomas Gross and Guei-Yuan Lueh", title = "Code Reuse in an Optimizing Compiler", journal = j-SIGPLAN, volume = "31", number = "10", pages = "51--68", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Barrett:1996:MSL, author = "Kim Barrett and Bob Cassels and Paul Haahr and David A. Moon and Keith Playford and Andrew L. M. Shalit and P. Tucker Withington", title = "A Monotonic Superclass Linearization for {Dylan}", journal = j-SIGPLAN, volume = "31", number = "10", pages = "69--82", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dean:1996:VOC, author = "Jeffrey Dean and Greg DeFouw and David Grove and Vassily Litvinov and Craig Chambers", title = "{Vortex}: an optimizing compiler for object-oriented languages", journal = j-SIGPLAN, volume = "31", number = "10", pages = "83--100", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Discusses performance of Vortex compiler for Cecil, C++, Java, and Modula-3.", URL = "http://www.cs.washington.edu/research/projects/cecil/", acknowledgement = ack-nhfb, classcodes = "C6150C (Compilers, interpreters and other processors); C6110J (Object-oriented programming); C6140D (High level languages)", conflocation = "San Jose, CA, USA; 6--10 Oct. 1996", conftitle = "OOPSLA '96: Eleventh Annual Conference on Object Oriented Programming Systems Languages and Applications", corpsource = "Dept. of Comput. Sci. and Eng., Washington Univ., Seattle, WA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "benchmark programs; C language; C++; Cecil; class; compilers; dynamic metrics; hierarchy analysis; hybrid languages; intermediate language; internal structure; Java; language-independent; Modula; Modula-3; object-oriented languages; optimising; optimization; optimizing compiler; prediction; profile-guided receiver class; program object-orientedness quantification; static metrics; suite; Vortex compiler infrastructure", sponsororg = "ACM", treatment = "P Practical", } @Article{Cameron:1996:PRP, author = "Lorette Cameron and Charles Berman and Brian Henderson-Sellers and Laura Hill and Randall Smith and Sanjiv Gossain", title = "Perspectives on reuse (panel)", journal = j-SIGPLAN, volume = "31", number = "10", pages = "101--103", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dutoit:1996:BOS, author = "Allen Dutoit and Sean Levy and Douglas Cunningham and Robert Patrick", title = "The Basic Object System: Supporting a Spectrum from Prototypes To Hardened Code", journal = j-SIGPLAN, volume = "31", number = "10", pages = "104--121", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bardou:1996:SOD, author = "Daniel Bardou and Christophe Dony", title = "Split Objects: {A} Disciplined Use of Delegation within Objects", journal = j-SIGPLAN, volume = "31", number = "10", pages = "122--137", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{R:1996:RSO, author = "Hern{\'a}n Astudillo R.", title = "Reorganizing split objects", journal = j-SIGPLAN, volume = "31", number = "10", pages = "138--149", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Astudillo:1996:RSO, author = "Hernan R. Astudillo", title = "Reorganizing Split Objects", journal = j-SIGPLAN, volume = "31", number = "10", pages = "138--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kleindienst:1996:LLI, author = "Jan Kleindienst and Franti{\v{s}}ek Pl{\'a}{\v{s}}il and Petr T{\ocirc{u}}ma", title = "Lessons Learned from Implementing the {CORBA} Persistent Object Service", journal = j-SIGPLAN, volume = "31", number = "10", pages = "150--167", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wallace:1996:SEO, author = "Evan Wallace and Kurt C. Wallnau", title = "A Situated Evaluation of the Object Management Group's ({OMG}) Object Management Architecture ({OMA})", journal = j-SIGPLAN, volume = "31", number = "10", pages = "168--178", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tip:1996:SCH, author = "Frank Tip and Jong-Deok Choi and John Field and G. Ramalingam", title = "Slicing Class Hierarchies in {C++}", journal = j-SIGPLAN, volume = "31", number = "10", pages = "179--197", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Moller:1996:FLD, author = "Ralf M{\"o}ller", title = "A Functional Layer for Description Logics: Knowledge Representation Meets Object-Oriented Programming", journal = j-SIGPLAN, volume = "31", number = "10", pages = "198--213", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gil:1996:EAN, author = "Joseph Gil and David H. Lorenz", title = "Environmental Acquisition: {A} New Inheritance-Like Abstraction Mechanism", journal = j-SIGPLAN, volume = "31", number = "10", pages = "214--231", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chisholm:1996:SIH, author = "Paul S. R. Chisholm and Larry Constantine and Ward Cunningham and Luke Hohmann and Norman Kerth", title = "Soft issues and hard problems in software development (panel)", journal = j-SIGPLAN, volume = "31", number = "10", pages = "232--234", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chisholm:1996:PSI, author = "Paul S. R. Chisholm and Larry Constantine and Ward Cunningham and Luke Hohmann and Norman Kerth", title = "Panel 2: Soft Issues and Hard Problems in Software Development", journal = j-SIGPLAN, volume = "31", number = "10", pages = "232--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Moore:1996:AIH, author = "Ivan Moore", title = "Automatic Inheritance Hierarchy Restructuring and Method Refactoring", journal = j-SIGPLAN, volume = "31", number = "10", pages = "235--250", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dicky:1996:ACI, author = "H. Dicky and C. Dony and M. Huchard and T. Libourel", title = "On Automatic Class Insertion with Overloading", journal = j-SIGPLAN, volume = "31", number = "10", pages = "251--267", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Steyaert:1996:RCM, author = "Patrick Steyaert and Carine Lucas and Kim Mens and Theo D'Hondt", title = "Reuse Contracts: Managing the Evolution of Reusable Assets", journal = j-SIGPLAN, volume = "31", number = "10", pages = "268--285", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1996:OAP, author = "Steven D. Fraser and Alistair Cockburn and Jim Coplien and Larry Constantine and Dave West and Leo Brajkovich", title = "{OO} anthropology (panel): crossing the chasm", journal = j-SIGPLAN, volume = "31", number = "10", pages = "286--291", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1996:POA, author = "Steven D. Fraser and Alistair Cockburn and Leo Brajkovich and Jim Coplien and Larry Constantine and Dave West", title = "Panel 3: {OO} Anthropology: Crossing the Chasm", journal = j-SIGPLAN, volume = "31", number = "10", pages = "286--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Diwan:1996:SEA, author = "Amer Diwan and J. Eliot B. Moss and Kathryn S. McKinley", title = "Simple and Effective Analysis of Statically-Typed Object-Oriented Programs", journal = j-SIGPLAN, volume = "31", number = "10", pages = "292--305", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Driesen:1996:DCV, author = "Karel Driesen and Urs H{\"o}lzle", title = "The Direct Cost of Virtual Function Calls in {C++}", journal = j-SIGPLAN, volume = "31", number = "10", pages = "306--323", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bacon:1996:FSA, author = "David F. Bacon and Peter F. Sweeney", title = "Fast Static Analysis of {C++} Virtual Function Calls", journal = j-SIGPLAN, volume = "31", number = "10", pages = "324--341", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ecklund:1996:CCU, author = "Earl F. {Ecklund, Jr.} and Lois M. L. Delcambre and Michael J. Freiling", title = "Change Cases: Use Cases that Identify Future Requirements", journal = j-SIGPLAN, volume = "31", number = "10", pages = "342--358", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{VanHilst:1996:URC, author = "Michael VanHilst and David Notkin", title = "Using Role Components to Implement Collaboration-Based Designs", journal = j-SIGPLAN, volume = "31", number = "10", pages = "359--369", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Klarlund:1996:FDC, author = "Nils Klarlund and Jari Koistinen and Michael I. Schwartzbach", title = "Formal Design Constraints", journal = j-SIGPLAN, volume = "31", number = "10", pages = "370--383", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shan:1996:OSW, author = "Yen-Ping Shan and Tom Morgan and Phil Proudfoot and Jim Thompson and John Tibetts and Allen Woolfrey", title = "Object on the server: are we ready? (panel)", journal = j-SIGPLAN, volume = "31", number = "10", pages = "384--388", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shan:1996:POS, author = "Yen-Ping Shan and Tom Morgan and Phil Proudfoot and Jim Thompson and John Tibbets and Allen Woolfrey", title = "Panel 4: Objects on the Server: Are We Ready?", journal = j-SIGPLAN, volume = "31", number = "10", pages = "384--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sefika:1996:AOV, author = "Mohlalefi Sefika and Aamod Sane and Roy H. Campbell", title = "Architecture-oriented visualization", journal = j-SIGPLAN, volume = "31", number = "10", pages = "389--405", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sefika:1996:AV, author = "Mohlalefi Sefika and Aamod Sane and Roy H. Campbell", title = "Architecture-Oriented Visualization", journal = j-SIGPLAN, volume = "31", number = "10", pages = "389--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Durham:1996:FRT, author = "Alan M. Durham and Ralph E. Johnson", title = "A framework for run-time systems and its visual programming language", journal = j-SIGPLAN, volume = "31", number = "10", pages = "406--420", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Durham:1996:FRS, author = "Alan M. Durham and Ralph E. Johnson", title = "A Framework for Run-Time Systems and its Visual Programming Language", journal = j-SIGPLAN, volume = "31", number = "10", pages = "406--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Attali:1996:SBV, author = "Isabelle Attali and Denis Caromel and Sidi O. Ehmety and Sylvain Lippi", title = "Semantic-based visualization for parallel object-oriented programming", journal = j-SIGPLAN, volume = "31", number = "10", pages = "421--440", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Attali:1996:SVP, author = "Isabelle Attali and Denis Caromel and Sidi O. Ehmety and Sylvain Lippi", title = "Semantic-Based Visualization for Parallel Object-Oriented Programming", journal = j-SIGPLAN, volume = "31", number = "10", pages = "421--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Booch:1996:TMR, author = "Grady Booch and Steven Fraser and Robert C. Martin and Steven J. Mellor and Michael Lee and Steven Garone and Martin Fowler and Douglas C. Schmidt and Marie Lenzi", title = "Translation: myth or reality? (panel)", journal = j-SIGPLAN, volume = "31", number = "10", pages = "441--443", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1996:PDT, author = "Steven Fraser and Grady Booch and Steven Garone and Robert Martin and Martin Fowler and Steven J. Mellor and Douglas C. Schmidt and Michael Lee and Marie Lenzi", title = "Panel 5 (Debate): Translation: Myth or Reality?", journal = j-SIGPLAN, volume = "31", number = "10", pages = "441--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bonar:1996:CIP, author = "Jeffrey Bonar and Nancy Lehrer and Kelly Looney and Randy Schnier and James Russel and Ted Selker and Stewart Nickolas", title = "Components on the {Internet} (panel)", journal = j-SIGPLAN, volume = "31", number = "10", pages = "444--448", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:25 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bonar:1996:PCI, author = "Jeffrey Bonar and Nancy Lehrer and Kelly Looney and Stewart Nickolas and Randy Schnier and James Russell and Ted Selker", title = "Panel 6: Components on the {Internet}", journal = j-SIGPLAN, volume = "31", number = "10", pages = "444--??", month = oct, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 21 19:22:46 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergin:1996:JBC, author = "Joseph Bergin", title = "{Java} as a better {C++}", journal = j-SIGPLAN, volume = "31", number = "11", pages = "21--27", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergin:1996:OTC, author = "Joseph Bergin", title = "Object Technology in the Classroom: {Java} as a Better {C++}", journal = j-SIGPLAN, volume = "31", number = "11", pages = "21--27", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Nov 25 18:50:49 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marin:1996:EUA, author = "Mike A. Marin", title = "Effective use of assertions in {C++}", journal = j-SIGPLAN, volume = "31", number = "11", pages = "28--32", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:LPSb, author = "Preston Briggs", title = "Literate Programming: Sparse Matrix Multiplication", journal = j-SIGPLAN, volume = "31", number = "11", pages = "33--37", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Nov 25 18:52:27 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1996:SMMb, author = "Preston Briggs", title = "Sparse matrix multiplication", journal = j-SIGPLAN, volume = "31", number = "11", pages = "33--37", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kniesel:1996:WDS, author = "G{\"u}nter Kniesel and Thilo Kielmann and Athanasios Demiris and Milena Shteto", title = "5th workshop for doctoral students in object-oriented systems", journal = j-SIGPLAN, volume = "31", number = "11", pages = "39--48", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agarwal:1996:SDR, author = "Rakesh Agarwal and Giorgio Bruno and Marco Torchiano", title = "Static, dynamic and run-time modeling of compound classes", journal = j-SIGPLAN, volume = "31", number = "11", pages = "49--55", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{vandenBroek:1996:MEP, author = "P. M. van den Broek and K. G. van den Berg", title = "Musical equational programs: a functional approach", journal = j-SIGPLAN, volume = "31", number = "11", pages = "56--65", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dotzel:1996:POS, author = "G{\"u}nter Dotzel and Hartmut Goebel", title = "Porting the {Oberon} system to {AlphaAXP}", journal = j-SIGPLAN, volume = "31", number = "11", pages = "66--73", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Werther:1996:MPC, author = "Ben Werther and Damian Conway", title = "A modest proposal: {C++} resyntaxed", journal = j-SIGPLAN, volume = "31", number = "11", pages = "74--82", month = nov, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:26 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pugh:1996:RO, author = "John Pugh", title = "A Report from {OOPSLA}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "1--2", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 16:56:12 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Noble:1996:EWP, author = "James Noble and Antero Taivalsaari", title = "{ECOOP '96 Workshop on Prototype Based Object Oriented Programming}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "12--17", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sharp:1996:PPS, author = "Helen Sharp and Mary Lynn Manns and Phil McLaughlin and Maximo Prieto and Mahesh Dodani", title = "Pedagogical patterns --- successes in teaching object technology: a workshop from {OOPSLA '96}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "18--21", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dodgson:1996:ECS, author = "David Dodgson", title = "Evolution of the {C++} Standard Library", journal = j-SIGPLAN, volume = "31", number = "12", pages = "22--26", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1996:BNT, author = "Ron K. Cytron", title = "Book Nook: {Out of their minds by Dennis Shasha}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "27--28", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1996:RTM, author = "Ron K. Cytron", title = "Review: {Out of their minds by Shasha and Lezere}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "27--28", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 14 16:56:12 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1996:WTF, author = "Paul Frenger", title = "A Whirlwind Tour of {Forth} Resources", journal = j-SIGPLAN, volume = "31", number = "12", pages = "29--32", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deBry:1996:RTW, author = "Roger K. deBry", title = "Report of {TC-2} working groups: minutes of the {IFIP TC-2} meeting {July 13--14, 1996, Oxford, UK}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "33--38", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Houser:1996:MCT, author = "Chris Houser", title = "Manual and Compiler for the Terse and Modular Language {DEM}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "41--51", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Knudsen:1996:UOO, author = "J{\o}rgen Lindskov Knudsen and Ole Lehrmann Madsen", title = "Using Object-Orientation as a Common Basis for System Development Education", journal = j-SIGPLAN, volume = "31", number = "12", pages = "52--62", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Callegarin:1996:RIL, author = "Giuseppe Callegarin", title = "Requirements for an Imperative Language to Host Logic Programming in a Seamless Way", journal = j-SIGPLAN, volume = "31", number = "12", pages = "63--68", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sorkin:1996:SCM, author = "Arthur Sorkin", title = "Some comments on {Morel} and {Renvoise}'s {``Global Optimization by Suppression of Partial Redundancies''}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "69--72", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ferrante:1996:ICS, author = "Richard D. Ferrante and James R. Allard", title = "Introducing a {CPS} Style Optimizer into an Existing Compiler", journal = j-SIGPLAN, volume = "31", number = "12", pages = "73--79", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Syropoulos:1996:NTCb, author = "Apostolos Syropoulos", title = "A {Note On Type Checking Linear Functional Languages}", journal = j-SIGPLAN, volume = "31", number = "12", pages = "80--83", month = dec, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:27 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1996:APO, author = "Anonymous", title = "Advance Program {October 6--10, 1996 --- San Jose, California}", journal = j-SIGPLAN, volume = "??", number = "??", pages = "??--??", month = "????", year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 6 05:56:21 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:LCa, author = "Barbara Ryder", title = "Letter from the Chair", journal = j-SIGPLAN, volume = "32", number = "1", pages = "1--1", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Mar 9 08:37:29 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Trott:1997:PLP, author = "Peter Trott", title = "Programming Languages: Past, Present, and Future: Sixteen Prominent Computer Scientists Assess Our Field", journal = j-SIGPLAN, volume = "32", number = "1", pages = "14--57", month = jan, year = "1997", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/251595.251598", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Extended interview with Al V. Aho, Fran Allen, Jack Dennis, Jeanne Ferrante, Adele Goldberg, Ken Kennedy, Barbara Liskov, David B. MacQueen, Jean Sammet, Ravi Sethi, Burton J. Smith, Guy Steele, Jr., Bjarne Stroustrup, Andrew Tanenbaum, Mark Wegman, and Will Wulf.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hankin:1997:PSS, author = "Chris Hankin and Hanne Riis Nielson and Jens Palsberg", title = "Position Statements on Strategic Directions for Research on Programming Languages", journal = j-SIGPLAN, volume = "32", number = "1", pages = "59--65", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cardelli:1997:GC, author = "Luca Cardelli", title = "Global Computation", journal = j-SIGPLAN, volume = "32", number = "1", pages = "66--68", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Consel:1997:PAB, author = "Charles Consel", title = "Program Adaptation based on Program Transformation", journal = j-SIGPLAN, volume = "32", number = "1", pages = "69--72", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cousot:1997:PAA, author = "Patrick Cousot", title = "Program Analysis: The Abstract Implementation Perspective", journal = j-SIGPLAN, volume = "32", number = "1", pages = "73--76", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hanus:1997:IDP, author = "Michael Hanus", title = "Integration of Declarative Paradigms: Benefits and Challenges", journal = j-SIGPLAN, volume = "32", number = "1", pages = "77--79", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harper:1997:MB, author = "Robert Harper and John C. Mitchell", title = "{ML} and Beyond", journal = j-SIGPLAN, volume = "32", number = "1", pages = "80--85", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{LeMetayer:1997:PAS, author = "Daniel {Le Metayer}", title = "Program Analysis for Software Engineering: New Applications, New Requirements, New Tools", journal = j-SIGPLAN, volume = "32", number = "1", pages = "86--88", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Mar 9 08:37:29 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Metayer:1997:PAS, author = "Daniel Le M{\'e}tayer", title = "Program analysis for software engineering: new applications, new requirements, new tools", journal = j-SIGPLAN, volume = "32", number = "1", pages = "86--88", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nielson:1997:PPA, author = "Flemming Nielson", title = "Perspectives on Program Analysis", journal = j-SIGPLAN, volume = "32", number = "1", pages = "89--91", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Odersky:1997:CTS, author = "Martin Odersky", title = "Challenges in Type Systems Research", journal = j-SIGPLAN, volume = "32", number = "1", pages = "92--93", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Paige:1997:FDP, author = "R. Paige", title = "Future Directions in Program Transformations", journal = j-SIGPLAN, volume = "32", number = "1", pages = "94--98", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pettorossi:1997:FDP, author = "Alberto Pettorossi and Maurizio Proietti", title = "Future Directions in Program Transformation", journal = j-SIGPLAN, volume = "32", number = "1", pages = "99--102", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Reynolds:1997:BM, author = "John C. Reynolds", title = "Beyond {ML}", journal = j-SIGPLAN, volume = "32", number = "1", pages = "103--105", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Riecke:1997:PLS, author = "Jon G. Riecke", title = "Programming Language Semantics: The Description of Computational Structures", journal = j-SIGPLAN, volume = "32", number = "1", pages = "106--109", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:PPC, author = "Barbara G. Ryder", title = "A Position Paper on Compile-time Program Analysis", journal = j-SIGPLAN, volume = "32", number = "1", pages = "110--114", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schmidt:1997:NPF, author = "David A. Schmidt", title = "On the Need for a Popular Formal Semantics", journal = j-SIGPLAN, volume = "32", number = "1", pages = "115--116", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Volpano:1997:PPL, author = "Dennis Volpano", title = "Provably-Secure Programming Languages for Remote Evaluation", journal = j-SIGPLAN, volume = "32", number = "1", pages = "117--119", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Mar 9 08:37:29 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Volpano:1997:PSP, author = "Dennis Volpano", title = "Provably-secure programming languages for remote evaluation", journal = j-SIGPLAN, volume = "32", number = "1", pages = "117--119", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wilhelm:1997:PAT, author = "Reinhard Wilhelm", title = "Program Analysis: {A} Toolmaker's Perspective", journal = j-SIGPLAN, volume = "32", number = "1", pages = "120--121", month = jan, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:28 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:LCb, author = "Barbara Ryder", title = "Letter from the Chair", journal = j-SIGPLAN, volume = "32", number = "2", pages = "1--1", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Mar 31 20:08:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:SA, author = "Barbara Ryder", title = "{SIGPLAN} Awards", journal = j-SIGPLAN, volume = "32", number = "2", pages = "2--2", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Mar 31 20:08:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Alfredsen:1997:OOF, author = "Knut Alfredsen and Bj{\o}rn S{\ae}ther", title = "An Object Oriented Framework for Creating Models in Hydrology", journal = j-SIGPLAN, volume = "32", number = "2", pages = "16--19", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1997:BNC, author = "Ron K. Cytron", title = "Book Nook: {{\booktitle{Compiler Construction}} by Niklaus Wirth}", journal = j-SIGPLAN, volume = "32", number = "2", pages = "20--21", month = feb, year = "1997", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/251621.609139", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Mar 31 20:08:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/w/wirth-niklaus.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", subject-dates = "Niklaus Wirth (15 February 1934--1 January 2024)", } @Article{Cytron:1997:RCC, author = "Ron K. Cytron", title = "Review: {Compiler Construction by Wirth}", journal = j-SIGPLAN, volume = "32", number = "2", pages = "20--21", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Mar 31 20:08:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1997:IBF, author = "Paul Frenger", title = "An Introduction to the {Beetle Forth} Virtual Processor", journal = j-SIGPLAN, volume = "32", number = "2", pages = "22--25", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Mar 31 20:08:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Thomas:1997:IBF, author = "Reuben R. Thomas", title = "An introduction to the {Beetle Forth} virtual processor", journal = j-SIGPLAN, volume = "32", number = "2", pages = "22--25", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yongquiang:1997:DIP, author = "Sun Yongquiang and Lin Kai and Shen Li", title = "The design and implementation of a program development system based on rewriting method", journal = j-SIGPLAN, volume = "32", number = "2", pages = "27--34", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yonqiang:1997:DIP, author = "Sun Yonqiang and Lin Kai and Shen Li", title = "The Design and Implementation of a Program Development System Based on Rewriting Method", journal = j-SIGPLAN, volume = "32", number = "2", pages = "27--34", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Mar 31 20:08:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ejiogu:1997:DVC, author = "Lem O. Ejiogu", title = "On Diminishing the Vibrant Confusion in Software Metrics", journal = j-SIGPLAN, volume = "32", number = "2", pages = "35--38", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ruckert:1997:CPP, author = "Martin Ruckert", title = "Conservative Pretty Printing", journal = j-SIGPLAN, volume = "32", number = "2", pages = "39--44", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Deshpande:1997:SPA, author = "G. Deshpande and T. Pearse and P. Oman", title = "Software Portability Annotated Bibliography", journal = j-SIGPLAN, volume = "32", number = "2", pages = "45--53", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{vandenBrand:1997:REN, author = "Mark van den Brand and Paul Klint and Chris Verhoef", title = "Re-engineering Needs Generic Programming Language Terminology", journal = j-SIGPLAN, volume = "32", number = "2", pages = "54--61", month = feb, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:29 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1997:LVC, author = "Mary Lou Soffa", title = "Letter from the {Vice-Chair for Conferences}", journal = j-SIGPLAN, volume = "32", number = "3", pages = "1--1", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:25:28 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1997:SSW, author = "Mary Lou Soffa", title = "{SIGPLAN} Sponsorship of Workshops", journal = j-SIGPLAN, volume = "32", number = "3", pages = "2--2", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:25:33 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1997:SST, author = "Mary Lou Soffa", title = "{SIGPLAN} Sponsorship of Technical Meetings", journal = j-SIGPLAN, volume = "32", number = "3", pages = "3--4", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:25:45 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1997:MHI, author = "Mary Lou Soffa", title = "Meetings held In-Cooperation With {SIGPLAN}", journal = j-SIGPLAN, volume = "32", number = "3", pages = "5--5", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 4 13:20:36 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmnn:1997:CC, author = "Seth Bergmnn", title = "Conference Corner", journal = j-SIGPLAN, volume = "32", number = "3", pages = "6--19", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:26:20 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1997:CPM, author = "Anonymous", title = "Call for Participation: {MASPLAS} '97", journal = j-SIGPLAN, volume = "32", number = "3", pages = "20--20", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:27:31 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Houlder:1997:CSA, author = "Tom Houlder", title = "{C++} for Scientific Applications of Iterative Nature", journal = j-SIGPLAN, volume = "32", number = "3", pages = "21--26", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:GIGa, author = "Henry G. Baker", title = "Garbage In\slash Garbage Out: When Bad Programs Happen to Good People", journal = j-SIGPLAN, volume = "32", number = "3", pages = "27--31", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:29:32 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:WBP, author = "Henry G. Baker", title = "When bad programs happen to good people", journal = j-SIGPLAN, volume = "32", number = "3", pages = "27--31", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1997:TCI, author = "A. Michael Berman", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "32", number = "3", pages = "32--32", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:29:29 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{MacLennan:1997:WCA, author = "Bruce J. MacLennan", title = "``Who cares about elegance?'' {The} role of aesthetics in programming language design", journal = j-SIGPLAN, volume = "32", number = "3", pages = "33--37", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Winkler:1997:PAU, author = "J{\"u}rgen F. H. Winkler and Stefan Kauer", title = "Proving Assertions is Also Useful", journal = j-SIGPLAN, volume = "32", number = "3", pages = "38--41", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cicekli:1997:IBS, author = "Ilyas Cicekli", title = "An Intelligent Backtracking Schema in a Logic Programming Environment", journal = j-SIGPLAN, volume = "32", number = "3", pages = "42--49", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chen:1997:NAC, author = "Jiajun Chen and Guoliang Zheng", title = "{NDC++}: an approach to concurrent extension of {C++}", journal = j-SIGPLAN, volume = "32", number = "3", pages = "50--56", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jiajun:1997:NAC, author = "Chen Jiajun and Zheng Guoliang", title = "{NDC++}: An Approach to Concurrent Extension of {C++}", journal = j-SIGPLAN, volume = "32", number = "3", pages = "50--56", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 07 14:29:45 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Verschaeren:1997:NPF, author = "Dennis Verschaeren and Annie Cuyt and Brigitte Verdonk", title = "On the Need for Predictable Floating-Point Arithmetic in the Programming Languages {Fortran 90} and {C\slash C++}", journal = j-SIGPLAN, volume = "32", number = "3", pages = "57--64", month = mar, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:30 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:LCc, author = "Barbara Ryder", title = "Letter from the {Chair}", journal = j-SIGPLAN, volume = "32", number = "4", pages = "1--1", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 4 13:20:36 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:SAA, author = "Barbara Ryder", title = "{SIGPLAN} Awards Announced", journal = j-SIGPLAN, volume = "32", number = "4", pages = "2--15", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 4 13:20:36 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rada:1997:IET, author = "Roy Rada and James Schoening", title = "{IEEE} Efforts Towards Standards in Educational Technology", journal = j-SIGPLAN, volume = "32", number = "4", pages = "16--18", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Briggs:1997:PPP, author = "Preston Briggs", title = "Predicting the Performance of Parallel Machines", journal = j-SIGPLAN, volume = "32", number = "4", pages = "19--21", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:FWE, author = "Henry G. Baker", title = "{I} have a feeling we're not in emerald city anymore", journal = j-SIGPLAN, volume = "32", number = "4", pages = "22--26", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:GIGb, author = "Henry G. Baker", title = "Garbage In\slash Garbage Out: {I} Have a Feeling We're Not in {Emerald City} Anymore", journal = j-SIGPLAN, volume = "32", number = "4", pages = "22--26", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 4 13:20:36 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1997:RCT, author = "Paul Frenger", title = "Robot control techniques: {Part} one: a review of robotics languages", journal = j-SIGPLAN, volume = "32", number = "4", pages = "27--31", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1997:RRL, author = "Paul Frenger", title = "A Review of Robotics Languages", journal = j-SIGPLAN, volume = "32", number = "4", pages = "27--31", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 4 13:20:36 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Discusses PostScript, Ghostscript, Tps (transportable PostScript), Java, and others.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kelleghan:1997:MRS, author = "James P. Kelleghan", title = "Monitoring Remote Sensing Devices in {C++}", journal = j-SIGPLAN, volume = "32", number = "4", pages = "32--36", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 4 13:20:36 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wise:1997:CMR, author = "G. Bowden Wise", title = "{C++}: monitoring remote sensing devices in {C++}", journal = j-SIGPLAN, volume = "32", number = "4", pages = "32--36", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zimmermann:1997:NBA, author = "Chris Zimmermann", title = "A Note on Before and After Metamethods", journal = j-SIGPLAN, volume = "32", number = "4", pages = "37--46", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rapin:1997:BSO, author = "Charles Rapin", title = "Block Structured Object Programming", journal = j-SIGPLAN, volume = "32", number = "4", pages = "47--54", month = apr, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:31 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Proebsting:1997:STG, author = "Todd A. Proebsting", title = "Simple Translation of Goal-Directed Evaluation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "1--6", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p1-proebsting/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog.", } @Article{Dolby:1997:AIA, author = "Julian Dolby", title = "Automatic Inline Allocation of Objects", journal = j-SIGPLAN, volume = "32", number = "5", pages = "7--17", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p7-dolby/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf D.2.9} Software, SOFTWARE ENGINEERING, Management. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies.", } @Article{Ramalingam:1997:MLA, author = "G. Ramalingam and Harini Srinivasan", title = "A Member Lookup Algorithm for {C++}", journal = j-SIGPLAN, volume = "32", number = "5", pages = "18--30", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p18-ramalingam/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Wagner:1997:IAR, author = "Tim A. Wagner and Susan L. Graham", title = "Incremental Analysis of Real Programming Languages", journal = j-SIGPLAN, volume = "32", number = "5", pages = "31--43", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p31-wagner/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance; reliability; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.6} Software, SOFTWARE ENGINEERING, Programming Environments. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Parsing. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types.", } @Article{Eide:1997:FFO, author = "Eric Eide and Kevin Frei and Bryan Ford and Jay Lepreau and Gary Lindstrom", title = "{Flick}: {A} Flexible, Optimizing {IDL} Compiler", journal = j-SIGPLAN, volume = "32", number = "5", pages = "44--56", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p44-eide/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", } @Article{Collberg:1997:RIM, author = "Christian S. Collberg", title = "Reverse Interpretation + Mutation Analysis = Automatic Retargeting", journal = j-SIGPLAN, volume = "32", number = "5", pages = "57--70", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p57-collberg/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters.", } @Article{Diniz:1997:DFE, author = "Pedro C. Diniz and Martin C. Rinard", title = "Dynamic Feedback: An Effective Technique for Adaptive Computing", journal = j-SIGPLAN, volume = "32", number = "5", pages = "71--84", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p71-diniz/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Ammons:1997:EHP, author = "Glenn Ammons and Thomas Ball and James R. Larus", title = "Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling", journal = j-SIGPLAN, volume = "32", number = "5", pages = "85--96", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p85-ammons/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @Article{Clinger:1997:GGC, author = "William D. Clinger and Lars T. Hansen", title = "Generational Garbage Collection and the Radioactive Decay Model", journal = j-SIGPLAN, volume = "32", number = "5", pages = "97--108", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p97-clinger/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory; verification", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Probabilistic computation.", } @Article{Poletto:1997:TSF, author = "Massimiliano Poletto and Dawson R. Engler and M. Frans Kaashoek", title = "{\tt tcc}: {A} System for Fast, Flexible, and High-level Dynamic Code Generation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "109--121", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p109-poletto/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; standardization; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{Goodwin:1997:IDA, author = "David W. Goodwin", title = "Interprocedural Dataflow Analysis in an Executable Optimizer", journal = j-SIGPLAN, volume = "32", number = "5", pages = "122--133", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p122-goodwin/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; standardization; theory", subject = "{\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{Ayers:1997:AI, author = "Andrew Ayers and Richard Schooler and Robert Gottlieb", title = "Aggressive Inlining", journal = j-SIGPLAN, volume = "32", number = "5", pages = "134--145", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p134-ayers/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf I.2.8} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods.", } @Article{Bodik:1997:ICB, author = "Rastislav Bod{\'\i}k and Rajiv Gupta and Mary Lou Soffa", title = "Interprocedural Conditional Branch Elimination", journal = j-SIGPLAN, volume = "32", number = "5", pages = "146--158", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p146-bodik/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages.", } @Article{Bodik:1997:PDC, author = "Rastislav Bod{\'\i}k and Rajiv Gupta", title = "Partial Dead Code Elimination using Slicing Transformations", journal = j-SIGPLAN, volume = "32", number = "5", pages = "159--170", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p159-bodik/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; reliability; theory; verification", subject = "{\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf D.2.7} Software, SOFTWARE ENGINEERING, Distribution, Maintenance, and Enhancement, Restructuring, reverse engineering, and reengineering. {\bf D.2.0} Software, SOFTWARE ENGINEERING, General. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation.", } @Article{Hashemi:1997:EPM, author = "Amir H. Hashemi and David R. Kaeli and Brad Calder", title = "Efficient Procedure Mapping Using Cache Line Coloring", journal = j-SIGPLAN, volume = "32", number = "5", pages = "171--182", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p171-hashemi/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; theory", subject = "{\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Young:1997:NIB, author = "Cliff Young and David S. Johnson and David R. Karger and Michael D. Smith", title = "Near-optimal Intraprocedural Branch Alignment", journal = j-SIGPLAN, volume = "32", number = "5", pages = "183--193", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p183-young/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; standardization; theory", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Pipeline processors**. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Young:1997:NOI, author = "Cliff Young and David S. Johnson and Michael D. Smith and David R. Karger", title = "Near-optimal intraprocedural branch alignment", journal = j-SIGPLAN, volume = "32", number = "5", pages = "183--193", month = may, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eichenberger:1997:EFO, author = "Alexandre E. Eichenberger and Edward S. Davidson", title = "Efficient Formulation for Optimal Modulo Schedulers", journal = j-SIGPLAN, volume = "32", number = "5", pages = "194--205", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p194-eichenberger/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Dussart:1997:MPS, author = "Dirk Dussart and Rogardt Heldal and John Hughes", title = "Module-Sensitive Program Specialisation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "206--214", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p206-dussart/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance; theory", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Software libraries. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", } @Article{Dussart:1997:MSP, author = "Dirk Dussart and Rogardt Heldal and John Hughes", title = "Module-sensitive program specialisation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "206--214", month = may, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sperber:1997:TPO, author = "Michael Sperber and Peter Thiemann", title = "Two for the Price of One: Composing Partial Evaluation and Compilation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "215--225", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p215-sperber/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging.", } @Article{Jensen:1997:AVP, author = "Jakob L. Jensen and Michael E. J{\o}rgensen and Michael I. Schwartzbach and Nils Klarlund", title = "Automatic Verification of Pointer Programs using Monadic Second-Order Logic", journal = j-SIGPLAN, volume = "32", number = "5", pages = "226--234", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p226-jensen/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Pascal.", } @Article{Flanagan:1997:CSA, author = "Cormac Flanagan and Matthias Felleisen", title = "Componential Set-Based Analysis", journal = j-SIGPLAN, volume = "32", number = "5", pages = "235--248", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p235-flanagan/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; reliability; standardization; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Decision problems. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Proof theory. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{Flanagan:1997:CSB, author = "Cormac Flanagan and Matthias Felleisen", title = "Componential set-based analysis", journal = j-SIGPLAN, volume = "32", number = "5", pages = "235--248", month = may, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Webber:1997:PAU, author = "Adam Brooks Webber", title = "Program Analysis Using Binary Relations", journal = j-SIGPLAN, volume = "32", number = "5", pages = "249--260", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p249-webber/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.2.0} Software, SOFTWARE ENGINEERING, General. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Heintze:1997:LTS, author = "Nevin Heintze and David McAllester", title = "Linear-Time Subtransitive Control Flow Analysis", journal = j-SIGPLAN, volume = "32", number = "5", pages = "261--272", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p261-heintze/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf D.2.0} Software, SOFTWARE ENGINEERING, General. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Chow:1997:NAP, author = "Fred Chow and Sun Chan and Robert Kennedy and Shin-Ming Liu and Raymond Lo and Peng Tu", title = "A New Algorithm for Partial Redundancy Elimination based on {SSA} Form", journal = j-SIGPLAN, volume = "32", number = "5", pages = "273--286", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p273-chow/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Bergner:1997:SCM, author = "Peter Bergner and Peter Dahl and David Engebretsen and Matthew O'Keefe", title = "Spill Code Minimization via Interference Region Spilling", journal = j-SIGPLAN, volume = "32", number = "5", pages = "287--295", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p287-bergner/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies.", } @Article{Lueh:1997:CCD, author = "Guei-Yuan Lueh and Thomas Gross", title = "Call-cost directed register allocation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "296--307", month = may, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lueh:1997:CDR, author = "Guei-Yuan Lueh and Thomas Gross", title = "Call-cost Directed Register Allocation", journal = j-SIGPLAN, volume = "32", number = "5", pages = "296--307", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p296-lueh/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Lu:1997:RPC, author = "John Lu and Keith D. Cooper", title = "Register Promotion in {C} Programs", journal = j-SIGPLAN, volume = "32", number = "5", pages = "308--319", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p308-lu/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf B.5.0} Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, General. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Taura:1997:FGM, author = "Kenjiro Taura and Akinori Yonezawa", title = "Fine-grain multithreading with minimal compiler support --- a cost effective approach to implementing efficient multithreading languages", journal = j-SIGPLAN, volume = "32", number = "5", pages = "320--333", month = may, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taura:1997:FMM, author = "Kenjiro Taura and Akinori Yonezawa", title = "Fine-grain Multithreading with Minimal Compiler Support --- {A} Cost Effective Approach to Implementing Efficient Multithreading Languages", journal = j-SIGPLAN, volume = "32", number = "5", pages = "320--333", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p320-taura/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; standardization; theory", 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.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", } @Article{Chandra:1997:DDS, author = "Rohit Chandra and Ding-Kai Chen and Robert Cox and Dror E. Maydan and Nenad Nedeljkovic and Jennifer M. Anderson", title = "Data Distribution Support on Distributed Shared Memory Multiprocessors", journal = j-SIGPLAN, volume = "32", number = "5", pages = "334--345", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p334-chandra/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; reliability; theory", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.2.4} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Distributed Systems. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Kodukula:1997:DCM, author = "Induprakas Kodukula and Nawaaz Ahmed and Keshav Pingali", title = "Data-centric multi-level blocking", journal = j-SIGPLAN, volume = "32", number = "5", pages = "346--357", month = may, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kodukula:1997:DMB, author = "Induprakas Kodukula and Nawaaz Ahmed and Keshav Pingali", title = "Data-Centric Multi-Level Blocking", journal = j-SIGPLAN, volume = "32", number = "5", pages = "346--357", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p346-kodukula/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; standardization; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Ernst:1997:CC, author = "Jens Ernst and William Evans and Christopher W. Fraser and Steven Lucco and Todd A. Proebsting", title = "Code Compression", journal = j-SIGPLAN, volume = "32", number = "5", pages = "358--365", month = may, year = "1997", CODEN = "SINODQ", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:32 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/258915/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/258915/p358-ernst/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'97.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", } @Article{Pollock:1997:SDF, author = "Lori Pollock", title = "The {SIG} Discretionary Fund: Role and Process", journal = j-SIGPLAN, volume = "32", number = "6", pages = "1--??", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Sep 3 20:50:04 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1997:CCC, author = "Anonymous", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "32", number = "6", pages = "2--??", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Sep 3 20:50:04 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Selvaraj:1997:IDF, author = "Asokan R. Selvaraj and Debasish Ghosh", title = "Implementation of a Database Factory", journal = j-SIGPLAN, volume = "32", number = "6", pages = "14--18", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1997:FRL, author = "Paul Frenger", title = "{Forth} as a Robotics Language: Part Two", journal = j-SIGPLAN, volume = "32", number = "6", pages = "19--22", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:CCS, author = "Henry G. Baker", title = "{COMFY --- comfortable} set of control primitives for machine language programming", journal = j-SIGPLAN, volume = "32", number = "6", pages = "23--27", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:GIGc, author = "Henry G. Baker", title = "Garbage In\slash Garbage Out: {COMFY} --- {A} Comfortable Set of Control Primitives for Machine Language Programming", journal = j-SIGPLAN, volume = "32", number = "6", pages = "23--??", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Sep 3 20:50:04 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Culwin:1997:JCC, author = "Fintain Culwin", title = "{Java} in the computing curriculum conference", journal = j-SIGPLAN, volume = "32", number = "6", pages = "28--32", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Culwin:1997:RJC, author = "Fintan Culwin", title = "A Report on the {`Java in the Computing Curriculum Conference'} held at {South Bank University, London, on 4th February 1997}", journal = j-SIGPLAN, volume = "32", number = "6", pages = "28--32", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Jul 18 15:04:45 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Carter:1997:CDF, author = "Debbie K. Carter and Albert D. Baker", title = "Considerations in Developing a Formally-Based Visual Programming Language Reference Manual: {A} Case Study on the {SLAM II} Language", journal = j-SIGPLAN, volume = "32", number = "6", pages = "34--39", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vetter:1997:CSA, author = "J. S. Vetter", title = "Computational Steering Annotated Bibliography", journal = j-SIGPLAN, volume = "32", number = "6", pages = "40--44", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kim:1997:FAT, author = "Myung Ho Kim", title = "A Functional Approach to Type Constraints of Generic Definitions", journal = j-SIGPLAN, volume = "32", number = "6", pages = "45--52", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zheng:1997:GMA, author = "Naixiao Zheng and Hongjun Zheng and Zongyan Qiu", title = "{Garment}: a mechanism for abstraction and encapsulation of languages", journal = j-SIGPLAN, volume = "32", number = "6", pages = "53--60", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Naixiao:1997:GMA, author = "Zhang Naixiao and Zheng Honjun and Qiu Zongyan", title = "{Garment}: {A} Mechanism for Abstraction and Encapsulation of Languages", journal = j-SIGPLAN, volume = "32", number = "6", pages = "53--??", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Sep 3 20:50:04 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chen:1997:CVS, author = "Wen-Ke Chen and Jia-Su Sun and Zhi-Min Tang", title = "Consummating Virtuality to Support More Polymorphism in {C++}", journal = j-SIGPLAN, volume = "32", number = "6", pages = "61--68", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frisbie:1997:FPL, author = "Ralph Frisbie and Richard Hendrickson and Michael Metcalf", title = "The {F} Programming Language", journal = j-SIGPLAN, volume = "32", number = "6", pages = "69--74", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zambonelli:1997:HAM, author = "Franco Zambonelli", title = "How to Achieve Modularity in Distributed Object Allocation", journal = j-SIGPLAN, volume = "32", number = "6", pages = "75--82", month = jun, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:34 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Subhlok:1997:NMI, author = "Jaspal Subhlok and Bwolen Yang", title = "A New Model for Integrated Nested Task and Data Parallel Programming", journal = j-SIGPLAN, volume = "32", number = "7", pages = "1--12", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hu:1997:HPF, author = "Y. Charlie Hu and S. Lennart Johnsson and Shang-Hua Teng", title = "{High Performance Fortran} for Highly Irregular Problems", journal = j-SIGPLAN, volume = "32", number = "7", pages = "13--24", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Narlikar:1997:SEI, author = "Girija J. Narlikar and Guy E. Blelloch", title = "Space-efficient implementation of nested parallelism", journal = j-SIGPLAN, volume = "32", number = "7", pages = "25--36", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Narlikar:1997:SIN, author = "Girija J. Narlikar and Guy E. Blelloch", title = "Space-Efficient Implementation of Nested Parallelism", journal = j-SIGPLAN, volume = "32", number = "7", pages = "25--??", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zhang:1997:DPA, author = "Xingbin Zhang and Andrew A. Chien", title = "Dynamic Pointer Alignment: Tiling and Communication Optimizations for Parallel Pointer-based Computations", journal = j-SIGPLAN, volume = "32", number = "7", pages = "37--47", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lu:1997:CSD, author = "Honghui Lu and Alan L. Cox and Sandhya Dwarkadas and Ramakrishnan Rajamony and Willy Zwaenepoel", title = "Compiler and Software Distributed Shared Memory Support for Irregular Applications", journal = j-SIGPLAN, volume = "32", number = "7", pages = "48--56", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fu:1997:STE, author = "Cong Fu and Tao Yang", title = "Space and Time Efficient Execution of Parallel Irregular Computations", journal = j-SIGPLAN, volume = "32", number = "7", pages = "57--68", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bianchini:1997:IPP, author = "Ricardo Bianchini and Enrique V. Carrera and Leonidas Kontothanassis", title = "The Interaction of Parallel Programming Constructs and Coherence Protocols", journal = j-SIGPLAN, volume = "32", number = "7", pages = "69--79", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Raghavachari:1997:ALM, author = "Mukund Raghavachari and Anne Rogers", title = "{Ace}: Linguistic Mechanisms for Customizable Protocols", journal = j-SIGPLAN, volume = "32", number = "7", pages = "80--89", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Amza:1997:TBF, author = "Cristiana Amza and Alan Cox and Karthick Rajamani and Willy Zwaenepoel", title = "Tradeoffs Between False Sharing and Aggregation in Software Distributed Shared Memory", journal = j-SIGPLAN, volume = "32", number = "7", pages = "90--99", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chandra:1997:OCH, author = "Satish Chandra and James R. Larus", title = "Optimizing Communication in {HPF} Programs on Fine-Grain Distributed Shared Memory", journal = j-SIGPLAN, volume = "32", number = "7", pages = "100--111", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rinard:1997:EFG, author = "Martin Rinard", title = "Effective fine-grain synchronization for automatically parallelized programs using optimistic synchronization primitives", journal = j-SIGPLAN, volume = "32", number = "7", pages = "112--123", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rinard:1997:EFS, author = "Martin Rinard", title = "Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives", journal = j-SIGPLAN, volume = "32", number = "7", pages = "112--??", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sodan:1997:ENN, author = "Angela Sodan and Guang R. Gao and Olivier Maquelin and Jens-Uwe Schultz and Xin-Min Tian", title = "Experiences with Non-numeric Applications on Multithreaded Architectures", journal = j-SIGPLAN, volume = "32", number = "7", pages = "124--135", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/multithreading.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sodan:1997:ENA, author = "Angela Sodan and Guang R. Gao and Oliver Maquelin and Jens-Uwe Schultz and Xin-Min Tian", title = "Experiences with Non-numeric Applications on Multithreaded Architectures", journal = j-SIGPLAN, volume = "32", number = "7", pages = "124--??", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hascoet:1997:APC, author = "Laurent Hasco{\"e}t", title = "Automatic Placement of Communications in Mesh-Partitioning Parallelization", journal = j-SIGPLAN, volume = "32", number = "7", pages = "136--144", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yang:1997:PBF, author = "Bwolen Yang and David R. O'Hallaron", title = "Parallel breadth-first {BDD} construction", journal = j-SIGPLAN, volume = "32", number = "7", pages = "145--156", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yang:1997:PBB, author = "Bwolen Yang and David R. O'Hallaron", title = "Parallel Breadth-First {BDD} Construction", journal = j-SIGPLAN, volume = "32", number = "7", pages = "145--??", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gu:1997:EEA, author = "Junjie Gu and Zhiyuan Li and Gyungho Lee", title = "Experience with Efficient Array Data Flow Analysis for Array Privatization", journal = j-SIGPLAN, volume = "32", number = "7", pages = "157--167", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Coelho:1997:CDM, author = "Fabien Coelho", title = "Compiling Dynamic Mappings with Array Copies", journal = j-SIGPLAN, volume = "32", number = "7", pages = "168--179", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Prasanna:1997:CPM, author = "G. N. Srinivasa Prasanna", title = "Compilation of Parallel Multimedia Computations --- Extending Retiming Theory and {Amdahl's Law}", journal = j-SIGPLAN, volume = "32", number = "7", pages = "180--192", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zhou:1997:RCC, author = "Yuanyuan Zhou and Liviu Iftode and Jaswinder Pal Singh and Kai Li and Brian R. Toonen and Ioannis Schoinas and Mark D. Hill and David A. Wood", title = "Relaxed Consistency and Coherence Granularity in {DSM} Systems: {A} Performance Evaluation", journal = j-SIGPLAN, volume = "32", number = "7", pages = "193--205", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frens:1997:ABM, author = "Jeremy D. Frens and David S. Wise", title = "Auto-Blocking Matrix-Multiplication or Tracking {BLAS3} Performance from Source Code", journal = j-SIGPLAN, volume = "32", number = "7", pages = "206--216", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jiang:1997:ARP, author = "Dongming Jiang and Hongzhang Shan and Jaswinder Pal Singh", title = "Application Restructuring and Performance Portability on Shared Virtual Memory and Hardware-Coherent Multiprocessors", journal = j-SIGPLAN, volume = "32", number = "7", pages = "217--229", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lim:1997:PIC, author = "Beng-Hong Lim and Chi-Chao Chang and Grzegorz Czajkowski and Thorsten Von Eicken", title = "Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems", journal = j-SIGPLAN, volume = "32", number = "7", pages = "230--239", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1997:SMP, author = "Zhichen Xu and James R. Larus and Barton P. Miller", title = "Shared-memory performance profiling", journal = j-SIGPLAN, volume = "32", number = "7", pages = "240--251", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1997:SPP, author = "Zhichen Xu and James R. Larus and Barton P. Miller", title = "Shared-Memory Performance Profiling", journal = j-SIGPLAN, volume = "32", number = "7", pages = "240--??", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jiang:1997:IPS, author = "Dongming Jiang and Jaswinder Pal Singh", title = "Improving Parallel Shear-Warp Volume Rendering on Shared Address Space Multiprocessors", journal = j-SIGPLAN, volume = "32", number = "7", pages = "252--263", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taura:1997:EGC, author = "Kenjiro Taura and Akinori Yonezawa", title = "An Effective Garbage Collection Strategy for Parallel Programming Languages on Large Scale Distributed-Memory Machines", journal = j-SIGPLAN, volume = "32", number = "7", pages = "264--275", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frank:1997:LMC, author = "Matthew I. Frank and Anant Agarwal and Mary K. Vernon", title = "{LoPC}: Modeling Contention in Parallel Algorithms", journal = j-SIGPLAN, volume = "32", number = "7", pages = "276--287", month = jul, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:35 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Banerjee:1997:MPT, author = "Anindya Banerjee", title = "A modular, polyvariant and type-based closure analysis", journal = j-SIGPLAN, volume = "32", number = "8", pages = "1--10", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dimock:1997:STF, author = "Allyn Dimock and Robert Muller and Franklyn Turbak and J. B. Wells", title = "Strongly typed flow-directed representation transformations (extended abstract)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "11--24", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bell:1997:TDD, author = "Jeffrey M. Bell and Fran{\c{c}}oise Bellegarde and James Hook", title = "Type-driven defunctionalization", journal = j-SIGPLAN, volume = "32", number = "8", pages = "25--37", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bell:1997:TD, author = "Jeffrey M. Bell and Fran{\c{c}}oise Bellegarde and James Hook", title = "Type-driven defunctionalization", journal = j-SIGPLAN, volume = "32", number = "8", pages = "25--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gasser:1997:SRC, author = "Kirsten L. Solberg Gasser and Flemming Nielson and Hanne Riis Nielson", title = "Systematic realisation of control flow analyses for {CML}", journal = j-SIGPLAN, volume = "32", number = "8", pages = "38--51", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Erwig:1997:FPG, author = "Martin Erwig", title = "Functional programming with graphs", journal = j-SIGPLAN, volume = "32", number = "8", pages = "52--65", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Okasaki:1997:CDE, author = "Chris Okasaki", title = "Catenable double-ended queues", journal = j-SIGPLAN, volume = "32", number = "8", pages = "66--74", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Okasaki:1997:CDQ, author = "Chris Okasaki", title = "Catenable double-ended queues", journal = j-SIGPLAN, volume = "32", number = "8", pages = "66--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fahndrich:1997:SCP, author = "Manuel F{\"a}hndrich and John Boyland", title = "Statically checkable pattern abstractions", journal = j-SIGPLAN, volume = "32", number = "8", pages = "75--84", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shao:1997:FRA, author = "Zhong Shao", title = "Flexible representation analysis", journal = j-SIGPLAN, volume = "32", number = "8", pages = "85--98", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ashley:1997:EFA, author = "J. Michael Ashley", title = "The effectiveness of flow analysis for inlining", journal = j-SIGPLAN, volume = "32", number = "8", pages = "99--111", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Blume:1997:LSH, author = "Matthias Blume and Andrew W. Appel", title = "Lambda-splitting: a higher-order approach to cross-module optimizations", journal = j-SIGPLAN, volume = "32", number = "8", pages = "112--124", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Blume:1997:LHA, author = "Matthias Blume and Andrew W. Appel", title = "Lambda-splitting: {A} higher-order approach to cross-module optimizations", journal = j-SIGPLAN, volume = "32", number = "8", pages = "112--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Crary:1997:FIH, author = "Karl Crary", title = "Foundations for the implementation of higher-order subtyping", journal = j-SIGPLAN, volume = "32", number = "8", pages = "125--135", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marlow:1997:PSS, author = "Simon Marlow and Philip Wadler", title = "A practical subtyping system for {Erlang}", journal = j-SIGPLAN, volume = "32", number = "8", pages = "136--149", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Heintze:1997:CSB, author = "Nevin Heintze and David McAllester", title = "On the complexity of set-based analysis", journal = j-SIGPLAN, volume = "32", number = "8", pages = "150--163", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Heintze:1997:CSA, author = "Nevin Heintze and David McAllester", title = "On the complexity of set-based analysis", journal = j-SIGPLAN, volume = "32", number = "8", pages = "150--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hu:1997:TCE, author = "Zhenjiang Hu and Hideya Iwasaki and Masato Takeichi and Akihiko Takano", title = "Tupling calculation eliminates multiple data traversals", journal = j-SIGPLAN, volume = "32", number = "8", pages = "164--175", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chin:1997:BIM, author = "Wei-Ngan Chin and Masami Hagiya", title = "A bounds inference method for vector-based memoization", journal = j-SIGPLAN, volume = "32", number = "8", pages = "176--187", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lawall:1997:GDO, author = "Julia L. Lawall and Harry G. Mairson", title = "On global dynamics of optimal graph reduction", journal = j-SIGPLAN, volume = "32", number = "8", pages = "188--195", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Armstrong:1997:DE, author = "Joe Armstrong", title = "The development of {Erlang}", journal = j-SIGPLAN, volume = "32", number = "8", pages = "196--203", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dussart:1997:TSI, author = "Dirk Dussart and John Hughes and Peter Thiemann", title = "Type specialisation for imperative languages", journal = j-SIGPLAN, volume = "32", number = "8", pages = "204--216", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kagawa:1997:CRS, author = "Koji Kagawa", title = "Compositional references for stateful functional programming", journal = j-SIGPLAN, volume = "32", number = "8", pages = "217--226", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Launchbury:1997:MSA, author = "John Launchbury and Amr Sabry", title = "Monadic state: Axiomatization and type safety", journal = j-SIGPLAN, volume = "32", number = "8", pages = "227--238", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Draves:1997:IBA, author = "Scott Draves", title = "Implementing bit-addressing with specialization", journal = j-SIGPLAN, volume = "32", number = "8", pages = "239--250", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Draves:1997:IBS, author = "Scott Draves", title = "Implementing bit-addressing with specialization", journal = j-SIGPLAN, volume = "32", number = "8", pages = "239--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Claessen:1997:SGP, author = "Koen Claessen and Ton Vullinghs and Erik Meijer", title = "Structuring graphical paradigms in {TkGofer}", journal = j-SIGPLAN, volume = "32", number = "8", pages = "251--262", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Elliott:1997:FRA, author = "Conal Elliott and Paul Hudak", title = "Functional reactive animation", journal = j-SIGPLAN, volume = "32", number = "8", pages = "263--273", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shivers:1997:AMO, author = "Olin Shivers", title = "Automatic management of operating-system resources", journal = j-SIGPLAN, volume = "32", number = "8", pages = "274--279", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ungureanu:1997:FMD, author = "Cristian Ungureanu and Benjamin Goldberg", title = "Formal models of distributed memory management", journal = j-SIGPLAN, volume = "32", number = "8", pages = "280--291", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hicks:1997:MCC, author = "Michael W. Hicks and Jonathan T. Moore and Scott M. Nettles", title = "The measured cost of copying garbage collection mechanisms", journal = j-SIGPLAN, volume = "32", number = "8", pages = "292--305", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Aerts:1997:GTF, author = "Kris Aerts and Karel De Vlaminck", title = "A {GUI} on top of a functional language (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "308--308", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Claessen:1997:GCP, author = "Koen Claessen", title = "Graphs in compilation (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "309--309", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Claessen:1997:GC, author = "Koen Claessen", title = "Graphs in compilation", journal = j-SIGPLAN, volume = "32", number = "8", pages = "309--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cook:1997:DMF, author = "Byron Cook and John Launchbury", title = "Disposable memo functions (extended abstract)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "310--310", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dornan:1997:ADT, author = "Chris Dornan", title = "Affordable dynamic types (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "311--311", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Duris:1997:FPA, author = "Etienne Duris", title = "Functional programming and attribute grammars deforestation (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "312--312", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Krasnogor:1997:PFM, author = "Natalio Krasnogor and Pablo E. Mart{\'\i}nez L{\'o}pez and Pablo Mocciola and David Pelta", title = "Protein folding meets functional programming (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "313--313", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Krasnogor:1997:MSF, author = "Natalio Krasnogor and Pablo E. Mart{\'\i}nez L{\'o}pez and Pablo Mocciola and David Pelta", title = "Modelling string folding with {G2L} grammars (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "314--314", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lassila:1997:FME, author = "Eero Lassila", title = "A functional macro expansion system for optimizing code generation: gaining context-sensitivity without losing confluence (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "315--315", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McAdam:1997:BMP, author = "Bruce J. McAdam", title = "{BigTypes} in {ML} (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "316--316", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McAdam:1997:BM, author = "Bruce J. McAdam and Stephen Gilmore", title = "{BigTypes} in {ML}", journal = j-SIGPLAN, volume = "32", number = "8", pages = "316--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pareja-Flores:1997:SFT, author = "Crist{\'o}bal Pareja-Flores and J. {\'A}ngel Vel{\'a}zquez-Iturbide", title = "Synthesis of functions by transformations and constraints (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "317--317", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Richard:1997:ISU, author = "G. Richard and F. Saubion and A. Tellez-Arenas", title = "Intensional sets using explicit substitutions (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "318--318", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sabelfeld:1997:SSA, author = "Viktor Sabelfeld and Andrei Sabelfeld", title = "Simple semantic analysis problems for functional programs (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "319--319", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Spiliopoulou:1997:DPP, author = "Eleni Spiliopoulou and Ian Holyer and Neil Davies", title = "Distributed programming, a purely functional approach (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "320--320", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taha:1997:MSPa, author = "Walid Taha and Tim Sheard", title = "Multi-stage programming (poster)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "321--321", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taha:1997:MP, author = "Walid Taha and Tim Sheard", title = "Multi-stage programming", journal = j-SIGPLAN, volume = "32", number = "8", pages = "321--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{deWailly:1997:SFP, author = "Guilhem de Wailly", title = "$\lambda$-flow (poster): a parallel functional synchronous dataflow language", journal = j-SIGPLAN, volume = "32", number = "8", pages = "322--322", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ostvold:1997:ISR, author = "Bjarte M. {\O}stvold", title = "Inductive synthesis of recursive functional programs (poster abstract)", journal = j-SIGPLAN, volume = "32", number = "8", pages = "323--323", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:37 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wailly:1997:LPF, author = "Guilhem De Wailly", title = "{l-flow}: {A} parallel functional synchronous dataflow language", journal = j-SIGPLAN, volume = "32", number = "8", pages = "377--??", month = aug, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Oct 10 17:39:26 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:LFC, author = "Barbara G. Ryder", title = "Letter From the {Former Chair}", journal = j-SIGPLAN, volume = "32", number = "9", pages = "1--1", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 12 16:58:52 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1997:ARA, author = "Barbara G. Ryder", title = "1996--1997 Annual Report on {ACM SIGPLAN}", journal = j-SIGPLAN, volume = "32", number = "9", pages = "2--4", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 12 16:58:52 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1997:CCC, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "32", number = "9", pages = "5--14", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 12 16:58:52 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergin:1997:CCH, author = "Tim Bergin", title = "Conference Corner: {History of Programming Languages Conference II}: {HOPL II} --- Closing Panel: The History of Programming: Does our Present Past Have a Future?", journal = j-SIGPLAN, volume = "32", number = "9", pages = "15--37", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 12 16:58:52 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergin:1997:HIC, author = "Tim Bergin and Michael S. Mahoney", title = "{HOPL II}: closing panel: {The} history of programming (panel): does our present past have a future?", journal = j-SIGPLAN, volume = "32", number = "9", pages = "15--37", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Li:1997:MCC, author = "Wei Li and Gansheng Li", title = "Making {C++} Concurrent and Real-time", journal = j-SIGPLAN, volume = "32", number = "9", pages = "39--46", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See correction \cite{Li:1998:CMC}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mansouri:1997:PAB, author = "F. Z. Mansouri and C. A. Higgins", title = "{Prolog}: An Annotated Bibliography", journal = j-SIGPLAN, volume = "32", number = "9", pages = "47--53", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Casimir:1997:BF, author = "Rommert J. Casimir", title = "{Basic} Forever", journal = j-SIGPLAN, volume = "32", number = "9", pages = "54--56", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lu:1997:MMD, author = "Pei Lu and Dachuan Yu and Jian Lu", title = "A method for modifying dynamically classes in the object-oriented dynamic programming environment", journal = j-SIGPLAN, volume = "32", number = "9", pages = "57--60", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pei:1997:MMD, author = "Lu Pei and Yu Dachuan and Lu Jian", title = "A Method for Modifying Dynamically Classes in the Object-Oriented Dynamic Programming Environment", journal = j-SIGPLAN, volume = "32", number = "9", pages = "57--60", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 12 16:58:52 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jianjua:1997:MCN, author = "Jianjua Zhao and Jiajun Chen and Guoliang Zheng", title = "Message Conversion and a New Type System for {OO} Model", journal = j-SIGPLAN, volume = "32", number = "9", pages = "61--67", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Nov 12 16:58:52 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zhao:1997:MCN, author = "Jianhua Zhao and Jiajun Chen and Guoliang Zheng", title = "Message conversion and a new type system for {OO} model", journal = j-SIGPLAN, volume = "32", number = "9", pages = "61--67", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Qiu:1997:SHN, author = "Zongyan Qiu", title = "Static head nodes in the operation on dynamic structures: a useful programming technique", journal = j-SIGPLAN, volume = "32", number = "9", pages = "68--71", month = sep, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mezini:1997:MCB, author = "Mira Mezini", title = "Maintaining The Consistency and Behavior of Class Libraries During their Evolution", journal = j-SIGPLAN, volume = "32", number = "10", pages = "1--21", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mezini:1997:MCC, author = "Mira Mezini", title = "Maintaining the consistency of class libraries during their evolution", journal = j-SIGPLAN, volume = "32", number = "10", pages = "1--21", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Price:1997:AMR, author = "Margaretha W. Price and Steven A. {Demurjian, Sr.}", title = "Analyzing and Measuring Reusability in Object-Oriented Designs", journal = j-SIGPLAN, volume = "32", number = "10", pages = "22--33", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Weihe:1997:RAS, author = "Karsten Weihe", title = "Reuse of Algorithms: Still a Challenge to Object-Oriented Programming", journal = j-SIGPLAN, volume = "32", number = "10", pages = "34--48", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agesen:1997:ATP, author = "Ole Agesen and Stephen N. Freund and John C. Mitchell", title = "Adding type parameterization to the {Java} language", journal = j-SIGPLAN, volume = "32", number = "10", pages = "49--65", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Boyland:1997:PMI, author = "John Boyland and Giuseppe Castagna", title = "Parasitic Methods: An Implementation of Multi-Methods for {Java}", journal = j-SIGPLAN, volume = "32", number = "10", pages = "66--76", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Litman:1997:MDC, author = "Diane Litman and Peter F. Patel-Schneider and Anil Mishra", title = "Modeling Dynamic Collections of Interdependent Objects Using Path-Based Rules", journal = j-SIGPLAN, volume = "32", number = "10", pages = "77--92", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anderson:1997:LOO, author = "Lougie Anderson and Mike Carey and Ken Jacobs and Erin Kinikin and David Maier", title = "Looking for the objects in object-relational {DBMSs} (panel)", journal = j-SIGPLAN, volume = "32", number = "10", pages = "93--93", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anderson:1997:PLO, author = "Lougie Anderson and Mike Carry and Ken Jacobs and Erin Kinikin and David Maier", title = "Panel 1: Looking for the Objects in Object-Relational {DBMs}", journal = j-SIGPLAN, volume = "32", number = "10", pages = "93--93", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Franklin:1997:FSD, author = "Michael Franklin and Stanley Zdonik", title = "A framework for scalable dissemination-based systems", journal = j-SIGPLAN, volume = "32", number = "10", pages = "94--105", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zdonik:1997:FSD, author = "Stan Zdonik", title = "A Framework for Scalable Dissemination-Based Systems", journal = j-SIGPLAN, volume = "32", number = "10", pages = "94--105", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rao:1997:ELC, author = "Bindu Rama Rao and Chad Edwards and Ted Linden and Regan Moore and Mark Seager", title = "Exploring largeness, complexity and scalability from the {OOT} perspective (panel)", journal = j-SIGPLAN, volume = "32", number = "10", pages = "106--107", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rao:1997:PEL, author = "Bindu Rama Rao and Chad Edwards and Ted Linden and Reagan Moore and Mark Seager", title = "Panel 2: Exploring Largeness, Complexity and Scalability from the {OOT} Perspective", journal = j-SIGPLAN, volume = "32", number = "10", pages = "106--107", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harel:1997:MAO, author = "David Harel", title = "On Modeling and Analyzing Object Behavior", journal = j-SIGPLAN, volume = "32", number = "10", pages = "108--108", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "No paper in volume, but table of contents includes an entry for this invited talk.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grove:1997:CGC, author = "David Grove and Greg DeFouw and Jeffrey Dean and Craig Chambers", title = "Call Graph Construction in Object-Oriented Languages", journal = j-SIGPLAN, volume = "32", number = "10", pages = "108--124", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zendra:1997:EDD, author = "Olivier Zendra and Dominique Colnet and Suzanne Collin", title = "Efficient Dynamic Dispatch without Virtual Function Tables: The Small {Eiffel} Compiler", journal = j-SIGPLAN, volume = "32", number = "10", pages = "125--141", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vitek:1997:ETI, author = "Jan Vitek and R. Nigel Horspool and Andreas Krall", title = "Efficient Type Inclusion Tests", journal = j-SIGPLAN, volume = "32", number = "10", pages = "142--157", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Coplien:1997:CEC, author = "Jim Coplien and Luke Hohmann and Norm Kerth and John Rae-Grant and Eileen Strider", title = "Changing the engine of the car? (panel): while driving 60 miles an hour!", journal = j-SIGPLAN, volume = "32", number = "10", pages = "158--161", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Coplien:1997:PCE, author = "Jim Coplien and Luke Hohmann and Norm Kerth and Jon Rae-Grant and Eileen Strider", title = "Panel 3: Changing the Engine of the Car? While Driving 60 Miles an Hour!", journal = j-SIGPLAN, volume = "32", number = "10", pages = "158--161", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiczales:1997:AOP, author = "Gregor Kiczales", title = "Aspect Oriented Programming", journal = j-SIGPLAN, volume = "32", number = "10", pages = "162--162", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "No paper in volume, but table of contents includes an entry for this invited talk.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tokoro:1997:SAN, author = "Mario Tokoro", title = "Software Agents and Network-Based Software --- New Research Directions", journal = j-SIGPLAN, volume = "32", number = "10", pages = "162--162", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "No paper in volume, but table of contents includes an entry for this invited talk.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hudson:1997:GCW, author = "Richard L. Hudson and Ron Morrison and J. Eliot B. Moss and David S. Munro", title = "Garbage Collecting the World: One Car at a Time", journal = j-SIGPLAN, volume = "32", number = "10", pages = "162--175", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hayes:1997:ENF, author = "Barry Hayes", title = "Ephemerons: {A} New Finalization Mechanism", journal = j-SIGPLAN, volume = "32", number = "10", pages = "176--183", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harrison:1997:DPR, author = "Timothy H. Harrison and David L. Levine and Douglas C. Schmidt", title = "The Design and Performance of a Real-Time {CORBA} Event Service", journal = j-SIGPLAN, volume = "32", number = "10", pages = "184--200", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Coleman:1997:PUL, author = "Derek Coleman and John Artim and Viktor Ohnjec and Erick Rivas and Jim Rumbaugh and Rebecca Wirfs-Brock", title = "Panel 4: {UML}: The Language of Software Blueprints?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "201--205", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Coleman:1997:UPL, author = "Derek Coleman and Viktor Ohnjec and John Artim and Erick Rivas and Jim Rumbaugh and Rebecca Wirfs-Bracle", title = "{UML} (panel): the language of blueprints for software?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "201--205", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eliot:1997:COL, author = "J. Eliot and B. Moss", title = "Compiling Object-Oriented Languages: Achievements and Promise", journal = j-SIGPLAN, volume = "32", number = "10", pages = "206--206", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "No paper in volume, but table of contents includes an entry for this invited talk.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lorenz:1997:TDP, author = "David H. Lorenz", title = "Tiling Design Patterns --- {A} Case Study Using the Interpreter Pattern", journal = j-SIGPLAN, volume = "32", number = "10", pages = "206--206", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "No paper in volume, but table of contents includes an entry for this invited talk.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mendelsohn:1997:CHF, author = "Noah Mendelsohn", title = "Components: How Far Can We Go?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "206--217", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Riehle:1997:CDP, author = "Dirk Riehle", title = "Composite Design Patterns", journal = j-SIGPLAN, volume = "32", number = "10", pages = "218--228", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Haines:1997:OIA, author = "Matthew Haines", title = "An Open Implementation Analysis and Design for Lightweight Threads", journal = j-SIGPLAN, volume = "32", number = "10", pages = "229--242", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Oler:1997:MRD, author = "Jon Oler and Gary Lindstrom and Terence Critchlow", title = "Migrating Relational Data to an {ODBMS}: Strategies and Lessons from a Molecular Biology Experience", journal = j-SIGPLAN, volume = "32", number = "10", pages = "243--252", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Alagic:1997:OOM, author = "Suad Alagic", title = "The {ODMG} Object Model: Does it Make Sense?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "253--270", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tip:1997:CHS, author = "Frank Tip and Peter F. Sweeney", title = "Class Hierarchy Specialization", journal = j-SIGPLAN, volume = "32", number = "10", pages = "271--285", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Volanschi:1997:DSO, author = "Eugen N. Volanschi and Charles Counsel and Gilles Muller and Crispin Cowan", title = "Declarative Specialization of Object-Oriented Programs", journal = j-SIGPLAN, volume = "32", number = "10", pages = "286--300", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hill:1997:OIL, author = "Laura Hill and Bruce Anderson and Adele Goldberg and Gregor Kiczales and Colin Scott and Kevin Tyson", title = "The {OT} idea life-cycle (panel): from eureka! to shrink wrap", journal = j-SIGPLAN, volume = "32", number = "10", pages = "301--303", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hill:1997:POL, author = "Laura Hill and Bruce Anderson and Adele Goldberg and Gregor Kiczales and Colin Scott and Kevin Tyson", title = "Panel 5: The {OT} Life-cycle: From {Eureka}! to Shrink Wrap", journal = j-SIGPLAN, volume = "32", number = "10", pages = "301--303", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lencevicius:1997:QBD, author = "Raimondas Lencevicius and Urs H{\"o}lzle and Ambuj K. Singh", title = "Query-based debugging of object-oriented programs", journal = j-SIGPLAN, volume = "32", number = "10", pages = "304--317", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lencevicius:1997:QDO, author = "Raimondas Lencevicius and Urs Holzle and Ambuj K. Singh", title = "Query-Based Debugging of Object-Oriented Programs", journal = j-SIGPLAN, volume = "32", number = "10", pages = "304--317", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ingalls:1997:BFS, author = "Dan Ingalls and Ted Kaehler and John Maloney and Scott Wallace and Alan Kay", title = "Back to the future: the story of {Squeak}, a practical {Smalltalk} written in itself", journal = j-SIGPLAN, volume = "32", number = "10", pages = "318--326", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kent:1997:CDV, author = "Stuart Kent", title = "Constraint diagrams: visualizing invariants in object-oriented models", journal = j-SIGPLAN, volume = "32", number = "10", pages = "327--341", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1997:BHP, author = "Steven Fraser and Kent Beck and Grady Booch and Jim Coplien and Ralph Johnson and Bill Opdyke", title = "Beyond the hype (panel): do patterns and frameworks reduce discovery costs?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "342--344", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:39 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1997:PBH, author = "Steven D. Fraser and Kent Beck and Grady Booch and Jim Coplien and Ralph Johnson and Bill Opdyke", title = "Panel 6: Beyond the Hype: Do Patterns and Frameworks Reduce Discovery Costs?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "342--344", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1997:AI, author = "Anonymous", title = "Author Index", journal = j-SIGPLAN, volume = "32", number = "10", pages = "345--345", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dodani:1997:PES, author = "Mahesh Dodani", title = "Panel: Educator's Symposium Report", journal = j-SIGPLAN, volume = "32", number = "10", pages = "345--345", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper did not appear in the printed proceedings, but does appear in the table of contents, where is says that the paper will appear in the Addendum.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Felten:1997:SNF, author = "Edward W. Felten", title = "Securing the Networked Future: Can Objects Help?", journal = j-SIGPLAN, volume = "32", number = "10", pages = "345--345", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper did not appear in the printed proceedings, but does appear in the table of contents.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kay:1997:KAC, author = "Alan Kay", title = "Keynote Address: The Computer Revolution Hasn't Happened Yet!", journal = j-SIGPLAN, volume = "32", number = "10", pages = "345--345", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper did not appear in the printed proceedings, but does appear in the table of contents.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kriens:1997:PDR, author = "Peter Kriens", title = "Panel: {DesignFest} Report", journal = j-SIGPLAN, volume = "32", number = "10", pages = "345--345", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper did not appear in the printed proceedings, but does appear in the table of contents, where is says that the paper will appear in the Addendum.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marcus:1997:PMW, author = "Bob Marcus", title = "Panel: Mid-Year Workshops Report", journal = j-SIGPLAN, volume = "32", number = "10", pages = "345--345", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper did not appear in the printed proceedings, but does appear in the table of contents.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1997:TI, author = "Anonymous", title = "Title Index", journal = j-SIGPLAN, volume = "32", number = "10", pages = "346--346", month = oct, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon Dec 29 20:48:04 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1997:LNE, author = "Mary Lou Soffa", title = "Letter From the Newly Elected {Chair}", journal = j-SIGPLAN, volume = "32", number = "11", pages = "1--??", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1997:CP, author = "Anonymous", title = "Calls for Papers", journal = j-SIGPLAN, volume = "32", number = "11", pages = "2--??", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mueller:1997:ASW, author = "Frank Mueller", title = "{The 3rd ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems}", journal = j-SIGPLAN, volume = "32", number = "11", pages = "15--16", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mueller:1997:WRL, author = "Frank Mueller", title = "Workshop Report: {LCTES} '97", journal = j-SIGPLAN, volume = "32", number = "11", pages = "15--??", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Weisert:1997:PEP, author = "Conrad Weisert", title = "Point-extent pattern for dimensioned numeric classes", journal = j-SIGPLAN, volume = "32", number = "11", pages = "17--20", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Weisert:1997:CT, author = "Conrad Weisert", title = "{C++} Toolbox", journal = j-SIGPLAN, volume = "32", number = "11", pages = "17--??", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1997:VFF, author = "Paul Frenger", title = "Venturing {Forth} with a flashlite", journal = j-SIGPLAN, volume = "32", number = "11", pages = "21--24", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1997:FR, author = "Paul Frenger", title = "{Forth} Report", journal = j-SIGPLAN, volume = "32", number = "11", pages = "21--??", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1997:CC, author = "Henry G. Baker", title = "The {COMFY} 6502 Compiler", journal = j-SIGPLAN, volume = "32", number = "11", pages = "25--30", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kruijer:1997:BNS, author = "H. S. M. Kruijer", title = "Book Nook: {The Search for Simplicity Essays in Parallel Programming by Per Brinch Hansen}", journal = j-SIGPLAN, volume = "32", number = "11", pages = "31--32", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1997:RSS, author = "Per Brinch Hansen", title = "Review of The Search for Simplicity Essays in Parallel Programming", journal = j-SIGPLAN, volume = "32", number = "11", pages = "31--??", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pronk:1997:SEM, author = "C. Pronk and R. J. Sutcliffe and M. Sch{\"o}nhacker and A. Wiedemann", title = "Standardized Extensions to {Modula-2}", journal = j-SIGPLAN, volume = "32", number = "11", pages = "34--48", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kanada:1997:WPR, author = "Yasusi Kanada", title = "{Web} Pages that Reproduce Themselves by {JavaScript}", journal = j-SIGPLAN, volume = "32", number = "11", pages = "49--56", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jiazhong:1997:DSS, author = "Zhang Jiazhong and Wang Yanbing and Zheng Mingchun", title = "Design and static semantics of algorithm language $\mathcal{L}$", journal = j-SIGPLAN, volume = "32", number = "11", pages = "57--64", month = nov, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:41 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Heldal:1997:PES, author = "Rogardt Heldal and John Hughes", title = "Partial Evaluation and Separate Compilation", journal = j-SIGPLAN, volume = "32", number = "12", pages = "1--11", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Asai:1997:PEC, author = "Kenichi Asai and Hidehiko Masuhara and Akinori Yonezawa", title = "Partial evaluation of call-by-value $\lambda$-calculus with side-effects", journal = j-SIGPLAN, volume = "32", number = "12", pages = "12--21", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sheard:1997:TDL, author = "Tim Sheard", title = "A type-directed, on-line, partial evaluator for a polymorphic language", journal = j-SIGPLAN, volume = "32", number = "12", pages = "22--35", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sheard:1997:TOP, author = "T. Sheard", title = "A Type-Directed, On-Line, Partial Evaluator for a Polymorphic Language", journal = j-SIGPLAN, volume = "32", number = "12", pages = "22--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gengler:1997:SAP, author = "Marc Gengler and Matthieu Martel", title = "Self-applicable partial evaluation for the pi-calculus", journal = j-SIGPLAN, volume = "32", number = "12", pages = "36--46", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jagannathan:1997:SPE, author = "S. Jagannathan and M. Gengler and M. Martel", title = "Self-Applicable Partial Evaluation for Pi-Calculus", journal = j-SIGPLAN, volume = "32", number = "12", pages = "36--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marinescu:1997:PET, author = "Mihnea Marinescu and Benjamin Goldberg", title = "Partial-evaluation techniques for concurrent programs", journal = j-SIGPLAN, volume = "32", number = "12", pages = "47--62", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marinescu:1997:PTC, author = "M. Marinescu and B. Goldberg", title = "Partial-Evaluation Techniques for Concurrent Programs", journal = j-SIGPLAN, volume = "32", number = "12", pages = "47--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hornof:1997:ABT, author = "Luke Hornof and Jacques Noy{\'e}", title = "Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity", journal = j-SIGPLAN, volume = "32", number = "12", pages = "63--73", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sahlin:1997:ABA, author = "D. Sahlin and L. Hornof and Jacques Noye", title = "Accurate Binding-Time Analysis for Imperative Languages: Flow, Context and Return Sensitivity", journal = j-SIGPLAN, volume = "32", number = "12", pages = "63--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Melski:1997:ISC, author = "David Melski and Thomas Reps", title = "Interconvertibility of Set Constraints and Context-Free Language Reachability", journal = j-SIGPLAN, volume = "32", number = "12", pages = "74--89", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Danvy:1997:LDT, author = "Olivier Danvy and Ulrik P. Schultz", title = "Lambda-dropping: transforming recursive equations into programs with block structure", journal = j-SIGPLAN, volume = "32", number = "12", pages = "90--106", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Danvy:1997:LTR, author = "O. Danvy and U. P. Schultz", title = "Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure", journal = j-SIGPLAN, volume = "32", number = "12", pages = "90--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Beshers:1997:GEV, author = "Clifford Beshers and Steven Feiner", title = "Generating Efficient Virtual Worlds for Visualization Using Partial Evaluation and Dynamic Compilation", journal = j-SIGPLAN, volume = "32", number = "12", pages = "107--115", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Muller:1997:SPE, author = "Gilles Muller and Eugen-Nicolae Volanschi and Renaud Marlet", title = "Scaling up partial evaluation for optimizing the {Sun} commercial {RPC} protocol", journal = j-SIGPLAN, volume = "32", number = "12", pages = "116--126", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Augustsson:1997:PEA, author = "Lennart Augustsson", title = "Partial Evaluation in Aircraft Crew Planning", journal = j-SIGPLAN, volume = "32", number = "12", pages = "127--136", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Etalle:1997:TSC, author = "Sandro Etalle and Maurizio Gabbrielli and Elena Marchiori", title = "A transformation system for {CLP} with dynamic scheduling and {CCP}", journal = j-SIGPLAN, volume = "32", number = "12", pages = "137--150", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Palsberg:1997:TSC, author = "Jens Palsberg and S. Etalle and M. Gabbrielli and E. Marchiori", title = "A Transformation System for {CLP} with Dynamic Scheduling and {CCP}", journal = j-SIGPLAN, volume = "32", number = "12", pages = "137--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Alpuente:1997:SLF, author = "M. Alpuente and M. Falaschi and P. Juli{\'a}n and G. Vidal", title = "Specialization of Lazy Functional Logic Programs", journal = j-SIGPLAN, volume = "32", number = "12", pages = "151--162", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grant:1997:ADR, author = "Brian Grant and Markus Mock and Matthai Philipose and Craig Chambers and Susan J. Eggers", title = "Annotation-directed run-time specialization in {C}", journal = j-SIGPLAN, volume = "32", number = "12", pages = "163--178", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liu:1997:ARS, author = "Yanhong Annie Liu and B. Grant and M. Mock and M. Philipose and C. Chambers and S. Eggers", title = "Annotation-Directed Run-Time Specialization in {C}", journal = j-SIGPLAN, volume = "32", number = "12", pages = "163--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Debray:1997:RBP, author = "Saumya Debray", title = "Resource-bounded partial evaluation", journal = j-SIGPLAN, volume = "32", number = "12", pages = "179--192", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Debray:1997:RPE, author = "S. Debray", title = "Resource-Bounded Partial Evaluation", journal = j-SIGPLAN, volume = "32", number = "12", pages = "179--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nielson:1997:PFM, author = "Flemming Nielson and Hanne Riis Nielson", title = "Prescriptive frameworks for multi-level lambda-calculi", journal = j-SIGPLAN, volume = "32", number = "12", pages = "193--202", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mogensen:1997:PFD, author = "Torben Mogensen and F. Nielson and H. Riis Nielson", title = "A Prescriptive Framework for Designing Multi-Level Lambda-Calculi", journal = j-SIGPLAN, volume = "32", number = "12", pages = "193--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taha:1997:MSPb, author = "Walid Taha and Tim Sheard", title = "Multi-stage programming with explicit annotations", journal = j-SIGPLAN, volume = "32", number = "12", pages = "203--217", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:42 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taha:1997:MPE, author = "W. Taha and T. Sheard", title = "Multi-Stage Programming with Explicit Annotations", journal = j-SIGPLAN, volume = "32", number = "12", pages = "203--??", month = dec, year = "1997", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Henglein:1998:ECN, author = "Fritz Henglein", title = "Executive Committee News", journal = j-SIGPLAN, volume = "33", number = "1", pages = "1--2", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:CCCa, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "33", number = "1", pages = "3--13", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CPL, author = "Anonymous", title = "Call for Papers: {LCR98} --- {Fourth Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers}", journal = j-SIGPLAN, volume = "33", number = "1", pages = "14--14", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{DeBry:1998:ITC, author = "Roger K. DeBry", title = "{IFIP Technical Committee on Software, TC-2}", journal = j-SIGPLAN, volume = "33", number = "1", pages = "15--21", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Feb 20 10:34:09 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gluche:1998:CT, author = "Dieter Gluche and Dietmar K{\"u}hl and Karsten Weihe", title = "{C++} Toolbox", journal = j-SIGPLAN, volume = "33", number = "1", pages = "22--29", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1998:YCLa, author = "Henry G. Baker", title = "You could learn a lot from a quadratic: overloading considered harmful", journal = j-SIGPLAN, volume = "33", number = "1", pages = "30--39", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nedjah:1998:MDL, author = "Nadia Nedjah", title = "Minimal Deterministic Left-to-Right Pattern-Matching Automata", journal = j-SIGPLAN, volume = "33", number = "1", pages = "40--47", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anquetil:1998:EOO, author = "Nicolas Anquetil and Jean Vaucher", title = "Expressing Opposition in the Object Model, First Step towards Negation", journal = j-SIGPLAN, volume = "33", number = "1", pages = "48--55", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McDowell:1998:UJC, author = "C. E. McDowell and E. A. Baldwin", title = "Unloading {Java} Classes That Contain Static Fields", journal = j-SIGPLAN, volume = "33", number = "1", pages = "56--60", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xiaocong:1998:SCL, author = "Fan Xiaocong and Xu Dianxiang and Hou Jianmin and Zheng Guoliang", title = "{SPLAW}: {A} Computable Language for Agent-oriented Programming", journal = j-SIGPLAN, volume = "33", number = "1", pages = "61--69", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:GG, author = "Anonymous", title = "Garbage {In\slash Garbage Out}", journal = j-SIGPLAN, volume = "33", number = "1", pages = "??--??", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:LT, author = "Anonymous", title = "Language tips", journal = j-SIGPLAN, volume = "33", number = "1", pages = "??--??", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:TC, author = "Anonymous", title = "Technical {Correspondence}", journal = j-SIGPLAN, volume = "33", number = "1", pages = "??--??", month = jan, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:43 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kessler:1998:ECN, author = "Robert Kessler", title = "Executive Committee News", journal = j-SIGPLAN, volume = "33", number = "2", pages = "1--1", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:CCCb, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "33", number = "2", pages = "2--13", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CAS, author = "Anonymous", title = "Conference Announcement: {Systems Implementation 2000}", journal = j-SIGPLAN, volume = "33", number = "2", pages = "14--14", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:WRP, author = "Anonymous", title = "Workshop Report: {Parallelism and Implementation Technology for (Constraint) Logic Programming}", journal = j-SIGPLAN, volume = "33", number = "2", pages = "15--17", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pontelli:1998:PIT, author = "Enrico Pontelli", title = "Parallelism and implementation technology for (constraint) logic programming", journal = j-SIGPLAN, volume = "33", number = "2", pages = "15--17", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Everitt:1998:CCO, author = "Cass W. Everitt and John van der Zwaag and Robert J. Moorhead", title = "{COST}: common object support toolkit", journal = j-SIGPLAN, volume = "33", number = "2", pages = "18--24", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Everitt:1998:CTC, author = "Cass W. Everitt and John {van der Zwaag} and Robert J. Moorhead", title = "{C++} Toolbox: {COST: Common Object Support Toolkit}", journal = j-SIGPLAN, volume = "33", number = "2", pages = "18--24", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wadler:1998:AHD, author = "Philip Wadler", title = "An angry half-dozen", journal = j-SIGPLAN, volume = "33", number = "2", pages = "25--30", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wadler:1998:FPA, author = "Philip Wadler", title = "Functional programming: An angry half-dozen", journal = j-SIGPLAN, volume = "33", number = "2", pages = "25--30", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:FR, author = "Paul Frenger", title = "{Forth} Report: Observations on the {EuroForth '97 Conference}", journal = j-SIGPLAN, volume = "33", number = "2", pages = "31--33", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:OEC, author = "Paul Frenger", title = "Observations on the {EuroForth '97} conference", journal = j-SIGPLAN, volume = "33", number = "2", pages = "31--33", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1998:YCLb, author = "Henry G. Baker", title = "You could learn a lot from a quadratic: {II}: {Digital} dentistry", journal = j-SIGPLAN, volume = "33", number = "2", pages = "34--39", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:IAa, author = "Anonymous", title = "Information for Authors", journal = j-SIGPLAN, volume = "33", number = "2", pages = "40--40", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Mar 17 07:33:50 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bielikova:1998:LPP, author = "M{\'a}ria Bielikov{\'a} and Pavol N{\'a}vrat", title = "Learning Programming in {Prolog} Using Schemata", journal = j-SIGPLAN, volume = "33", number = "2", pages = "41--47", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kitchen:1998:FAT, author = "Andrew Kitchen", title = "A Formal Approach to the Teaching of Programming Language Concepts", journal = j-SIGPLAN, volume = "33", number = "2", pages = "48--55", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dotzel:1998:BO, author = "G{\"u}nter Dotzel and Hartmut Goebel", title = "64 Bit {Oberon}", journal = j-SIGPLAN, volume = "33", number = "2", pages = "56--58", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rangarajan:1998:WTC, author = "K. Rangarajan and A. Balasubramaniam", title = "When are Two Classes Equivalent?", journal = j-SIGPLAN, volume = "33", number = "2", pages = "59--64", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1998:CSS, author = "Baowen Xu", title = "Comments On Several Syntax Rules in {Ada95}", journal = j-SIGPLAN, volume = "33", number = "2", pages = "65--67", month = feb, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:44 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lee:1998:ECN, author = "Peter Lee", title = "Executive Committee News: {SIGPLAN} Supports Your Professional Activities", journal = j-SIGPLAN, volume = "33", number = "3", pages = "1--1", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:CC, author = "Seth Bergmann", title = "Conference Corner", journal = j-SIGPLAN, volume = "33", number = "3", pages = "2--13", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CPS, author = "Anonymous", title = "Call for Papers: {SIGADA} '98", journal = j-SIGPLAN, volume = "33", number = "3", pages = "14--14", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CPI, author = "Anonymous", title = "Call for Papers: {ICFP} '98", journal = j-SIGPLAN, volume = "33", number = "3", pages = "15--15", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Salus:1998:HN, author = "Peter H. Salus", title = "Historical Notes: Languages of the {Net}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "16--20", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Salus:1998:LN, author = "Peter H. Salus", title = "Languages of the {Net}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "16--20", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:FRG, author = "Paul Frenger", title = "{Forth} Report: The Growing Machine, a Pre-{Forth} Language Implementation", journal = j-SIGPLAN, volume = "33", number = "3", pages = "21--23", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:GMP, author = "Paul Frenger", title = "The growing machine, a pre-{Forth} language implementation", journal = j-SIGPLAN, volume = "33", number = "3", pages = "21--23", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1998:MMM, author = "Henry G. Baker", title = "{March M{\"o}bius} Madness with a Polynomial {PostScript}, March 32, 1998", journal = j-SIGPLAN, volume = "33", number = "3", pages = "24--35", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1998:ARP, author = "A. Michael Berman", title = "Amendment to Review of {Per Brinch Hansen, {\em The Search for Simplicity --- Essays in Parallel Programming}}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "36--36", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1998:TCIa, author = "A. Michael Berman", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "33", number = "3", pages = "37--37", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Prather:1998:MMP, author = "Ronald E. Prather", title = "A Modular Mathematical Programming Language", journal = j-SIGPLAN, volume = "33", number = "3", pages = "38--56", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1998:EHP, author = "Per Brinch Hansen", title = "An Evaluation of {High Performance Fortran}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "57--64", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "The author strongly criticizes HPF, and remarks ``HPF has severe conceptual and practical limitations.''", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1998:EMP, author = "Per Brinch Hansen", title = "An Evaluation of the {Message-Passing Interface}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "65--72", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "The author criticizes MPI, and remarks ``MPI \ldots{} lack[s] the elegance and security that can only by checked by a parallel programming language.''", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{AzanonEsteire:1998:JST, author = "Oscar {Aza{\~n}{\'o}n Esteire} and Juan Manual {Cueva Lovelle}", title = "{J} --- Set of Tools for Native Code Generation for the {Java Virtual Machine}", journal = j-SIGPLAN, volume = "33", number = "3", pages = "73--79", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } %%% %%% Unchecked: volume 33 number 4 April 1998: (my personal copy never arrived) %%% @Article{Esteire:1998:STN, author = "Oscar Aza{\~n}{\'o}n Esteire and Juan Manuel Cueva Lovelle", title = "Set of tools for native code generation for the {Java} virtual machines", journal = j-SIGPLAN, volume = "33", number = "3", pages = "73--79", month = mar, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:45 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1998:ECN, author = "Ron Cytron", title = "{Executive Committee} News", journal = j-SIGPLAN, volume = "33", number = "4", pages = "1--??", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 1 06:23:08 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:EA, author = "Anonymous", title = "{ECOOP '98} Announcement", journal = j-SIGPLAN, volume = "33", number = "4", pages = "14--??", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 1 06:23:08 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marcus:1998:OMW, author = "Robert Marcus", title = "{OOPSLA} Midyear Workshop", journal = j-SIGPLAN, volume = "33", number = "4", pages = "15--??", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 1 06:23:08 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jaeschke:1998:CPL, author = "Rex Jaeschke", title = "The {C} Programming Language", journal = j-SIGPLAN, volume = "33", number = "4", pages = "16--16", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Appel:1998:SFP, author = "Andrew W. Appel", title = "{SSA} is Functional Programming", journal = j-SIGPLAN, volume = "33", number = "4", pages = "17--20", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:TT, author = "Paul Frenger", title = "The Talking Toaster", journal = j-SIGPLAN, volume = "33", number = "4", pages = "21--25", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Li:1998:CMC, author = "Gansheng Li", title = "Correction to {``Making C++ Concurrent and Real-time''}", journal = j-SIGPLAN, volume = "33", number = "4", pages = "27--27", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Li:1997:MCC}.", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Creak:1998:GTN, author = "G. Alan Creak", title = "Garbage: Two New Structures", journal = j-SIGPLAN, volume = "33", number = "4", pages = "28--29", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1998:SPS, author = "A. Michael Berman", title = "Selected Papers from the {Second United Kingdom: Java in the Computing Curriculum (JICC) Conference}", journal = j-SIGPLAN, volume = "33", number = "4", pages = "30--30", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1998:SSS, author = "A. Michael Berman", title = "Special Section: Selected Papers from the {Second UK Java in the Computing Curriculum Conference}", journal = j-SIGPLAN, volume = "33", number = "4", pages = "30--??", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 1 06:23:08 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Culwin:1998:SSS, author = "Fintan Culwin", title = "Special section: selected papers from the {Java} in the computing curriculum conference", journal = j-SIGPLAN, volume = "33", number = "4", pages = "31--33", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Culwin:1998:EJJ, author = "Fintan Culwin", title = "Editorial --- Justifying {Java}?", journal = j-SIGPLAN, volume = "33", number = "4", pages = "31--??", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 1 06:23:08 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Martin:1998:JGB, author = "Peter Martin", title = "{Java}, the Good, the Bad and the Ugly", journal = j-SIGPLAN, volume = "33", number = "4", pages = "34--39", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gibbons:1998:SPJ, author = "Jeremy Gibbons", title = "Structured Programming in {Java}", journal = j-SIGPLAN, volume = "33", number = "4", pages = "40--43", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cornelius:1998:UCJ, author = "Barry Cornelius", title = "Using {CORBA} and {JDBC} to produce Three-Tier Systems", journal = j-SIGPLAN, volume = "33", number = "4", pages = "44--52", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Burton:1998:KLK, author = "Peter Burton", title = "Kinds of Language, Kinds of Learning", journal = j-SIGPLAN, volume = "33", number = "4", pages = "53--61", month = apr, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:46 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.rowan.edu/sigplan/apr199~1.htm", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bodik:1998:CRR, author = "Rastislav Bod{\'\i}k and Rajiv Gupta and Mary Lou Soffa", title = "Complete removal of redundant expressions", journal = j-SIGPLAN, volume = "33", number = "5", pages = "1--14", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p1-bodik/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.4.9} Software, OPERATING SYSTEMS, Systems Programs and Utilities. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", } @Article{Sastry:1998:NAS, author = "A. V. S. Sastry and Roy D. C. Ju", title = "A New Algorithm for Scalar Register Promotion based on {SSA} Form", journal = j-SIGPLAN, volume = "33", number = "5", pages = "15--25", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p15-sastry/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance", 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.", } @Article{Chow:1998:RPS, author = "Fred Chow and Robert Kennedy and Shin-Ming Liu and Raymond Lo and Peng Tu", title = "Register Promotion by Sparse Partial Redundancy Elimination of Loads and Stores", journal = j-SIGPLAN, volume = "33", number = "5", pages = "26--37", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 01 06:51:33 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.virginia.edu/pldi98/program.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lo:1998:RPS, author = "Raymond Lo and Fred Chow and Robert Kennedy and Shin-Ming Liu and Peng Tu", title = "Register promotion by sparse partial redundancy elimination of loads and stores", journal = j-SIGPLAN, volume = "33", number = "5", pages = "26--37", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p26-lo/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; measurement; performance", 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{Rivera:1998:DTE, author = "Gabriel Rivera and Chau-Wen Tseng", title = "Data Transformations for Eliminating Conflict Misses", journal = j-SIGPLAN, volume = "33", number = "5", pages = "38--49", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p38-rivera/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.1.3} Mathematics of Computing, NUMERICAL ANALYSIS, Numerical Linear Algebra, Linear systems (direct and iterative methods). {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Lewis:1998:IEF, author = "E. Christopher Lewis and Calvin Lin and Lawrence Snyder", title = "The Implementation and Evaluation of Fusion and Contraction in Array Languages", journal = j-SIGPLAN, volume = "33", number = "5", pages = "50--59", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p50-lewis/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent C. {\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.", } @Article{Paek:1998:SAA, author = "Yunheung Paek and Jay Hoeflinger and David Padua", title = "Simplification of Array Access Patterns for Compiler Optimizations", journal = j-SIGPLAN, volume = "33", number = "5", pages = "60--71", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p60-paek/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf E.1} Data, DATA STRUCTURES, Arrays. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Ammons:1998:IDF, author = "Glenn Ammons and James R. Larus", title = "Improving Data-flow Analysis with Path Profiles", journal = j-SIGPLAN, volume = "33", number = "5", pages = "72--84", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p72-ammons/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; 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 F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @Article{Aiken:1998:POC, author = "Alexander Aiken and Manuel Fahndrich and Jeffery S. Foster and Zhendong Su", title = "Partial Online Cycle Elimination in Inclusion Constraint Graphs", journal = j-SIGPLAN, volume = "33", number = "5", pages = "85--96", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jul 01 06:51:33 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.virginia.edu/pldi98/program.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fahndrich:1998:POC, author = "Manuel F{\"a}hndrich and Jeffrey S. Foster and Zhendong Su and Alexander Aiken", title = "Partial online cycle elimination in inclusion constraint graphs", journal = j-SIGPLAN, volume = "33", number = "5", pages = "85--96", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p85-fahndrich/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @Article{Hasti:1998:USS, author = "Rebecca Hasti and Susan Horwitz", title = "Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis", journal = j-SIGPLAN, volume = "33", number = "5", pages = "97--105", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p97-hasti/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\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, Control primitives.", } @Article{Diwan:1998:TBA, author = "Amer Diwan and Kathryn S. McKinley and J. Eliot B. Moss", title = "Type-Based Alias Analysis", journal = j-SIGPLAN, volume = "33", number = "5", pages = "106--117", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p106-diwan/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages", subject = "{\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, Type structure. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Sastry:1998:EIF, author = "S. Subramanya Sastry and Subbarao Palacharla and James E. Smith", title = "Exploiting Idle Floating-Point Resources for Integer Execution", journal = j-SIGPLAN, volume = "33", number = "5", pages = "118--129", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p118-sastry/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf G.1.0} Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic.", } @Article{Yang:1998:IPB, author = "Minghui Yang and Gang-Ryung Uh and David B. Whalley", title = "Improving Performance by Branch Reordering", journal = j-SIGPLAN, volume = "33", number = "5", pages = "130--141", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p130-yang/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; measurement; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", } @Article{Traub:1998:QSL, author = "Omri Traub and Glenn Holloway and Michael D. Smith", title = "Quality and Speed in Linear-scan Register Allocation", journal = j-SIGPLAN, volume = "33", number = "5", pages = "142--151", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p142-traub/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\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, Sequencing and scheduling. {\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{Fessant:1998:ICA, author = "Fabrice Le Fessant and Ian Piumarta and Marc Shapiro", title = "An implementation of complete, asynchronous, distributed garbage collection", journal = j-SIGPLAN, volume = "33", number = "5", pages = "152--161", month = may, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{LeFessant:1998:ICA, author = "Fabrice {Le Fessant} and Ian Piumarta and Marc Shapiro", title = "An implementation of complete, asynchronous, distributed garbage collection", journal = j-SIGPLAN, volume = "33", number = "5", pages = "152--161", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 12:37:28 MDT 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p152-le_fessant/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Memory management (garbage collection). {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming.", } @Article{Cheng:1998:GSC, author = "Perry Cheng and Robert Harper and Peter Lee", title = "Generational Stack Collection and Profile-Driven Pretenuring", journal = j-SIGPLAN, volume = "33", number = "5", pages = "162--173", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p162-cheng/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Memory management (garbage collection). {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Clinger:1998:PTR, author = "William D. Clinger", title = "Proper Tail Recursion and Space Efficiency", journal = j-SIGPLAN, volume = "33", number = "5", pages = "174--185", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p174-clinger/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; standardization", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\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, Control primitives.", } @Article{Adve:1998:UIS, author = "Vikram Adve and John Mellor-Crummey", title = "Using Integer Sets for Data-Parallel Program Analysis and Optimization", journal = j-SIGPLAN, volume = "33", number = "5", pages = "186--198", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p186-adve/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; measurement; performance", subject = "{\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.", } @Article{Zhu:1998:COP, author = "Yingchun Zhu and Laurie J. Hendren", title = "Communication Optimizations for Parallel {C} Programs", journal = j-SIGPLAN, volume = "33", number = "5", pages = "199--211", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p199-zhu/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Parallel C. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures.", } @Article{Frigo:1998:ICM, author = "Matteo Frigo and Charles E. Leiserson and Keith H. Randall", title = "The Implementation of the {Cilk-5} Multithreaded Language", journal = j-SIGPLAN, volume = "33", number = "5", pages = "212--223", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p212-frigo/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; performance", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", } @Article{Wickline:1998:RTC, author = "Philip Wickline and Peter Lee and Frank Pfenning", title = "Run-time code generation and {Modal-ML}", journal = j-SIGPLAN, volume = "33", number = "5", pages = "224--235", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p224-wickline/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Flatt:1998:UCM, author = "Matthew Flatt and Matthias Felleisen", title = "{Units}: cool modules for {HOT} languages", journal = j-SIGPLAN, volume = "33", number = "5", pages = "236--248", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p236-flatt/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\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.", } @Article{Xi:1998:EAB, author = "Hongwei Xi and Frank Pfenning", title = "Eliminating Array Bound Checking Through Dependent Types", journal = j-SIGPLAN, volume = "33", number = "5", pages = "249--257", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p249-xi/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; languages; performance", 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, Standard ML. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @Article{Bacon:1998:TLF, author = "David F. Bacon and Ravi Konuru and Chet Murthy and Mauricio Serrano", title = "Thin Locks: Featherweight Synchronization for {Java}", journal = j-SIGPLAN, volume = "33", number = "5", pages = "258--268", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p258-bacon/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; measurement; performance", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Performance measures. {\bf D.4.0} Software, OPERATING SYSTEMS, General, AIX.", } @Article{Agesen:1998:GCL, author = "Ole Agesen and David Detlefs and J. Eliot B. Moss", title = "Garbage Collection and Local Variable Type-Precision and Liveness in {Java Virtual Machines}", journal = j-SIGPLAN, volume = "33", number = "5", pages = "269--279", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p269-agesen/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "experimentation; measurement; performance; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Memory management (garbage collection). {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @Article{Adl-Tabatabai:1998:FEC, author = "Ali-Reza Adl-Tabatabai and Micha{\l} Cierniak and Guei-Yuan Lueh and Vishesh M. Parikh and James M. Stichnoth", title = "Fast, effective code generation in a just-in-time {Java} compiler", journal = j-SIGPLAN, volume = "33", number = "5", pages = "280--290", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p280-adl-tabatabai/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Piumarta:1998:ODT, author = "Ian Piumarta and Fabio Riccardi", title = "Optimizing Direct-threaded Code by Selective Inlining", journal = j-SIGPLAN, volume = "33", number = "5", pages = "291--300", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p291-piumarta/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; experimentation; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators.", } @Article{Ayers:1998:SCM, author = "Andrew Ayers and Stuart de Jong and John Peyton and Richard Schooler", title = "Scalable Cross-Module Optimization", journal = j-SIGPLAN, volume = "33", number = "5", pages = "301--312", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p301-ayers/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance", subject = "{\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.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @Article{Gay:1998:MME, author = "David Gay and Alex Aiken", title = "Memory Management with Explicit Regions", journal = j-SIGPLAN, volume = "33", number = "5", pages = "313--323", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p313-gay/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Memory management (garbage collection). {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", } @Article{Sweeney:1998:SDD, author = "Peter F. Sweeney and Frank Tip", title = "A Study of Dead Data Members in {C++} Applications", journal = j-SIGPLAN, volume = "33", number = "5", pages = "324--332", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p324-sweeney/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; measurement", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Memory management (garbage collection).", } @Article{Necula:1998:DIC, author = "George C. Necula and Peter Lee", title = "The Design and Implementation of a Certifying Compiler", journal = j-SIGPLAN, volume = "33", number = "5", pages = "333--344", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p333-necula/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; performance; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification.", } @Article{Colby:1998:ACO, author = "Christopher Colby and Patrice Godefroid and Lalita Jategaonkar Jagadeesan", title = "Automatically Closing Open Reactive Programs", journal = j-SIGPLAN, volume = "33", number = "5", pages = "345--357", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:47 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/277650/index.html; http://www.cs.virginia.edu/pldi98/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/277650/p345-colby/", acknowledgement = ack-nhfb, annote = "Published as part of the Proceedings of PLDI'98.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; languages; theory; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Model checking. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", } @Article{Berman:1998:SNW, author = "A. Michael Berman", title = "{SIGPLAN Notices} --- Where We Are, Where We're Going", journal = j-SIGPLAN, volume = "33", number = "6", pages = "1--??", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:C, author = "Anonymous", title = "Calendar", journal = j-SIGPLAN, volume = "33", number = "6", pages = "3--??", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:PCPa, author = "Anonymous", title = "{POPL99} Call for Papers", journal = j-SIGPLAN, volume = "33", number = "6", pages = "15--15", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:04:19 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryder:1998:M, author = "Barbara G. Ryder", title = "{MASPLAS98}", journal = j-SIGPLAN, volume = "33", number = "6", pages = "16--16", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Felleisen:1998:DPO, author = "M. Felleisen and R. B. Findler and M. Flatt and S. Krishnamurthi", title = "The {DrScheme} project: an overview", journal = j-SIGPLAN, volume = "33", number = "6", pages = "17--23", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Felleisen:1998:FPD, author = "M. Felleisen and R. B. Findler and M. Flatt and S. Krishnamurthi", title = "Functional Programming: The {DrScheme Project}: An Overview", journal = j-SIGPLAN, volume = "33", number = "6", pages = "17--??", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:FSN, author = "Paul Frenger", title = "{Forth} in space, or, so {NEAR} yet so far out", journal = j-SIGPLAN, volume = "33", number = "6", pages = "24--26", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:FFS, author = "Paul Frenger", title = "{Forth}: {Forth} in Space, or, So {NEAR} Yet So Far", journal = j-SIGPLAN, volume = "33", number = "6", pages = "24--??", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1998:YCLc, author = "Henry G. Baker", title = "You could learn a lot from a quadratic: {Newton} squares the circle", journal = j-SIGPLAN, volume = "33", number = "6", pages = "27--31", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Baker:1998:GIG, author = "Henry G. Baker", title = "Garbage In\slash Garbage Out: You Could Learn a Lot from a Quadratic: {Newton} Squares the Circle", journal = j-SIGPLAN, volume = "33", number = "6", pages = "27--??", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kokol:1998:FSR, author = "Peter Kokol and Janez Brest", title = "Fractal structure of random programs", journal = j-SIGPLAN, volume = "33", number = "6", pages = "33--38", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kobol:1998:FSR, author = "Peter Kobol and Janez Brest", title = "Fractal Structure of Random Programs", journal = j-SIGPLAN, volume = "33", number = "6", pages = "33--??", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Apr 30 08:30:23 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Aridor:1998:DAL, author = "Yariv Aridor and Shimon Cohen and Amiram Yehudai", title = "Design of an {Actor} language for implicit parallel programming", journal = j-SIGPLAN, volume = "33", number = "6", pages = "39--47", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rangarajan:1998:UCE, author = "K. Rangarajan and P. Eswar", title = "Understanding Class Evolution Through Atomic Changes", journal = j-SIGPLAN, volume = "33", number = "6", pages = "48--60", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{vanBatenburg:1998:AEC, author = "F. H. D. {van Batenburg} and Ellen {de Ridder} and Joseph {de Kerf}", title = "{APL Extended Compared With Other Languages According} to {Halstead}'s {Theory}", journal = j-SIGPLAN, volume = "33", number = "6", pages = "54--54", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ancona:1998:SHS, author = "Massimo Ancona and Walter Cazzola", title = "Static Header as Sentinel", journal = j-SIGPLAN, volume = "33", number = "6", pages = "61--64", month = jun, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:48 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Snelting:1998:CAN, author = "Gregor Snelting", title = "Concept Analysis --- {A} New Framework for Program Understanding (Invited Paper)", journal = j-SIGPLAN, volume = "33", number = "7", pages = "1--10", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Concept analysis transforms any relation between `objects' and `attributes' into a complete lattice. This concept lattice can be studied by algebraic means and offers remarkable insight into properties and structure of the original relation. As relations between `objects' and `attributes' occur all the time in software technology, concept analysis is an attractive foundation for a new class of program analysis tools. The article presents a short overview of the underlying theory, as well as applications for software component retrieval, analysis of configuration spaces, and modularization of legacy code.", acknowledgement = ack-nhfb, affiliation = "Technische Universitaet Braunschweig", affiliationaddress = "Braunschweig, Ger", classification = "721.1; 723; 723.1; 723.5; 921.1", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Boolean algebra; Computation theory; Computer aided software engineering; Computer software selection and evaluation; Galois connection; Legacy code modularization; Legacy systems; Mathematical operators", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Zhang:1998:ECA, author = "Sean Zhang and Barbara G. Ryder and William A. Landi", title = "Experiments with Combined Analysis for Pointer Aliasing", journal = j-SIGPLAN, volume = "33", number = "7", pages = "11--18", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "We present initial empirical experiments with combined analysis, a scalable analysis technique that uses a program decomposition to apply different aliasing algorithms to independent program segments. The effectiveness of the solution strategy is validated through application to side-effect and reference analysis of C programs.", acknowledgement = ack-nhfb, affiliation = "Rutgers Univ", affiliationaddress = "Piscataway, NJ, USA", classification = "723; 723.1; 723.1.1; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Algorithms; C (programming language); Combined analysis; Computer aided software engineering; Computer software selection and evaluation; Pointer aliasing", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Tice:1998:ONA, author = "Caroline Tice and Susan L. Graham", title = "{OPTVIEW}: {A} new approach for examining optimized code", journal = j-SIGPLAN, volume = "33", number = "7", pages = "19--26", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The task of mapping between source programs and machine code, once the code has been optimized and transformed by a compiler is often difficult. Yet there are many instances, such as debugging optimized code or attributing performance analysis data to source lines, when it is useful or necessary to understand at the source level what is occurring in the binary. The standard approach has been for tools to attempt to map directly from the optimized binary to the original source. Such mappings are often fragile, and sometimes inaccurate or misleading. We suggest an alternative approach. Rather than mapping directly between the original source and the binary, we create a modified version of the source program, still recognizable, but updated to reflect some of the effects of optimizations, thus facilitating mapping from the binary. We have implemented a tool, Optview, to demonstrate and test these ideas.", acknowledgement = ack-nhfb, affiliation = "Univ of California", affiliationaddress = "Berkeley, CA, USA", classification = "723; 723.1; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Binary codes; Computer aided software engineering; Computer software selection and evaluation; Program compilers; Program debugging; Software package optview", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Dor:1998:DME, author = "Nurit Dor and Michael Rodeh and Mooly Sagiv", title = "Detecting Memory Errors via Static Pointer Analysis (Preliminary experience)", journal = j-SIGPLAN, volume = "33", number = "7", pages = "27--34", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Programs which manipulate pointers are hard to debug. Pointer analysis algorithms (originally aimed at optimizing compilers) may provide some remedy by identifying potential errors such as dereferencing NULL pointers by statically analyzing the behavior of programs on all their input data. Our goal is to identify the `core program analysis techniques' that can be used when developing realistic tools which detect memory errors at compile time without generating too many false alarms. Our preliminary experience indicates that the following techniques are necessary: (i) finding aliases between pointers, (ii) flow sensitive techniques that account for the program control flow constructs, (iii) partial interpretation of conditional statements, (iv) analysis of the relationships between pointers, and sometimes (v) analysis of the underlying data structures manipulated by the C program. We show that a combination of these techniques can yield better results than those achieved by state of the art tools. Yet it is not clear to us whether our ideas are applicable to large programs.", acknowledgement = ack-nhfb, affiliation = "Tel-Aviv Univ", affiliationaddress = "Tel-Aviv, Isr", classification = "723; 723.1; 723.1.1; 723.2; 723.5; 922.2", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Algorithms; C (programming language); Computer aided software engineering; Computer software selection and evaluation; Core program analysis; Data flow analysis; Data storage equipment; Data structures; Program compilers; Program debugging; Static pointer analysis; Statistical methods", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Krinke:1998:SST, author = "Jens Krinke", title = "Static Slicing of Threaded Programs", journal = j-SIGPLAN, volume = "33", number = "7", pages = "35--42", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing method for threaded programs which handles interference correctly. We present such a method which also calculates more precise static slices. This paper extends the well known structures of the control flow graph and the program dependence graph for threaded programs with interference. This new technique does not require serialization of threaded programs.", acknowledgement = ack-nhfb, affiliation = "Technische Universitaet Braunschweig", affiliationaddress = "Braunschweig, Ger", classification = "723; 723.1; 723.2; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Computer aided software engineering; Computer software selection and evaluation; Control flow graphs; Data flow analysis; Data structures; Program debugging; Static program slicing; Threaded programs", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Chase:1998:RSA, author = "Melissa P. Chase and Steven M. Christey and David R. Harris and Alexander S. Yeh", title = "Recovering Software Architecture from Multiple Source Code Analyses", journal = j-SIGPLAN, volume = "33", number = "7", pages = "43--50", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "We describe the experiences we have had in using ManSART-a software architecture recovery tool that we developed and are employing in the analysis of large scale legacy software systems. ManSART uses a battery of standard data flow, control flow, and program slicing capabilities to automatically recover architectural features from source code. This source code analysis is enabled by representations called analysis modules. Analysis modules describe the interfaces of each component in a multiple component system. ManSART uses these modules to focus source code analysis and to store the results.", acknowledgement = ack-nhfb, affiliation = "MITRE Corp", affiliationaddress = "Bedford, MA, USA", classification = "722.1; 722.2; 723; 723.1; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Computer aided software engineering; Computer architecture; Computer software selection and evaluation; Data flow analysis; Data storage equipment; Interfaces (computer); Large scale systems; Legacy systems; Multiple source code analysis; Program slicing; Software package mansart", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Naumovich:1998:ECD, author = "Gleb Naumovich and Lori A. Clarke and Leon J. Osterweil", title = "Efficient Composite Data Flow Analysis Applied to Concurrent Programs", journal = j-SIGPLAN, volume = "33", number = "7", pages = "51--58", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "FLAVERS, a tool for verifying properties of concurrent systems, uses composite data flow analysis to incrementally improve the precision of the results of its verifications. Although FLAVERS is one of the few static analysis techniques for concurrent systems that has the potential to handle large scale systems, it sometimes can still be very expensive to use. In this paper we experimentally compare the cost of two versions of this approach for solving composite data flow analysis problems. The first version, product-based, uses the more straightforward approach, and the second, tuple-based, is built around the idea of reducing analysis space requirements at the expense of analysis time. We demonstrate experimentally, by analyzing properties of actual concurrent programs, that the tuple-based version is comparable in time to the product-based version but for large composite data flow problems it requires several orders of magnitude less space.", acknowledgement = ack-nhfb, affiliation = "Univ of Massachusetts", affiliationaddress = "Amherst, MA, USA", classification = "723; 723.1; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Computer aided software engineering; Computer software selection and evaluation; Concurrent programs; Data flow analysis; Large scale systems; Software package flavers; Static analysis", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Reiss:1998:SVD, author = "Steven P. Reiss", title = "Software Visualization in the Desert Environment", journal = j-SIGPLAN, volume = "33", number = "7", pages = "59--66", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "While software visualization has been widely used for navigation, its use for understanding has been much more limited. Software visualizations are expensive to develop, require large amounts of information that is often difficult to collect, and even then, are good only at addressing the specific task for which they were developed. Our work on software visualization in the Desert environment is aimed at making software visualization a viable approach to understanding. We do this by providing ready access to a variety of information about the system at hand, a range of high-quality, high-density visualizations, and a simple interface that lets the programmer rapidly create new software visualizations for understanding problems as they arise. In this paper we describe the approach we have taken.", acknowledgement = ack-nhfb, affiliation = "Brown Univ", affiliationaddress = "Providence, RI, USA", classification = "722.2; 723; 723.1; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Computer aided software engineering; Computer software selection and evaluation; Desert environment; Interfaces (computer); Software visualization; Visualization", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Jeffery:1998:LAP, author = "Clinton Jeffery and Wenyi Zhou and Kevin Templer and Michael Brazell", title = "A Lightweight Architecture for Program Execution Monitoring", journal = j-SIGPLAN, volume = "33", number = "7", pages = "67--74", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "The Alamo monitor architecture significantly reduces the development cost of writing program execution monitors such as special-purpose profilers, bug-detectors, and visualizations. The design has been realized by monitor frameworks for two very different programming language implementations. Monitor performance under Alamo is quite attractive when the available static and dynamic means of reducing the number of reported events are employed. However, Alamo architecture has no support for real-time or shared-memory multiprocessor-based parallel applications.", acknowledgement = ack-nhfb, affiliation = "Univ of Texas at San Antonio", affiliationaddress = "San Antonio, TX, USA", classification = "723; 723.1; 723.1.1; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Alamo monitor architecture; C (programming language); Computer aided software engineering; Computer architecture; Computer software selection and evaluation; Program profiling; unix", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Waddell:1998:VPH, author = "Oscar Waddell and J. Michael Ashley", title = "Visualizing the Performance of Higher-Order Programs", journal = j-SIGPLAN, volume = "33", number = "7", pages = "75--82", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "Program transformations such as macro-expansion and procedure inlining can obscure the relationship between the source and object code. Higher-order programs also have complex control flow. To address these problems, a profiler and interactive profile visualizer have been used and integrated into an optimizing Scheme compiler. The profiler maintains correlation with the original source despite compiler optimizations that can eliminate, duplicate, or move code. The visualizer operates as a source-code browser with features to examine execution counts and execution times from several perspectives. It supports the programmer in identifying program hot spots, as well as code regions responsible for or affected by those hot spots.", acknowledgement = ack-nhfb, affiliation = "Indiana Univ", affiliationaddress = "IN, USA", classification = "722.4; 723; 723.1; 723.2; 723.5", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Codes (symbols); Computer aided software engineering; Computer software selection and evaluation; Data flow analysis; Interactive computer systems; Program compilers; Program profiling; Scheme compiler; Visualization", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Harrold:1998:EIP, author = "Mary Jean Harrold and Gregg Rothermel and Rui Wu and Liu Yi", title = "An Empirical Investigation of Program Spectra", journal = j-SIGPLAN, volume = "33", number = "7", pages = "83--90", month = jul, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:49 MST 2003", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", abstract = "A variety of expensive software maintenance and testing tasks require a comparison of the behaviors of program versions. Program spectra have recently been proposed as a heuristic for use in performing such comparisons. To assess the potential usefulness of spectra in this context, we conducted an experiment that examined the relationship between program spectra and program behavior, and empirically compared several types of spectra. This paper reports the results of that experiment.", acknowledgement = ack-nhfb, affiliation = "Ohio State Univ", affiliationaddress = "OH, USA", classification = "723; 723.1; 723.5; 921", conference = "Proceedings of the 1998 ACM SIGPLAN\slash SIGSOFT Workshop on Program Analysis for Software Tools and Engineering", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", journalabr = "ACM SIGPLAN SIGSOFT Workshop Program Anal Software Tools Eng", keywords = "Computer aided software engineering; Computer software maintenance; Computer software selection and evaluation; Heuristic methods; Program spectra", meetingaddress = "Montreal, Can", meetingdate = "Jun 16 1998", meetingdate2 = "06/16/98", sponsor = "ACM", } @Article{Zorn:1998:IO, author = "Benjamin Zorn", title = "An Invitation to {OOPSLA '98}", journal = j-SIGPLAN, volume = "33", number = "8", pages = "1--2", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 11 08:45:37 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:CCCc, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "33", number = "8", pages = "3--12", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 11 08:45:37 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:PPC, author = "Anonymous", title = "{PLDI '99} Preliminary Call for Papers", journal = j-SIGPLAN, volume = "33", number = "8", pages = "13--13", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 11 08:45:37 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:FCP, author = "Seth Bergmann", title = "{FOOL 6} Call for Papers", journal = j-SIGPLAN, volume = "33", number = "8", pages = "14--15", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 11 08:45:37 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pontelli:1998:PSI, author = "Enrico Pontelli", title = "Programming with \{SETS\} --- An International Forum of Discussion", journal = j-SIGPLAN, volume = "33", number = "8", pages = "16--16", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 11 08:45:37 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McNamee:1998:DTM, author = "Paul McNamee and Marty Hall", title = "Developing a Tool for memoizing Functions in {C++}", journal = j-SIGPLAN, volume = "33", number = "8", pages = "17--22", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wadler:1998:WNO, author = "Philip Wadler", title = "Why No One Uses Functional Languages", journal = j-SIGPLAN, volume = "33", number = "8", pages = "23--27", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:TFF, author = "Paul Frenger", title = "A Tribute to {FIG-Forth}", journal = j-SIGPLAN, volume = "33", number = "8", pages = "28--31", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1998:LE, author = "Per Brinch Hansen", title = "Letter to the Editor", journal = j-SIGPLAN, volume = "33", number = "8", pages = "32--33", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Sep 11 08:45:37 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Offner:1998:PBH, author = "Carl D. Offner", title = "{Per Brinch Hansen}'s Concerns about {High Performance Fortran}", journal = j-SIGPLAN, volume = "33", number = "8", pages = "34--39", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schilling:1998:OCE, author = "Jonathan L. Schilling", title = "Optimizing away {C++} exception handling", journal = j-SIGPLAN, volume = "33", number = "8", pages = "40--47", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ledru:1998:JIL, author = "Pascal Ledru", title = "{JSpace}: implementation of a {Linda} System in {Java}", journal = j-SIGPLAN, volume = "33", number = "8", pages = "48--50", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ledru:1998:TSJ, author = "Pascal Ledru", title = "A Traveling Salesman in {Java}", journal = j-SIGPLAN, volume = "33", number = "8", pages = "51--56", month = aug, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:50 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1998:SA, author = "Mary Lou Soffa", title = "1998 {SIGPLAN} awards", journal = j-SIGPLAN, volume = "33", number = "9", pages = "1--3", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:CCCd, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "33", number = "9", pages = "4--15", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:PCPb, author = "Anonymous", title = "{PLDI '99} Call for Papers", journal = j-SIGPLAN, volume = "33", number = "9", pages = "16--16", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:IAb, author = "Anonymous", title = "{ISMM '98} Announcement", journal = j-SIGPLAN, volume = "33", number = "9", pages = "17--17", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Scherlis:1998:EST, author = "William L. Scherlis and Neil D. Jones", title = "The {European} Scene: Two Clusters of Programming Languages Conferences", journal = j-SIGPLAN, volume = "33", number = "9", pages = "18--19", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Scherlis:1998:TCP, author = "William L. Scherlis", title = "Two clusters of programming language conferences", journal = j-SIGPLAN, volume = "33", number = "9", pages = "18--19", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:FMA, author = "Paul Frenger", title = "{Forth}: {MUCKing} Around With {Forth}", journal = j-SIGPLAN, volume = "33", number = "9", pages = "20--24", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:MAF, author = "Paul Frenger", title = "{MUCKing} around with {Forth}", journal = j-SIGPLAN, volume = "33", number = "9", pages = "20--24", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1998:TCIb, author = "A. Michael Berman", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "33", number = "9", pages = "25--25", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Adams:1998:RRA, author = "N. I. {Adams IV} and D. H. Bartley and G. Brooks and R. K. Dybvig and D. P. Friedman and R. Halstead and C. Hanson and C. T. Haynes and E. Kohlbecker and D. Oxley and K. M. Pitman and G. J. Rozas and G. L. {Steele, Jr.} and G. J. Sussman and M. Wand and H. Abelson", title = "Revised5 Report on the Algorithmic Language {Scheme}", journal = j-SIGPLAN, volume = "33", number = "9", pages = "26--76", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kelsey:1998:RRA, author = "Richard Kelsey and William Clinger and Jonathan Rees", title = "Revised$^5$ Report on the Algorithmic Language {Scheme}", journal = j-SIGPLAN, volume = "33", number = "9", pages = "26--76", month = sep, year = "1998", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/382130.382133", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 15 17:01:28 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "With H. Abelson, N. I. {Adams, IV}, D. H. Bartley, G. Brooks, R. K. Dybvig, D. P. Friedman, R. Halstead, C. Hanson, C. T. Haynes, E. Kohlbecker, D. Oxley, K. M. Pitman, G. J. Rozas, G. L. {Steele, Jr.}, G. J. Sussman, and M. Wand.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bantchev:1998:PMM, author = "Boyko B. Bantchev", title = "Putting More Meaning in Expressions", journal = j-SIGPLAN, volume = "33", number = "9", pages = "77--83", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McDowell:1998:RGJ, author = "C. E. McDowell", title = "Reducing garbage in {Java}", journal = j-SIGPLAN, volume = "33", number = "9", pages = "84--86", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Johnstone:1998:RIB, author = "Adrian Johnstone and Elizabeth Scott", title = "{\tt rdp} --- an iterator-based recursive descent parser generator with tree promotion operators", journal = j-SIGPLAN, volume = "33", number = "9", pages = "87--94", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yang:1998:EBC, author = "Fuqing Yang and Hong Mei and Wanghong Yuan and Qiong Wu and Yao Guo", title = "Experiences in Building {C++} Front End", journal = j-SIGPLAN, volume = "33", number = "9", pages = "95--102", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vogt:1998:FPP, author = "Christopher J. Vogt", title = "Floating Point Performance of {Common Lisp}", journal = j-SIGPLAN, volume = "33", number = "9", pages = "103--107", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Atkinson-Abutridy:1998:DIG, author = "John A. Atkinson-Abutridy and Anita A. Ferreira-Cabrera", title = "The design and implementation of the {GILENA} natural language interfaces specification system", journal = j-SIGPLAN, volume = "33", number = "9", pages = "108--117", month = sep, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:51 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dolby:1998:EAO, author = "Julian Dolby and Andrew A. Chien", title = "An Evaluation of Automatic Object Inline Allocation Techniques", journal = j-SIGPLAN, volume = "33", number = "10", pages = "1--20", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Czajkowski:1998:JRA, author = "Grzegorz Czajkowski and Thorsten von Eicken", title = "{JRes}: {A} Resource Accounting Interface for {Java}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "21--35", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liang:1998:DCL, author = "Sheng Liang and Gilad Bracha", title = "Dynamic Class Loading in the {Java Virtual Machine}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "36--44", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Artim:1998:OOP, author = "John Artim and Charlie Bridgeford and Lillian Christman and James Coplien and Mary Beth Rosson and Stanley Taylor and Rebecca Wirfs-Brock", title = "Object-oriented practice in 1998 (panel): does it help or hinder collaboration?", journal = j-SIGPLAN, volume = "33", number = "10", pages = "45--47", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Artim:1998:POP, author = "John Artim and Charlie Bridgeford and Lilian Christman and James Coplien and Mary Beth Rosson and Stanley Taylor and Rebecca Wirfs-Brock", title = "Panel 1: Object-Oriented practice in 1998: Does it help or hinder collaboration?", journal = j-SIGPLAN, volume = "33", number = "10", pages = "45--47", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clarke:1998:OTF, author = "David G. Clarke and John M. Potter and James Noble", title = "Ownership Types for Flexible Alias Protection", journal = j-SIGPLAN, volume = "33", number = "10", pages = "48--64", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Simons:1998:BCS, author = "Anthony J. H. Simons", title = "Borrow, copy or steal?: loans and larceny in the orthodox canonical form", journal = j-SIGPLAN, volume = "33", number = "10", pages = "65--83", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bouraqadi-Saadani:1998:SMP, author = "Noury M. N. Bouraqadi-Sa{\^a}dani and Thomas Ledoux and Fred Rivard", title = "Safe Metaclass Programming", journal = j-SIGPLAN, volume = "33", number = "10", pages = "84--96", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mezini:1998:APC, author = "Mira Mezini and Karl Lieberherr", title = "Adaptive Plug-and-Play Components for Evolutionary Software Development", journal = j-SIGPLAN, volume = "33", number = "10", pages = "97--116", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mezini:1998:APP, author = "Mira Mezini and Karl Lieberherr", title = "Adaptive plug-and-play components for evolutionary software development", journal = j-SIGPLAN, volume = "33", number = "10", pages = "97--116", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Riehle:1998:RMB, author = "Dirk Riehle and Thomas Gross", title = "Role Model Based Framework Design and Integration", journal = j-SIGPLAN, volume = "33", number = "10", pages = "117--133", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agerbo:1998:HPB, author = "Ellen Agerbo and Aino Cornils", title = "How to Preserve the Benefits of Design Patterns", journal = j-SIGPLAN, volume = "33", number = "10", pages = "134--143", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Leino:1998:DGS, author = "K. Rustan M. Leino", title = "Data Groups: Specifying the Modification of Extended State", journal = j-SIGPLAN, volume = "33", number = "10", pages = "144--153", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rossie:1998:LOE, author = "Jonathan G. {Rossie, Jr.}", title = "Logical Observable Entities", journal = j-SIGPLAN, volume = "33", number = "10", pages = "154--165", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gianantonio:1998:LCO, author = "Pietro Di Gianantonio and Furio Honsell and Luigi Liquori", title = "A Lambda Calculus of Objects with Self-Inflicted Extension", journal = j-SIGPLAN, volume = "33", number = "10", pages = "166--178", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bak:1998:NCJ, author = "Lars Bak and John Duimovich and Jesse Fang and Scott Meyer and David Ungar", title = "The new crop of {Java} virtual machines (panel)", journal = j-SIGPLAN, volume = "33", number = "10", pages = "179--182", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ungar:1998:PNC, author = "David Ungar and Lars Bak and Jesse Fang and John Duimovich and Scott Meyer", title = "Panel 2: The New Crop of {Java Virtual Machines}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "179--182", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bracha:1998:MFS, author = "Gilad Bracha and Martin Odersky and David Stoutamire and Philip Wadler", title = "Making the Future Safe for the Past: Adding Genericity to the {Java} Programming Language", journal = j-SIGPLAN, volume = "33", number = "10", pages = "183--200", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cartwright:1998:CGR, author = "Robert Cartwright and Guy L. {Steele, Jr.}", title = "Compatible Genericity with Run-time Types for the {Java} Programming Language", journal = j-SIGPLAN, volume = "33", number = "10", pages = "201--215", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Solorzano:1998:PPJ, author = "Jose H. Solorzano and Suad Alagi{\'c}", title = "Parametric Polymorphism for {Java}: {A} Reflective Solution", journal = j-SIGPLAN, volume = "33", number = "10", pages = "216--225", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cockburn:1998:QTA, author = "Alistair Cockburn and Martin Fowler", title = "Question time! about use cases", journal = j-SIGPLAN, volume = "33", number = "10", pages = "226--229", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fowler:1998:PQT, author = "Martin Fowler and Ivar Jacobson and Bruce Anderson and Alistair Cockburn and Ian Graham", title = "Panel 3: Question Time! About Use Cases", journal = j-SIGPLAN, volume = "33", number = "10", pages = "226--229", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McAuliffe:1998:VFF, author = "Mark L. McAuliffe and Michael J. Carey and Marvin H. Solomon", title = "{Vclusters}: {A} Flexible, Fine-Grained Object Clustering Mechanism", journal = j-SIGPLAN, volume = "33", number = "10", pages = "230--243", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Guerraoui:1998:SSO, author = "Rachid Guerraoui and Pascal Felber and Beno{\^\i}t Garbinato and Karim Mazouni", title = "System Support for Object Groups", journal = j-SIGPLAN, volume = "33", number = "10", pages = "244--258", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bertino:1998:EOO, author = "Elisa Bertino and Giovanna Guerrini", title = "Extending the {ODMG} Object Model with Composite Objects", journal = j-SIGPLAN, volume = "33", number = "10", pages = "259--270", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Walker:1998:VDS, author = "Robert J. Walker and Gail C. Murphy and Bjorn Freeman-Benson and Darin Wright and Darin Swanson and Jeremy Isaak", title = "Visualizing Dynamic Software System Information through High-level Models", journal = j-SIGPLAN, volume = "33", number = "10", pages = "271--283", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Olken:1998:OLL, author = "Frank Olken and Hans-Arno Jacobsen and Chuck McParland and Mary Ann Piette and Mary F. Anderson", title = "Object Lessons Learned from a Distributed System for Remote Building Monitoring and Operation", journal = j-SIGPLAN, volume = "33", number = "10", pages = "284--295", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harris:1998:LOO, author = "Jacob Harris and Vivek Sarkar", title = "Lightweight object-oriented shared variables for distributed applications on the {Internet}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "296--309", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harris:1998:LOS, author = "Jacob Harris and Vivek Sarkar", title = "Lightweight Object-Oriented Shared Variables for Distributed Applications on the {Internet}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "296--309", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Freund:1998:TSO, author = "Stephen N. Freund and John C. Mitchell", title = "A Type System for Object Initialization in the {Java} Bytecode Language", journal = j-SIGPLAN, volume = "33", number = "10", pages = "310--328", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jacobs:1998:RAJ, author = "Bart Jacobs and Joachim van den Berg and Marieke Huisman and Martijn van Berkum and Ulrich Hensel and Hendrik Tews", title = "Reasoning about {Java} classes: preliminary report", journal = j-SIGPLAN, volume = "33", number = "10", pages = "329--340", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Drossopoulou:1998:WJB, author = "Sophia Drossopoulou and David Wragg and Susan Eisenbach", title = "What is {Java} Binary Compatibility?", journal = j-SIGPLAN, volume = "33", number = "10", pages = "341--358", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cleal:1998:PPM, author = "David Cleal and Luke Hohmann and Chet Hendrickson and Allen B. Davis and John Nolan", title = "Panel 4: The Project Management Game", journal = j-SIGPLAN, volume = "33", number = "10", pages = "359--361", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Buchi:1998:CTJ, author = "Martin B{\"u}chi and Wolfgang Weck", title = "Compound Types for {Java}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "362--373", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Leavens:1998:MDD, author = "Gary T. Leavens and Todd D. Millstein", title = "Multiple dispatch as dispatch on {Tuples}", journal = j-SIGPLAN, volume = "33", number = "10", pages = "374--387", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Litvinov:1998:CBP, author = "Vassily Litvinov", title = "Contraint-based polymorphism in {Cecil}: towards a practical and static type system", journal = j-SIGPLAN, volume = "33", number = "10", pages = "388--411", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Litvinov:1998:CPC, author = "Vassily Litvinov", title = "Constraint-Based Polymorphism in {Cecil}: Towards a Practical and Static Type System", journal = j-SIGPLAN, volume = "33", number = "10", pages = "388--411", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lea:1998:BDS, author = "Doug Lea and David Forslund and Tom Barry and Don Vines and Rajendra Raj and Ashutosh Tiwary", title = "Building distributed systems (panel)", journal = j-SIGPLAN, volume = "33", number = "10", pages = "412--416", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lea:1998:PBD, author = "Doug Lea and Tom Barry and Don Vines and David W. Forslund and Rajendra Raj and Ashutosh Tiwary", title = "Panel 5: Building Distributed Systems", journal = j-SIGPLAN, volume = "33", number = "10", pages = "412--416", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1998:PSR, author = "Steven Fraser and Maggie Davis and Martin Griss and Luke Hohmann and Ian Hopper and Rebecca Joos and Bill Opdyke", title = "Panel 6: Software Reuse: {Nemesis} or {Nirvana}?", journal = j-SIGPLAN, volume = "33", number = "10", pages = "417--420", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1998:SRP, author = "Steven Fraser and Maggie Davis and Martin Griss and Luke Hohmann and Ian Hopper and Rebecca Joos and Bill Opdyke", title = "Software reuse (panel): nemesis or nirvana?", journal = j-SIGPLAN, volume = "33", number = "10", pages = "417--420", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:52 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:AI, author = "Anonymous", title = "Author Index", journal = j-SIGPLAN, volume = "33", number = "10", pages = "421--421", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:TI, author = "Anonymous", title = "Title Index", journal = j-SIGPLAN, volume = "33", number = "10", pages = "422--422", month = oct, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Nov 5 06:59:51 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cooper:1998:CCM, author = "Keith D. Cooper and Timothy J. Harvey", title = "Compiler-Controlled Memory", journal = j-SIGPLAN, volume = "33", number = "11", pages = "2--11", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p2-cooper/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @Article{Seidl:1998:SHO, author = "Matthew L. Seidl and Benjamin G. Zorn", title = "Segregating Heap Objects by Reference Behavior and Lifetime", journal = j-SIGPLAN, volume = "33", number = "11", pages = "12--23", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p12-seidl/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf E.1} Data, DATA STRUCTURES. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization.", } @Article{Strout:1998:SIS, author = "Michelle Mills Strout and Larry Carter and Jeanne Ferrante and Beth Simon", title = "Schedule-Independent Storage Mapping for Loops", journal = j-SIGPLAN, volume = "33", number = "11", pages = "24--33", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p24-strout/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; measurement; performance; theory", subject = "{\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, Sequencing and scheduling. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Sodani:1998:EAI, author = "Avinash Sodani and Gurindar S. Sohi", title = "An Empirical Analysis of Instruction Repetition", journal = j-SIGPLAN, volume = "33", number = "11", pages = "35--45", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p35-sodani/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance; standardization; theory", subject = "{\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", } @Article{Lee:1998:STS, author = "Walter Lee and Rajeev Barua and Matthew Frank and Devabhaktuni Srikrishna and Jonathan Babb and Vivek Sarkar and Saman Amarasinghe", title = "Space-Time Scheduling of Instruction-Level Parallelism on a Raw Machine", journal = j-SIGPLAN, volume = "33", number = "11", pages = "46--57", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p46-lee/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory", subject = "{\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\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.", } @Article{Hammond:1998:DSS, author = "Lance Hammond and Mark Willey and Kunle Olukotun", title = "Data Speculation Support for a Chip Multiprocessor", journal = j-SIGPLAN, volume = "33", number = "11", pages = "58--69", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p58-hammond/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; standardization; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{VanMeter:1998:VNV, author = "Rodney {Van Meter} and Gregory G. Finn and Steve Hotz", title = "{VISA}: {Netstation}'s {Virtual Internet SCSI Adapter}", journal = j-SIGPLAN, volume = "33", number = "11", pages = "71--80", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p71-van_meter/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; standardization; theory", subject = "{\bf C.2.5} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area Networks, Internet. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management.", } @Article{Acharya:1998:ADP, author = "Anurag Acharya and Mustafa Uysal and Joel Saltz", title = "Active Disks: Programming Model, Algorithms and Evaluation", journal = j-SIGPLAN, volume = "33", number = "11", pages = "81--91", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p81-acharya/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; measurement; performance; theory", subject = "{\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General. {\bf D.4.0} Software, OPERATING SYSTEMS, General.", } @Article{Gibson:1998:CEH, author = "Garth A. Gibson and David F. Nagle and Khalil Amiri and Jeff Butler and Fay W. Chang and Howard Gobioff and Charles Hardin and Erik Riedel and David Rochberg and Jim Zelenka", title = "A cost-effective, high-bandwidth storage architecture", journal = j-SIGPLAN, volume = "33", number = "11", pages = "92--103", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p92-gibson/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; theory", subject = "{\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf C.2.5} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area Networks. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Distributed systems. {\bf B.4.0} Hardware, INPUT/OUTPUT AND DATA COMMUNICATIONS, General.", } @Article{Machanick:1998:HST, author = "Philip Machanick and Pierre Salverda and Lance Pompe", title = "Hardware-Software Trade-Offs in a Direct {Rambus} Implementation of the {RAMpage} Memory Hierarchy", journal = j-SIGPLAN, volume = "33", number = "11", pages = "105--114", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p105-machanick/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles. {\bf B.7.1} Hardware, INTEGRATED CIRCUITS, Types and Design Styles. {\bf C.0} Computer Systems Organization, GENERAL. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Roth:1998:DBP, author = "Amir Roth and Andreas Moshovos and Gurindar S. Sohi", title = "Dependence Based Prefetching for Linked Data Structures", journal = j-SIGPLAN, volume = "33", number = "11", pages = "115--126", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p115-roth/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance; theory", subject = "{\bf E.1} Data, DATA STRUCTURES. {\bf B.7.0} Hardware, INTEGRATED CIRCUITS, General. {\bf B.8.0} Hardware, PERFORMANCE AND RELIABILITY, General.", } @Article{Weissman:1998:PCS, author = "Boris Weissman", title = "Performance Counters and State Sharing Annotations: a Unified Approach to Thread Locality", journal = j-SIGPLAN, volume = "33", number = "11", pages = "127--138", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p127-weissman/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance; theory", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Simulation. {\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS, Markov processes.", } @Article{Calder:1998:CCD, author = "Brad Calder and Chandra Krintz and Simmi John and Todd Austin", title = "Cache-Conscious Data Placement", journal = j-SIGPLAN, volume = "33", number = "11", pages = "139--149", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p139-calder/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Le:1998:OET, author = "Bich C. Le", title = "An Out-of-Order Execution Technique for Runtime Binary Translators", journal = j-SIGPLAN, volume = "33", number = "11", pages = "151--158", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p151-le/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Error handling and recovery.", } @Article{Krintz:1998:OET, author = "Chandra Krintz and Brad Calder and Han Bok Lee and Benjamin G. Zorn", title = "Overlapping execution with transfer using non-strict execution for mobile programs", journal = j-SIGPLAN, volume = "33", number = "11", pages = "159--169", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p159-krintz/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; standardization; theory; verification", subject = "{\bf C.1.4} Computer Systems Organization, PROCESSOR ARCHITECTURES, Parallel Architectures, Mobile processors. {\bf C.2.5} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Local and Wide-Area Networks, Internet. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{Stark:1998:VLP, author = "Jared Stark and Marius Evers and Yale N. Patt", title = "Variable Length Path Branch Prediction", journal = j-SIGPLAN, volume = "33", number = "11", pages = "170--179", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p170-stark/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; measurement; performance; standardization; theory", subject = "{\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Pipeline processors**. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Verghese:1998:PIS, author = "Ben Verghese and Anoop Gupta and Mendel Rosenblum", title = "Performance Isolation: Sharing and Isolation in Shared-Memory Multiprocessors", journal = j-SIGPLAN, volume = "33", number = "11", pages = "181--192", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p181-verghese/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors). {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.0} Software, OPERATING SYSTEMS, General.", } @Article{Chen:1998:UMA, author = "Yuqun Chen and Angelos Bilas and Stefanos N. Damianakis and Cezary Dubnicki and Kai Li", title = "{UTLB}: {A} Mechanism for Address Translation on Network Interfaces", journal = j-SIGPLAN, volume = "33", number = "11", pages = "193--204", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p193-chen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; theory", subject = "{\bf C.2.0} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf H.5.2} Information Systems, INFORMATION INTERFACES AND PRESENTATION, User Interfaces.", } @Article{Pai:1998:LAR, author = "Vivek S. Pai and Mohit Aron and Gaurav Banga and Michael Svendsen and Peter Druschel and Willy Zwaenepoel and Erich Nahum", title = "Locality-Aware Request Distribution in Cluster-based Network Servers", journal = j-SIGPLAN, volume = "33", number = "11", pages = "205--216", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p205-pai/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; performance; standardization; theory", subject = "{\bf C.5.5} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Servers. {\bf C.2.0} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.2} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Protocols.", } @Article{Temam:1998:IOL, author = "Olivier Temam", title = "Investigating Optimal Local Memory Performance", journal = j-SIGPLAN, volume = "33", number = "11", pages = "218--227", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p218-temam/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; measurement; performance; standardization; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf B.8.0} Hardware, PERFORMANCE AND RELIABILITY, General.", } @Article{Ghosh:1998:PMA, author = "Somnath Ghosh and Margaret Martonosi and Sharad Malik", title = "Precise Miss Analysis for Program Transformations with Caches of Arbitrary Associativity", journal = j-SIGPLAN, volume = "33", number = "11", pages = "228--239", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p228-ghosh/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; measurement; performance; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf B.8.0} Hardware, PERFORMANCE AND RELIABILITY, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Peir:1998:CDM, author = "Jih-Kwon Peir and Yongjoon Lee and Windsor W. Hsu", title = "Capturing Dynamic Memory Reference Behavior with Adaptive Cache Topology", journal = j-SIGPLAN, volume = "33", number = "11", pages = "240--250", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p240-peir/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf B.8.0} Hardware, PERFORMANCE AND RELIABILITY, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @Article{Citron:1998:AMM, author = "Daniel Citron and Dror Feitelson and Larry Rudolph", title = "Accelerating Multi-Media processing by Implementing Memoing in Multiplication and Division Units", journal = j-SIGPLAN, volume = "33", number = "11", pages = "252--261", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p252-citron/", acknowledgement = ack-nhfb, annote = "This paper shows how memoing of multiply and divide units in a 32-entry four-way set associative memo cache can produces cache hit ratios of 0.11 for floating-point multiply, and 0.16 for floating-point divide on the Perfect benchmarks. For SPEC95, the corresponding results are 0.20 and 0.17. For a multimedia benchmark, the figures are 0.39 and 0.47, and for integer multiply 0.59. Current architectures require 2 to 5 cycles for pipelined floating-point multiply (one result per clock, in the best case), but 22 to 40 cycles for floating-point division (not pipelined). Such a cache would require about 1KB of on-chip memory, which is currently feasible, since several architectures offer on-chip caches of up to 64KB, and could offer significant speedups for division.", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; theory", subject = "{\bf H.5.1} Information Systems, INFORMATION INTERFACES AND PRESENTATION, Multimedia Information Systems. {\bf H.5.2} Information Systems, INFORMATION INTERFACES AND PRESENTATION, User Interfaces. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories.", } @Article{Fu:1998:VSS, author = "Chao-Ying Fu and Matthew D. Jennings and Sergei Y. Larin and Thomas M. Conte", title = "Value Speculation Scheduling for High Performance Processors", journal = j-SIGPLAN, volume = "33", number = "11", pages = "262--271", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p262-fu/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; measurement; performance; standardization; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf B.5.1} Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Ranganathan:1998:ESD, author = "Narayan Ranganathan and Manoj Franklin", title = "An Empirical Study of Decentralized {ILP} Execution Models", journal = j-SIGPLAN, volume = "33", number = "11", pages = "272--281", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p272-ranganathan/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; measurement; performance; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Scheduling. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Schnarr:1998:FOP, author = "Eric Schnarr and James R. Larus", title = "Fast Out-Of-Order Processor Simulation Using Memoization", journal = j-SIGPLAN, volume = "33", number = "11", pages = "283--294", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p283-schnarr/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; measurement; performance; standardization; theory", subject = "{\bf C.1.0} Computer Systems Organization, PROCESSOR ARCHITECTURES, General. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{Jacob:1998:LSM, author = "Bruce L. Jacob and Trevor N. Mudge", title = "{A} Look at Several Memory Management Units, {TLB}-Refill Mechanisms, and Page Table Organizations", journal = j-SIGPLAN, volume = "33", number = "11", pages = "295--306", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p295-jacob/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Virtual memory. {\bf C.4} Computer Systems Organization, PERFORMANCE OF SYSTEMS.", } @Article{Ranganathan:1998:PDW, author = "Parthasarathy Ranganathan and Kourosh Gharachorloo and Sarita V. Adve and Luiz Andr{\'e} Barroso", title = "Performance of Database Workloads on Shared-Memory Systems with Out-of-Order Processors", journal = j-SIGPLAN, volume = "33", number = "11", pages = "307--318", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:54 MST 2003", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/asplos/291069/p307-ranganathan/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; management; measurement; performance; theory", subject = "{\bf H.2.0} Information Systems, DATABASE MANAGEMENT, General. {\bf H.4.2} Information Systems, INFORMATION SYSTEMS APPLICATIONS, Types of Systems, Decision support. {\bf H.2.4} Information Systems, DATABASE MANAGEMENT, Systems, Transaction processing. {\bf H.3.5} Information Systems, INFORMATION STORAGE AND RETRIEVAL, Online Information Services. {\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Shared memory. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization.", } @Article{Anonymous:1998:AVR, author = "Anonymous", title = "{ASPLOS-VIII} Reviewers", journal = j-SIGPLAN, volume = "33", number = "11", pages = "v--vi", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 18 17:37:55 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CC, author = "Anonymous", title = "Conference Committee", journal = j-SIGPLAN, volume = "33", number = "11", pages = "iv--iv", month = nov, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Dec 18 17:37:55 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Soffa:1998:SSJ, author = "Mary Lou Soffa and David Notkin", title = "{SIGPLAN} and {SIGSOFT} Joint Efforts", journal = j-SIGPLAN, volume = "33", number = "12", pages = "1--1", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1998:CCCe, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "33", number = "12", pages = "2--13", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CPAa, author = "Anonymous", title = "Call for Papers: {ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE '99)}", journal = j-SIGPLAN, volume = "33", number = "12", pages = "14--15", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1998:CPAb, author = "Anonymous", title = "Call for Papers: {1999 ACM International Conference on Supercomputing}", journal = j-SIGPLAN, volume = "33", number = "12", pages = "15--15", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benson:1998:EYO, author = "Brent W. {Benson, Jr.}", title = "Eat your own dog food", journal = j-SIGPLAN, volume = "33", number = "12", pages = "16--18", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benson:1998:JRR, author = "Brent W. {Benson, Jr.}", title = "{Java} Reflections: Reflection: Eat your own dog food", journal = j-SIGPLAN, volume = "33", number = "12", pages = "16--19", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1998:OTD, author = "Chris Clark", title = "Overlapping token definitions", journal = j-SIGPLAN, volume = "33", number = "12", pages = "20--24", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1998:PPP, author = "Chris Clark", title = "Practical Parsing Patterns: Overlapping Token Definitions", journal = j-SIGPLAN, volume = "33", number = "12", pages = "20--24", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:FRM, author = "Paul Frenger", title = "{Forth} Report: {Mind.Forth}: Thoughts on Artificial Intelligence and {Forth}", journal = j-SIGPLAN, volume = "33", number = "12", pages = "25--31", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1998:MFT, author = "Paul Frenger", title = "{Mind.Forth}: thoughts on artificial intelligence and {Forth}", journal = j-SIGPLAN, volume = "33", number = "12", pages = "25--31", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1998:TCIc, author = "A. Michale Berman", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "33", number = "12", pages = "32--32", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sakharov:1998:TCP, author = "Alex Sakharov", title = "Technical Correspondence: Processing Recursive Data Types in {Java}", journal = j-SIGPLAN, volume = "33", number = "12", pages = "33--33", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Jan 14 15:02:28 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Svensson:1998:IBG, author = "Kurt Svensson", title = "Index in {BNF} Grammars", journal = j-SIGPLAN, volume = "33", number = "12", pages = "34--34", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 20 08:54:23 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Paleri:1998:SAP, author = "Vineeth Kumar Paleri and Y. N. Srikant and Priti Shankar", title = "A Simple Algorithm for Partial Redundancy Elimination", journal = j-SIGPLAN, volume = "33", number = "12", pages = "35--43", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Curcio:1998:ASA, author = "Igor D. D. Curcio", title = "{ASAP} --- {A} Simple Assertion Pre-processor", journal = j-SIGPLAN, volume = "33", number = "12", pages = "44--51", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See correction \cite{Curcio:1999:CCI}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hatzigeorgiu:1998:LPS, author = "Nick Hatzigeorgiu and Apostolos Syropoulos", title = "Literate programming and the ``{Spaniel}'' method", journal = j-SIGPLAN, volume = "33", number = "12", pages = "52--56", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See comments \cite{Bigot:1999:LEC,Syropoulos:1999:LER}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hericko:1998:JDO, author = "Marjan Hericko and Matjaz B. Juric and Ales Zivkovic and Ivan Rozman and Tomaz Domajnko and Marjan Krisper", title = "{Java} and Distributed Object Models: An Analysis", journal = j-SIGPLAN, volume = "33", number = "12", pages = "57--65", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Budd:1998:FPF, author = "Timothy A. Budd", title = "Functional Programming and the Fragile Base Class Problem", journal = j-SIGPLAN, volume = "33", number = "12", pages = "66--71", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Malik:1998:EHL, author = "Masud Ahmad Malik", title = "Evolution of the High Level Programming Languages: {A} Critical Perspective", journal = j-SIGPLAN, volume = "33", number = "12", pages = "72--80", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper was plagiarized from a published book; see editorial apology in \cite{Berman:1999:LEM}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Havener:1998:EQL, author = "Charles D. Havener", title = "{EQL} --- The Query Language You Never Heard Of", journal = j-SIGPLAN, volume = "33", number = "12", pages = "81--88", month = dec, year = "1998", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:55 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Minamide:1999:RCT, author = "Yasuhiko Minamide and Jacques Garrigue", title = "On the Runtime Complexity of Type-Directed Unboxing", journal = j-SIGPLAN, volume = "34", number = "1", pages = "1--12", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Kyoto University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Visser:1999:BPO, author = "Eelco Visser and Zine-el-Abidine Benaissa and Andrew Tolmach", title = "Building Program Optimizers with Rewriting Strategies", journal = j-SIGPLAN, volume = "34", number = "1", pages = "13--26", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Pacific Software Research Center", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hannan:1999:HOA, author = "John Hannan and Patrick Hicks", title = "Higher-Order Arity Raising", journal = j-SIGPLAN, volume = "34", number = "1", pages = "27--38", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Pennsylvania State University; St. Vincent Archabbey", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gustavsson:1999:TBS, author = "J{\"o}rgen Gustavsson", title = "A Type Based Sharing Analysis for Update Avoidance and Optimisation", journal = j-SIGPLAN, volume = "34", number = "1", pages = "39--50", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Chalmers University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kieburtz:1999:TEM, author = "Richard B. Kieburtz", title = "Taming Effects with Monadic Typing", journal = j-SIGPLAN, volume = "34", number = "1", pages = "51--62", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Oregon Graduate Institute", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wadler:1999:MEM, author = "Philip Wadler", title = "The marriage of effects and monads", journal = j-SIGPLAN, volume = "34", number = "1", pages = "63--74", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Bell Laboratories", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taylor:1999:TCF, author = "Colin J. Taylor", title = "A Theory of Core Fudgets", journal = j-SIGPLAN, volume = "34", number = "1", pages = "75--85", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of Nottingham", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hicks:1999:PPL, author = "Michael Hicks and Pankaj Kakkar and Jonathan T. Moore and Carl A. Gunter and Scott Nettles", title = "{PLAN}: a packet language for active networks", journal = j-SIGPLAN, volume = "34", number = "1", pages = "86--93", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of Pennsylvania", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Findler:1999:MOO, author = "Robert Bruce Findler and Matthew Flatt", title = "Modular Object-Oriented Programming with Units and Mixins", journal = j-SIGPLAN, volume = "34", number = "1", pages = "94--104", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Rice University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Odersky:1999:PVF, author = "Martin Odersky", title = "Programming with Variable Functions", journal = j-SIGPLAN, volume = "34", number = "1", pages = "105--116", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of South Australia", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mackie:1999:YYA, author = "Ian Mackie", title = "{YALE}: {Yet Another Lambda Evaluator} Based on Interaction Nets", journal = j-SIGPLAN, volume = "34", number = "1", pages = "117--128", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "{\'E}cole Polytechnique", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benton:1999:CSM, author = "Nick Benton and Andrew Kennedy and George Russell", title = "Compiling {Standard ML} to {Java} Bytecodes", journal = j-SIGPLAN, volume = "34", number = "1", pages = "129--140", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Persimmon IT", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shao:1999:TCM, author = "Zhong Shao", title = "Typed Cross-Module Compilation", journal = j-SIGPLAN, volume = "34", number = "1", pages = "141--152", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Yale University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Finne:1999:HDB, author = "Sigbjorn Finne and Daan Leijen and Erik Meijer and Simon Peyton Jones", title = "{H/Direct}: {A} Binary Foreign Language Interface for {Haskell}", journal = j-SIGPLAN, volume = "34", number = "1", pages = "153--162", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of Glasgow; University of Utrecht; University of Utrecht; University of Glasgow", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mountjoy:1999:STG, author = "Jon Mountjoy", title = "The Spineless Tagless {G}-machine, naturally", journal = j-SIGPLAN, volume = "34", number = "1", pages = "163--173", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of Amsterdam", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bjesse:1999:LHD, author = "Per Bjesse and Koen Claessen and Mary Sheeran and Satnam Singh", title = "{Lava}: Hardware Design in {Haskell}", journal = j-SIGPLAN, volume = "34", number = "1", pages = "174--184", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Chalmers University; Xilinx", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Edalat:1999:LCE, author = "Abbas Edalat and Peter John Potts and Philipp S{\"u}nderhauf", title = "Lazy Computation with Exact Real Numbers", journal = j-SIGPLAN, volume = "34", number = "1", pages = "185--194", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Imperial College", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Karczmarczuk:1999:FDC, author = "Jerzy Karczmarczuk", title = "Functional Differentiation of Computer Programs", journal = j-SIGPLAN, volume = "34", number = "1", pages = "195--203", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Universit{\'e} de Caen", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Moreau:1999:DGC, author = "Luc Moreau", title = "A Distributed Garbage Collector with Diffusion Tree Reorganisation and Mobile Objects", journal = j-SIGPLAN, volume = "34", number = "1", pages = "204--215", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of Southampton", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nordlander:1999:PSP, author = "Johan Nordlander", title = "Pragmatic Subtyping in Polymorphic Languages", journal = j-SIGPLAN, volume = "34", number = "1", pages = "216--227", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Chalmers University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pottier:1999:FTI, author = "Fran{\c{c}}ois Pottier", title = "A Framework for Type Inference with Subtyping", journal = j-SIGPLAN, volume = "34", number = "1", pages = "228--238", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "INRIA-Rocquencourt", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Augustsson:1999:CLD, author = "Lennart Augustsson", title = "{Cayenne} --- a Language with Dependent Types", journal = j-SIGPLAN, volume = "34", number = "1", pages = "239--250", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Chalmers University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sobel:1999:RC, author = "Jonathan Sobel and Daniel P. Friedman", title = "Recycling Continuations", journal = j-SIGPLAN, volume = "34", number = "1", pages = "251--260", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Indiana University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Scholz:1999:ISM, author = "Enno Scholz", title = "Imperative Streams --- {A} Monadic Combinator Library for Synchronous Programming", journal = j-SIGPLAN, volume = "34", number = "1", pages = "261--272", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Daimler-Benz", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gibbons:1999:UAU, author = "Jeremy Gibbons and Geraint Jones", title = "The Under-Appreciated Unfold", journal = j-SIGPLAN, volume = "34", number = "1", pages = "273--279", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Oxford Brookes University; University of Oxford", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hutton:1999:FUP, author = "Graham Hutton", title = "Fold and Unfold for Program Semantics", journal = j-SIGPLAN, volume = "34", number = "1", pages = "280--288", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "University of Nottingham", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yang:1999:ETM, author = "Zhe Yang", title = "Encoding Types in {ML}-like Languages", journal = j-SIGPLAN, volume = "34", number = "1", pages = "289--300", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "New York University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Crary:1999:IPT, author = "Karl Crary and Stephanie Weirich and Greg Morrisett", title = "Intensional Polymorphism in Type-Erasure Semantics", journal = j-SIGPLAN, volume = "34", number = "1", pages = "301--312", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Cornell University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shao:1999:ITI, author = "Zhong Shao and Christopher League and Stefan Monnier", title = "Implementing Typed Intermediate Languages", journal = j-SIGPLAN, volume = "34", number = "1", pages = "313--323", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Yale University", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kutzner:1999:NDC, author = "Arne Kutzner and Manfred Schmidt-Schau{\ss}", title = "A Non-Deterministic Call-by-Need Lambda Calculus", journal = j-SIGPLAN, volume = "34", number = "1", pages = "324--335", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "http://www.cs.rice.edu/~matthias/ICFP98/schedule.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiselyov:1999:LLB, author = "Oleg Kiselyov", title = "{LAND*}: an {AND} with local bindings, a {\em guarded\/} {LET*} special form", journal = j-SIGPLAN, volume = "34", number = "1", pages = "336--336", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiselyov:1999:FSC, author = "Oleg Kiselyov", title = "Functional style in {C++}: closures, late binding, and {Lambda} abstractions", journal = j-SIGPLAN, volume = "34", number = "1", pages = "337--337", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McAdam:1999:TEC, author = "Bruce J. McAdam", title = "Type errors confuse the programmer (poster abstract)", journal = j-SIGPLAN, volume = "34", number = "1", pages = "338--338", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ennals:1999:CTN, author = "Robert Ennals", title = "Controlled Temporal Non-Determinism for Reasoning with a Machine of Finite Speed", journal = j-SIGPLAN, volume = "34", number = "1", pages = "339--339", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ennals:1999:VT, author = "Robert Ennals", title = "Verbose Typing", journal = j-SIGPLAN, volume = "34", number = "1", pages = "340--340", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Putnik:1999:ASS, author = "Zoran Putnik", title = "On Application of Self-Similar Pictures in Education", journal = j-SIGPLAN, volume = "34", number = "1", pages = "341--341", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Russell:1999:MFA, author = "Dan Russell", title = "{MAP}: {A} Functional Analysis and Design Method", journal = j-SIGPLAN, volume = "34", number = "1", pages = "342--342", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiselyov:1999:DLR, author = "Oleg Kiselyov", title = "A delegation language to request weather products and a scheme of its interpretation", journal = j-SIGPLAN, volume = "34", number = "1", pages = "343--343", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Am:1999:SAR, author = "Nancy Am and Young Park", title = "A Structured Approach to Retrieving Functions by Types", journal = j-SIGPLAN, volume = "34", number = "1", pages = "344--344", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Dec 30 14:35:17 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{An:1999:SAR, author = "Nancy An and Young Park", title = "A structured approach to retrieving functions by types", journal = j-SIGPLAN, volume = "34", number = "1", pages = "344--344", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ling:1999:FFR, author = "Gary Shu Ling", title = "{Frob} --- Functional Robotics", journal = j-SIGPLAN, volume = "34", number = "1", pages = "345--345", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marcos:1999:FPA, author = "Daniel H. Marcos and Pablo E. Mart{\'\i}nez L{\'o}pez and Walter A. Risi", title = "A Functional Programming Approach to Hypermedia Authoring", journal = j-SIGPLAN, volume = "34", number = "1", pages = "346--346", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Faggian:1999:TCU, author = "Claudia Faggian", title = "A Term Calculus for a Unitary Approach to Normalization", journal = j-SIGPLAN, volume = "34", number = "1", pages = "347--347", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Erlich:1999:IDP, author = "Yan-David Erlich", title = "Implementing design patterns as language constructs", journal = j-SIGPLAN, volume = "34", number = "1", pages = "348--348", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiselyov:1999:LCN, author = "Oleg Kiselyov", title = "A lazy {CGI} namespace in {Scheme}", journal = j-SIGPLAN, volume = "34", number = "1", pages = "349--349", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zhang:1999:ADI, author = "Yuchen Zhang and Yanhong A. Liu", title = "Automating Derivation of Incremental Programs", journal = j-SIGPLAN, volume = "34", number = "1", pages = "350--350", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Haiming:1999:CCR, author = "Chen Haiming", title = "Combining {CFG} and Recursive Functions to Get a New Language", journal = j-SIGPLAN, volume = "34", number = "1", pages = "351--351", month = jan, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:56 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, affiliation = "Goethe Universit{\"a}t", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1999:LEM, author = "A. Michael Berman", title = "Letter from the Editor: {Malik}'s {``Evolution of the High Level Programming Languages: {A} Critical Perspective''}: {A} Correction and Apology", journal = j-SIGPLAN, volume = "34", number = "2", pages = "1--1", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "The editor apologizes for publication of a paper \cite{Malik:1998:EHL} that was largely plagiarized from a published book.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Berman:A=_Michael.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Burke:1999:AEC, author = "Michael G. Burke", title = "Activities: {Executive Committee} News: Panel Sessions at {SIGPLAN} Conference", journal = j-SIGPLAN, volume = "34", number = "2", pages = "2--3", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Burke:Michael_G=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1999:CCCa, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "34", number = "2", pages = "4--15", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Apr 21 17:43:37 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jones:1999:EEA, author = "Neil D. Jones", title = "{EAPLS}: the {European Association for Programming Languages and Systems}", journal = j-SIGPLAN, volume = "34", number = "2", pages = "19--20", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jones:1999:ESE, author = "Neil D. Jones", title = "The {European} Scene: {EAPLS}: the {European Association for Programming Languages and Systems}", journal = j-SIGPLAN, volume = "34", number = "2", pages = "19--20", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/j/Jones:Neil_D=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ball:1999:FPP, author = "Thomas Ball", title = "Functional Programming: Paths between Imperative and Functional Programming Languages", journal = j-SIGPLAN, volume = "34", number = "2", pages = "21--25", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Ball:Thomas.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ball:1999:PBI, author = "Thomas Ball", title = "Paths between imperative and functional programming", journal = j-SIGPLAN, volume = "34", number = "2", pages = "21--25", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:PPPa, author = "Chris Clark", title = "Practical Parsing Patterns: What to Do with a Dangling Else", journal = j-SIGPLAN, volume = "34", number = "2", pages = "26--31", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Clark:Chris.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:WDD, author = "Chris Clark", title = "What to do with a dangling else", journal = j-SIGPLAN, volume = "34", number = "2", pages = "26--31", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benson:1999:CM, author = "Brent W. {Benson, Jr.}", title = "Closures for the masses", journal = j-SIGPLAN, volume = "34", number = "2", pages = "32--35", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benson:1999:JRI, author = "Brent W. {Benson, Jr.}", title = "{Java} Reflections: Inner Classes: Closures for the Masses", journal = j-SIGPLAN, volume = "34", number = "2", pages = "32--35", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "This paper describes recent extensions to the Java language languages to support inner classes and closures.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Benson_Jr=:Brent_W=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1999:FOT, author = "Paul Frenger", title = "{Forth} and the open terminal architecture", journal = j-SIGPLAN, volume = "34", number = "2", pages = "36--38", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1999:FRF, author = "Paul Frenger", title = "{Forth} Report: {Forth} and the {Open Terminal Architecture}", journal = j-SIGPLAN, volume = "34", number = "2", pages = "36--39", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/f/Frenger:Paul.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1999:TCIa, author = "A. Michael Berman", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "34", number = "2", pages = "40--40", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Apr 21 17:43:37 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Carlisle:1999:LES, author = "Martin C. Carlisle", title = "Letters to the {Editor}: {SIGPLAN Notices} on language evolution", journal = j-SIGPLAN, volume = "34", number = "2", pages = "41--41", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Apr 21 17:43:37 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Feldman:1999:LED, author = "Michael B. Feldman", title = "Letters to the {Editor}: {DEC 98 SIGPLAN Notices}", journal = j-SIGPLAN, volume = "34", number = "2", pages = "41--42", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Apr 21 17:43:37 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bigot:1999:LEC, author = "Peter A. Bigot", title = "Letters to the {Editor}: Comment on {Spaniel} paper", journal = j-SIGPLAN, volume = "34", number = "2", pages = "42--45", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Apr 21 17:43:37 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Hatzigeorgiu:1998:LPS,Syropoulos:1999:LER}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Syropoulos:1999:LER, author = "Apostolos Syropoulos", title = "Letters to the {Editor}: Response to {Peter A. Bigot}", journal = j-SIGPLAN, volume = "34", number = "2", pages = "46--46", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Apr 21 17:43:37 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Hatzigeorgiu:1998:LPS,Bigot:1999:LEC}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Spinellis:1999:DPO, author = "Diomidis Spinellis", title = "Declarative peephole optimization using string pattern matching", journal = j-SIGPLAN, volume = "34", number = "2", pages = "47--50", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Spinellis:1999:TCD, author = "Diomidis Spinellis", title = "Technical Correspondence: Declarative Peephole Optimization Using String Pattern Matching", journal = j-SIGPLAN, volume = "34", number = "2", pages = "47--51", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/s/Spinellis:Diomidis.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1999:TSL, author = "Dianxiang Xu", title = "A Type System of Logic Objects", journal = j-SIGPLAN, volume = "34", number = "2", pages = "52--56", month = feb, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:17:59 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/x/Xu:Dianxiang.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Larose:1999:CIC, author = "Martin Larose and Marc Feeley", title = "A compacting incremental collector and its performance in a production quality compiler", journal = j-SIGPLAN, volume = "34", number = "3", pages = "1--9", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p1-larose/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection.", } @Article{Azagury:1999:CCM, author = "Alain Azagury and Elliot K. Kolodner and Erez Petrank and Zvi Yehudai", title = "Combining card marking with remembered sets: how to save scanning time", journal = j-SIGPLAN, volume = "34", number = "3", pages = "10--19", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p10-azagury/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Pirinen:1999:BTI, author = "Pekka P. Pirinen", title = "Barrier techniques for incremental tracing", journal = j-SIGPLAN, volume = "34", number = "3", pages = "20--25", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p20-pirinen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf I.5.2} Computing Methodologies, PATTERN RECOGNITION, Design Methodology, Classifier design and evaluation.", } @Article{Johnstone:1999:MFP, author = "Mark S. Johnstone and Paul R. Wilson", title = "The memory fragmentation problem: solved?", journal = j-SIGPLAN, volume = "34", number = "3", pages = "26--36", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p26-johnstone/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Chilimbi:1999:UGG, author = "Trishul M. Chilimbi and James R. Larus", title = "Using generational garbage collection to implement cache-conscious data placement", journal = j-SIGPLAN, volume = "34", number = "3", pages = "37--48", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p37-chilimbi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Main memory. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Roth:1999:OBC, author = "David J. Roth and David S. Wise", title = "One-bit counts between unique and sticky", journal = j-SIGPLAN, volume = "34", number = "3", pages = "49--56", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p49-roth/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS, Linked representations. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection.", } @Article{Moreau:1999:HDR, author = "Luc Moreau", title = "Hierarchical distributed reference counting", journal = j-SIGPLAN, volume = "34", number = "3", pages = "57--67", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p57-moreau/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Counting problems.", } @Article{Smith:1999:CMC, author = "Frederick Smith and Greg Morrisett", title = "Comparing mostly-copying and mark-sweep conservative collection", journal = j-SIGPLAN, volume = "34", number = "3", pages = "68--78", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p68-smith/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; standardization; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf K.6.2} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, Installation Management, Benchmarks.", } @Article{Rodriguez-Rivera:1999:NFN, author = "Gustavo Rodriguez-Rivera and Michael Spertus and Charles Fiterman", title = "A non-fragmenting non-moving, garbage collector", journal = j-SIGPLAN, volume = "34", number = "3", pages = "79--85", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p79-rodriguez-rivera/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies.", } @Article{Nishanov:1999:GCG, author = "Gor V. Nishanov and Sibylle Schupp", title = "Garbage collection in generic libraries", journal = j-SIGPLAN, volume = "34", number = "3", pages = "86--96", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p86-nishanov/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Software libraries.", } @Article{Demoen:1999:MMP, author = "Bart Demoen and Konstantinos Sagonas", title = "Memory management for {Prolog} with tabling", journal = j-SIGPLAN, volume = "34", number = "3", pages = "97--106", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p97-demoen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.1.6} Software, PROGRAMMING TECHNIQUES, Logic Programming.", } @Article{Wallace:1999:BBL, author = "Malcolm Wallace and Colin Runciman", title = "The bits between the lambdas: binary data in a lazy functional language", journal = j-SIGPLAN, volume = "34", number = "3", pages = "107--117", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p107-wallace/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.4.3} Software, OPERATING SYSTEMS, File Systems Management.", } @Article{Lim:1999:MER, author = "Tian F. Lim and Przemys{\l}aw Pardyak and Brian N. Bershad", title = "A memory-efficient real-time non-copying garbage collector", journal = j-SIGPLAN, volume = "34", number = "3", pages = "118--129", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p118-lim/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems. {\bf D.4.0} Software, OPERATING SYSTEMS, General.", } @Article{Siebert:1999:GND, author = "Fridtjof Siebert", title = "Guaranteeing non-disruptiveness and real-time deadlines in an incremental garbage collector", journal = j-SIGPLAN, volume = "34", number = "3", pages = "130--137", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p130-siebert/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; theory; verification", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf C.3} Computer Systems Organization, SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS, Real-time and embedded systems. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design, Real-time systems and embedded systems.", } @Article{Hicks:1999:SLO, author = "Michael Hicks and Luke Hornof and Jonathan T. Moore and Scott M. Nettles", title = "A study of large object spaces", journal = j-SIGPLAN, volume = "34", number = "3", pages = "138--145", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p138-hicks/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection.", } @Article{Kakkad:1999:PRT, author = "Sheetal V. Kakkad and Mark S. Johnstone and Paul R. Wilson", title = "Portable run-time type description for conventional compilers", journal = j-SIGPLAN, volume = "34", number = "3", pages = "146--153", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p146-kakkad/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++.", } @Article{Colnet:1999:CSC, author = "Dominique Colnet and Philippe Coucaud and Olivier Zendra", title = "Compiler support to customize the mark and sweep algorithm", journal = j-SIGPLAN, volume = "34", number = "3", pages = "154--165", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p154-colnet/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Huelsbergen:1999:VCM, author = "Lorenz Huelsbergen and Phil Winterbottom", title = "Very concurrent mark-{\&}-sweep garbage collection without fine-grain synchronization", journal = j-SIGPLAN, volume = "34", number = "3", pages = "166--175", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p166-huelsbergen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Garbage collection. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Larson:1999:MAL, author = "Per-{\AA}ke Larson and Murali Krishnan", title = "Memory allocation for long-running server applications", journal = j-SIGPLAN, volume = "34", number = "3", pages = "176--185", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p176-larson/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @Article{Tofte:1999:BIR, author = "Mads Tofte", title = "A brief introduction to regions", journal = j-SIGPLAN, volume = "34", number = "3", pages = "186--195", month = mar, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:00 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/plan/286860/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/286860/p186-tofte/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages; measurement; performance; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Standard ML.", } @Article{Zorn:1999:ACS, author = "Ben Zorn", title = "Activities: Corporate Support and {SIGPLAN}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "1--2", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/z/Zorn:Benjamin_G=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zorn:1999:CSS, author = "Ben Zorn", title = "Corporate support and {SIGPLAN}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "1--2", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1999:CCCb, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "34", number = "4", pages = "3--15", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 02 14:42:20 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:FCR, author = "Anonymous", title = "{Federated Computing Research Conference: April 30--May 6, 1999, Atlanta, GA}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "16--16", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 02 14:42:20 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:APA, author = "Anonymous", title = "Advance Program for {ACM SIGPLAN '99 Conference on Programming Language Design and Implementation: Atlanta Hilton \& Towers, Atlanta, Georgia, May 1--4, 1999}; \path=http://www.cs.rutgers.edu/pldi99=", journal = j-SIGPLAN, volume = "34", number = "4", pages = "17--18", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 02 14:42:20 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:BTS, author = "Chris Clark", title = "Build a tree --- save a parse", journal = j-SIGPLAN, volume = "34", number = "4", pages = "19--24", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:PPPb, author = "Chris Clark", title = "Practical Parsing Patterns: Build a Tree --- Save a Parse", journal = j-SIGPLAN, volume = "34", number = "4", pages = "19--24", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Clark:Chris.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benson:1999:J, author = "Brent W. {Benson, Jr.}", title = "{JavaScript}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "25--27", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benson:1999:JRJ, author = "Brent W. {Benson, Jr.}", title = "{Java} Reflections: {JavaScript} --- Not {Java} (but just as hot)", journal = j-SIGPLAN, volume = "34", number = "4", pages = "25--27", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Benson_Jr=:Brent_W=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1999:FRP, author = "Paul Frenger", title = "{Forth} Report: Parallel {Forth}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "28--32", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/f/Frenger:Paul.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frenger:1999:PF, author = "Paul Frenger", title = "{Parallel Forth}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "28--32", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{VanRoy:1999:AMP, author = "Peter {Van Roy}", title = "Announcing the {Mozart} programming system", journal = j-SIGPLAN, volume = "34", number = "4", pages = "33--34", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{VanRoy:1999:RAM, author = "Peter {Van Roy}", title = "Resources: Announcing the {Mozart} Programming System", journal = j-SIGPLAN, volume = "34", number = "4", pages = "33--34", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/r/Roy:Peter_Van.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Peterson:1999:FPM, author = "John Peterson", title = "Functional Programming: {Microsoft} and {Yale} Conclude Agreement to License Technology for {Haskell}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "35--36", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Warning: This is an April Fool's joke.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/p/Peterson:John.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Peterson:1999:MYC, author = "John Peterson", title = "{Microsoft} and {Yale} conclude agreement to license technology for {Haskell}", journal = j-SIGPLAN, volume = "34", number = "4", pages = "35--36", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Berman:1999:TCIb, author = "A. Michael Berman", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "34", number = "4", pages = "37--37", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 02 14:42:20 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1999:JIP, author = "Per Brinch Hansen", title = "{Java}'s insecure parallelism", journal = j-SIGPLAN, volume = "34", number = "4", pages = "38--45", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hansen:1999:TCJ, author = "Per Brinch Hansen", title = "Technical Correspondence: {Java}'s Insecure Parallelism", journal = j-SIGPLAN, volume = "34", number = "4", pages = "38--45", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/h/Hansen:Per_Brinch.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Harris:1999:ESR, author = "Timothy Harris", title = "Early storage reclamation in a tracing garbage collector", journal = j-SIGPLAN, volume = "34", number = "4", pages = "46--53", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/h/Harris:Timothy.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pareja-Flores:1999:CED, author = "Crist{\'o}bal Pareja-Flores and J. {\'A}ngel Vel{\'a}zquez-Iturbide", title = "Calculating Encoding and Decoding Functions for Prefix Codes", journal = j-SIGPLAN, volume = "34", number = "4", pages = "54--60", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/p/Pareja=Flores:Crist=oacute=bal.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/v/Vel=aacute=zquez=Iturbide:J=_=Aacute=ngel.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Biswas:1999:REP, author = "Bitan Biswas and Rajib Mall", title = "Reverse Execution of Programs", journal = j-SIGPLAN, volume = "34", number = "4", pages = "61--69", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Biswas:Bitan.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/m/Mall:Rajib.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agrawal:1999:NPR, author = "Gagan Agrawal and Shyamala Murthy and Chandrashekhar Garud", title = "A Novel Program Representation for Interprocedural Analysis", journal = j-SIGPLAN, volume = "34", number = "4", pages = "70--76", month = apr, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:01 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/a/Agrawal:Gagan.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/g/Garud:Chandrashekar.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/m/Murthy:Shyamala.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chilimbi:1999:CCSa, author = "Trishul M. Chilimbi and Mark D. Hill and James R. Larus", title = "Cache-Conscious Structure Layout", journal = j-SIGPLAN, volume = "34", number = "5", pages = "1--12", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p1-chilimbi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chilimbi:1999:CCSb, author = "Trishul M. Chilimbi and Bob Davidson and James R. Larus", title = "Cache-Conscious Structure Definition", journal = j-SIGPLAN, volume = "34", number = "5", pages = "13--24", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p13-chilimbi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Jones:1999:SIE, author = "Simon Peyton Jones and Alastair Reid and Fergus Henderson and Tony Hoare and Simon Marlow", title = "A semantics for imprecise exceptions", journal = j-SIGPLAN, volume = "34", number = "5", pages = "25--36", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{PeytonJones:1999:SIE, author = "Simon {Peyton Jones} and Alastair Reid and Tony Hoare and Simon Marlow and Fergus Henderson", title = "A Semantics for Imprecise Exceptions", journal = j-SIGPLAN, volume = "34", number = "5", pages = "25--36", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 16:27:02 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p25-peyton_jones/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fisher:1999:DCM, author = "Kathleen Fisher and John Reppy", title = "The Design of a Class Mechanism for {Moby}", journal = j-SIGPLAN, volume = "34", number = "5", pages = "37--49", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p37-fisher/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Crary:1999:WRM, author = "Karl Crary and Robert Harper and Sidd Puri", title = "What is a Recursive Module?", journal = j-SIGPLAN, volume = "34", number = "5", pages = "50--63", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p50-crary/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bodik:1999:LRA, author = "Rastislav Bod{\'\i}k and Rajiv Gupta and Mary Lou Soffa", title = "Load-Reuse Analysis: Design and Evaluation", journal = j-SIGPLAN, volume = "34", number = "5", pages = "64--76", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p64-bodik/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rugina:1999:PAM, author = "Radu Rugina and Martin Rinard", title = "Pointer Analysis for Multithreaded Programs", journal = j-SIGPLAN, volume = "34", number = "5", pages = "77--90", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p77-rugina/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yong:1999:PAP, author = "Suan Hsi Yong and Susan Horwitz and Thomas Reps", title = "Pointer Analysis for Programs with Structures and Casting", journal = j-SIGPLAN, volume = "34", number = "5", pages = "91--103", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p91-yong/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Blelloch:1999:BTS, author = "Guy E. Blelloch and Perry Cheng", title = "On Bounding Time and Space for Multiprocessor Garbage Collection", journal = j-SIGPLAN, volume = "34", number = "5", pages = "104--117", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p104-blelloch/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stichnoth:1999:SGC, author = "James M. Stichnoth and Guei-Yuan Lueh and Micha{\l} Cierniak", title = "Support for Garbage Collection at Every Instruction in a {Java} Compiler", journal = j-SIGPLAN, volume = "34", number = "5", pages = "118--127", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p118-stichnoth/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rao:1999:SAO, author = "Amit Rao and Santosh Pande", title = "Storage Assignment Optimizations to Generate Compact and Efficient Code on Embedded {DSPs}", journal = j-SIGPLAN, volume = "34", number = "5", pages = "128--138", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p128-rao/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cooper:1999:ECC, author = "Keith D. Cooper and Nathaniel McIntosh", title = "Enhanced Code Compression for Embedded {RISC} Processors", journal = j-SIGPLAN, volume = "34", number = "5", pages = "139--149", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p139-cooper/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vegdahl:1999:UNM, author = "Steven R. Vegdahl", title = "Using Node Merging to Enhance Graph Coloring", journal = j-SIGPLAN, volume = "34", number = "5", pages = "150--154", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p150-vegdahl/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schlansker:1999:CCB, author = "Michael Schlansker and Scott Mahlke and Richard Johnson", title = "Control {CPR}: {A} Branch Height Reduction Optimization for {EPIC} Architectures", journal = j-SIGPLAN, volume = "34", number = "5", pages = "155--168", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p155-schlansker/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Frigo:1999:FFT, author = "Matteo Frigo", title = "A Fast {Fourier} Transform Compiler", journal = j-SIGPLAN, volume = "34", number = "5", pages = "169--180", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p169-frigo/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wu:1999:NFD, author = "Le-Chun Wu and Rajiv Mirani and Harish Patil and Bruce Olsen and Wen-mei W. Hwu", title = "A New Framework for Debugging Globally Optimized Code", journal = j-SIGPLAN, volume = "34", number = "5", pages = "181--191", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p181-wu/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Foster:1999:TTQ, author = "Jeffrey S. Foster and Manuel F{\"a}hndrich and Alexander Aiken", title = "A Theory of Type Qualifiers", journal = j-SIGPLAN, volume = "34", number = "5", pages = "192--203", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p192-foster/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Leung:1999:SSA, author = "Allen Leung and Lal George", title = "Static Single Assignment Form for Machine Code", journal = j-SIGPLAN, volume = "34", number = "5", pages = "204--214", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p204-leung/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Song:1999:NTT, author = "Yonghong Song and Zhiyuan Li", title = "New Tiling Techniques to Improve Cache Temporal Locality", journal = j-SIGPLAN, volume = "34", number = "5", pages = "215--228", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p215-song/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ding:1999:ICP, author = "Chen Ding and Ken Kennedy", title = "Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time", journal = j-SIGPLAN, volume = "34", number = "5", pages = "229--241", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p229-ding/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1999:AIM, author = "Christopher W. Fraser", title = "Automatic Inference of Models for Statistical Code Compression", journal = j-SIGPLAN, volume = "34", number = "5", pages = "242--246", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p242-fraser/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pugh:1999:CJC, author = "William Pugh", title = "Compressing {Java} Class Files", journal = j-SIGPLAN, volume = "34", number = "5", pages = "247--258", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p247-pugh/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Larus:1999:WPP, author = "James R. Larus", title = "Whole Program Paths", journal = j-SIGPLAN, volume = "34", number = "5", pages = "259--269", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p259-larus/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Fraser:1999:FSC, author = "Christopher W. Fraser and Todd A. Proebsting", title = "Finite-State Code Generation", journal = j-SIGPLAN, volume = "34", number = "5", pages = "270--280", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p270-fraser/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Marlet:1999:EIR, author = "Renaud Marlet and Charles Consel and Philippe Boinot", title = "Efficient Incremental Run-Time Specialization for Free", journal = j-SIGPLAN, volume = "34", number = "5", pages = "281--292", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p281-martlet/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grant:1999:ERT, author = "Brian Grant and Matthai Philipose and Markus Mock and Susan J. Eggers and Craig Chambers", title = "An Evaluation of Run-time Optimizations", journal = j-SIGPLAN, volume = "34", number = "5", pages = "293--304", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 16:27:02 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See PLDI'99 proceedings \cite{ACM:1999:PASa}.", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/301122/p293-grant/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grant:1999:ESR, author = "Brian Grant and Matthai Philipose and Markus Mock and Craig Chambers and Susan J. Eggers", title = "An evaluation of staged run-time optimizations in {DyC}", journal = j-SIGPLAN, volume = "34", number = "5", pages = "293--304", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:03 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Davidson:1999:NCI, author = "Jack Davidson and Monica Lam and David Moore and Mike Smith", title = "{National Compiler Infrastructure} Progress Report", journal = j-SIGPLAN, volume = "34", number = "5", pages = "??--??", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 16:27:02 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Was scheduled to appear in PLDI'99 proceedings \cite{ACM:1999:PASa}, but nothing but a table-of-contents entry was given there.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rhyne:1999:IPQ, author = "Jim Rhyne and Steven Lucco and Edward Felten and Guy L. {Steele, Jr.}", title = "Industrial Panel: {``Trends in the Future of Industrial Computing''}", journal = j-SIGPLAN, volume = "34", number = "5", pages = "??--??", month = may, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 13 16:27:02 1999", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Was scheduled to appear in PLDI'99 proceedings \cite{ACM:1999:PASa}, but nothing but a table-of-contents entry was given there.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kessler:1999:ECN, author = "Robert Kessler", title = "Executive Committee News: {SIGPLAN} Conferences and Workshops", journal = j-SIGPLAN, volume = "34", number = "6", pages = "1--1", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bergmann:1999:CCCc, author = "Seth Bergmann", title = "Conference Corner: Calendar", journal = j-SIGPLAN, volume = "34", number = "6", pages = "2--12", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:CPP, author = "Anonymous", title = "Call for Papers: {POPL '00}: The 27th Annual {ACM SIGPLAN-SIGACT} Symposium on Principles of Programming Languages", journal = j-SIGPLAN, volume = "34", number = "6", pages = "13--13", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:CPAa, author = "Anonymous", title = "Call for Papers: {APL99}: On Track to the {21st Century}: International Conference on Array Processing Languages", journal = j-SIGPLAN, volume = "34", number = "6", pages = "14--14", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:CPAb, author = "Anonymous", title = "Call for Papers: {ACM SIGPLAN} Workshop on {\em Dyn\/}amic and {\em A\/}daptive Co{\em m\/}pilation and {\em O\/}ptimization ({Dynamo'00})", journal = j-SIGPLAN, volume = "34", number = "6", pages = "15--15", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liu:1999:CCC, author = "Annie Liu and Scott D. Stoller", title = "Conference Corner: Conference Report: {ETAPS '99}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "16--17", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/l/Liu:Yanhong_A=.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/s/Stoller:Scott_D=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:KSS, author = "Chris Clark", title = "Keywords: {Scanners} and {Screeners}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "18--22", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:PPPc, author = "Chris Clark", title = "Practical Parsing Patterns: Keywords: Scanners and Screeners", journal = j-SIGPLAN, volume = "34", number = "6", pages = "18--22", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Clark:Chris.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Plasmeijer:1999:FPK, author = "Rinus Plasmeijer and Marko van Eekelen", title = "Functional Programming: Keep it {\sc Clean}: {A} unique approach to functional programming", journal = j-SIGPLAN, volume = "34", number = "6", pages = "23--31", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/e/Eekelen:Marko_C=_J=_D=_van.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/p/Plasmeijer:Marinus_J=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Plasmeijer:1999:KIC, author = "Rinus Plasmeijer and Marko van Eekelen", title = "Keep it clean: a unique approach to functional programming", journal = j-SIGPLAN, volume = "34", number = "6", pages = "23--31", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sadler:1999:FFO, author = "John Sadler", title = "{Ficl}, {FORML}, {\&} {Object Forth}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "32--35", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sadler:1999:FFR, author = "John Sadler", title = "{Forth}: {Forth} Report: {Ficl}, {FORML}, \& {Object Forth}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "32--35", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/s/Sadler:John.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:TCI, author = "Anonymous", title = "Technical Correspondence: Information for Authors", journal = j-SIGPLAN, volume = "34", number = "6", pages = "36--36", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Panizzi:1999:RTV, author = "Emanuele Panizzi and Bernardo Pastorelli", title = "On the return types of virtual functions", journal = j-SIGPLAN, volume = "34", number = "6", pages = "37--42", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Panizzi:1999:TCR, author = "Emanuele Panizzi and Bernardo Pastorelli", title = "Technical Correspondence: On the Return Types of Virtual Functions", journal = j-SIGPLAN, volume = "34", number = "6", pages = "37--42", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/p/Panizzi:Emanuele.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/p/Pastorelli:Bernardo.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wolfe:1999:PRE, author = "Michael Wolfe", title = "Partial Redundancy Elimination is not Bidirectional", journal = j-SIGPLAN, volume = "34", number = "6", pages = "43--46", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/w/Wolfe:Michael.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Khedker:1999:BDF, author = "Uday P. Khedker and Dhananjay M. Dhamdhere", title = "Bidirectional Data Flow Analysis: Myths and Reality", journal = j-SIGPLAN, volume = "34", number = "6", pages = "47--57", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/d/Dhamdhere:Dhananjay_M=.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/k/Khedker:Uday_P=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Naik:1999:OOS, author = "Mayur Naik and Rajeev Kumar", title = "Object-Oriented Symbol Management in Syntax-Directed Compiler Systems", journal = j-SIGPLAN, volume = "34", number = "6", pages = "58--67", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/k/Kumar:Rajeev.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/n/Naik:Mayur.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mernik:1999:IMA, author = "Marjan Mernik and Viljem {\v{Z}}umer and Mitja Leni{\v{c}} and Enis Avdi{\v{c}}au{\v{s}}evi{\'c}", title = "Implementation of Multiple Attribute Grammar Inheritance in the tool {LISA}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "68--75", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/a/Avdicausevic:Enis.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/l/Lenic:Mitja.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/m/Mernik:Marjan.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/z/Zumer:Viljem.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Wolfgang:1999:IST, author = "Paul Wolfgang and Yang Song", title = "Integration of the {Standard Template Library} and the {Microsoft Foundation Class}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "76--81", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/s/Song:Yang.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/w/Wolfgang:Paul.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Botting:1999:APN, author = "Richard J. Botting", title = "On the Application of a Popular Notation to Semantics", journal = j-SIGPLAN, volume = "34", number = "6", pages = "82--83", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See comment \cite{Kiselyov:1999:CAP}.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Botting:Richard_J=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kokol:1999:CFS, author = "Peter Kokol and Vili Podgorelec and Henri Habrias and Nassim Hadj Rabia", title = "The complexity of formal specifications --- assessments by {$\alpha$}-metric", journal = j-SIGPLAN, volume = "34", number = "6", pages = "84--88", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/h/Habrias:Henri.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/k/Kokol:Peter.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/p/Podgorelec:Vili.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/r/Rabia:Nassim_Hadj.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:F, author = "Anonymous", title = "{Forth}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "??--??", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:FP, author = "Anonymous", title = "Functional programming", journal = j-SIGPLAN, volume = "34", number = "6", pages = "??--??", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:PPP, author = "Anonymous", title = "Practical parsing patterns", journal = j-SIGPLAN, volume = "34", number = "6", pages = "??--??", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Anonymous:1999:TC, author = "Anonymous", title = "Technical {Correspondence}", journal = j-SIGPLAN, volume = "34", number = "6", pages = "??--??", month = jun, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:04 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cooper:1999:ORC, author = "Keith D. Cooper and Philip J. Schielke and Devika Subramanian", title = "Optimizing for Reduced Code Space using Genetic Algorithms", journal = j-SIGPLAN, volume = "34", number = "7", pages = "1--9", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Uh:1999:EEZ, author = "Gang-Ryung Uh and Yuhong Wang and David Whalley and Sanjay Jinturkar and Chris Burns and Vincent Cao", title = "Effective Exploitation of a Zero Overhead Loop Buffer", journal = j-SIGPLAN, volume = "34", number = "7", pages = "10--19", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eckstein:1999:MCL, author = "Erik Eckstein and Andreas Krall", title = "Minimizing Cost of Local Variables Access for {DSP}-Processors", journal = j-SIGPLAN, volume = "34", number = "7", pages = "20--27", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stotzer:1999:MST, author = "Eric Stotzer and Ernst Leiss", title = "Modulo Scheduling for the {TMS320C6x VLIW DSP} Architecture", journal = j-SIGPLAN, volume = "34", number = "7", pages = "28--34", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Schneider:1999:PBP, author = "J{\"o}rn Schneider and Christian Ferdinand", title = "Pipeline behavior prediction for superscalar processors by abstract interpretation", journal = j-SIGPLAN, volume = "34", number = "7", pages = "35--44", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Persson:1999:LMA, author = "Patrik Persson", title = "Live Memory Analysis for Garbage Collection in Embedded Systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "45--54", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kim:1999:SGC, author = "Taehyoun Kim and Naehyuck Chang and Namyun Kim and Heonshik Shin", title = "Scheduling Garbage Collector for Embedded Real-Time Systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "55--64", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sugawara:1999:TBQ, author = "Tomoyoshi Sugawara and Kosuke Tatsukawa", title = "Table-Based {QoS} Control for Embedded Real-time Systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "65--72", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tomoyoshi:1999:TBQ, author = "Sugawara Tomoyoshi and Tatsukawa Kosuke", title = "Table-based {QoS} control for embedded real-time systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "65--72", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lee:1999:SDC, author = "Sungyoung Lee and Byeong-Soo Jeong and Hyon-Woo Seung", title = "A secure dynamic copy protocol in real-time secure database systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "73--79", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Park:1999:SDC, author = "Soo-Yeon Park and Sungyoung Lee and Byung-Soo Jeong and Hyon Woo Seung", title = "A Secure Dynamic Copy Protocol in Real-Time Database Systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "73--79", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Aug 31 06:24:16 1999", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryu:1999:PRE, author = "Minsoo Ryu and Jungkeun Park and Kimoon Kim and Yangmin Seo and Seongsoo Hong", title = "Performance Re-Engineering of Embedded Real-Time Systems", journal = j-SIGPLAN, volume = "34", number = "7", pages = "80--86", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kang:1999:SST, author = "D.-I. Kang and R. Gerber and L. Golubchik and J. K. Hollingsworth and M. Saksena", title = "A Software Synthesis Tool for Distributed Embedded System Design", journal = j-SIGPLAN, volume = "34", number = "7", pages = "87--95", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Engblom:1999:WSS, author = "Jakob Engblom", title = "Why {SpecInt95} Should Not Be Used to Benchmark Embedded Systems Tools", journal = j-SIGPLAN, volume = "34", number = "7", pages = "96--103", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ryu:1999:ICD, author = "In Ryu", title = "Issues and Challenges in Developing Embedded Software for Information Appliances and Telecommunication Terminals", journal = j-SIGPLAN, volume = "34", number = "7", pages = "104--120", month = jul, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:05 MST 2003", bibsource = "http://www.cs.indiana.edu/~liu/lctes99/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lee:1999:BCA, author = "Jaejin Lee and David A. Padua and Samuel P. Midkiff", title = "Basic compiler algorithms for parallel programs", journal = j-SIGPLAN, volume = "34", number = "8", pages = "1--12", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p1-lee/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Knoop:1999:CME, author = "Jens Knoop and Bernhard Steffen", title = "Code motion for explicitly parallel programs", journal = j-SIGPLAN, volume = "34", number = "8", pages = "13--24", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p13-knoop/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McCurdy:1999:ECP, author = "Collin McCurdy and John Mellor-Crummey", title = "An evaluation of computing paradigms for {$N$}-body simulations on distributed memory architectures", journal = j-SIGPLAN, volume = "34", number = "8", pages = "25--36", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p25-mccurdy/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liao:1999:SEI, author = "Shih-Wei Liao and Amer Diwan and Robert P. {Bosch, Jr.} and Anwar Ghuloum and Monica S. Lam", title = "{SUIF Explorer}: an interactive and interprocedural parallelizer", journal = j-SIGPLAN, volume = "34", number = "8", pages = "37--48", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p37-liao/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Xu:1999:DIT, author = "Zhichen Xu and Barton P. Miller and Oscar Naim", title = "Dynamic instrumentation of threaded applications", journal = j-SIGPLAN, volume = "34", number = "8", pages = "49--59", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p49-xu/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taura:1999:SMI, author = "Kenjiro Taura and Kunio Tabata and Akinori Yonezawa", title = "{StackThreads\slash MP}: integrating futures into calling standards", journal = j-SIGPLAN, volume = "34", number = "8", pages = "60--71", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p60-taura/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rugina:1999:APD, author = "Radu Rugina and Martin Rinard", title = "Automatic parallelization of divide and conquer algorithms", journal = j-SIGPLAN, volume = "34", number = "8", pages = "72--83", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p72-rugina/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Moon:1999:EPA, author = "Sungdo Moon and Mary W. Hall", title = "Evaluation of predicated array data-flow analysis for automatic parallelization", journal = j-SIGPLAN, volume = "34", number = "8", pages = "84--95", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p84-moon/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Scherer:1999:TAP, author = "Alex Scherer and Honghui Lu and Thomas Gross and Willy Zwaenepoel", title = "Transparent adaptive parallelism on {NOWs} using {OpenMP}", journal = j-SIGPLAN, volume = "34", number = "8", pages = "96--106", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p96-scherer/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tang:1999:CRT, author = "Hong Tang and Kai Shen and Tao Yang", title = "Compile\slash run-time support for threaded {MPI} execution on multiprogrammed shared memory machines", journal = j-SIGPLAN, volume = "34", number = "8", pages = "107--118", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p107-tang/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Mainwaring:1999:DCV, author = "Alan M. Mainwaring and David E. Culler", title = "Design challenges of virtual networks: fast, general-purpose communication", journal = j-SIGPLAN, volume = "34", number = "8", pages = "119--130", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p119-mainwaring/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kielmann:1999:MMC, author = "Thilo Kielmann and Rutger F. H. Hofman and Henri E. Bal and Aske Plaat and Raoul A. F. Bhoedjang", title = "{MagPIe}: {MPI}'s collective communication operations for clustered wide area systems", journal = j-SIGPLAN, volume = "34", number = "8", pages = "131--140", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p131-kielmann/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sundaram-Stukel:1999:PAW, author = "David Sundaram-Stukel and Mary K. Vernon", title = "Predictive analysis of a wavefront application using {LogGP}", journal = j-SIGPLAN, volume = "34", number = "8", pages = "141--150", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p141-sundaram-stukel/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bagrodia:1999:PPL, author = "Rajive Bagrodia and Ewa Deeljman and Steven Docy and Thomas Phan", title = "Performance prediction of large parallel applications using parallel simulations", journal = j-SIGPLAN, volume = "34", number = "8", pages = "151--162", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p151-bagrodia/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Subhlok:1999:ANS, author = "Jaspal Subhlok and Peter Lieu and Bruce Lowekamp", title = "Automatic node selection for high performance applications on networks", journal = j-SIGPLAN, volume = "34", number = "8", pages = "163--172", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p163-subhlok/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Maassen:1999:EIJ, author = "Jason Maassen and Rob van Nieuwpoort and Ronald Veldema and Henri E. Bal and Aske Plaat", title = "An efficient implementation of {Java}'s remote method invocation", journal = j-SIGPLAN, volume = "34", number = "8", pages = "173--182", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p173-maassen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ramachandran:1999:STM, author = "Umakishore Ramachandran and Rishiyur S. Nikhil and Nissim Harel and James M. Rehg and Kathleen Knobe", title = "Space-time memory: a parallel programming abstraction for interactive multimedia applications", journal = j-SIGPLAN, volume = "34", number = "8", pages = "183--192", month = aug, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:06 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/ppopp/301104/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/ppopp/301104/p183-ramachandran/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Longley:1999:WFP, author = "John Longley", title = "When is a Functional Program Not a Functional Program?", journal = j-SIGPLAN, volume = "34", number = "9", pages = "1--7", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p1-longley", acknowledgement = ack-nhfb, author-1-address = "University of Edinburgh, Scotland", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Aiken:1999:MLM, author = "Alex Aiken", title = "Modern languages for modern parallel computing (invited lecture, abstract only)", journal = j-SIGPLAN, volume = "34", number = "9", pages = "8--8", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/fp/317636/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99). Invited talk: abstract only.", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p-aiken", acknowledgement = ack-nhfb, author-1-address = "University of California at Berkeley", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Arvind:1999:YCD, author = "Arvind", title = "You Can Design Microprocessors Too: Putting {TRS}'s to Work (invited lecture, abstract only)", journal = j-SIGPLAN, volume = "34", number = "9", pages = "8--8", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/fp/317636/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99). Invited talk: abstract only.", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p-arvind", acknowledgement = ack-nhfb, author-1-address = "Laboratory for Computer Science, Massachusetts Institute of Technology", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", xxnote = "Yes, author has only a single name", } @Article{Leroy:1999:OCM, author = "Xavier Leroy", title = "Objects, classes and modules in {Objective Caml} (invited lecture, abstract only)", journal = j-SIGPLAN, volume = "34", number = "9", pages = "8--8", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/fp/317636/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99). Invited talk: abstract only.", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p-leroy", acknowledgement = ack-nhfb, author-1-address = "INRIA Rocquencourt and Trusted Logic", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Semmelroth:1999:MEM, author = "Miley Semmelroth and Amr Sabry", title = "Monadic Encapsulation in {ML}", journal = j-SIGPLAN, volume = "34", number = "9", pages = "8--17", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p8-semmelroth", acknowledgement = ack-nhfb, author-1-address = "University of Oregon, USA", author-2-address = "University of Oregon, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ganz:1999:TS, author = "Steven E. Ganz and Daniel P. Friedman and Mitchell Wand", title = "Trampolined Style", journal = j-SIGPLAN, volume = "34", number = "9", pages = "18--27", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p18-ganz", acknowledgement = ack-nhfb, author-1-address = "Northeastern University, USA", author-2-address = "Indiana University, USA", author-3-address = "Indiana University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Okasaki:1999:FES, author = "Chris Okasaki", title = "From Fast Exponentiation to Square Matrices: An Adventure in Types", journal = j-SIGPLAN, volume = "34", number = "9", pages = "28--35", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p28-okasaki", acknowledgement = ack-nhfb, author-1-address = "Columbia University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Nilsson:1999:TPP, author = "Henrik Nilsson", title = "Tracing Piece by Piece: Affordable Debugging for Lazy Functional Languages", journal = j-SIGPLAN, volume = "34", number = "9", pages = "36--47", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p36-nilsson", acknowledgement = ack-nhfb, author-1-address = "Link{\"o}ping University, Sweden, and INRIA Sophia-Antipolis, France", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shivers:1999:AHT, author = "Olin Shivers and James W. Clark and Roland McGrath", title = "Atomic Heap Transactions and Fine-Grain Interrupts", journal = j-SIGPLAN, volume = "34", number = "9", pages = "48--59", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p48-shivers", acknowledgement = ack-nhfb, author-1-address = "MIT, USA", author-2-address = "MIT, USA", author-3-address = "MIT, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Launchbury:1999:EMD, author = "John Launchbury and Jeffrey R. Lewis and Byron Cook", title = "On Embedding a Microarchitectural Design Language Within {Haskell}", journal = j-SIGPLAN, volume = "34", number = "9", pages = "60--69", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p60-launchbury", acknowledgement = ack-nhfb, author-1-address = "Oregon Graduate Institute of Science and Technology, USA", author-2-address = "Oregon Graduate Institute of Science and Technology, USA", author-3-address = "Oregon Graduate Institute of Science and Technology, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hughes:1999:RDD, author = "John Hughes and Lars Pareto", title = "Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded {ML} Programming", journal = j-SIGPLAN, volume = "34", number = "9", pages = "70--81", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p70-hughes", acknowledgement = ack-nhfb, author-1-address = "Chalmers University, Sweden", author-2-address = "Chalmers University, Sweden", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Crary:1999:SPT, author = "Karl Crary", title = "A Simple Proof Technique for Certain Parametricity Results", journal = j-SIGPLAN, volume = "34", number = "9", pages = "82--89", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p82-crary", acknowledgement = ack-nhfb, author-1-address = "Carnegie Mellon University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kfoury:1999:RTE, author = "Assaf J. Kfoury and Harry G. Mairson and Franklyn A. Turbak and J. B. Wells", title = "Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)", journal = j-SIGPLAN, volume = "34", number = "9", pages = "90--101", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p90-kfoury", acknowledgement = ack-nhfb, author-1-address = "Heriot-Watt University, UK", author-2-address = "Wellesley College, USA", author-3-address = "Brandeis University, USA", author-4-address = "Boston University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Splawski:1999:TFI, author = "Zdzis{\l}aw Sp{\l}awski and Pawe{\l} Urzyczyn", title = "Type Fixpoints: Iteration vs. Recursion", journal = j-SIGPLAN, volume = "34", number = "9", pages = "102--113", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p102-splawski", acknowledgement = ack-nhfb, author-1-address = "University of Warsaw, Poland", author-2-address = "Technical University of Wroc{\l}aw, Poland", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Finne:1999:CHH, author = "Sigbjorn Finne and Daan Leijen and Erik Meijer and Simon Peyton Jones", title = "Calling {Hell} From {Heaven} and {Heaven} From {Hell}", journal = j-SIGPLAN, volume = "34", number = "9", pages = "114--125", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p114-finne", acknowledgement = ack-nhfb, author-1-address = "Microsoft Research Ltd, England", author-2-address = "University of Utrecht, The Netherlands", author-3-address = "University of Utrecht, The Netherlands", author-4-address = "University of Glasgow, Scotland", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Benton:1999:IWT, author = "Nick Benton and Andrew Kennedy", title = "Interlanguage Working Without Tears: Blending {SML} with {Java}", journal = j-SIGPLAN, volume = "34", number = "9", pages = "126--137", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p126-benton", acknowledgement = ack-nhfb, author-1-address = "Microsoft Research Ltd, England", author-2-address = "Microsoft Research Ltd, England", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "MLj; Standard ML", } @Article{Flatt:1999:PLO, author = "Matthew Flatt and Robert Bruce Findler and Shriram Krishnamurthi and Matthias Felleisen", title = "Programming languages as operating systems ({\em or\/} revenge of the {Son of the Lisp Machine})", journal = j-SIGPLAN, volume = "34", number = "9", pages = "138--147", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p138-flatt", acknowledgement = ack-nhfb, author-1-address = "Rice University, USA", author-2-address = "Rice University, USA", author-3-address = "Rice University, USA", author-4-address = "Rice University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "DrScheme; MrEd; Scheme", } @Article{Wallace:1999:HXG, author = "Malcolm Wallace and Colin Runciman", title = "{Haskell} and {XML}: Generic Combinators or Type-Based Translation?", journal = j-SIGPLAN, volume = "34", number = "9", pages = "148--159", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p148-wallace", acknowledgement = ack-nhfb, author-1-address = "University of York, England", author-2-address = "University of York, England", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ohori:1999:TIR, author = "Atsushi Ohori and Nobuaki Yoshida", title = "Type inference with rank $1$ polymorphism for type-directed compilation of {ML}", journal = j-SIGPLAN, volume = "34", number = "9", pages = "160--171", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p160-ohori", acknowledgement = ack-nhfb, author-1-address = "Kyoto University, Japan", author-2-address = "Kyoto University, Japan", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Glew:1999:TDN, author = "Neal Glew", title = "Type Dispatch for Named Hierarchical Types", journal = j-SIGPLAN, volume = "34", number = "9", pages = "172--182", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p172-glew", acknowledgement = ack-nhfb, author-1-address = "Cornell University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{League:1999:RJC, author = "Christopher League and Zhong Shao and Valery Trifonov", title = "Representing {Java} Classes in a Typed Intermediate Language", journal = j-SIGPLAN, volume = "34", number = "9", pages = "183--196", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p183-league", acknowledgement = ack-nhfb, author-1-address = "Yale University, USA", author-2-address = "Yale University, USA", author-3-address = "Yale University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zdancewic:1999:PPL, author = "Steve Zdancewic and Dan Grossman and Greg Morrisett", title = "Principals in Programming Languages: {A} Syntactic Proof Technique", journal = j-SIGPLAN, volume = "34", number = "9", pages = "197--207", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p197-zdancewic", acknowledgement = ack-nhfb, author-1-address = "Cornell University, USA", author-2-address = "Cornell University, USA", author-3-address = "Cornell University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Elsman:1999:SIM, author = "Martin Elsman", title = "Static Interpretation of Modules", journal = j-SIGPLAN, volume = "34", number = "9", pages = "208--219", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p208-elsman", acknowledgement = ack-nhfb, author-1-address = "University of California at Berkeley, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Shao:1999:TMF, author = "Zhong Shao", title = "Transparent Modules with Fully Syntactic Signatures", journal = j-SIGPLAN, volume = "34", number = "9", pages = "220--232", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p220-shao", acknowledgement = ack-nhfb, author-1-address = "Yale University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Crary:1999:FTA, author = "Karl Crary and Stephanie Weirich", title = "Flexible Type Analysis", journal = j-SIGPLAN, volume = "34", number = "9", pages = "233--248", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p233-crary", acknowledgement = ack-nhfb, author-1-address = "Cornell University, USA", author-2-address = "Carnegie Mellon University, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chitil:1999:TIB, author = "Olaf Chitil", title = "Type Inference Builds a Short Cut to Deforestation", journal = j-SIGPLAN, volume = "34", number = "9", pages = "249--260", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p249-chitil", acknowledgement = ack-nhfb, author-1-address = "RWTH Aachen, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Huch:1999:VEP, author = "Frank Huch", title = "Verification of {Erlang} Programs using Abstract Interpretation and Model Checking", journal = j-SIGPLAN, volume = "34", number = "9", pages = "261--272", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p261-huch", acknowledgement = ack-nhfb, author-1-address = "RWTH Aachen, Germany", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Alpuente:1999:SIS, author = "Mar{\'\i}a Alpuente and Michael Hanus and Salvador Lucas and Germ{\'a}n Vidal", title = "Specialization of Inductively Sequential Functional Logic Programs", journal = j-SIGPLAN, volume = "34", number = "9", pages = "273--283", month = sep, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:08 MST 2003", bibsource = "http://pauillac.inria.fr/pli/icfp/; http://www.acm.org/pubs/contents/proceedings/fp/317636/; http://www.cs.cmu.edu/~petel/icfp99/conference-program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99).", URL = "http://www.acm.org/pubs/citations/proceedings/fp/317636/p273-alpuente", acknowledgement = ack-nhfb, author-1-address = "UPV, Spain", author-2-address = "UPV, Spain", author-3-address = "RWTH Aachen, Germany", author-4-address = "UPV, Spain", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Choi:1999:EAJ, author = "Jong-Deok Choi and Manish Gupta and Mauricio Serrano and Vugranam C. Sreedhar and Sam Midkiff", title = "Escape analysis for {Java}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "1--19", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p1-choi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Blanchet:1999:EAO, author = "Bruno Blanchet", title = "Escape analysis for object-oriented languages: application to {Java}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "20--34", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p20-blanchet/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Bogda:1999:RUS, author = "Jeff Bogda and Urs H{\"o}lzle", title = "Removing unnecessary synchronization in {Java}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "35--46", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p35-bogda/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Travassos:1999:DDO, author = "Guilherme Travassos and Forrest Shull and Michael Fredericks and Victor R. Basili", title = "Detecting defects in object-oriented designs: using reading techniques to increase software quality", journal = j-SIGPLAN, volume = "34", number = "10", pages = "47--56", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p47-travassos/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{France:1999:POA, author = "Robert France", title = "A problem-oriented analysis of basic {UML} static requirements modeling concepts", journal = j-SIGPLAN, volume = "34", number = "10", pages = "57--69", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p57-france/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Ovlinger:1999:LSR, author = "Johan Ovlinger and Mitchell Wand", title = "A language for specifying recursive traversals of object structures", journal = j-SIGPLAN, volume = "34", number = "10", pages = "70--81", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p70-ovlinger/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Vitek:1999:CT, author = "Jan Vitek and Boris Bokowski", title = "Confined types", journal = j-SIGPLAN, volume = "34", number = "10", pages = "82--96", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p82-vitek/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Duggan:1999:MTB, author = "Dominic Duggan", title = "Modular type-based reverse engineering of parameterized types in {Java} code", journal = j-SIGPLAN, volume = "34", number = "10", pages = "97--113", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p97-duggan/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Madsen:1999:SAV, author = "Ole Lehrmann Madsen", title = "Semantic analysis of virtual classes and tested classes", journal = j-SIGPLAN, volume = "34", number = "10", pages = "114--131", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p114-madsen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Igarashi:1999:FJM, author = "Atshushi Igarashi and Benjamin Pierce and Philip Wadler", title = "{Featherweight Java}: a minimal core calculus for {Java} and {GJ}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "132--146", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p132-igarashi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Freund:1999:FFJ, author = "Stephen N. Freund and John C. Mitchell", title = "A formal framework for the {Java} bytecode language and verifier", journal = j-SIGPLAN, volume = "34", number = "10", pages = "147--166", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p147-freund/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Rinat:1999:CPO, author = "Ran Rinat and Menachem Magidor and Scott F. Smith", title = "Correspondence polymorphism for object-oriented languages", journal = j-SIGPLAN, volume = "34", number = "10", pages = "167--186", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p167-rinat/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Whaley:1999:CPE, author = "John Whaley and Martin Rinard", title = "Compositional pointer and escape analysis for {Java} programs", journal = j-SIGPLAN, volume = "34", number = "10", pages = "187--206", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p187-whaley/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Agesen:1999:EML, author = "Ole Agesen and David Detlefs and Alex Garthwaite and Ross Knippel and Y. S. Ramakrishna and Derek White", title = "An efficient meta-lock for implementing ubiquitous synchronization", journal = j-SIGPLAN, volume = "34", number = "10", pages = "207--222", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p207-agesen/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Onodera:1999:SLO, author = "Tamiya Onodera and Kiyokuni Kawachiya", title = "A study of locking objects with bimodal fields", journal = j-SIGPLAN, volume = "34", number = "10", pages = "223--237", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p223-onodera/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chambers:1999:EMP, author = "Craig Chambers and Weimin Chen", title = "Efficient multiple and predicated dispatching", journal = j-SIGPLAN, volume = "34", number = "10", pages = "238--255", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p238-chambers/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sweeney:1999:STE, author = "Peter F. Sweeney and Joseph (Yossi) Gil", title = "Space and time-efficient memory layout for multiple inheritance", journal = j-SIGPLAN, volume = "34", number = "10", pages = "256--275", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p256-sweeney/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Calder:1999:RTD, author = "Brad Calder and Chandra Krintz and Urs H{\"o}lzle", title = "Reducing transfer delay using {Java} class file splitting and prefetching", journal = j-SIGPLAN, volume = "34", number = "10", pages = "276--291", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p276-calder/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Tip:1999:PEA, author = "Frank Tip and Chris Laffra and Peter F. Sweeney and David Streeter", title = "Practical experience with an application extractor for {Java}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "292--305", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p292-tip/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hagimont:1999:PEM, author = "Daniel Hagimont and L. Ismail", title = "A performance evaluation of the mobile agent paradigm", journal = j-SIGPLAN, volume = "34", number = "10", pages = "306--313", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p306-hagimont/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Alpern:1999:IJJ, author = "Bowen Alpern and C. R. Attanasio and Anthony Cocchi and Derek Lieber and Stephen Smith and Ton Ngo and John J. Barton and Susan Flynn Hummel and Janice C. Sheperd and Mark Mergen", title = "Implementing {Jalape{\~n}o} in {Java}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "314--324", month = oct, year = "1999", bibdate = "Thu Apr 27 07:14:21 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p314-alpern/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Alpern:1999:IJN, author = "Bowen Alpern and C. R. Attanasio and Anthony Cocchi and Derek Lieber and Stephen Smith and Ton Ngo and John J. Barton and Susan Flynn Hummel and Janice C. Sheperd and Mark Mergen", title = "Implementing jalape{\~n}o in {Java}", journal = j-SIGPLAN, volume = "34", number = "10", pages = "314--324", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clarke:1999:SOD, author = "Siobh{\'a}n Clarke and William Harrison and Harold Ossher and Peri Tarr", title = "Subject-oriented design: towards improved alignment of requirements, design, and code", journal = j-SIGPLAN, volume = "34", number = "10", pages = "325--339", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p325-clarke/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kersten:1999:ACS, author = "Mik Kersten and Gail C. Murphy", title = "{Atlas}: a case study in building a {Web}-based learning environment using aspect-oriented programming", journal = j-SIGPLAN, volume = "34", number = "10", pages = "340--352", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p340-kersten/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kendall:1999:RMD, author = "Elizabeth A. Kendall", title = "Role model designs and implementations with aspect-oriented programming", journal = j-SIGPLAN, volume = "34", number = "10", pages = "353--369", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p353-kendall/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Stefanovic:1999:ABG, author = "Darko Stefanovi{\'c} and Kathryn S. McKinley and J. Eliot B. Moss", title = "Age-based garbage collection", journal = j-SIGPLAN, volume = "34", number = "10", pages = "370--381", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p370-stefanovicacute/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hosking:1999:MCR, author = "Antony L. Hosking and Jiawan Chen", title = "Mostly-copying reachability-based orthogonal persistence", journal = j-SIGPLAN, volume = "34", number = "10", pages = "382--398", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p382-hosking/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Siek:1999:GGC, author = "Jeremy G. Siek and Lie-Quan Lee and Andrew Lumsdaine", title = "The generic graph component library", journal = j-SIGPLAN, volume = "34", number = "10", pages = "399--414", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p399-siek/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Evans:1999:ZCA, author = "Huw Evans and Peter Dickman", title = "Zones, contracts and absorbing changes: an approach to software evolution", journal = j-SIGPLAN, volume = "34", number = "10", pages = "415--434", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p415-evans/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Zorzo:1999:DOO, author = "A. F. Zorzo and R. J. Stroud", title = "A distributed object-oriented framework for dependable multiparty interactions", journal = j-SIGPLAN, volume = "34", number = "10", pages = "435--446", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p435-zorzo/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Lipkind:1999:OVL, author = "Ilya Lipkind and Igor Pechtchanski and Vijay Karamcheti", title = "Object views: language support for intelligent object caching in parallel and distributed computations", journal = j-SIGPLAN, volume = "34", number = "10", pages = "447--460", month = oct, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:09 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/oops/320384/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/oops/320384/p447-lipkind/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Das:1999:SAL, author = "Manuvir Das", title = "Static analysis of large programs (invited talk) (abstract only): some experiences", journal = j-SIGPLAN, volume = "34", number = "11", pages = "1--1", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Invited talk; abstract only.", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p1-das/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Braux:1999:TPE, author = "Mathias Braux and Jacques Noy{\'e}", title = "Towards partially evaluating reflection in {Java}", journal = j-SIGPLAN, volume = "34", number = "11", pages = "2--11", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p2-braux/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Sumii:1999:OOP, author = "Eijiro Sumii and Naoki Kobayashi", title = "Online-and-offline partial evaluation (extended abstract): a mixed approach", journal = j-SIGPLAN, volume = "34", number = "11", pages = "12--21", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Extended abstract.", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p12-sumii/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Grobauer:1999:SFP, author = "Bernd Grobauer and Zhe Yang", title = "The second {Futamura} projection for type-directed partial evaluation", journal = j-SIGPLAN, volume = "34", number = "11", pages = "22--32", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p22-grobauer/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Pfenning:1999:LFS, author = "Frank Pfenning", title = "On the logical foundations of staged computation (invited talk)", journal = j-SIGPLAN, volume = "34", number = "11", pages = "33--33", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Invited talk.", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p33-pfenning/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Taha:1999:SRS, author = "Walid Taha", title = "A sound reduction semantics for untyped {CBN} multi-stage computation. {Or}, the theory of {MetaML} is non-trivial (extended abstract)", journal = j-SIGPLAN, volume = "34", number = "11", pages = "34--43", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Extended abstract.", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p34-taha/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Gallagher:1999:URA, author = "John P. Gallagher and Julio C. Peralta", title = "Using regular approximations for generalisation during partial evalution", journal = j-SIGPLAN, volume = "34", number = "11", pages = "44--51", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p44-gallagher/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Levi:1999:NPS, author = "Giorgio Levi and Fausto Spoto", title = "Non pair-sharing and freeness analysis through linear refinement", journal = j-SIGPLAN, volume = "34", number = "11", pages = "52--61", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p52-levi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chin:1999:CST, author = "Wei-Ngan Chin and Siau-Cheng Khoo", title = "Calculating sized types", journal = j-SIGPLAN, volume = "34", number = "11", pages = "62--72", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p62-chin/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Liu:1999:RIW, author = "Yanhong A. Liu and Scott D. Stoller", title = "From recursion to iteration: what are the optimizations?", journal = j-SIGPLAN, volume = "34", number = "11", pages = "73--82", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p73-liu/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Walpole:1999:OSS, author = "Jonathan Walpole", title = "Operating systems specialization (invited talk) (abstract only): experiences, opportunities and challenges", journal = j-SIGPLAN, volume = "34", number = "11", pages = "83--83", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Invited talk; abstract only.", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p83-walpole/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kobayashi:1999:TBU, author = "Naoki Kobayashi", title = "Type-based useless variable elimination", journal = j-SIGPLAN, volume = "34", number = "11", pages = "84--93", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p84-kobayashi/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Murphy:1999:PAP, author = "Brian R. Murphy and Monica S. Lam", title = "Program analysis with partial transfer functions", journal = j-SIGPLAN, volume = "34", number = "11", pages = "94--103", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p94-murphy/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Scholz:1999:SPA, author = "Berhard Scholz and Johann Blieberger and Thomas Fahringer", title = "Symbolic pointer analysis for detecting memory leaks", journal = j-SIGPLAN, volume = "34", number = "11", pages = "104--113", month = nov, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:10 MST 2003", bibsource = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/citations/proceedings/pepm/328690/p104-scholz/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Cytron:1999:ALN, author = "Ron K. Cytron", title = "Activities: Letter from the {Newly Elected Chair}", journal = j-SIGPLAN, volume = "34", number = "12", pages = "1--1", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Cytron:Ron.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chalk:1999:CCJ, author = "Peter Chalk", title = "Conference Corner: {Java} in the Computing Curricula", journal = j-SIGPLAN, volume = "34", number = "12", pages = "9--11", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Chalk:Peter.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Chalk:1999:JCC, author = "Peter Chalk", title = "{Java} in the computing curricula", journal = j-SIGPLAN, volume = "34", number = "12", pages = "9--11", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hind:1999:SAI, author = "Michael Hind", title = "{SIGAda '98}: {ACM\slash SIGAda} international conference", journal = j-SIGPLAN, volume = "34", number = "12", pages = "12--12", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Hind:1999:SAS, author = "Michael Hind", title = "{SIGAda '98}: {ACM\slash SIGAda} International Conference (Report)", journal = j-SIGPLAN, volume = "34", number = "12", pages = "12--12", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/h/Hind:Michael.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McClain:1999:BAF, author = "D. McClain", title = "{BlurFit}: an application of functional programming to scientific analysis", journal = j-SIGPLAN, volume = "34", number = "12", pages = "13--17", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{McClain:1999:FPB, author = "D. McClain", title = "Functional Programming: {BlurFit} --- an Application of Functional Programming to Scientific Analysis", journal = j-SIGPLAN, volume = "34", number = "12", pages = "13--17", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/m/McClain:D=.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:KSI, author = "Chris Clark", title = "Keywords: special identifier idioms", journal = j-SIGPLAN, volume = "34", number = "12", pages = "18--23", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Clark:1999:PPPd, author = "Chris Clark", title = "Practical Parsing Patterns: Keywords: Special Identifier Idiom", journal = j-SIGPLAN, volume = "34", number = "12", pages = "18--23", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/c/Clark:Chris.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Metcalf:1999:FH, author = "Michael Metcalf", title = "{Fortran 90\slash 95\slash HPF}", journal = j-SIGPLAN, volume = "34", number = "12", pages = "24--29", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Metcalf:1999:RFI, author = "Michael Metcalf", title = "Resources: {Fortran} Information File", journal = j-SIGPLAN, volume = "34", number = "12", pages = "24--29", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Sep 26 17:06:07 MDT 2000", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/m/Metcalf:Michael.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Eckert:1999:FFF, author = "Brad Eckert", title = "{Forth}: Firmware Factory \& {Forth}", journal = j-SIGPLAN, volume = "34", number = "12", pages = "30--33", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/e/Eckert:Brad.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Kiselyov:1999:TCC, author = "Oleg Kiselyov and Richard J. Botting", title = "Technical Correspondence: Comment on {``On the Application of a Popular Notation to Semantics''} and reply from the Author", journal = j-SIGPLAN, volume = "34", number = "12", pages = "35--36", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Botting:1999:APN}.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Botting:Richard_J=.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/k/Kiselyov:Oleg.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Normark:1999:PWW, author = "Kurt N{\o}rmark", title = "Programming {World Wide Web} Pages in {Scheme}", journal = j-SIGPLAN, volume = "34", number = "12", pages = "37--46", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Describes a literate programming environment, LAML (Lisp Abstracted Markup Language), for HTML dynamically generated from Scheme programs.", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/n/N=oslash=rmark:Kurt.html; http://www.cs.auc.dk/~normark/laml/", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dai:1999:ABO, author = "Guilan Dai and Baowen Xu", title = "An {Ada}-based Object-Oriented Modeling Language", journal = j-SIGPLAN, volume = "34", number = "12", pages = "47--56", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Baowen:Xu.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/d/Dai:Guilan.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Yingjun:1999:SPL, author = "Li Yingjun and Lu Jian", title = "{SEIS++}: {A} Pattern Language for Seismic Tools Construction and Integration", journal = j-SIGPLAN, volume = "34", number = "12", pages = "57--66", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/j/Jian:Lu.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/y/Yingjun:Li.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Dai:1999:CRT, author = "Guilan Dai and Baowen Xu", title = "A comparison of real-time object-oriented modeling methods {ROOM} and {OCTOPUS}", journal = j-SIGPLAN, volume = "34", number = "12", pages = "67--71", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "http://ftp.informatik.rwth-aachen.de/dblp/db/journals/sigplan/sigplan34.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/b/Baowen:Xu.html; http://ftp.informatik.rwth-aachen.de/dblp/db/indices/a-tree/d/Dai:Guilan.html", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @Article{Curcio:1999:CCI, author = "Igor D. D. Curcio", title = "Correction to: {Curcio, Igor D. D., ``ASAP --- A Simple Assertion Pre-Processor'', ACM Sigplan Notices 33(12), December 1998, pp. 44--51}", journal = j-SIGPLAN, volume = "34", number = "12", pages = "72--72", month = dec, year = "1999", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:18:11 MST 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "See \cite{Curcio:1998:ASA}.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", } @InProceedings{Abbott:1998:DDO, author = "Mark Abbott and Lalit Kumar Jain", title = "{DOVE}: {Distributed Objects based scientific Visualization Environment}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/dove.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/dove.ps", acknowledgement = ack-nhfb, } @InProceedings{Akarsu:1998:DJB, author = "Erol Akarsu and Geoffrey Fox and Tomasz Haupt", title = "{DARP}: {Java}-based Data Analysis and Rapid Prototyping Environment for Distributed High Performance Computations", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/darp.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/darp.ps", acknowledgement = ack-nhfb, } @InProceedings{Baratloo:1998:INC, author = "A. Baratloo and M. Karaul and H. Karl and Z. M. Kedem", title = "An Infrastructure for Network Computing with {Java} Applets", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/knittingfactory.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/knittingfactory.ps", acknowledgement = ack-nhfb, } @InProceedings{Bik:1998:PBP, author = "Aart J. C. Bik and Dennis B. Gannon", title = "A Prototype Bytecode Parallelization Tool ({\tt javab} Manual)", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/javab.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/javab.ps", acknowledgement = ack-nhfb, } @InProceedings{Bizarro:1998:JJL, author = "Pedro Bizarro and Lu{\'\i}s M. Silva and Jo{\~a}o Gabriel Silva", title = "{JWarp}: {A} {Java} Library For Parallel Discrete-Event Simulations", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jwarp.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jwarp.ps", acknowledgement = ack-nhfb, } @InProceedings{Boisvert:1998:DNL, author = "Ronald F. Boisvert and Jack J. Dongarra and Roldan Pozo and Karin A. Remington and G. W. Stewart", title = "Developing numerical libraries in {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jnt.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jnt.ps", acknowledgement = ack-nhfb, } @InProceedings{Boyles:1998:CCE, author = "Michael Boyles and Rajeev Raje and Shiaofen Fang", title = "{CEV}: Collaborative Environment for Visualization Using {Java-RMI}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/cev.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/cev.ps", acknowledgement = ack-nhfb, } @InProceedings{Breg:1998:JRP, author = "Fabian Breg and Shridhar Diwan and Juan Villacis and Jayashree Balasubramanian and Esra Akman and Dennis Gannon", title = "{Java RMI} Performance and Object Model Interoperability: Experiments with {Java\slash HPC++}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/rmi.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/rmi.ps", acknowledgement = ack-nhfb, } @InProceedings{Caromel:1998:JFS, author = "Denis Caromel and Julien Vayssiere", title = "A {Java} Framework for Seamless Sequential, Multi-threaded, and Distributed Programming", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/javapp.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/javapp.ps", acknowledgement = ack-nhfb, } @InProceedings{Carpenter:1998:HDP, author = "Bryan Carpenter and Guansong Zhang and Geoffrey Fox and Xinying Li and Yuhong Wen", title = "{HPJava}: Data Parallel Extensions to {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/hpjava.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/hpjava.ps", acknowledgement = ack-nhfb, } @InProceedings{Chandy:1998:UAL, author = "K. Mani Chandy and Adam Rifkin and Eve Schooler", title = "Using Announce-Listen with Global Events to Develop Distributed Control Systems", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/dcs.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/dcs.ps", acknowledgement = ack-nhfb, } @InProceedings{Cowie:1998:JPD, author = "James Cowie", title = "{JTED}: Parallel Discrete-Event Simulation in {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jted.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jted.ps", acknowledgement = ack-nhfb, } @InProceedings{Demaine:1998:CCP, author = "Erik D. Demaine", title = "Converting {C} Pointers to {Java} References", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/pointers.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/pointers.ps", acknowledgement = ack-nhfb, } @InProceedings{Ferrari:1998:JNP, author = "Adam J. Ferrari", title = "{JPVM}: Network Parallel Computing in {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jpvm.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jpvm.ps", acknowledgement = ack-nhfb, } @InProceedings{Getov:1998:HPP, author = "Vladimir Getov and Susan Flynn-Hummel and Sava Mintchev", title = "High-Performance Parallel Programming in {Java}: Exploiting Native Libraries", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/hpjavampi.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/hpjavampi.ps", acknowledgement = ack-nhfb, } @InProceedings{Gladychev:1998:CRJ, author = "Pavel Gladychev and Ahmed Patel and Donal O'Mahony", title = "Cracking {RC5} with {Java} applets", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/rc5.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/rc5.ps", acknowledgement = ack-nhfb, } @InProceedings{Glossner:1998:JSP, author = "John Glossner and Jesse Thilo and Stamatis Vassiliadis", title = "{Java} Signal Processing: {FFTs} with bytecodes", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jfft.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jfft.ps", acknowledgement = ack-nhfb, } @InProceedings{Gosling:1998:EJN, author = "James Gosling", title = "Extensions to {Java} for Numerical Computation", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://java.sun.com/people/jag/FP.html", acknowledgement = ack-nhfb, } @InProceedings{Gray:1998:NLB, author = "Paul A. Gray and Vaidy S. Sunderam", title = "Native-Language-Based Distributed Computing Across Network and Filesystem Boundaries", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/icet.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/icet.ps", acknowledgement = ack-nhfb, } @InProceedings{Hirano:1998:PEP, author = "Satoshi Hirano and Yoshiji Yasu and Hirotaka Igarashi", title = "Performance Evaluation of Popular Distributed Object Technologies for {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/dots.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/dots.ps", acknowledgement = ack-nhfb, } @InProceedings{Jacob:1998:LSP, author = "Matthias Jacob and Michael Philippsen and Martin Karrenbach", title = "Large-Scale Parallel Geophysical Algorithms in {Java}: {A} Feasibility Study", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/veltran.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/veltran.ps", acknowledgement = ack-nhfb, } @InProceedings{Judd:1998:DDO, author = "Glenn Judd and Mark Clement and Quinn Snell", title = "{DOGMA}: {Distributed Object Group Management Architecture}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/dogma.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/dogma.ps", acknowledgement = ack-nhfb, } @InProceedings{Kahan:1998:HJF, author = "William Kahan and University of California at Berkeley", title = "How {Java}'s Floating-Point Hurts Everyone Everywhere", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/javahurt.pdf", acknowledgement = ack-nhfb, } @InProceedings{Karl:1998:BGB, author = "Holger Karl", title = "Bridging the Gap between Distributed Shared Memory and Message Passing", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/bridging.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/bridging.ps", acknowledgement = ack-nhfb, } @InProceedings{Keren:1998:APP, author = "Arie Keren and Amnon Barak", title = "Adaptive Placement of Parallel {Java} Agents in a Scalable Computing Cluster", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/agents.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/agents.ps", acknowledgement = ack-nhfb, } @InProceedings{Ki:1998:CSD, author = "Byeongseob Ki and Scott Klasky", title = "Collaborative Scientific Data Visualization", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/scivis.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/scivis.ps", acknowledgement = ack-nhfb, } @InProceedings{Krall:1998:MEH, author = "Andreas Krall and Mark Probst", title = "Monitors and Exceptions: How to implement {Java} efficiently", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/cacao.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/cacao.ps", acknowledgement = ack-nhfb, } @InProceedings{Miller:1998:MVJ, author = "Kevin Miller", title = "{Microsoft VM} for {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Invited talk.", acknowledgement = ack-nhfb, } @InProceedings{Sarmenta:1998:TBB, author = "Luis F. G. Sarmenta and Satoshi Hirano and Stephen A. Ward", title = "Towards {Bayanihan}: Building an Extensible Framework for Volunteer Computing Using {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/bayanihan.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/bayanihan.ps", acknowledgement = ack-nhfb, } @InProceedings{Schwab:1998:AJC, author = "Matthias Schwab and Joel Schroeder", title = "Algebraic {Java} classes for numerical optimization", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jest.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jest.ps", acknowledgement = ack-nhfb, } @InProceedings{Souder:1998:JCB, author = "Dan Souder and Morgan Herrington and Rajat P. Garg and Dennis DeRyke", title = "{JSPICE}: {A} Component-based Distributed {Java} Front-End For {SPICE}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/jspice.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/jspice.ps", acknowledgement = ack-nhfb, } @InProceedings{Takagi:1998:NMP, author = "Hiromitsu Takagi and Satoshi Matsuoka and Hidemoto Nakada and Satoshi Sekiguchi and Mitsuhisa Satoh and Umpei Nagashima", title = "{Ninflet}: a Migratable Parallel Objects Framework using {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/ninflet.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/ninflet.ps", acknowledgement = ack-nhfb, } @InProceedings{Thiruvathukal:1998:RRM, author = "George K. Thiruvathukal and Lovely S. Thomas and Andy T. Korczynski", title = "{Reflective Remote Method Invocation}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/reflective.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/reflective.ps", acknowledgement = ack-nhfb, } @InProceedings{vanHalderen:1998:FWB, author = "Berry A. W. van Halderen and Benno J. Overeinder", title = "{Fornax}: Web-based Distributed Discrete Event Simulation in {Java}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/fornax.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/fornax.ps", acknowledgement = ack-nhfb, } @InProceedings{Weber:1998:PCA, author = "Andreas Weber and Wolfgang K{\"u}chlin and Bernhard Eggers and Volker Simonis", title = "Parallel Computer Algebra Software as a {Web} Component", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/algebra.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/algebra.ps", acknowledgement = ack-nhfb, } @InProceedings{Yalamanchilli:1998:CPJ, author = "Narendar Yalamanchilli and William Cohen", title = "Communication Performance of {Java} based {Parallel Virtual Machines}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/passing.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/passing.ps", acknowledgement = ack-nhfb, } @InProceedings{Yelick:1998:THP, author = "Kathy Yelick and Luigi Semenzato and Geoff Pike and Carleton Miyamoto and Ben Liblit and Arvind Krishnamurthy and Paul Hilfinger and Susan Graham and David Gay and Phil Colella and Alex Aiken", title = "{Titanium}: {A} High-Performance {Java} Dialect", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/titanium.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/titanium.ps", acknowledgement = ack-nhfb, } @InProceedings{Zhu:1998:SUP, author = "Jinsong Zhu and Maria Toeroe and Victor Leung and Son Vuong", title = "Supporting Universal Personal Computing on {Internet} with {Java} and {CORBA}", crossref = "ACM:1998:AWJ", pages = "??--??", year = "1998", bibdate = "Thu Apr 27 10:43:08 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.cs.ucsb.edu/conferences/java98/papers/upc.pdf; http://www.cs.ucsb.edu/conferences/java98/papers/upc.ps", acknowledgement = ack-nhfb, } %%% ==================================================================== %%% FORTH conference papers @InProceedings{Drissel:1991:CSR, author = "William E. Drissel", title = "Common sense and real time executives", crossref = "Koopman:1991:PST", pages = "1--6", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p1-drissel/", acknowledgement = ack-nhfb, } @InProceedings{Frenger:1991:OKV, author = "Paul Frenger", title = "A one key video graphics terminal", crossref = "Koopman:1991:PST", pages = "7--12", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p7-frenger/", acknowledgement = ack-nhfb, } @InProceedings{Hand:1991:CFR, author = "Tom Hand", title = "Challenges for future real-time operating systems", crossref = "Koopman:1991:PST", pages = "13--16", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p13-hand/", acknowledgement = ack-nhfb, } @InProceedings{Hand:1991:DES, author = "Tom Hand", title = "Debugging embedded systems implemented in {C}", crossref = "Koopman:1991:PST", pages = "17--22", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p17-hand/", acknowledgement = ack-nhfb, } @InProceedings{Philip:1991:ECP, author = "Philip {Koopman, Jr.}", title = "Embedded control as a path to {Forth} acceptance", crossref = "Koopman:1991:PST", pages = "23--26", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p23-koopman/", acknowledgement = ack-nhfb, } @InProceedings{Lyons:1991:FMF, author = "Ken Lyons", title = "A fast method for finding an integer square root", crossref = "Koopman:1991:PST", pages = "27--30", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p27-lyons/", acknowledgement = ack-nhfb, } @InProceedings{Mikiten:1991:FRI, author = "Brian C. Mikiten and Shawn Mikiten and John L. Orr", title = "A {Forth}-based real-time in-flight monitoring system", crossref = "Koopman:1991:PST", pages = "31--34", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p31-mikiten/", acknowledgement = ack-nhfb, } @InProceedings{Morgenstern:1991:PF, author = "Leonard Morgenstern", title = "{Pascal} to {Forth}", crossref = "Koopman:1991:PST", pages = "35--36", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p35-morgenstern/", acknowledgement = ack-nhfb, } @InProceedings{Orr:1991:AOI, author = "John L. Orr and Brian C. Mikiten", title = "The acoustic orientation instrument: real-time digital audio control with {Forth}", crossref = "Koopman:1991:PST", pages = "37--44", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p37-orr/", acknowledgement = ack-nhfb, } @InProceedings{Pierce:1991:AFE, author = "Albert Pierce and Elizabeth Pierce", title = "The application of {Forth} engines as coprocessors for the {Macintosh} computer", crossref = "Koopman:1991:PST", pages = "45--48", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p45-pierce/", acknowledgement = ack-nhfb, } @InProceedings{Snow:1991:FDE, author = "Paul A. Snow and K. Michael Parker", title = "The fifth development environment", crossref = "Koopman:1991:PST", pages = "49--52", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p49-snow/", acknowledgement = ack-nhfb, } @InProceedings{VanWyck:1991:EAC, author = "Don {Van Wyck}", title = "The evolution of an access control system", crossref = "Koopman:1991:PST", pages = "53--56", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p53-van_wyck/", acknowledgement = ack-nhfb, } @InProceedings{Wehrer:1991:LFP, author = "Wayne J. Wehrer", title = "Low-cost, fast, portable embedded system development", crossref = "Koopman:1991:PST", pages = "57--62", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p57-wehrer/", acknowledgement = ack-nhfb, } @InProceedings{Bean:1991:MFW, author = "Warren Bean", title = "The marketing of {Forth} workshop report", crossref = "Koopman:1991:PST", pages = "63--70", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p63-bean/", acknowledgement = ack-nhfb, } @InProceedings{Wavrik:1991:UFC, author = "John J. Wavrik", title = "Use of {Forth} in a course in computer algebra", crossref = "Koopman:1991:PST", pages = "71--80", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p71-wavrik/", acknowledgement = ack-nhfb, } @InProceedings{Johnsen:1991:SPP, author = "Charles Johnsen and David L. Fox", title = "The silicon palimpsest: a programming model for electrically reconfigurable processors", crossref = "Koopman:1991:PST", pages = "81--94", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p81-johnsen/", acknowledgement = ack-nhfb, } @InProceedings{Brakefield:1991:CF, author = "James C. Brakefield", title = "Challenges for {Forth}", crossref = "Koopman:1991:PST", pages = "95--98", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p95-brakefield/", acknowledgement = ack-nhfb, } @InProceedings{Frenger:1991:FHN, author = "Paul Frenger", title = "A {Forth}-based hybrid neuron for neural nets", crossref = "Koopman:1991:PST", pages = "99--102", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p99-frenger/", acknowledgement = ack-nhfb, } @InProceedings{Furman:1991:PF, author = "Alan T. Furman", title = "Pipes in {Forth}", crossref = "Koopman:1991:PST", pages = "103--114", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p103-furman/", acknowledgement = ack-nhfb, } @InProceedings{Howerton:1991:FAW, author = "Charles P. Howerton", title = "{Forth} is alive and well and living in a hypercube somewhere in {Wyoming}", crossref = "Koopman:1991:PST", pages = "115--120", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p115-howerton/", acknowledgement = ack-nhfb, } @InProceedings{Sergeant:1991:FPF, author = "Frank Sergeant", title = "Files in {Pygmy Forth}", crossref = "Koopman:1991:PST", pages = "121--124", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p121-sergeant/", acknowledgement = ack-nhfb, } @InProceedings{William:1991:SSR, author = "George William {Shaw, II}", title = "{Sh-BOOM}: the sound of the {RISC} market changing", crossref = "Koopman:1991:PST", pages = "125--125", year = "1991", bibdate = "Tue May 4 05:57:50 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/259965/p125-shaw/", acknowledgement = ack-nhfb, } @InProceedings{Caffrey:1992:FSI, author = "Robert T. Caffrey and J. Thomas Riley and E. Hilsenrath and S. Hynes and J. Hui and S. Sjolander", title = "{Forth} in space: interfacing {SSBUV}, a scientific instrument, to the {Space Shuttle}", crossref = "ACM:1992:FPF", pages = "1--8", year = "1992", bibdate = "Tue May 4 05:54:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199200/p1-caffrey/", acknowledgement = ack-nhfb, keywords = "design; languages; performance", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH. {\bf J.2} Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Aerospace.", } @InProceedings{DiMeo:1992:FCE, author = "Frank N. DiMeo", title = "A {Forth} course for engineers", crossref = "ACM:1992:FPF", pages = "9--11", year = "1992", bibdate = "Tue May 4 05:54:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199200/p9-dimeo/", acknowledgement = ack-nhfb, keywords = "design; human factors; languages; management", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH. {\bf K.3.2} Computing Milieux, COMPUTERS AND EDUCATION, Computer and Information Science Education, Curriculum. {\bf J.2} Computer Applications, PHYSICAL SCIENCES AND ENGINEERING, Engineering.", } @InProceedings{Lee:1992:FSF, author = "Yong M. Lee and Edward Conjura", title = "First step to {Forth} engine construction", crossref = "ACM:1992:FPF", pages = "12--16", year = "1992", bibdate = "Tue May 4 05:54:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199200/p12-lee/", acknowledgement = ack-nhfb, keywords = "design; languages; performance", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH. {\bf D.4.7} Software, OPERATING SYSTEMS, Organization and Design. {\bf D.2.6} Software, SOFTWARE ENGINEERING, Programming Environments.", } @InProceedings{Sakharov:1992:CC, author = "Alexander Sakharov", title = "A {C-to-Forth} compiler", crossref = "ACM:1992:FPF", pages = "17--18", year = "1992", bibdate = "Tue May 4 05:54:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199200/p17-sakharov/", acknowledgement = ack-nhfb, keywords = "design; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH.", } @InProceedings{Gassanenko:1992:AAS, author = "Michael L. Gassanenko", title = "Alternative approaches to standardization and portability for {Forth}", crossref = "ACM:1992:FPF", pages = "27--31", year = "1992", bibdate = "Tue May 4 05:54:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199200/p27-gassanenko/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; standardization", subject = "{\bf D.3.0} Software, PROGRAMMING LANGUAGES, General, Standards. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTH.", } %%% ==================================================================== %%% POPL conference papers @InProceedings{Field:1990:LOL, author = "John Field", title = "On laziness and optimality in lambda interpreters: tools for specification and analysis", crossref = "ACM:1990:PPS", pages = "1--15", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p1-field/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages.", } @InProceedings{Lamping:1990:AOL, author = "John Lamping", title = "An algorithm for optimal lambda calculus reduction", crossref = "ACM:1990:PPS", pages = "16--30", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p16-lamping/", acknowledgement = ack-nhfb, keywords = "algorithms", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Abadi:1990:ES, author = "M. Abadi and P. L. Curien and J. J. Levy", title = "Explicit substitutions", crossref = "ACM:1990:PPS", pages = "31--46", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p31-abadi/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Reducibility and completeness. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Griffin:1990:FNC, author = "Timothy G. Griffin", title = "A formulae-as-type notion of control", crossref = "ACM:1990:PPS", pages = "47--58", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p47-griffin/", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Asperti:1990:IFP, author = "Andrea Asperti and Gian Luigi Ferrari and Roberto Gorrieri", title = "Implicative formulae in the proofs of computations' analogy", crossref = "ACM:1990:PPS", pages = "59--71", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p59-asperti/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @InProceedings{Moschovakis:1990:CP, author = "Yiannis N. Moschovakis", title = "Computable process", crossref = "ACM:1990:PPS", pages = "72--80", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p72-moschovakis/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Berry:1990:CAM, author = "Gerard Berry and Gerard Boudol", title = "The chemical abstract machine", crossref = "ACM:1990:PPS", pages = "81--94", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p81-berry/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.1.0} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, General. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, CCS.", } @InProceedings{Lafont:1990:IN, author = "Yves Lafont", title = "Interaction nets", crossref = "ACM:1990:PPS", pages = "95--108", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p95-lafont/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @InProceedings{Mitchell:1990:TTF, author = "John C. Mitchell", title = "Toward a typed foundation for method specialization and inheritance", crossref = "ACM:1990:PPS", pages = "109--124", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p109-mitchell/", acknowledgement = ack-nhfb, keywords = "languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\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, Type structure.", } @InProceedings{Cook:1990:IS, author = "William R. Cook and Walter Hill and Peter S. Canning", title = "Inheritance is not subtyping", crossref = "ACM:1990:PPS", pages = "125--135", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p125-cook/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", 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, Type structure. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Graver:1990:TSS, author = "Justin O. Graver and Ralph E. Johnson", title = "A type system for {Smalltalk}", crossref = "ACM:1990:PPS", pages = "136--150", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p136-graver/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Smalltalk. {\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.", } @InProceedings{Burn:1990:RBA, author = "Geoffrey Burn", title = "A relationship between abstract interpretation and projection analysis", crossref = "ACM:1990:PPS", pages = "151--156", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p151-burn/", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @InProceedings{Deutsch:1990:DLA, author = "Alan Deutsch", title = "On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications", crossref = "ACM:1990:PPS", pages = "157--168", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p157-deutsch/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\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. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Sekar:1990:SDS, author = "R. C. Sekar and Shaunak Pawagi and I. V. Ramarkrishnan", title = "Small domains spell fast strictness analysis", crossref = "ACM:1990:PPS", pages = "169--183", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p169-sekar/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @InProceedings{Marlowe:1990:EHA, author = "Thomas J. Marlowe and Barbara G. Ryder", title = "An efficient hybrid algorithm for incremental data flow analysis", crossref = "ACM:1990:PPS", pages = "184--196", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p184-marlowe/", acknowledgement = ack-nhfb, keywords = "algorithms", 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 G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @InProceedings{Heintze:1990:FPT, author = "Nevin Heintze and Joxan Jaffar", title = "A finite presentation theorem for approximating logic programs", crossref = "ACM:1990:PPS", pages = "197--209", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p197-heintze/", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{William:1990:PTP, author = "John H. William and Alexander Aiken and Edward L. Wimmers", title = "Program transformation in the presence of errors", crossref = "ACM:1990:PPS", pages = "210--217", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p210-william/", acknowledgement = ack-nhfb, keywords = "design; 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 F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FP.", } @InProceedings{Steele:1990:MAP, author = "Guy L. {Steele, Jr.}", title = "Making asynchronous parallelism safe for the world", crossref = "ACM:1990:PPS", pages = "218--231", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p218-steele/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", 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 D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming.", } @InProceedings{Saraswat:1990:CCP, author = "Vijay A. Saraswat and Martin Rinard", title = "Concurrent constraint programming", crossref = "ACM:1990:PPS", pages = "232--245", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p232-saraswat/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.2.10} Software, SOFTWARE ENGINEERING, Design**, Methodologies**. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Ramakrishnan:1990:PLP, author = "Raghu Ramakrishnan", title = "Parallelism in logic programs", crossref = "ACM:1990:PPS", pages = "246--260", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p246-ramakrishnan/", acknowledgement = ack-nhfb, keywords = "languages; theory", 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. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @InProceedings{Demmers:1990:CGC, author = "Alan Demmers and Mark Weiser and Barry Hayes and Hans Boehm and Daniel Bobrow and Scott Shenker", title = "Combining generational and conservative garbage collection: framework and implementations", crossref = "ACM:1990:PPS", pages = "261--269", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p261-demmers/", acknowledgement = ack-nhfb, keywords = "design; languages; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies.", } @InProceedings{Palem:1990:STI, author = "Krishna Palem and Barbara Simons", title = "Scheduling time-critical instructions on {RISC} machines", crossref = "ACM:1990:PPS", pages = "270--280", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p270-palem/", acknowledgement = ack-nhfb, keywords = "algorithms", subject = "{\bf C.1.3} Computer Systems Organization, PROCESSOR ARCHITECTURES, Other Architecture Styles. {\bf C.1.1} Computer Systems Organization, PROCESSOR ARCHITECTURES, Single Data Stream Architectures, RISC. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Reducibility and completeness. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computations on polynomials.", } @InProceedings{Ramesh:1990:AIP, author = "R. Ramesh and I. V. Ramakrishnan and D. S. Warren", title = "Automata-driven indexing of {Prolog} clauses", crossref = "ACM:1990:PPS", pages = "281--291", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p281-ramesh/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages.", } @InProceedings{Attie:1990:FHM, author = "Paul C. Attie and Nissim Francez and Orna Grumberg", title = "Fairness and hyperfairness in multi-party interactions", crossref = "ACM:1990:PPS", pages = "292--305", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p292-attie/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Gunter:1990:RTP, author = "Carl A. Gunter", title = "Relating total and partial correctness interpretations of non-deterministic programs", crossref = "ACM:1990:PPS", pages = "306--319", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p306-gunter/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General.", } @InProceedings{Russell:1990:ONK, author = "James R. Russell", title = "On oraclizable networks and {Kahn}'s principle", crossref = "ACM:1990:PPS", pages = "320--328", year = "1990", bibdate = "Fri May 03 11:56:10 2002", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p320-russell/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming.", } @InProceedings{Stark:1990:RCC, author = "Eugene W. Stark", title = "On the relations computable by a class of concurrent automata", crossref = "ACM:1990:PPS", pages = "329--340", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p329-stark/", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata.", } @InProceedings{Harper:1990:HMP, author = "Robert Harper and John C. Mitchell and Eugenio Moggi", title = "Higher-order modules and the phase distinction", crossref = "ACM:1990:PPS", pages = "341--354", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p341-harper/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\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, Denotational semantics. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Rouaix:1990:SRO, author = "Fran{\c{c}}ois Rouaix", title = "Safe run-time overloading", crossref = "ACM:1990:PPS", pages = "355--366", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p355-rouaix/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Thatte:1990:QT, author = "Satish Thatte", title = "Quasi-static typing", crossref = "ACM:1990:PPS", pages = "367--381", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p367-thatte/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", 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, Data types and structures. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @InProceedings{Mairson:1990:DMT, author = "Harry G. Mairson", title = "Deciding {ML} typability is complete for deterministic exponential time", crossref = "ACM:1990:PPS", pages = "382--401", year = "1990", bibdate = "Mon May 3 12:42:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/96709/p382-mairson/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance; theory; verification", 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.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Bounded-action devices. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @InProceedings{Sundaresh:1991:TIC, author = "R. S. Sundaresh and Paul Hudak", title = "A theory of incremental computation and its application", crossref = "ACM:1991:PPE", pages = "1--13", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p1-sundaresh/", acknowledgement = ack-nhfb, keywords = "algorithms; design", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.2.6} Software, SOFTWARE ENGINEERING, Programming Environments. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Parsing. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Consel:1991:SDS, author = "Charles Consel and Olivier Danvy", title = "Static and dynamic semantics processing", crossref = "ACM:1991:PPE", pages = "14--24", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p14-consel/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages", subject = "{\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, Denotational semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages.", } @InProceedings{Odersky:1991:HMD, author = "Martin Odersky", title = "How to make destructive updates less destructive", crossref = "ACM:1991:PPE", pages = "25--36", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p25-odersky/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\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. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Sekar:1991:PLS, author = "R. C. Sekar and Prateek Mishra and I. V. Ramakrishnan", title = "On the power and limitation of strictness analysis based on abstract interpretation", crossref = "ACM:1991:PPE", pages = "37--48", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p37-sekar/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @InProceedings{Abramsky:1991:RAS, author = "Samson Abramsky and Thomas P. Jensen", title = "A relational approach to strictness analysis for higher-order polymorphic functions", crossref = "ACM:1991:PPE", pages = "49--54", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p49-abramsky/", acknowledgement = ack-nhfb, keywords = "algorithms; 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 D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages.", } @InProceedings{Ferrante:1991:ACS, author = "J. Ferrante", title = "Automatic construction of sparse data flow evaluation graphs", crossref = "ACM:1991:PPE", pages = "55--66", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p55-ferrante/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", 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. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures.", } @InProceedings{Pingali:1991:DFG, author = "Keshav Pingali and Micah Beck and Richard Johnson and Mayan Moudgill and Paul Stodghill", title = "Dependence flow graphs: an algebraic approach to program dependencies", crossref = "ACM:1991:PPE", pages = "67--78", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p67-pingali/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\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 D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Pinter:1991:POP, author = "Shlomit S. Pinter and Ron Y. Pinter", title = "Program optimization and parallelization using idioms", crossref = "ACM:1991:PPE", pages = "79--92", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p79-pinter/", acknowledgement = ack-nhfb, keywords = "algorithms; design", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators. {\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.", } @InProceedings{Landi:1991:PAP, author = "William Landi and Barbara G. Ryder", title = "Pointer-induced aliasing: a problem taxonomy", crossref = "ACM:1991:PPE", pages = "93--103", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p93-landi/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FORTRAN. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques.", } @InProceedings{Amadio:1991:SRT, author = "Roberto M. Amadio and Luca Cardelli", title = "Subtyping recursive types", crossref = "ACM:1991:PPE", pages = "104--118", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p104-amadio/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", 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, Control primitives. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @InProceedings{Henglein:1991:CTI, author = "Fritz Henglein and Harry G. Mairson", title = "The complexity of type inference for higher-order lambda calculi", crossref = "ACM:1991:PPE", pages = "119--130", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p119-henglein/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML.", } @InProceedings{Harper:1991:RCB, author = "Robert Harper and Benjamin Pierce", title = "A record calculus based on symmetric concatenation", crossref = "ACM:1991:PPE", pages = "131--142", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p131-harper/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @InProceedings{Cai:1991:LMN, author = "Jiazhen Cai and Robert A. Paige", title = "Look ma, no hashing, and no arrays neither", crossref = "ACM:1991:PPE", pages = "143--154", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p143-cai/", acknowledgement = ack-nhfb, keywords = "algorithms; design", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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 G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Combinatorial algorithms. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @InProceedings{Clinger:1991:MW, author = "William Clinger", title = "Macros that work", crossref = "ACM:1991:PPE", pages = "155--162", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p155-clinger/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.4.3} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Operations on languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Macro and assembly languages.", } @InProceedings{Duba:1991:TFC, author = "Bruce Duba and Robert Harper and David MacQueen", title = "Typing first-class continuations in {ML}", crossref = "ACM:1991:PPE", pages = "163--173", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p163-duba/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\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, Type structure. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Queinnec:1991:DEC, author = "Christian Queinnec and Bernard Serpette", title = "A dynamic extent control operator for partial continuations", crossref = "ACM:1991:PPE", pages = "174--184", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p174-queinnec/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\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 D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Sitaram:1991:MCC, author = "Dorai Sitaram and Matthias Felleisen", title = "Models of continuations without continuations", crossref = "ACM:1991:PPE", pages = "185--196", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p185-sitaram/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\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.", } @InProceedings{Lucco:1991:PPC, author = "Steven Lucco and Oliver Sharp", title = "Parallel programming with coordination structures", crossref = "ACM:1991:PPE", pages = "197--208", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p197-lucco/", acknowledgement = ack-nhfb, keywords = "design; languages", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages.", } @InProceedings{Joung:1991:CFM, author = "Yuh-Jzer Joung and Scott A. Smolka", title = "Coordinating first-order multiparty interactions", crossref = "ACM:1991:PPE", pages = "209--220", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p209-joung/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, CSP. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sequencing and scheduling. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures.", } @InProceedings{Kleinman:1991:CDL, author = "Alon Kleinman and Yael Moscowitz and Amir Pnueli and Ehud Sharpio", title = "Communication with directed logic variables", crossref = "ACM:1991:PPE", pages = "221--232", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p221-kleinman/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs.", } @InProceedings{Crank:1991:PLC, author = "Erik Crank and Matthias Felleisen", title = "Parameter-passing and the lambda calculus", crossref = "ACM:1991:PPE", pages = "233--244", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p233-crank/", acknowledgement = ack-nhfb, keywords = "design; languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Riecke:1991:FAT, author = "Jon G. Riecke", title = "Fully abstract translations between functional languages", crossref = "ACM:1991:PPE", pages = "245--254", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p245-riecke/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Recursive function theory.", } @InProceedings{Maranget:1991:ODW, author = "Luc Maranget", title = "Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems", crossref = "ACM:1991:PPE", pages = "255--269", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p255-maranget/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Mitchell:1991:ESM, author = "John Mitchell and Sigurd Meldal and Neel Madhav", title = "An extension of standard {ML} modules with subtyping and inheritance", crossref = "ACM:1991:PPE", pages = "270--278", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p270-mitchell/", acknowledgement = ack-nhfb, keywords = "design; languages; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\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, Modules and interfaces. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Aiken:1991:STI, author = "Alex Aiken and Brian Murphy", title = "Static type inference in a dynamically typed language", crossref = "ACM:1991:PPE", pages = "279--290", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p279-aiken/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\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, Type structure. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems.", } @InProceedings{Leroy:1991:PTI, author = "Xavier Leroy and Pierre Weis", title = "Polymorphic type inference and assignment", crossref = "ACM:1991:PPE", pages = "291--302", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p291-leroy/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", 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 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, ML. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{Jouvelot:1991:ART, author = "Pierre Jouvelot and David Gifford", title = "Algebraic reconstruction of types and effects", crossref = "ACM:1991:PPE", pages = "303--310", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p303-jouvelot/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf I.1.2} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Algorithms, Algebraic algorithms.", } @InProceedings{Pratt:1991:MCG, author = "Vaughn Pratt", title = "Modeling concurrency with geometry", crossref = "ACM:1991:PPE", pages = "311--322", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p311-pratt/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.1.m} Software, PROGRAMMING TECHNIQUES, Miscellaneous. {\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, Geometrical problems and computations. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata.", } @InProceedings{Abadi:1991:LVC, author = "Martin Abadi and Gordon Plotkin", title = "A logical view of composition and refinement", crossref = "ACM:1991:PPE", pages = "323--332", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p323-abadi/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages.", } @InProceedings{Saraswat:1991:SFC, author = "Vijay A. Saraswat and Martin Rinard and Prakash Panangaden", title = "The semantic foundations of concurrent constraint programming", crossref = "ACM:1991:PPE", pages = "333--352", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p333-saraswat/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @InProceedings{Henzinger:1991:TPM, author = "Tom Henzinger and Zohar Manna and Amir Pnueli", title = "Temporal proof methodologies for real-time systems", crossref = "ACM:1991:PPE", pages = "353--366", year = "1991", bibdate = "Mon May 3 12:44:16 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/99583/p353-henzinger/", acknowledgement = ack-nhfb, keywords = "languages; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @InProceedings{Wadler:1992:EFP, author = "Philip Wadler", title = "The essence of functional programming", crossref = "ACM:1992:CRN", pages = "1--14", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p1-wadler/", abstract = "This paper explores the use monads to structure functional programs. No prior knowledge of monads or category theory is required. Monads increase the ease with which programs may be modified. They can mimic the effect of impure features such as exceptions, state, and continuations; and also provide effects not easily achieved with such features. The types of a program reflect which effects occur. Monads increase the ease with which programs may be modified. They can mimic the effect of impure features such as exceptions, state, and continuations; and also provide effects not easily achieved with such features. The types of a program reflect which effects occur. The first section is an extended example of the use of monads. A simple interpreter is modified to support various extra features: error messages, state, output, and non-deterministic choice. The second section describes the relation between monads and the continuation-passing style. The third section sketches how monads are used in a compiler for Haskell that is written in Haskell.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters.", } @InProceedings{Gonthier:1992:GOL, author = "Georges Gonthier and Mart{\'\i}n Abadi and Jean-Jacques L{\'e}vy", title = "The geometry of optimal lambda reduction", crossref = "ACM:1992:CRN", pages = "15--26", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p15-gonthier/", abstract = "Lamping discovered an optimal graph-reduction implementation of the [lambda]-calculus. Simultaneously, Girard invented the geometry of interaction, a mathematical foundation for operational semantics. In this paper, we connect and explain the geometry of interaction and Lamping's graphs. The geometry of interaction provides a suitable semantic basis for explaining and improving Lamping's system. On the other hand, graphs similar to Lamping's provide a concrete representation of the geometry of interaction. Together, they offer a new understanding of computation, as well as ideas for efficient and correct implementations.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\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, Algebraic approaches to semantics.", } @InProceedings{Filinski:1992:LC, author = "Andrzej Filinski", title = "Linear continuations", crossref = "ACM:1992:CRN", pages = "27--38", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p27-filinski/", abstract = "We present a functional interpretation of classical linear logic based on the concept of {\em linear continuations\/}. Unlike their non-linear counterparts, such continuations lead to a model of control that does not inherently impose any particular evaluation strategy. Instead, such additional structure is expressed by admitting closely controlled copying and discarding of continuations. We also emphasize the importance of classicality in obtaining computationally appealing categorical models of linear logic and propose a simple ``coreflective subcategory'' interpretation of the modality ``!''.", acknowledgement = ack-nhfb, keywords = "algorithms; design", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General.", } @InProceedings{Lang:1992:GCW, author = "Bernard Lang and Christian Queinnec and Jos{\'e} Piquer", title = "Garbage collecting the world", crossref = "ACM:1992:CRN", pages = "39--50", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p39-lang/", abstract = "Distributed symbolic computations involve the existence of {\em remote references\/} allowing an object, local to a processor, to designate another object located on another processor. To reclaim inaccessible objects is the non trivial task of a distributed Garbage Collector (GC). We present in this paper a new distributed GC algorithm which {\em (i)\/} is fault-tolerant, {\em (ii)\/} is largely independent of how a processor garbage collects its own data space, {\em (iii)\/} does not need centralized control nor global stop-the-world synchronization, {\em (iv)\/} allows for multiple concurrent active GCs, {\em (v)\/} does not require to migrate objects from processor to processor and {\em (vi)\/} eventually reclaims all inaccessible objects including distributed cycles. These results are mainly obtained through the concept of a {\em group\/} of processors (or processes). Processors of a same group cooperate together to a GC inside this group; this GC is conservative with respect to the outside of the group. A processor contributes to the global GC of all groups to which it belongs. Garbage collection on small groups reclaims quickly locally distributed garbage clusters, while garbage collection on large groups ultimately reclaims widely distributed garbage clusters, albeit more slowly. Groups can be reorganized dynamically, in particular to tolerate failures of some member processors. These properties make the algorithm usable on very large and evolving networks of processors. Other than distributed symbolic computations, possible applications include for example distributed file or database systems.", acknowledgement = ack-nhfb, keywords = "algorithms", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @InProceedings{Edelson:1992:MCC, author = "Daniel R. Edelson", title = "A mark-and-sweep collector {C++}", crossref = "ACM:1992:CRN", pages = "51--58", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p51-edelson/", abstract = "Our research is concerned with compiler-independent, tag-free garbage collection for the C++ programming language. We have previously presented a copying collector based on root registration. This paper presents a mark-and-sweep garbage collector that ameliorates shortcomings of the previous collector. We describe the two collectors and discuss why the new one is an improvement over the old one. We have tested this collector and a conservative collector in a VLSI CAD application, and this paper discusses the differences. Currently this prototype of the collector imposes too much overhead on our application. We intend to solve that problem, and then use the techniques described in this paper to implement a generational Mark-and-Sweep collector for C++.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C++. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies.", } @InProceedings{Ball:1992:OPT, author = "Thomas Ball and James R. Larus", title = "Optimally profiling and tracing programs", crossref = "ACM:1992:CRN", pages = "59--70", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p59-ball/", abstract = "This paper presents algorithms for inserting monitoring code to profile and trace programs. These algorithms greatly reduce the cost of measuring programs. Profiling counts the number of times each basic block in a program executes and has a variety of applications. Instruction traces are the basis for trace-driven simulation and analysis, and are also used in trace-driven debugging. The profiling algorithm chooses a placement of counters that is optimized---and frequently optimal---with respect to the expected or measured execution frequency of each basic block and branch in the program. The tracing algorithm instruments a program to obtain a subsequence of the basic block trace---whose length is optimized with respect to the program's execution---from which the entire trace can be efficiently regenerated. Both algorithms have been implemented and produce a substantial improvement over previous approaches. The profiling algorithm reduces the number of counters by a factor of two and the number of counter increments by up to a factor of four. The tracing algorithm reduces the file size and overhead of an already highly optimized tracing system by 20-40\%.", acknowledgement = ack-nhfb, keywords = "algorithms; performance", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Tracing. {\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.", } @InProceedings{Nielson:1992:BFP, author = "Hanne Riis Nielson and Flemming Nielson", title = "Bounded fixed point iteration", crossref = "ACM:1992:CRN", pages = "71--82", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p71-nielson/", abstract = "In the context of abstract interpretation we study the number of times a functional need to be unfolded in order to give the least fixed point. For the cases of the total or monotone functions we obtain an exponential bound and in the case of strict and additive (or distributive) functions we obtain a quadratic bound. These bounds are shown to be tight. Specialising the case of strict and additive functions to functionals of a form that would correspond to iterative programs we show that a linear bound is tight. We demonstrate the relation to several analyses studied in the literature (including strictness analysis).", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf G.1.5} Mathematics of Computing, NUMERICAL ANALYSIS, Roots of Nonlinear Equations, Iterative methods.", } @InProceedings{Cousot:1992:IDS, author = "Patrick Cousot and Radhia Cousot", title = "Inductive definitions, semantics and abstract interpretations", crossref = "ACM:1992:CRN", pages = "83--94", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p83-cousot/", abstract = "We introduce and illustrate a {\em specification method\/} combining rule-based inductive definitions, well-founded induction principles, fixed-point theory and abstract interpretation for general use in computer science. Finite as well as infinite objects can be specified, at various levels of details related by abstraction. General proof principles are applicable to prove properties of the specified objects. The specification method is illustrated by introducing G{\em [infinity] \/}SOS, a structured operational semantics generalizing Plotkin's [28] structured operational semantics (SOS) so as to describe the finite, as well as the infinite behaviors of programs in a uniform way and by constructively deriving inductive presentations of the other (relational, denotational, predicate transformers, \ldots{}) semantics from G{\em [infinity] \/}SOS by abstract interpretation.", acknowledgement = ack-nhfb, keywords = "algorithms", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Barbuti:1992:MPC, author = "Roberto Barbuti and Michael Codish and Roberto Giacobazzi and Giorgio Levi", title = "Modelling {Prolog} control", crossref = "ACM:1992:CRN", pages = "95--104", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p95-barbuti/", abstract = "The goal of this paper is to construct a semantic basis for the abstract interpretaion of Prolog programs. Prolog is a well-known logic programming language which applies a depth-first search strategy in order to provide a practical approximation of Horn clause logic. While pure logic programming has clean fix-point, model-theoretic and operational semantics the situation for Prolog is different. Difficulties in capturing the declarative meaning of Prolog programs have led to various semantic definitions which attempt to encode the search strategy in different mathematical frameworks. However semantic based analyses of Prolog are typically achieved by abstracting the more simple but less precise declarative semantics of pure logic Programs. We propose instead to model Prolog control in a simple constraint logic language which is presented together with its declarative and operational semantics. This enables us to maintain the usual approach to declarative semantics of logic programs while capturing control aspects such as search strategy and selection rule.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @InProceedings{Rinard:1992:SFJ, author = "Martin C. Rinard and Monica S. Lam", title = "Semantic foundations of {Jade}", crossref = "ACM:1992:CRN", pages = "105--118", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p105-rinard/", abstract = "Jade is a language designed to support coarse-grain parallelism on both shared and distributed address-space machines. Jade is data-oriented: a Jade programmer simply augments a sequential imperative program with declarations specifying how the program accesses data. A Jade implementation dynamically interprets the access specification to execute the program concurrently while enforcing the program's data dependence constraints, thus preserving the sequential semantics. This paper describes the Jade constructs and defines both a serial and a parallel formal operational semantics for Jade. The paper proves that the two semantics are equivalent.", acknowledgement = ack-nhfb, keywords = "languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming.", } @InProceedings{Berry:1992:SMC, author = "Dave Berry and Robin Milner and David N. Turner", title = "A semantics for {ML} concurrency primitives", crossref = "ACM:1992:CRN", pages = "119--129", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p119-berry/", abstract = "We present a set of concurrency primitives for Standard ML. We define these by giving the transitional semantics of a simple language. We prove that our semantics preserves the expected behaviour of sequential programs. We also show that we can define stores as processes, such that the representation has the same behaviour as a direct definition. These proofs are the first steps towards integrating our semantics with the full definition of Standard ML.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\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. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @InProceedings{Chow:1992:CAP, author = "Jyh-Herng Chow and William Ludwell {Harrison, III}", title = "Compile-time analysis of parallel programs that share memory", crossref = "ACM:1992:CRN", pages = "130--141", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p130-chow/", abstract = "Traditional optimization techniques for sequential programs are not directly applicable to parallel programs where concurrent activities may interfere with each other through shared variables. New compiler techniques must be developed to accommodate features found in parallel languages. In this paper, we use {\em abstract interpretation\/} to obtain useful properties of programs, e.g., side effects, data dependences, object lifetime and concurrent expressions, for a language that supports first-class functions, pointers, dynamic allocations and explicit parallelism through cobegin. These analyses may facilitate many applications, such as program optimization, parallelization, restructuring, memory management, and detecting access anomalies. Our semantics is based on a {\em labeled transition system\/} and is instrumented with {\em procedure strings\/} to record the procedural/concurrency movement along the program interpretation. We develop analyses in both concrete domains and abstract domains, and prove the correctness and termination of the abstract interpretation.", acknowledgement = ack-nhfb, keywords = "design; languages", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @InProceedings{Joung:1992:CSC, author = "Yuh-Jzer Joung and Scott A. Smolka", title = "A comprehensive study of the complexity of multiparty interaction", crossref = "ACM:1992:CRN", pages = "142--153", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p142-joung/", abstract = "We present a taxonomy of languages for multiparty interaction, which covers all proposals of which we are aware. Based on this taxonomy, we present a comprehensive analysis of the computational complexity of the {\em multiparty interaction implementation problem\/}, the problem of scheduling multiparty interactions in a given execution environment.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @InProceedings{Ohori:1992:CMM, author = "Atsushi Ohori", title = "A compilation method for {ML}-style polymorphic record calculi", crossref = "ACM:1992:CRN", pages = "154--165", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p154-ohori/", abstract = "Polymorphic record calculi have recently attracted much attention as a typed foundation for object-oriented programming. This is based on the fact that a function that selects a field {\em l\/} of a record can be given a polymorphic type that enables it to be applied to various records containing a field {\em l\/}. Recent studies have established techniques to develop an ML-style type inference algorithm for such a polymorphic type system. There seems to be, however, no established method to compile an ML-style polymorphic record calculus into efficient code. The purpose of this paper is to present one such method. We define a polymorphic record calculus as an extension of Damas and Miler's proof system for ML. For this calculus, we define an implementation calculus where records are represented as arrays of (references to) values and field selection is performed by direct indexing. To represent polymorphic field selection, the implementation calculus contains an abstraction mechanism over indexes. We then develop an algorithm to translate the polymorphic record calculus into the implementation calculus by refining a type inference algorithm; it simultaneously computes a principal type scheme in the polymorphic record calculus and a correct implementation term in the implementation calculus. The type inference is shown to be sound and complete in the sense of Damas-Milner's algorithm for ML. Moreover, the polymorphic type system is shown to be sound with respect to an operational semantics of the translated terms in the implementation calculus.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Remy:1992:TRC, author = "Didier R{\'e}my", title = "Typing record concatenation for free", crossref = "ACM:1992:CRN", pages = "166--176", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p166-remy/", abstract = "We show that any functional language with record extension possesses record concatenation for free. We exhibit a translation from the latter into the former. We obtain a type system for a language with record concatenation by composing the translation with type-checking in a language with record extension. We apply this method to a version of ML with a record extension and obtain an extension of ML with either asymmetric or symmetric concatenation. The latter extension is simple, flexible and has a very efficient type inference algorithm in practice. Concatenation together with removal of fields needs one more construct than extension of records. It can be added to the version of ML with record extension. However, many typed languages with record cannot type such a construct. The method still applies to them, producing type systems for record concatenation without removal of fields. Object systems also benefit of the encoding which shows that multiple inheritance does not actually require the concatenation of records but only their extension.", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Leroy:1992:UOP, author = "Xavier Leroy", title = "Unboxed objects and polymorphic typing", crossref = "ACM:1992:CRN", pages = "177--188", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p177-leroy/", abstract = "This paper presents a program transformation that allows languages with polymorphic typing (e.g. ML) to be implemented with unboxed, multi-word data representations. The transformation introduces coercions between various representations, based on a typing derivation. A prototype ML compiler utilizing this transformation demonstrates important speedups.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\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, Compilers. {\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, Operational semantics. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{Tofte:1992:PSH, author = "Mads Tofte", title = "Principal signatures for higher-order program modules", crossref = "ACM:1992:CRN", pages = "189--199", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p189-tofte/", abstract = "Under the Damas-Milner type discipline for functional languages, every expression has principal type, if it elaborates at all. In the type discipline for ML Modules, a signature expression has a principal signature, if it elaborates at all. However, while functions can be higher-order in ML, parameterised modules in ML are first-order only. We present a type discipline for a skeletal higher-order module language which has principal signatures. Sharing and multiple views of structures are handled in a manner which is compatible with the semantics of the first-order ML modules.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", 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, ML. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Cosmo:1992:TIT, author = "Robero Di Cosmo", title = "Type isomorphisms in a type-assignment framework", crossref = "ACM:1992:CRN", pages = "200--210", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p200-cosmo/", abstract = "This paper contains a full treatment of isomorphic types for languages equipped with an ML style polymorphic type inference mechanism. Surprisingly enough the results obtained contradict the common-place feeling that (the core of) ML is a subset of second order [lambda]-calculus: we can provide an isomorphism of types that holds in the core ML language, but not in second order [lambda]-calculus. This new isomorphism not only allows to provide a complete (and decidable) axiomatisation of all the type isomorphic in ML style languages, a relevant issue for the {\em type as specifications\/} paradigm in library searches, but also suggest a natural extension that in a sense completes the type-inference mechanism in ML. This extension is easy to implement and allows to get a further insight in the nature of the {\em let\/} polymorphic construct.", acknowledgement = ack-nhfb, keywords = "languages; theory", 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, ML. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Farnum:1992:PTA, author = "Charles Farnum", title = "Pattern-based tree attribution", crossref = "ACM:1992:CRN", pages = "211--222", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p211-farnum/", abstract = "Attribute grammars have been used for many language-oriented tasks, including the formal description of semantics and the implementation of compilation tasks from simple type checking through code generation. Despite their successful use, attribute grammars have some disadvantages, including the monolithic nature of the grammar and the fixed factoring of all attribute descriptions by a single set of grammar productions. {\em Attribute pattern sets\/} provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis. Attribute pattern sets can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system, making it straightforward to convert many of the practical results from attribute grammar theory to similar results for attribute pattern sets.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Farrow:1992:CAG, author = "R. Farrow and T. J. Marlowe and D. M. Yellin", title = "Composable attribute grammars: support for modularity in translator design and implementation", crossref = "ACM:1992:CRN", pages = "223--234", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p223-farrow/", abstract = "This paper introduces Composable Attribute Grammars (CAGs), a formalism that extends classical attribute grammars to allow for the modular composition of translation specifications and of translators. CAGs bring to complex translator writing systems the same benefits of modularity found in modern programming languages, including comprehensibility, reusability, and incremental meta-compilation. A CAG is built from several smaller {\em component AGs\/}, each of which solves a particular subproblem, such as name analysis or register allocation. A component AG is based upon a simplified phrase-structure that reflects the properties of its subproblem rather than the phrase-structure of the source language. Different component phrase-structures for various subproblems are combined by mapping them into a phrase-structure for the source language. Both input and {\em output\/} attributes can be associated with the terminal symbols of a component AG. Output attributes enable the results of solving a subproblem to be distributed back to anywhere that originally contributed part of the subproblem, e.g. transparently distributing the results of global name analysis back to every symbolic reference in the source program. After introducing CAGs by way of an example, we provide a formal definition of CAGs and their semantics. We describe a subclass of CAGs, called separable CAGs, that have favorable implementation properties. We discuss the novel aspects of CAGs, compare them to other proposals for inserting modularity into attribute grammars, and relate our experience using CAGs in the Linguist translator-writing system.", acknowledgement = ack-nhfb, keywords = "design; 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 F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Bates:1992:RSL, author = "Joseph Bates and Alon Lavie", title = "Recognizing substrings of {LR(k)} languages in linear time", crossref = "ACM:1992:CRN", pages = "235--245", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p235-bates/", abstract = "LR parsing techniques have long been studied as efficient and powerful methods for processing context free languages. A linear time algorithm for recognizing languages representable by LR({\em k\/}) grammars has long been known. Recognizing substrings of a context-free language is at least as hard as recognizing full strings of the language, as the latter problem easily reduces to the former. In this paper we present a linear time algorithm for recognizing substrings of LR({\em k\/}) languages, thus showing that the substring recognition problem for these languages is no harder than the full string recognition problem. An interesting data structure, the Forest Structured Stack, allows the algorithm to track all possible parses of a substring without loosing the efficiency of the original LR parser. We present the algorithm, prove its correctness, analyze its complexity, and mention several applications that have been constructed.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing.", } @InProceedings{Gupta:1992:GDP, author = "Rajiv Gupta", title = "Generalized dominators and post-dominators", crossref = "ACM:1992:CRN", pages = "246--257", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p246-gupta/", abstract = "The notion of dominators is generalized to include multiple-vertex dominators in addition to single-vertex dominators. A multiple-vertex dominator of a vertex is a group of vertices that collectively dominate the vertex. Existing algorithms compute immediate single-vertex dominators, and an algorithm for computing immediate multiple-vertex dominators is presented in this paper. The immediate dominator information is expressed in the form of a directed acyclic graph referred to as the dominator DAG or the DDAG. The generalized dominator set of any vertex dominators of the vertex, can be computed from the DDAG. The single-vertex dominator information restricts the propagation of loop invariant statements and array bound checks out of loops. Generalized dominator information avoids these restrictions. In addition, it can be used to identify natural loops and improve the existing optimization algorithm for code hoisting. The dual notion of generalized post-dominators can be used for computing control dependences and automatic generation of compact test suites for programs.", acknowledgement = ack-nhfb, keywords = "algorithms; verification", subject = "{\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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Jorgensen:1992:GCL, author = "Jesper J{\o}rgensen", title = "Generating a compiler for a lazy language by partial evaluation", crossref = "ACM:1992:CRN", pages = "258--268", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p258-jorgensen/", abstract = "Compiler generation is often emphasized as being the most important application of partial evaluation. But most of the larger practical applications have, to the best of our knowledge, been outside this field. Especially, no one has generated compilers for languages other than small languages. This paper describes a large application of partial evaluation where a realistic compiler was generated for a strongly typed lazy functional language. The language, that was called BAWL, was modeled after the language in Bird and Wadler [BW88] and is a combinator language with pattern matching, guarded alternatives, local definitions and list comprehensions. The paper describes the most important techniques used, especially the binding time improvements needed in order to get small and efficient target programs. Finally, the performance of the compiler is compared with two compilers for similar languages: Miranda and LML.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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 D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @InProceedings{Nirkhe:1992:PEH, author = "Vivek Nirkhe and William Pugh", title = "Partial evaluation of high-level imperative programming languages with applications in hard real-time systems", crossref = "ACM:1992:CRN", pages = "269--280", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p269-nirkhe/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", } @InProceedings{Ma:1992:PS, author = "QingMing Ma", title = "Parametricity as subtyping", crossref = "ACM:1992:CRN", pages = "281--292", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p281-ma/", abstract = "A polymorphic function is parametric if it has uniform behavior for all type parameters. This property is useful when writing, reasoning about, and compiling functional programs. We show how to syntactically define and reason about parametricity in a language with intersection types and bounded polymorphism. Within this framework, parametricity is subtyping, and reasoning about parametricity becomes reasoning about the well-typedness of terms. This work also demonstrates the expressiveness of languages that combine intersection types and bounded polymorphism.", acknowledgement = ack-nhfb, keywords = "algorithms; 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 F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Lincoln:1992:AAT, author = "Patrick Lincoln and John C. Mitchell", title = "Algorithmic aspects of type inference with subtypes", crossref = "ACM:1992:CRN", pages = "293--304", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p293-lincoln/", abstract = "We study the complexity of type inference for programming languages with subtypes. There are three language variations that effect the problem: (i) basic functions may have polymorphic or more limited types, (ii) the subtype hierarchy may be fixed or vary as a result of subtype declarations within a program, and (iii) the subtype hierarchy may be an arbitrary partial order or may have a more restricted form, such as a tree or lattice. The naive algorithm for infering a most general polymorphic type, undervariable subtype hypotheses, requires deterministic exponential time. If we fix the subtype ordering, this upper bound grows to nondeterministic exponential time. We show that it is NP-hard to decide whether a lambda term has a type with respect to a fixed subtype hierarchy (involving only atomic type names). This lower bound applies to monomorphic or polymorphic languages. We give PSPACE upper bounds for deciding polymorphic typability if the subtype hierarchy has a lattice structure or the subtype hierarchy varies arbitrarily. We also give a polynomial time algorithm for the limited case where there are of no function constants and the type hierarchy is either variable or any fixed lattice.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Reducibility and completeness.", } @InProceedings{Pierce:1992:BQU, author = "Benjamin C. Pierce", title = "Bounded quantification is undecidable", crossref = "ACM:1992:CRN", pages = "305--315", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p305-pierce/", abstract = "{\em F\/}\$ Curien and Ghelli proved the partial correctness of a recursive procedure for computing minimal types of {\em F\/}\$ This question is settled here in the negative, using a reduction from the halting problem for two-counter Turing machines to show that the subtype relation of {\em F\/}\$", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Bruce:1992:PMS, author = "Kim Bruce and John C. Mitchell", title = "{PER} models of subtyping, recursive types and higher-order polymorphism", crossref = "ACM:1992:CRN", pages = "316--327", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p316-bruce/", acknowledgement = ack-nhfb, keywords = "languages; theory", 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 F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Cartwright:1992:OSF, author = "Robert Cartwright and Matthias Felleisen", title = "Observable sequentiality and full abstraction", crossref = "ACM:1992:CRN", pages = "328--342", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p328-cartwright/", abstract = "One of the major challenges in denotational semantics is the construction of fully abstract models for {\em sequential\/} programming languages. For the past fifteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus. Unlike most practical languages, PCF has no facilities for {\em observing\/} and {\em exploiting\/} the evaluation order of arguments in procedures. Since we believe that such facilities are crucial for understanding the nature of sequential computation, this paper focuses on a sequential extension of PCF (called SPCF) that includes two classes of control operators: error generators enable us to construct a fully abstract model for SPCF that interprets higher types as sets of {\em error-sensitive\/} functions instead of {\em continuous\/} functions. The error-sensitve functions form a Scott domain that is isomorphic to a domain of decision trees. We believe that the same construction will yield fully abstract models for functional languages with different control operators for observing the order of evaluation.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\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, Trees.", } @InProceedings{Clarke:1992:MCA, author = "Edmund M. Clarke and Orna Grumberg and David E. Long", title = "Model checking and abstraction", crossref = "ACM:1992:CRN", pages = "343--354", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p343-clarke/", abstract = "We describe a method for using abstraction to reduce the complexity of temporal logic model checking. The basis of this method is a way of constructing an abstract model of a program without ever examining the corresponding unabstracted model. We show how this abstract model can be used to verify properties of the original program. We have implemented a system based on these techniques, and we demonstrate their practicality using a number of examples, including a pipelined ALU circuit with over 101300 states.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Validation.", } @InProceedings{Jagadeesan:1992:ASH, author = "Radha Jagadeesan and Keshav Pingali", title = "Abstract semantics for a higher-order functional language with logic variables", crossref = "ACM:1992:CRN", pages = "355--366", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p355-jagadeesan/", acknowledgement = ack-nhfb, keywords = "languages", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @InProceedings{Snir:1993:CAP, author = "Marc Snir", title = "Computer architectures and programming models for scalable parallel computing (abstract)", crossref = "ACM:1993:CRT", pages = "1--1", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p1-snir/", acknowledgement = ack-nhfb, keywords = "algorithms; design; performance", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf C.1.2} Computer Systems Organization, PROCESSOR ARCHITECTURES, Multiple Data Stream Architectures (Multiprocessors), Parallel processors**. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Maydan:1993:AFA, author = "Dror E. Maydan and Saman P. Amarasinghe and Monica S. Lam", title = "Array-data flow analysis and its use in array privatization", crossref = "ACM:1993:CRT", pages = "2--15", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p2-maydan/", abstract = "Data-flow analysis of scalar variables and data dependence analysis on array elements are two important program analyses used in optimizing and parallelizing compilers. Traditional data-flow analysis models accesses of array elements simply as accesses to the entire array, and is inadequate for parallelizing loops in array-based programs. On the other hand, data dependence analysis differentiates between different array elements but is flow-insensitive. This paper studies the combination of these two analyses---data-flow analyses---data-flow analysis of accesses to individual array elements. The problem of finding precise array dataflow information in the domain of loop nests where the loop bounds and array indices are affine functions of loop indices was first formulated by Feautrier. Feautrier's algorithm, based on parametric integer programming techniques, is general but inefficient. This paper presents an efficient algorithm that can find the same precise information for many of the programs found in practice. In this paper, we argue that data-flow analysis of individual array elements is necessary for effective automatic parallelization. In particular, we demonstrate the use of array data-flow analysis in an important optimization known as array privatization. By demonstrating that array data-flow analysis can be computed efficiently and by showing the importance of the optimizations enabled by the analysis, this paper suggests that array data-flow analysis may become just as important in future optimizing and parallelizing compilers as data-flow and data dependence analysis are in today's compilers.", acknowledgement = ack-nhfb, keywords = "algorithms", 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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @InProceedings{Chatterjee:1993:AAA, author = "Siddhartha Chatterjee and John R. Gilbert and Robert Schreiber and Shang-Hua Teng", title = "Automatic array alignment in data-parallel programs", crossref = "ACM:1993:CRT", pages = "16--28", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p16-chatterjee/", abstract = "Data-parallel languages like Fortran 90 express parallelism in the form of operations on data aggregates such as arrays. Misalignment of the operands of an array operation can reduce program performance on a distributed-memory parallel machine by requiring nonlocal data accesses. Determining array alignments that reduce communication is therefore a key issue in compiling such languages. We present a framework for the automatic determination of array alignments in data-parallel languages such as Fortran 90. Our language model handles array sectioning, reductions, spreads, transpositions, and masked operations. We decompose alignment functions into three constituents: axis, stride, and offset. For each of these subproblems, we show how to solve the alignment problem for a basic block of code, possibly containing common subexpressions. Alignments are generated for all array objects in the code, both named program variables and intermediate results. The alignments obtained by our algorithms are more general than those provided by the ``owner-computes'' rule. Finally, we present some ideas for dealing with control flow, replication, and dynamic alignments that depend on loop induction variables.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\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, Trees. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Fortran 90. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @InProceedings{Ning:1993:NFR, author = "Qi Ning and Guang R. Gao", title = "A novel framework of register allocation for software pipelining", crossref = "ACM:1993:CRT", pages = "29--42", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p29-ning/", abstract = "Although software pipelining has been proposed as one of the most important loop scheduling methods, simultaneous scheduling and register allocation is less understood and remains an open problem [28]. The objective of this paper is to develop a unified algorithmic framework for concurrent scheduling and register allocation to support time-optimal software pipelining. A key intuition leading to this surprisingly simple formulation and its efficient solution is the association of maximum computation rate of a program graph with its {\em critical cycles\/} due to Reiter's pioneering work on Karp-Miller computation graphs [29]. In particular, our method generalizes the work by Callahan, Carr and Kennedy on {\em scalar expansion\/}[6], the work by Lam on {\em modular variable expansion\/} for software pipelined loops [20], and the work by Rau et al. on register allocation for modulo scheduled loops[28].", acknowledgement = ack-nhfb, keywords = "algorithms; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization, Integer programming.", } @InProceedings{Odersky:1993:CNA, author = "Martin Odersky and Dan Rabin and Paul Hudak", title = "Call by name, assignment, and the lambda calculus", crossref = "ACM:1993:CRT", pages = "43--56", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p43-odersky/", abstract = "We define an extension of the call-by-name lambda calculus with additional constructs and reduction rules that represent mutable variables and assignments. The extended calculus has neither a concept of an explicit store nor a concept of evaluation order; nevertheless, we show that programs in the calculus can be implemented using a single-threaded store. We also show that the new calculus has the Church--Rosser property and that it is a conservative extension of classical lambda calculus with respect to operational equivalence; that is, all algebraic laws of the functional subset are preserved.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Weeks:1993:OAP, author = "Stephen Weeks and Matthias Felleisen", title = "On the orthogonality of assignments and procedures in {Algol}", crossref = "ACM:1993:CRT", pages = "57--70", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p57-weeks/", abstract = "According to folklore, Algol is an ``orthogonal'' extension of a simple imperative programming language with a call-by-name functional language. The former contains assignments, branching constructs, and compound statements; the latter is based on the typed [lambda]-calculus. In an attempt to formalize the claim of ``orthogonality'', we define a simple version of Algol and an extended [lambda]-calculus. The calculus includes the {\em full\/} [beta]-rule and rules for the reduction of assignment statements and commands. It has the usual properties, e.g., it satisfies a Church--Rosser and Strong Normalization Theorem. In support of the claim that the imperative and functional components are orthogonal to each other, we show that the proofs of these theorems are combinations of separate Church--Rosser and Strong Normalization theorems for each sublanguage. An acclaimed consequence of Algol's orthogonal design is the idea that the evaluation of a program has two distinct phases. The first phase corresponds to an unrolling of the program according to the usual [beta] and fixpoint reductions, which provide the formal counterpart to Algol's famous copy rule. The result of this phase is essentially an imperative program. The second phase executes the output of the first phase in the imperative fashion of a stack machine. Given our calculus, we can prove a Postponement Theorem and can thus formalize this phase separation.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL-60. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Jones:1993:IFP, author = "Simon L. Peyton Jones and Philip Wadler", title = "Imperative functional programming", crossref = "ACM:1993:CRT", pages = "71--84", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p71-peyton_jones/", abstract = "We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\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, Control primitives.", } @InProceedings{Berry:1993:CRP, author = "G. Berry and S. Ramesh and R. K. Shyamasundar", title = "Communicating reactive processes", crossref = "ACM:1993:CRT", pages = "85--98", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p85-berry/", abstract = "We present a new programming paradigm called Communicating Reactive Processes or CRP that unifies the capabilities of asynchronous and synchronous concurrent programming languages. Asynchronous languages such as CSP, OCCAM, or ADA are well-suited for distributed algorithms; their processes are loosely coupled and communication takes time. The ESTEREL synchronous language is dedicated to reactive systems; its processes are tightly coupled and deterministic, communication being realized by instantaneous broadcasting. Complex applications such as process of robot control require to couple both forms of concurrency, which is the object of CRP. A CRP program consists of independent locally reactive ESTEREL nodes that communicate with each other by CSP rendezvous. CRP faithfully extends both ESTEREL and CSP and adds new possibilities such as precise local watchdogs on rendezvous. We present the design of CRP, its semantics, a translation into classical process calculi for program verification, and application example, and implementation issues.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Modules, packages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, CSP. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, CSP.", } @InProceedings{Ohori:1993:SCP, author = "Atsushi Ohori and Kazuhiko Kato", title = "Semantics for communication primitives in a polymorphic language", crossref = "ACM:1993:CRT", pages = "99--112", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p99-ohori/", abstract = "We propose a method to extend an ML-style polymorphic language with transparent communication primitives, and give their precise operational semantics. These primitives allow {\em any\/} polymorphic programs definable in ML to be used remotely in a manner completely transparent to the programmer. Furthermore, communicating programs may be based on different architecture and use different data representations. We define a polymorphic functional calculus with transparent communication primitives, which we call {\bf dML}, as an extension of Damas and Milner's proof system for ML. We then develop an algorithm to translate {\bf dML} to a ``core'' language containing only low-level communication primitives that are readily implementable in most of distributed environments. To establish the {\em type safety\/} of communicating programs, we define an operational semantics of the core language and prove that the polymorphic type system of {\bf dML} is sound with respect to the operational semantics of the translated terms of the core language.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\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, Type structure. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML.", } @InProceedings{Doligez:1993:CGG, author = "Damien Doligez and Xavier Leroy", title = "A concurrent, generational garbage collector for a multithreaded implementation of {ML}", crossref = "ACM:1993:CRT", pages = "113--123", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p113-doligez/", abstract = "This paper presents the design and implementation of a ``quasi real-time'' garbage collector for Concurrent Caml Light, an implementation of ML with threads. This two-generation system combines a fast, asynchronous copying collector on the young generation with a non-disruptive concurrent marking collector on the old generation. This design crucially relies on the ML compile-time distinction between mutable and immutable objects.", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; languages; performance", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, LML.", } @InProceedings{Lawall:1993:SSC, author = "Julia L. Lawall and Olivier Danvy", title = "Separating stages in the continuation-passing style transformation", crossref = "ACM:1993:CRT", pages = "124--136", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p124-lawall/", abstract = "The continuation-passing style (CPS) transformation is powerful but complex. Our thesis is that this transformation is in fact {\em compound\/}, and we set out to {\em stage\/} it. We factor the CPS transformation into several steps, separating aspects in each step: (1) Intermediate values are named; (2) Continuations are introduced; (3) Sequencing order is decided and administrative reductions are performed. Step 1 determines the evaluation order ({\em e.g.\/}, call-by-name or call-by-value). Step 2 isolates the introduction of continuations and is expressed with local, structure-preserving rewrite rules --- a novel aspect standing in sharp contrast with the usual CPS transformations. Step 3 determines the ordering of continuations ({\em e.g.\/}, left-to-right or right-to-left evaluation) and leads to the familiar-looking continuation-passing terms. Step 2 is completely reversible and Steps 1 and 3 form Galois connections. Together they lead to the direct style (DS) transformation of our earlier work (including first-class continuations): (1) Intermediate continuations are named and sequencing order is abstracted; (2) Second-class continuations are eliminated; (3) Administrative reductions are performed. A subset of these transformations can leverage program manipulation systems: CPS-based compilers can modify sequencing to improve {\em e.g.\/}, register allocation; static program analyzers can yield more precise results; and overspecified CPS programs can be rescheduled. Separating aspects of the CPS transformation also enables a new programming style, with applications to nondeterministic programming. As a byproduct, our work also suggests a new continuation semantics for unspecified sequencing orders in programming languages ({\em e.g.\/}, Scheme).", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Wand:1993:SCB, author = "Mitchell Wand", title = "Specifying the correctness of binding-time analysis", crossref = "ACM:1993:CRT", pages = "137--143", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p137-wand/", abstract = "Mogensen has exhibited a very compact partial evaluator for the pure lambda calculus, using binding-time analysis followed by specialization. We give a correctness criterion for this partial evaluator and prove its correctness relative to this specification. We show that the conventional properties of partial evaluators, such as the Futamura projections, are consequences of this specification. By considering both a flow analysis and the transformation it justifies together, this proof suggests a framework for the incorporating flow analyses into verified compilers.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Launchbury:1993:NSL, author = "John Launchbury", title = "A natural semantics for lazy evaluation", crossref = "ACM:1993:CRT", pages = "144--154", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p144-launchbury/", abstract = "We define an operational semantics for lazy evaluation which provides an accurate model for sharing. The only computational structure we introduce is a set of bindings which corresponds closely to a heap. The semantics is set at a considerably higher level of abstraction than operational semantics for particular abstract machines, so is more suitable for a variety of proofs. Furthermore, because a heap is explicitly modelled, the semantics provides a suitable framework for studies about space behaviour of terms under lazy evaluation.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Reynolds:1993:ILR, author = "John C. Reynolds", title = "An introduction to logical relations and parametric polymorphism (abstract)", crossref = "ACM:1993:CRT", pages = "155--156", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p155-reynolds/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", } @InProceedings{Abadi:1993:FPP, author = "Mart{\'\i}n Abadi and Luca Cardelli and Pierre-Louis Curien", title = "Formal parametric polymorphism", crossref = "ACM:1993:CRT", pages = "157--170", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p157-abadi/", abstract = "A polymorphic function is parametric if its behavior does not depend on the type at which it is instantiated. Starting with Reynolds' work, the study of parametricity is typically semantic. In this paper, we develop a syntactic approach to parametricity, and a formal system that embodies this approach: system {\em R \/}. Girard's system F deals with terms and types; {\em R \/} is an extension of F that deals also with relations between types. In {\em R \/}**, it is possible to derive theorems about functions from their types, or ``theorems for free'', as Wadler calls them. An easy ``theorem for free'' asserts that the type {$\forall$XX$\rightarrow$} Bool contains only constant functions; this is not provable in F. There are many harder and more substantial examples. Various metatheorems can also be obtained, such as a syntactic version of Reynolds' abstraction theorem.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{OHearn:1993:RPL, author = "P. W. O'Hearn and R. D. Tennent", title = "Relational parametricity and local variables", crossref = "ACM:1993:CRT", pages = "171--184", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p171-o_hearn/", abstract = "J. C. Reynolds suggested that Strachey's intuitive concept of ``parametric'' (i.e., uniform) polymorphism is closely linked to {\em representation independence\/}, and used logical relations to formalize this principle in languages with type variables and user-defined types. Here, we use relational parametricity to address long-standing problems with the semantics of local-variable declarations, by showing that interactions between local and non-local entities satisfy certain relational criteria. The new model is based on a cartesian closed category of ``relation-preserving'' functors and natural transformations which is induced by a suitable category of ``possible worlds'' with relations assigned to its objects and morphisms. The semantic interpretation supports straightforward validations of all the test equivalences that have been proposed in the literature, and encompasses standard methods of reasoning about data representations; however, it is not known whether it is fully abstract.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\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 D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL.", } @InProceedings{Riecke:1993:ARC, author = "Jon G. Riecke and Ramesh Subrahmanyam", title = "Algebraic reasoning and completeness in typed languages", crossref = "ACM:1993:CRT", pages = "185--195", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p185-riecke/", abstract = "We consider the following problem in proving observational congruences in functional languages: given a call-by-name language based on the simply-typed [lambda]-calculus with algebraic operations axiomatized by algebraic equations E, is the set of observational congruences between terms exactly those provable from ([beta]), [eegr], and E? We find conditions for determining whether [beta][eegr]E-equational reasoning is complete for proving the observational congruences between such terms. We demonstrate the power and generality of the theorems by presenting a number of easy corollaries for particular algebras.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", } @InProceedings{Klarlund:1993:GT, author = "Nils Klarlund and Michael I. Schwartzbach", title = "Graph types", crossref = "ACM:1993:CRT", pages = "196--205", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p196-klarlund/", abstract = "Recursive data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compile-time and exploited to automatically generate code for building, copying, comparing, and traversing values without loss of efficiency. However, such values are always tree shaped, which is a major obstacle to practical use. We propose a notion of graph types, which allow common shapes, such as doubly-linked lists or threaded trees, to be expressed concisely and efficiently. We define regular languages of routing expressions to specify relative addresses of extra pointers in a canonical spanning tree. An efficient algorithm for computing such addresses is developed. We employ a second-order monadic logic to decide well-formedness of graph type specifications. This logic can also be used for automated reasoning about pointer structures.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", 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, Data types and structures. {\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, Trees.", } @InProceedings{Harper:1993:EPC, author = "Robert Harper and Mark Lillibridge", title = "Explicit polymorphism and {CPS} conversion", crossref = "ACM:1993:CRT", pages = "206--219", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p206-harper/", abstract = "We study the typing properties of CPS conversion for an extension of F\omega with control operators. Two classes of evaluation strategies are considered, each with call-by-name and call-by-value variants. Under the ``standard'' strategies, constructor abstractions are values, and constructor applications can lead to non-trivial control effects. In contrast, the ``ML-like'' strategies evaluate beneath constructor abstractions, reflecting the usual interpretation of programs in languages based on implicit polymorphism. Three continuation passing style sub-languages are considered, one on which the standard strategies coincide, one on which the ML-like strategies coincide, and one on which all strategies coincide. Compositional, type-preserving CPS transformation algorithms are given for the standard strategies, resulting in terms on which all evaluation strategies coincide. This has as a corollary the soundness and termination of well-typed programs under the standard evaluation strategies. A similar result is obtained for the ML-like call-by-name strategy. In contrast, such results are obtained for the call-by-name strategy. In contrast, such results are obtained for the call-by value ML-like strategy only for a restricted sub-language in which constructor abstractions are limited to values.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\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 D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\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.", } @InProceedings{Leroy:1993:PNR, author = "Xavier Leroy", title = "Polymorphism by name for references and continuations", crossref = "ACM:1993:CRT", pages = "220--231", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p220-leroy/", abstract = "This article investigates an ML-like language with byname semantics for polymorphism: polymorphic objects are not evaluated once for all at generalization time, but re-evaluated at each specialization. Unlike the standard ML semantics, the by-name semantics works well with polymorphic references and polymorphic continuations: the naive typing rules for references and for continuations are sound with respect to this semantics. Polymorphism by name leads to a better integration of these imperative features into the ML type discipline. Practical experience shows that it retains most of the efficiency and predictability of polymorphism by value.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Choi:1993:EFI, author = "Jong-Deok Choi and Michael Burke and Paul Carini", title = "Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects", crossref = "ACM:1993:CRT", pages = "232--245", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p232-choi/", abstract = "We present practical {\em approximation\/} methods for computing interprocedural aliases and side effects for a program written in a language that includes pointers, reference parameters and recursion. We present the following results: (1) An algorithm for {\em flow-sensitive\/} interprocedural alias analysis which is more precise and efficient than the best interprocedural method known. (2) An extension of traditional {\em flow-insensitive\/} alias analysis which accommodates pointers and provides a framework for a family of algorithms which trade off precision for efficiency. (3) An algorithm which correctly computes side effects in the presence of pointers. Pointers cannot be correctly handled by conventional methods for side effect analysis. (4) An alias naming technique which handles dynamically allocated objects and guarantees the correctness of data-flow analysis. (5) A compact representation based on transitive reduction which does not result in a loss of precision and improves precision in some case. (6) A method for intraprocedural alias analysis which is based on a sparse representation.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\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. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\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.", } @InProceedings{Yi:1993:AGM, author = "Kwangkeun Yi and Williams Ludwell {Harrison, III}", title = "Automatic generation and management of interprocedural program analyses", crossref = "ACM:1993:CRT", pages = "246--259", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p246-yi/", abstract = "We have designed and implemented an interprocedural program analyzer generator, called {\em system Z\/}. Our goal is to automate the generation and management of semantics-based interprocedural program analysis for a wide range of target languages. System Z is based on the abstract interpretation framework. The input to system Z is a high-level specification of an abstract interpreter. The output is a C code for the specified interprocedural program analyzer. The system provides a high-level command set (called {\em projection expressions\/}) in which the user can tune the analysis in accuracy and cost. The user writes projection expressions for selected domains; system Z takes care of the remaining things so that the generated analyzer conducts an analysis over the projected domains, which will vary in cost and accuracy according to the projections. We demonstrate the system's capabilities by experiments with a set of generated analyzers which can analyze C, FORTRAN, and SCHEME programs.", acknowledgement = ack-nhfb, keywords = "design; experimentation; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Z. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", } @InProceedings{Srinivasan:1993:SSA, author = "Harini Srinivasan and James Hook and Michael Wolfe", title = "Static single assignment for explicitly parallel programs", crossref = "ACM:1993:CRT", pages = "260--272", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p260-srinivasan/", abstract = "We describe and prove algorithms to convert programs which use the Parallel Computing Forum Parallel Sections construct into Static Single Assignment (SSA) form. This proces allows compilers to apply classical scalar optimization algorithms to explicitly parallel programs. To do so, we must define what the concept of {\em dominator\/} and {\em dominance frontier\/} mean in parallel programs. We also describe how we extend SSA form to handle parallel updates and still preserve the SSA properties.", acknowledgement = ack-nhfb, keywords = "algorithms; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", } @InProceedings{Lakhotia:1993:CCM, author = "Arun Lakhotia", title = "Constructing call multigraphs using dependence graphs", crossref = "ACM:1993:CRT", pages = "273--284", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p273-lakhotia/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\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. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", } @InProceedings{Bruce:1993:STC, author = "Kim B. Bruce", title = "Safe type checking in a statically-typed object-oriented programming language", crossref = "ACM:1993:CRT", pages = "285--298", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p285-bruce/", abstract = "In this paper we introduce a statically-typed, functional, object-oriented programming language, TOOPL, which supports classes, objects, methods, instance variable, subtypes, and inheritance. It has proved to be surprisingly difficult to design statically-typed object-oriented languages which are nearly as expressive as Smalltalk and yet have no holes in their typing systems. A particular problem with statically type checking object-oriented languages is determining whether a method provided in a superclass will continue to type check when inherited in a subclass. This program is solved in our language by providing type checking rules which guarantee that a method which type checks as part of a class will type check correctly in all legal subclasses in which it is inherited. This feature enables library providers to provide only the interfaces of classes with executables and still allow users to safely create subclasses. The design of TOOPL has been guided by an analysis of the semantics of the language, which is given in terms of a sufficiently rich model of the F-bounded second-order lambda calculus. This semantics supported the language design by providing a means of proving that the type-checking rules for the language are sound, ensuring that well-typed terms produce objects of the appropriate type. In particular, in a well-typed program it is impossible to send a message to an object which lacks a corresponding method.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\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 D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Pierce:1993:OPR, author = "Benjamin C. Pierce and David N. Turner", title = "Object-oriented programming without recursive types", crossref = "ACM:1993:CRT", pages = "299--312", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p299-pierce/", abstract = "It is widely agreed that recursive types are inherent in the static typing of the essential mechanisms of object-oriented programming: encapsulation, message passing, subtyping, and inheritance. We demonstrate here that modeling object encapsulation in terms of existential types yields a substantially more straightforward explanation of these features in a simpler calculus without recursive types.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory", 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, Abstract data types. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Mairson:1993:CLM, author = "Harry G. Mairson", title = "A constructive logic of multiple subtyping", crossref = "ACM:1993:CRT", pages = "313--324", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p313-mairson/", abstract = "We show how a higher order logic, the calculus of constructions, can be used to give a simple, first principles treatment of record calculi, polymorphism, and subtyping. The development follows the constructive idiom of extracting implementations of equationally specified programs from proofs of their termination, with a logic for reasoning about programs, and a semantics that comes as a gratuity. In this framework, records are finitely specified functions where equality is decidable over the domain, with types that are a particular kind of logical assertion. By proving that a record specification satisfies its type, we can extract its implementation. While program extraction serves as a sort of compiler, proof normalization serves as an interpreter; the latter serves to ensure in some sense the coherence of the translation embedded in the former. This simple minded approach lets us show, for example, that many inference rules found in record and object calculi can be derived---they are just provable lemmas in higher order logic. We see explicitly how from subtyping proofs we can extract, using conventional methods, coercion functions between underlying representations of data types. By further exploiting the computational metaphor of higher order logic, we can realize an interpreter for recursively defined objects, as well as subtype and inheritance relations between them. Recursive types for objects are explained by primitive recursion in higher types. The approach also gives a computational understanding of F-bounded polymorphism.", acknowledgement = ack-nhfb, keywords = "algorithms; theory", 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 F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs.", } @InProceedings{Leivant:1993:SFP, author = "Daniel Leivant", title = "Stratified functional programs and computational complexity", crossref = "ACM:1993:CRT", pages = "325--333", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p325-leivant/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf G.2.1} Mathematics of Computing, DISCRETE MATHEMATICS, Combinatorics, Recurrences and difference equations. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes.", } @InProceedings{Marriott:1993:ROC, author = "Kimball G. Marriott and Peter J. Stuckey", title = "The 3 {R}'s of optimizing constraint logic programs: refinement, removal and reordering", crossref = "ACM:1993:CRT", pages = "334--344", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p334-marriott/", abstract = "Central to constraint logic programming (CLP) languages is the notion of a global constraint solver which is queried to direct execution and to which constraints are monotonically added. We present a methodology for use in the compilation of CLP languages which is designed to reduce the overhead of the global constraint solver. This methododology is based on three optimizations. The first, refinement, involves adding new constraints, which in effect make information available earlier in the computation, guiding subsequent execution away from unprofitable choices. The second, removal, involves eliminating constraints from the solver when they are redundant. The last, reordering, involves moving constraint addition later and constraint removal earlier in the computation. Determining the applicability of each optimization requires sophisticated global analysis. These analyses are based on abstract interpretation and provide information about potential and definite interaction between constraints.", acknowledgement = ack-nhfb, keywords = "languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\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, Operational semantics.", } @InProceedings{VillemontedelaClergerie:1993:LSI, author = "E. {Villemonte de la Clergerie}", title = "Layer sharing: an improved structure-sharing framework", crossref = "ACM:1993:CRT", pages = "345--358", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p345-de_la_clergerie/", abstract = "We present in this paper a structure-sharing framework originally developed for a Dynamic Programming interpreter of Logic programs called DyALog. This mechanism should be of interest for alternative execution models of PROLOG which maintain multiple computation branches and reuse sub-computations in various contexts (computation sharing). This category includes, besides our Dynamic Programming model, the tabular models (OLDT, SLDAL, XWAM), the ``magic-set'' models, and the independent AND and OR parallelism with solution sharing models. These models raise the problem of storing vast amount of data, motivating us to discard copying mechanisms in favor of structure-sharing mechanisms. Unfortunately, computation sharing requires joining computation branches and possibly renaming some variables, which generally leads to complex structure-sharing mechanisms. The proposed ``layer-sharing'' framework succeeds however in remaining understandable and easy to implement.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @InProceedings{Bossi:1993:DLP, author = "A. Bossi and M. Bugliesi and M. Gabbrielli and G. Levi and M. C. Meo", title = "Differential logic programming", crossref = "ACM:1993:CRT", pages = "359--370", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p359-bossi/", abstract = "In this paper we define a compositional semantics for a generalized composition operator on logic programs. Static and dynamic inheritance as well as composition by union of clauses can all be obtained by specializing the general operator. The semantics is based on the notion of {\em differential\/} programs, logic programs annotated with declarations that establish the programs' external interfaces.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{Adl--Tabatabai:1993:EVI, author = "Ali-Reza Adl-Tabatabai and Thomas Gross", title = "Evicted variables and the interaction of global register allocation and symbolic debugging", crossref = "ACM:1993:CRT", pages = "371--383", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p371-adl-tabatabai/", abstract = "A symbolic debugger allows a user to display the values of program variables at a breakpoint. However, problems arise if the program is translated by an optimizing compiler. This paper addresses the effects of global register allocation and assignment: a register assigned to a variable V may not be holding V's value at a breakpoint since the register can also be assigned to other variables. We define the problem of determining whether a variable is in its assigned register as the {\em residence\/} problem. Prior work on debugging of optimized code has focused on the currency problem; detecting whether a variable's run-time value is the expected value. Determining residence is a more serious problem than currency detection. We present a data flow algorithm that accurately computes a variable's residency, by determining when a variable becomes {\em evicted\/} from its register. We measure the effectiveness of different approaches to determine variable residence for three C programs from the SPEC suite.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\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, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Bates:1993:IPT, author = "Samuel Bates and Susan Horwitz", title = "Incremental program testing using program dependence graphs", crossref = "ACM:1993:CRT", pages = "384--396", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p384-bates/", abstract = "Program dependence graphs have been proposed for use in optimizing, vectorizing, and parallelizing compilers, and for program integration. This paper proposes their use as the basis for {\em incremental program testing\/} when using {\em test data adequacy criteria\/}. Test data adequacy is commonly used to provide some confidence that a particular test suite does a reasonable job of testing a program. Incremental program testing using test data adequacy criteria addresses the problem of testing a modified program given an adequate test suite for the original program. Ideally, one would like to create an adequate test suite for the modified program that reuses as many files from the old test suite as possible. Furthermore, one would like to know, for every file that is in both the old and the new test suites, whether the program components exercised by that file have been affected by the program modification; if no components have been affected, then it is not necessary to rerun the program using that file. In this paper we define adequacy criteria based on the program dependence graph, and propose techniques based on program slicing to identify components of the modified program that can be tested using files from the old test suite, and components that have been affected by the modification. This information can be used to reduce the time required to create new test files, and to avoid unproductive retesting of unaffected components. Although exact identification of the components listed above is, in general, undecidable, we demonstrate that our techniques provide safe approximations.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\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 F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @InProceedings{Dhamdhere:1993:CBD, author = "Dhananjay M. Dhamdhere and Uday P. Khedker", title = "Complexity of bi-directional data flow analysis", crossref = "ACM:1993:CRT", pages = "397--408", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p397-dhamdhere/", abstract = "The concept of an {\em information flow path\/} arising from the generalized theory of data flow analysis [21] is used to analyze the complexity of data flow analysis. The {\em width (w)\/} of a program flow graph with respect to a class of data flow problems is introduced as a measure of the complexity of round-robin iterative analysis. This provides the first known complexity result for round robin iterative analysis of bidirectional data flows commonly used in algorithms based on the suppression of partial redundancies [6, 7, 8, 9, 17, 18, 25]. We also show that width provides a better bound on the complexity of unidirectional data flows than the classical notion of {\em depth\/}. The paper presents ways to reduce the width, and thereby the complexity of flow analysis, for several interesting problems. Complexity analysis using the notion of width is also shown to motivate efficient solution methods for various bidirectional problems, {\em viz\/}. The {\em alternating iterations\/} method, and an interval analysis based elimination method for the partial redundancy elimination problems. The paper also presents a condition for the decomposability of a bidirectional problem into a sequence of unidirectional problems.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms. {\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. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", } @InProceedings{Nipkow:1993:TCT, author = "Tobias Nipkow and Christian Prehofer", title = "Type checking type classes", crossref = "ACM:1993:CRT", pages = "409--418", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p409-nipkow/", abstract = "We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This lead to simple type inference systems and algorithms which closely resemble those for ML. In particular we present a new unification algorithm which is an extension of syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\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 D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @InProceedings{Kozen:1993:ERS, author = "Dexter Kozen and Jens Palsberg and Michael I. Schwartzbach", title = "Efficient recursive subtyping", crossref = "ACM:1993:CRT", pages = "419--428", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p419-kozen/", abstract = "Subtyping in the presence of recursive types for the [lambda]-calculus was studied by Amadio and Cardelli in 1991 [1]. In that paper they showed that the problem of deciding whether one recursive type is a sub-type of another is decidable in exponential time. In this paper we give an O(n2) algorithm. Our algorithm is based on a simplification of the definition of the subtype relation, which allows us to reduce the problem to the emptiness problem for a certain finite automaton with quadratically many states. It is known that equality of recursive types and the covariant B{\``o}hm order can be decided efficiently by means of finite automata. Our results extend the automata-theoretic approach to handle orderings based on contravariance.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\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, Procedures, functions, and subroutines.", } @InProceedings{Gay:1993:SIA, author = "Simon J. Gay", title = "A sort inference algorithm for the polyadic $\pi$-calculus", crossref = "ACM:1993:CRT", pages = "429--438", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p429-gay/", abstract = "In Milner's polyadic $\pi$-calculus there is a notion of {\em sorts\/} which is analogous to the notion of types in functional programming. As a well-typed program applies functions to arguments in a consistent way, a well-sorted process uses communication channels in a consistent way. An open problem is whether there is an algorithm to infer sorts in the $\pi$-calculus in the same way that types can be inferred in functional programming. Here we solve the problem by presenting an algorithm which infers the most general sorting for a process in the first-order calculus, and proving its correctness. The algorithm is similar in style to those used for Hindley-Milner type inference in functional languages.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs.", } @InProceedings{Shao:1993:SR, author = "Zhong Shao and Andrew W. Ael", title = "Smartest recompilation", crossref = "ACM:1993:CRT", pages = "439--450", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p439-shao/", abstract = "To separately compile a program module in traditional statically-typed languages, one has to manually write down an import interface which explicitly specifies all the external symbols referenced in the module. Whenever the definitions of these external symbols are changed, the module has to be recompiled. In this paper, we present an algorithm which can automatically infer the ``minimum'' import interface for any module in languages based on the Damas-Milner type discipline (e.g., ML). By ``minimum'', we mean that the interface specifies a set of assumptions (for external symbols) that are just enough to make the module type-check and compile. By compiling each module using its ``minimum'' import interface, we get a separate compilation method that can achieve the following optimal property: {\em A compilation unit never needs to be recompiled unless its own implementation changes\/}.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\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, ML. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\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.", } @InProceedings{Codish:1993:CAM, author = "Michael Codish and Saumya K. Debray and Roberto Giacobazzi", title = "Compositional analysis of modular logic programs", crossref = "ACM:1993:CRT", pages = "451--464", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p451-codish/", abstract = "This paper describes a semantic basis for a compositional approach to the analysis of logic programs. A logic program is viewed as consisting of a set of modules, each module defining a subset of the program's predicates. Analyses are constructed by considering abstract interpretations of a compositional semantics. The abstract meaning of a module corresponds to its analysis and composition of abstract meanings corresponds to composition of analyses. Such an approach is essential for large program development so that altering one module does not require re-analysis of the entire program. We claim that for a substantial class of programs, compositional analyses which are based on a notion of {\em abstract unfolding\/} provide the same precision as non-compositional analysis. A compositional analysis for ground dependencies is included to illustrate the approach. To the best of our knowledge this is the first account of a compositional framework for the analysis of logic programs.", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces.", } @InProceedings{Aponte:1993:ERT, author = "Maria Virginia Aponte", title = "Extending record typing to type parametric modules with sharing", crossref = "ACM:1993:CRT", pages = "465--478", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p465-aponte/", abstract = "We extend term unification techniques used to type extensible records in order to solve the two main typing problems for modules in Standard ML: matching and sharing. We obtain a type system for modules based only on well known unification problems, modulo some equational theories we define. Our formalization is simple and has the elegance of polymorphic type disciplines based on unification. It can be seen as a synthesis of previous work on module and record typing.", acknowledgement = ack-nhfb, keywords = "algorithms; 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, Standard ML. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\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.", } @InProceedings{Lee:1993:QSS, author = "Shinn-Der Lee and Daniel P. Friedman", title = "Quasi-static scoping: sharing variable bindings across multiple lexical scopes", crossref = "ACM:1993:CRT", pages = "479--492", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p479-lee/", abstract = "Static scoping embodies a strong encapsulation mechanism for hiding the details of program units. Yet, it does not allow the sharing of variable bindings (locations) across independent program units. Facilities such as module and object systems that require cross references of variables therefore must be added as special features. In this paper we present an alternative: quasi-static scoping. Quasi-static scoping is more flexible than static scoping, but has the same encapsulation mechanism. The user can control when and in what scope to resolve a quasi-static variable, i.e., to associate it with a variable binding. To demonstrate its versatility, we add quasi-static scoping to Scheme and show how to build the aforementioned facilities at the user-level. We also show that quasi-static scoping can be implemented efficiently.", acknowledgement = ack-nhfb, keywords = "algorithms; 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. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, SCHEME. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @InProceedings{Consel:1993:TNP, author = "Charles Consel and Olivier Danvy", title = "Tutorial notes on partial evaluation", crossref = "ACM:1993:CRT", pages = "493--501", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p493-consel/", abstract = "The last years have witnessed a flurry of new results in the area of partial evaluation. These tutorial notes survey the field and present a critical assessment of the state of the art.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Ramalingam:1993:CBI, author = "G. Ramalingam and Thomas Reps", title = "A categorized bibliography on incremental computation", crossref = "ACM:1993:CRT", pages = "502--510", year = "1993", bibdate = "Mon May 3 12:45:53 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/158511/p502-ramalingam/", acknowledgement = ack-nhfb, keywords = "algorithms; design; documentation; languages; measurement; performance; theory", subject = "{\bf A.2} General Literature, REFERENCE. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\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, Functional constructs. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @InProceedings{Diwan:1994:MSP, author = "Amer Diwan and David Tarditi and Eliot Moss", title = "Memory subsystem performance of programs using copying garbage collection", crossref = "ACM:1994:CRP", pages = "1--14", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p1-diwan/", abstract = "Heap allocation with copying garbage collection is believed to have poor memory subsystem performance. We conducted a study of the memory subsystem performance of heap allocation for memory subsystems found on many machines. We found that many machines support heap allocation poorly. However, with the appropriate memory subsystem organization, heap allocation can have good memory subsystem performance.", acknowledgement = ack-nhfb, keywords = "measurement; performance; theory", subject = "{\bf B.3.2} Hardware, MEMORY STRUCTURES, Design Styles, Cache memories. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf B.3.3} Hardware, MEMORY STRUCTURES, Performance Analysis and Design Aids**, Simulation**.", } @InProceedings{Ramsey:1994:CTB, author = "Norman Ramsey", title = "Correctness of trap-based breakpoint implementations", crossref = "ACM:1994:CRP", pages = "15--24", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p15-ramsey/", abstract = "It is common for debuggers to implement breakpoints by a combination of planting traps and single stepping. When the target program contains multiple threads of execution, a debugger that is not carefully implemented may miss breakpoints. This paper gives a formal model of a breakpoint in a two-threaded program. The model describes correct and incorrect breakpoint implementations. Automatic search of the model's state space shows that the correct implementation does miss a breakpoint. The results apply even to debuggers like dbx and gdb, which are apparently for single-threaded programs; when the user evaluates an expression containing function calls, the debugger executes the call in the target address space, in effect creating a new thread.", acknowledgement = ack-nhfb, keywords = "languages; measurement; theory", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @InProceedings{Agrawal:1994:DSB, author = "Hiralal Agrawal", title = "Dominators, super blocks, and program coverage", crossref = "ACM:1994:CRP", pages = "25--34", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p25-agrawal/", abstract = "In this paper we present techniques to find subsets of nodes of a flowgraph that satisfy the following property: A test set that exercises all nodes in a subset exercises all nodes in the flowgraph. Analogous techniques to find subsets of edges are also proposed. These techniques may be used to significantly reduce the cost of coverage testing of programs. A notion of a super block consisting of one or more basic blocks in that super block must be exercised by the same input. Dominator relationships among super blocks are used to identify a subset of the super blocks whose coverage implies that of all super blocks and, in turn, that of all basic blocks. Experiments with eight systems in the range of 1-75K lines of code show that, on the average, test cases targeted to cover just 29\% of the basic blocks and 32\% of the branches ensure 100\% block and branch coverage, respectively.", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; measurement; verification", subject = "{\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging.", } @InProceedings{Garrigue:1994:TPL, author = "Jacques Garrigue and Hassan A{\"\i}t-Kaci", title = "The typed polymorphic label-selective [lambda]-calculus", crossref = "ACM:1994:CRP", pages = "35--47", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p35-garrigue/", abstract = "Formal calculi of record structures have recently been a focus of active research. However, scarcely anyone has studied formally the dual notion---i.e., argument-passing to functions by keywords, and its harmonization with currying. We have. Recently, we introduced the label-selective [lambda]-calculus, a conservative extension of [lambda]-calculus that uses a labeling of abstractions and applications to perform unordered currying. In other words, it enables some form of commutation between arguments. This improves program legibility, thanks to the presence of labels, and efficiency, thanks to argument commuting. In this paper, we propose a simply typed version of the calculus, then extend it to one with ML-like polymorphic types. For the latter calculus, we establish the existence of principal types and we give an algorithm to compute them. Thanks to the fact that label-selective [lambda]-calculus is a conservative extension of [lambda]-calculus by adding numeric labels to stand for argument positions, its polymorphic typing provides us with a keyword argument-passing extension of ML obviating the need of records. In this context, conventional ML syntax can be seen as a restriction of the more general keyword-oriented syntax limited to using only implicit positions instead of keywords.", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Odersky:1994:FTL, author = "Martin Odersky", title = "A functional theory of local names", crossref = "ACM:1994:CRP", pages = "48--59", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p48-odersky/", abstract = "[lambda]v is an extension of the [lambda]-calculus with a binding construct for local names. The extension has properties analogous to classical [lambda]-calculus and preserves all observational equivalences of [lambda]. It is useful as a basis for modeling wide-spectrum languages that build on a functional core.", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Lescanne:1994:LLJ, author = "Pierre Lescanne", title = "From [lambda][sigma] to [lambda]v: a journey through calculi of explicit substitutions", crossref = "ACM:1994:CRP", pages = "60--69", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p60-lescanne/", abstract = "This paper gives a systematic description of several calculi of explicit substitutions. These systems are orthogonal and have easy proofs of termination of their substitution calculus. The last system, called [lambda]v, entails a very simple environment machine for strong normalization of [lambda]-terms.", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Doligez:1994:PUG, author = "Damien Doligez and Georges Gonthier", title = "Portable, unobtrusive garbage collection for multiprocessor systems", crossref = "ACM:1994:CRP", pages = "70--83", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p70-doligez/", abstract = "We describe and prove the correctness of a new concurrent mark-and-sweep garbage collection algorithm. This algorithm derives from the classical on-the-fly algorithm from Dijkstra {\em et al.\/} [9]. A distinguishing feature of our algorithm is that it supports multiprocessor environments where the registers of running processes are not readily accessible, without imposing any overhead on the elementary operations of loading a register or reading or initializing a field. Furthermore our collector never blocks running mutator processes except possibly on requests for free memory; in particular, updating a field or creating or marking or sweeping a heap object does not involve system-dependent synchronization primitives such as locks. We also provide support for process creation and deletion, and for managing an extensible heap of variable-sized objects.", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Nielson:1994:HCP, author = "Hanne Riis Nielson and Flemming Nielson", title = "Higher-order concurrent programs with finite communication topology (extended abstract)", crossref = "ACM:1994:CRP", pages = "84--97", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p84-nielson/", abstract = "Concurrent ML (CML) is an extension of the functional language Standard ML(SML) with primitives for the dynamic creation of processes and channels and for the communication of values over channels. Because of the powerful abstraction mechanisms the communication topology of a given program may be very complex and therefore an efficient implementation may be facilitated by knowledge of the topology. This paper presents an analysis for determining when a bounded number of processes and channels will be generated. The analysis proceeds in two stages. First we extend a polymorphic type system for SML to deduce not only the type of CML programs but also their communication behaviour expressed as terms in a new process algebra. Next we develop an analysis that given the communication behaviour predicts the number of processes and channels required during the execution of the CML program. The correctness of the analysis is proved using a subject reduction property for the type system.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @InProceedings{deBoer:1994:PCC, author = "Frank S. {de Boer} and Maurizio Gabbrielli and Elena Marchiori and Catuscia Palamidessi", title = "Proving concurrent constraint programs correct", crossref = "ACM:1994:CRP", pages = "98--108", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p98-de_boer/", abstract = "We develop a compositional proof-system for the partial correctness of concurrent constraint programs. Soundness and (relative) completeness of the system are proved with respect to a denotational semantics based on the notion of strongest postcondition. The strongest postcondition semantics provides a justification of the declarative nature of concurrent constraint programs, since it allows to view programs as theories in the specification logic.", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @InProceedings{Leroy:1994:MTM, author = "Xavier Leroy", title = "Manifest types, modules, and separate compilation", crossref = "ACM:1994:CRP", pages = "109--122", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p109-leroy/", abstract = "This paper presents a variant of the SML module system that introduces a strict distinction between abstract types and manifest types (types whose definitions are part of the module specification), while retaining most of the expressive power of the SML module system. The resulting module system provides much better support for separate compilation.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Modules, packages. {\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, Compilers.", } @InProceedings{Harper:1994:TAH, author = "Robert Harper and Mark Lillibridge", title = "A type-theoretic approach to higher-order modules with sharing", crossref = "ACM:1994:CRP", pages = "123--137", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p123-harper/", abstract = "The design of a module system for constructing and maintaining large programs is a difficult task that raises a number of theoretical and practical issues. A fundamental issue is the management of the flow of information between program units at compile time via the notion of an interface. Experience has shown that fully opaque interfaces are awkward to use in practice since too much information is hidden, and that fully transparent interfaces lead to excessive interdependencies, creating problems for maintenance and separate compilation. The ``sharing'' specifications of Standard ML address this issue by allowing the programmer to specify equational relationships between types in separated modules, but are not expressive enough to allow the programmer complete control over the propagation of type information between modules. These problems are addressed from a type-theoretic viewpoint by considering a calculus based on Girard's system F\omega. The calculus differs form those considered in previous studies by relying exclusively on a new form of weak sum type to propagate information at compile-time, in contrast to approaches based on strong sums which rely on substitution. The new form of sum type allows for the specification of equational, as well as type and kind, information in interfaces. This provides complete control over the propagation of compile-time information between program units and is sufficient to encode in a straightforward way most users of type sharing specifications in Standard ML. Modules are treated as ``first-class'' citizens, and therefore the system supports higher-order modules and some object-oriented programming idioms; the language may be easily restricted to ``second-class'' modules found in ML-like languages.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Modules, packages. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Katiyar:1994:TSP, author = "Dinesh Katiyar and David Luckham and John Mitchell", title = "A type system for prototyping languages", crossref = "ACM:1994:CRP", pages = "138--150", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p138-katiyar/", abstract = "RAPIDE is a programming language framework designed for the development of large, concurrent, real-time systems by prototyping. The framework consists of a type language and default executable, specification and architecture languages, along with associated programming tools. We describe the main features of the type language, its intended use in a prototyping environment, and rationale for selected design decisions.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\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, Type structure.", } @InProceedings{Castagna:1994:DBQ, author = "Giusee Castagna and Benjamin C. Pierce", title = "Decidable bounded quantification", crossref = "ACM:1994:CRP", pages = "151--162", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p151-castagna/", abstract = "The standard formulation of bounded quantification, system F\$ We propose here a simple variant of F\$", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Aiken:1994:STC, author = "Alexander Aiken and Edward L. Wimmers and T. K. Lakshman", title = "Soft typing with conditional types", crossref = "ACM:1994:CRP", pages = "163--173", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p163-aiken/", abstract = "We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive types, and conditional types. Conditional types enable us to analyze control flow using type inference, thus facilitating computation of accurate types. We demonstrate the power and practicality of the method with examples and performance results from an implementation.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Thatte:1994:ASI, author = "Satish R. Thatt{\'e}", title = "Automated synthesis of interface adapters for reusable classes", crossref = "ACM:1994:CRP", pages = "174--187", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p174-thatte/", abstract = "The need to fit together reusable components and system designs in spite of differences in protocol and representation choices occurs often in object-oriented software construction. It is therefore necessary to use {\em adapters\/} to achieve an exact fit between the available ``socket'' for a reusable part and the actual part. In this paper we discuss an approach to the construction of tools that {\em largely automate\/} the synthesis of adapter code. Such tools are important in reducing the effort involved in reuse since adapter synthesis can be challenging and error-prone in the complex type environment of an object-oriented language. Our approach is applicable to statically typed languages like C++ and Eiffel, and is based on a formal notion of {\em adaptability\/} which is related to but distinct from both subtyping and inheritance.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program synthesis. {\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous, Reusable software**. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", } @InProceedings{Tofte:1994:ITC, author = "Mads Tofte and Jean-Pierre Talpin", title = "Implementation of the typed call-by-value [lambda]-calculus using a stack of regions", crossref = "ACM:1994:CRP", pages = "188--201", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p188-tofte/", abstract = "We present a translation scheme for the polymorphically typed call-by-value [lambda]-calculus. All runtime values, including function closures, are put into {\em regions\/}. The store consists of a stack of regions. Region inference and effect inference are used to infer where regions can be allocated and de-allocated. Recursive functions are handled using a limited form of polymorphic recursion. The translation is proved correct with respect to a store semantics, which models as a region-based run-time system. Experimental results suggest that regions tend to be small, that region allocation is frequent and that overall memory demands are usually modest, even without garbage collection.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Hankin:1994:DAT, author = "Chris Hankin and Daniel Le M{\'e}tayer", title = "Deriving algorithms from type inference systems: application to strictness analysis", crossref = "ACM:1994:CRP", pages = "202--212", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p202-hankin/", abstract = "The role of non-standard type inference in static program analysis has been much studied recently. Early work emphasised the efficiency of type inference algorithms and paid little attention to the correctness of the inference system. Recently more powerful inference systems have been investigated but the connection with efficient inference algorithms has been obscured. The contribution of this paper is twofold: first we show how to transform a program logic into an algorithm and, second, we introduce the notion of lazy types and show how to derive an efficient algorithm or strictness analysis.", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Henglein:1994:FOB, author = "Fritz Henglein and Jesper J{\o}rgensen", title = "Formally optimal boxing", crossref = "ACM:1994:CRP", pages = "213--226", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p213-henglein/", abstract = "An important implementation decision in polymorphically typed functional programming language is whether to represent data in boxed or unboxed form and when to transform them from one representation to the other. Using a language with explicit representation types and boxing/unboxing operations we axiomatize equationally the set of all explicitly boxed versions, called {\em completions\/}, of a given source program. In a two-stage process we give some of the equations a rewriting interpretation that captures eliminating boxing/unboxing operations without relying on a specific implementation or even semantics of the underlying language. The resulting reduction systems operate on congruence classes of completions defined by the remaining equations {\em E\/}, which can be understood as moving boxing/unboxing operations along data flow paths in the source program. We call a completion {\em eopt formally optimal\/} if every other completion for the same program (and at the same representation type) reduces to {\em eopt\/} under this two-stage reduction. We show that every source program has formally optimal completions, which are unique modulo {\em E\/}. This is accomplished by first ``polarizing'' the equations in {\em E\/} and orienting them to obtain two canonical (confluent and strongly normalizing) rewriting systems. The completions produced by Leroy's and Poulsen's algorithms are generally not formally optimal in our sense. The rewriting systems have been implemented and applied to some simple Standard ML programs. Our results show that the amount of boxing and unboxing operations is also in practice substantially reduced in comparison to Leroy's completions. This analysis is intended to be integrated into Tofte's region-based implementation of Standard ML currently underway at DIKU.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{Cortesi:1994:CAD, author = "Agostino Cortesi and Baudouin {Le Charlier} and Pascal {Van Hentenryck}", title = "Combinations of abstract domains for logic programming", crossref = "ACM:1994:CRP", pages = "227--239", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p227-cortesi/", abstract = "Abstract interpretation [7] is a systematic methodology to design static program analysis which has been studied extensively in the logic programming community, because of the potential for optimizations in logic programming compilers and the sophistication of the analyses which require conceptual support. With the emergence of efficient generic abstract interpretation algorithms for logic programming, the main burden in building an analysis is the abstract domain which gives a safe approximation of the concrete domain of computation. However, accurate abstract domains for logic programming are often complex because of the variety of analyses to perform their interdependence, and the need to maintain structural information. The purpose of this paper is to propose conceptual and software support for the design of abstract domains. It contains two main contributions: the notion of open product and a generic pattern domain. The open product is a new way of combining abstract domains allowing each combined domain to benefit from information from the other components through the notions of queries and open operations. The open product is general-purpose and can be used for other programming paradigms as well. The generic pattern domain Pat ({\em R \/})automatically upgrades a domain D with structural information yielding a more accurate domain Pat (D) without additional design or implementation cost. The two contributions are orthogonal and can be combined in various ways to obtain sophisticated domains while imposing minimal requirements on the designer. Both contributions are characterized theoretically and experimentally and were used to design very complex abstract domains such as PAT(OProp $\otimes$ OMode $\otimes$OPS) which would be very difficult to design otherwise. On this last domain, designers need only contribute about 20\% (about 3,400 lines) of the complete system (about 17,700 lines).", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @InProceedings{Marriott:1994:ALP, author = "Kim Marriott and Mar{\'\i}a Jos{\'e} Garc{\'\i}a de la Banda and Manuel Hermenegildo", title = "Analyzing logic programs with dynamic scheduling", crossref = "ACM:1994:CRP", pages = "240--253", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p240-marriott/", abstract = "Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceed left-to-right but in which some calls are dynamically ``delayed'' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.", acknowledgement = ack-nhfb, keywords = "measurement; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Qian:1994:HEL, author = "Zhenyu Qian", title = "Higher-order equational logic programming", crossref = "ACM:1994:CRP", pages = "254--267", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p254-qian/", abstract = "Higher-order equational logic programming is a paradigm which combines first-order equational and higher-order logic programming, where higher-order logic programming is based on a subclass of simply typed [lambda]-terms, called higher-order patterns. Central to the notion of higher-order equational logic programming is the so-called higher-order equational unification. This paper extends several important classes of first-order equational unification algorithms to the higher-order setting: only problems of the extensions are discussed and first-order equational unifications are viewed as black boxes whenever possible. We first extend narrowing and show that the completeness of many higher-order narrowing strategies reduces to that of their underlying first-order counterparts. Then we propose an algorithm or higher-order equational unification of free higher-order patterns in an arbitrary equational theory. Finally a general approach to extend first-order unification combination algorithms is sketched informally. The termination property of the above higher-order extensions is considered in a uniform way.", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf D.1.6} Software, PROGRAMMING TECHNIQUES, Logic Programming.", } @InProceedings{Antoy:1994:NNS, author = "Sergio Antoy and Rachid Echahed and Michael Hanus", title = "A needed narrowing strategy", crossref = "ACM:1994:CRP", pages = "268--279", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p268-antoy/", abstract = "Narrowing is the operational principle of languages that integrate functional and logic programming. We propose a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the Huet and L{\'e}vy notion of a needed reduction step. We define a strategy, based on this notion, that computes only needed narrowing steps. Our strategy is sound and complete for a large class of rewrite systems, is optimal w.r.t. the cost measure that counts the number of distinct steps of a derivation, computes only independent unifiers, and is efficiently implemented by pattern matching.", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.1.6} Software, PROGRAMMING TECHNIQUES, Logic Programming. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @InProceedings{Proebsting:1994:DPS, author = "Todd A. Proebsting and Christopher W. Fraser", title = "Detecting pipeline structural hazards quickly", crossref = "ACM:1994:CRP", pages = "280--286", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p280-proebsting/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata.", } @InProceedings{Ramalingam:1994:IAM, author = "G. Ramalingam and Thomas Reps", title = "An incremental algorithm for maintaining the dominator tree of a reducible flowgraph", crossref = "ACM:1994:CRP", pages = "287--296", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p287-ramalingam/", abstract = "We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and deletion of edges. Such an algorithm has applications in incremental dataflow analysis and incremental compilation.", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.", } @InProceedings{Weise:1994:VDG, author = "Daniel Weise and Roger F. Crew and Michael Ernst and Bjarne Steensgaard", title = "Value dependence graphs: representation without taxation", crossref = "ACM:1994:CRP", pages = "297--310", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p297-weise/", abstract = "The {\em value dependence graph\/} (VDG) is a sparse dataflow-like representation that simplifies program analysis and transformation. It is a functional representation that represents control flow as data flow and makes explicit all machine quantities, such as stores and I/O channels. We are developing a compiler that builds a VDG representing a program, analyzes and transforms the VDG, then produces a control flow graph (CFG) [ASU86] from the optimized VDG. This framework simplifies transformations and improves upon several published results. For example, it enables more powerful code motion than [CLZ86, FOW87], eliminates as many redundancies as [AWZ88, RWZ88] (except for redundant loops), and provides important information to the code scheduler [BR91]. We exhibit a fast, one-pass method for elimination of partial redundancies that never performs redundant code motion [KFS92, DS93] and is simpler than the classical [MR79, Dha91] or SSA [RWZ88] methods. These results accrue from eliminating the CFG from the analysis/transformation phases and using {\em demand dependences\/} in preference to control dependences.", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Maslov:1994:LAD, author = "Vadim Maslov", title = "Lazy array data-flow dependence analysis", crossref = "ACM:1994:CRP", pages = "311--325", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p311-maslov/", abstract = "Automatic parallelization of real FORTRAN programs does not live up to users expectations yet, and dependence analysis algorithms which either produce too many false dependences or are too slow to contribute significantly to this. In this paper we introduce dataflow dependence analysis algorithm which exactly computes value-based dependence relations for program fragments in which all subscripts, loop bound and IF conditions are affine. Our algorithm also computes good affine approximations of dependence relations for non-affine program fragments. Actually, we do not know about any other algorithm which can compute better approximations. And our algorithm is efficient too, because it is lazy. When searching for write statements that supply values used by a given read statement, it starts with statements which are lexicographically close to the read statement in iteration space. Then if some of the read statement instances are not ``satisfied'' with these close writes, the algorithm broadens its search scope by looking into more distant writes. The search scope keeps broadening until all read instances are satisfied or no write candidates are left. We timed our algorithm on several benchmark programs and the timing results suggest that our algorithm is fast enough to be used in commercial compilers---it usually takes 5 to 15 percent of f77 -02 compilation time to analyze a program. Most programs in the 100-line range take less than 1 second to analyze on a SUN SPARCstation IPX.", acknowledgement = ack-nhfb, keywords = "algorithms; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Cleaveland:1994:OFV, author = "Rance Cleaveland and Daniel Yankelevich", title = "An operational framework for value-passing processes", crossref = "ACM:1994:CRP", pages = "326--338", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p326-cleaveland/", abstract = "This paper develops a semantic framework for concurrent languages with value passing. An operation analogous to substitution in the [lambda]-calculus is given, and a semantics is given for a value-passing version of Milner's Calculus of Communicating Systems (CCS). An operational equivalence is then defined and shown to coincide with Milner's (early) bisimulation equivalence. We also show how semantics maybe given for languages with asynchronous communication primitives. In contrast with existing approaches to value passing, this semantics does not reduce data exchange to pure synchronization over (potentially infinite) families of ports indexed by data, and it avoids variable renamings that are not local to processes engaged in communication.", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Bloom:1994:CCH, author = "Bard Bloom", title = "{CHOCOLATE}: {Calculi of Higher Order COmmunication and LAmbda TErms} (preliminary report)", crossref = "ACM:1994:CRP", pages = "339--347", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p339-bloom/", abstract = "We propose a general definition of higher-order process calculi, generalizing CHOCS [Tho89] and related calculi, and investigate its basic properties. We give sufficient conditions under which a calculus is finitely-branching and effective. We show that a suitable notion of higher-order bisimulation is a congruence for a subclass of higher-order calculi. We illustrate our definitions with a simple calculus strictly stronger than CHOCS.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.0} Software, PROGRAMMING LANGUAGES, General. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{Honda:1994:CRM, author = "Kohei Honda and Nobuko Yoshida", title = "Combinatory representation of mobile processes", crossref = "ACM:1994:CRP", pages = "348--360", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p348-honda/", abstract = "A theory of combinators in the setting of concurrent processes is formulated. The new combinators are derived from an analysis of the operation called {\em asynchronous name passing\/}, just as an analysis of {\em logical substitution\/} gave rise to the sequential combinators. A system with seven atoms and fixed interaction rules, but with no notion of prefixing, is introduced, and is shown to be capable of representing input and output prefixes over arbitrary terms in a behaviourally correct way, just as SK-combinators are closed under functional abstraction without having it as a proper syntactic construct. The basic equational correspondence between concurrent combinators and a system of asynchronous mobile processes, as well as the embedding of the finite part of $\pi$-calculus in concurrent combinators, is proved. These results will hopefully serve as a cornerstone for further investigation of the theoretical as well as pragmatic possibilities of the presented construction.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.0} Software, PROGRAMMING LANGUAGES, General.", } @InProceedings{Paakki:1994:MEF, author = "Jukka Paakki", title = "Multi-pass execution of functional logic programs", crossref = "ACM:1994:CRP", pages = "361--374", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p361-paakki/", abstract = "An operational semantics for functional logic programs is presented. In such programs functional terms provide for reduction of expressions, provided that they ground. The semantics is based on multi-pass evaluation techniques originally developed for attribute grammars. Program execution is divided into two phases: (1) construction of an incomplete proof tree, and (2) its decoration into a complete proof tree. The construction phase applies a modified SLD-resolution scheme, and the decoration phase a partial (multi-pass) traversal over the tree. The phase partition is generated by static analysis where data dependencies are extracted for the functional elements of the program. The method guarantees that all the functional terms of a program can be evaluated, and no dynamic groundness checks are needed.", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.1.6} Software, PROGRAMMING TECHNIQUES, Logic Programming. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Boyland:1994:CTA, author = "John Boyland and Susan L. Graham", title = "Composing tree attributions", crossref = "ACM:1994:CRP", pages = "375--388", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p375-boyland/", abstract = "Using the {\em simple tree attributions\/} described in this paper, attribute values can themselves be trees, enabling attribution to be used for tree transformations. Unlike higher-order attribute grammars, simple tree attributions have the property of {\em descriptional composition\/}, which allows a complex transformation to be built up from simpler ones, yet be executed efficiently. In contrast to other formalisms that admit descriptional composition, notably composable attribute grammars, simple tree attributions have the expressive power to handle remote references and recursive syntactic (tree-generating) functions, providing significantly more general forms of attribution and transformation.", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\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.", } @InProceedings{Muller:1994:SCA, author = "Robert Muller", title = "A staging calculus and its application to the verification of translators (preliminary report)", crossref = "ACM:1994:CRP", pages = "389--396", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p389-muller/", abstract = "We develop a calculus in which the computation steps required to execute a computer program can be separated into discrete stages. The calculus, denoted [lambda]2, is embedded within the pure untyped [lambda]-calculus. The main result of the paper is a characterization of sufficient conditions for confluence for terms in the calculus. The condition can be taken as a correctness criterion for translators that perform reductions in one stage leaving residual redexes over for subsequent computation stages. As an application of the theory, we verify the correctness of a macro expansion algorithm. The expansion algorithm is of some interest in its own right since it solves the problem of desired variable capture using only the familiar capture avoiding substitutions.", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators.", } @InProceedings{Calder:1994:RIF, author = "Brad Calder and Dirk Grunwald", title = "Reducing indirect function call overhead in {C++} programs", crossref = "ACM:1994:CRP", pages = "397--408", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p397-calder/", abstract = "Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as {\em speculative execution\/} and {\em prefetching\/} are becoming standard architectural mechanisms that rely on {\em control flow prediction\/} to prefetch and speculatively execute future instructions. At the same time, computer programmers are increasingly turning to object-oriented languages to increase their productivity. These languages commonly use {\em run time dispatching\/} to implement object polymorphism. Dispatching is usually implemented using an indirect function call, which presents challenges to existing control flow prediction techniques. We have measured the occurrence of indirect function calls in a collection of C++ programs. We show that, although it is more important to predict branches accurately, indirect call prediction is also an important factor in some programs and will grow in importance with the growth of object-oriented programming. We examine the improvement offered by compile-time optimizations and static and dynamic prediction techniques, and demonstrate how compilers can use existing branch prediction mechanisms to improve performance in C++ programs. Using these methods with the programs we examined, the number of instructions between mispredicted breaks in control can be doubled on existing computers.", acknowledgement = ack-nhfb, keywords = "measurement; performance; theory", subject = "{\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{DeBosschere:1994:CFS, author = "Koen {De Bosschere} and Saumya Debray and David Gudeman and Sampath Kannan", title = "Call forwarding: a simple interprocedural optimization technique for dynamically typed languages", crossref = "ACM:1994:CRP", pages = "409--420", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p409-de_bosschere/", abstract = "This paper discusses {\em call forwarding\/}, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: find an ordering for the ``entry actions'' of a procedure, and generate multiple entry points for the procedure, so as to maximize the savings realized from different call sites bypassing different sets of entry actions. We show that the problem of computing optimal solutions to arbitrary call forwarding problems is NP-complete, and describe an efficient greedy algorithm for the problem. Experimental results indicate that (i) this algorithm is effective, in that the solutions produced are generally close to optimal; and (ii) the resulting optimization leads to significant performance improvements for a number of benchmarks tested.", acknowledgement = ack-nhfb, keywords = "algorithms; measurement; performance; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Feigen:1994:RT, author = "Lawrence Feigen and David Klaholz and Robert Casazza and Xing Xue", title = "The revival transformation", crossref = "ACM:1994:CRP", pages = "421--434", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p421-feigen/", abstract = "The notion that a definition of a variable is {\em dead\/} is used by optimizing compilers to delete code whose execution is useless. We extend the notion of {\em deadness\/} to that of {\em partial deadness\/}, and define a transformation, the {\em revival transformation\/}, which eliminates useless executions of a (partially dead) definition by tightening its execution conditions without changing the set of uses which it reaches or the conditions under which it reaches each of them.", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Wand:1994:SLC, author = "Mitchell Wand and Paul Steckler", title = "Selective and lightweight closure conversion", crossref = "ACM:1994:CRP", pages = "435--445", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p435-wand/", abstract = "We consider the problem of selective and lightweight closure conversion, in which multiple procedure-calling protocols may coexist in the same code. Flow analysis is used to match the protocol expected by each procedure and the protocol used at each of its possible call sites. We formulate the flow analysis as the solution of a set of constraints, and show that any solution to the constraints justifies the resulting transformation. Some of the techniques used are suggested by those of abstract interpretation, but others arise out of alternative approaches.", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Filinski:1994:RM, author = "Andrzej Filinski", title = "Representing monads", crossref = "ACM:1994:CRP", pages = "446--457", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p446-filinski/", abstract = "We show that any monad whose unit and extension operations are expressible as purely functional terms can be embedded in a call-by-value language with ``composable continuations''. As part of the development, we extend Meyer and Wand's characterization of the relationship between continuation-passing and direct style to one for continuation-passing vs. general ``monadic'' style. We further show that the composable-continuations construct can itself be represented using ordinary, non-composable first-class continuations and a single piece of state. Thus, in the presence of two specific computational effects - storage and escapes - {\em any\/} expressible monadic structure (e.g., nondeterminism as represented by the list monad) can be added as a purely definitional extension, without requiring a reinterpretation of the whole language. The paper includes an implementation of the construction (in Standard ML with some New Jersey extensions) and several examples.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", } @InProceedings{Hatcliff:1994:GAC, author = "John Hatcliff and Olivier Danvy", title = "A generic account of continuation-passing styles", crossref = "ACM:1994:CRP", pages = "458--471", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p458-hatcliff/", abstract = "We unify previous work on the continuation-passing style (CPS) transformations in a generic framework based on Moggi's computational meta-language. This framework is used to obtain CPS transformations for a variety of evaluation strategies and to characterize the corresponding administrative reductions and inverse transformations. We establish generic formal connections between operational semantics and equational theories. Formal properties of transformations for specific evaluation orders follow as corollaries. Essentially, we factor transformations through Moggi's computational m eta-language. Mapping [lambda]-terms into the meta-language captures computation properties (e.g., partiality, strictness) and evaluation order explicitly in both the term and the type structure of the meta-language. The CPS transformation is then obtained by applying a generic transformation from terms and types in the meta-language to CPS terms and types, based on a typed term representation of the continuation monad. We prove an adequacy property for the generic transformation and establish an equational correspondence between the meta-language and CPS terms. These generic results generalize Plotkin's seminal theorems, subsume more recent results, and enable new uses of CPS transformations and their inverses. We discuss how to aply these results to compilation.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{L:1994:BIC, author = "Guy L. {Steele, Jr.}", title = "Building interpreters by composing monads", crossref = "ACM:1994:CRP", pages = "472--492", year = "1994", bibdate = "Mon May 3 12:50:22 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/174675/p472-steele/", abstract = "We exhibit a set of functions coded in Haskell that can be used as building blocks to construct a variety of interpreters for Lisp-like languages. The building blocks are joined merely through functional composition. Each building block contributes code to support a specific feature, such as numbers, continuations, functions calls, or nondeterminism. The result of composing some number of building blocks is a parser, an interpreter, and a printer that support exactly the expression forms and data types needed for the combined set of features, and no more. The data structures are organized as {\em pseudomonads\/}, a generalization of monads that allows composition. Functional composition of the building blocks implies type composition of the relevant pseudomonads. Our intent was that the Haskell type resolution system ought to be able to deduce the appropriate data types automatically. Unfortunately there is a deficiency in current Haskell implementations related to recursive data types: circularity must be reflected statically in the type definitions. We circumvent this restriction by applying a purpose-built program simplifier that performs partial evaluation and a certain amount of program algebra. We construct a wide variety of interpreters in the style of Wadler by starting with the building blocks and a page of boiler-plate code, writing three lines of code (one to specify the building blocks and two to (redundantly) specify type compositions), and then applying the simplifier. The resulting code is acceptable Haskell code. We have tested a dozen different interpreters with various combinations of features. In this paper we discuss the overall code structuring strategy, exhibit several building blocks, briefly describe the partial evaluator, and present a number of automatically generated interpreters.", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming.", } @InProceedings{Riecke:1995:ISE, author = "Jon G. Riecke and Ramesh Viswanathan", title = "Isolating side effects in sequential languages", crossref = "ACM:1995:CRP", pages = "1--12", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p1-riecke/", abstract = "It is well known that adding side effects to functional languages changes the operational equivalences of the language. We develop a new language construct, {\bf encap}, that forces imperative pieces of code to behave purely functionally, {\em i.e.\/},without any visible side effects. The coercion operator {\bf encap} provides a means of extending the simple reasoning principles for equivalences of code in a functional language to a language with side effects. In earlier work, similar coercion operators were developed, but their correctness required the underlying functional language to include parallel operations. The coercion operators developed here are simpler and are proven correct for {\em purely sequential\/} languages. The sequential setting requires the construction of fully abstract models for sequential call-by-value languages and the formulation of a weak form of ``monad'' suitable for expressing the semantics of call-by-value languages with side effects.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Standard ML. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @InProceedings{Brookes:1995:SAD, author = "Stephen Brookes and Denis Dancanet", title = "Sequential algorithms, deterministic parallelism, and intensional expressiveness", crossref = "ACM:1995:CRP", pages = "13--24", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p13-brookes/", abstract = "We call language {\em L\/}1 {\em intensionally more expressive\/} than {\em L\/}2 if there are functions which can be computed faster in {\em L\/}1 than in {\em L\/}2. We study the intensional expressiveness of several languages: the Berry-Curien programming language of sequential algorithms, CDS0, a deterministic parallel extension to it, named CDSP, and various parallel extensions to the functional programming language PCF. The paper consists of two parts. In the first part, we show that CDS0 can compute the minimum of two numbers {\em n\/} and {\em p\/} in unary representation in time {\em O(min(n,p))\/}. However, it cannot compute a ``natural'' version of this function. CDSP allows us to compute this function, as well as functions like parallel-or. This work can be seen as an extension of the work of Colson with primitive recursive algorithms to the setting of sequential algorithms. In the second part, we show that deterministic parallelism adds intensional expressiveness, settling a ``folk'' conjecture from the literature in the negative. We show that CDSP is more expressive intensionally than CDS0. We also study three parallel extensions to PCF: parallel-or ({\em por\/}) and parallel conditionals on booleans ({\em pif\/}[ogr]) and integers ({\em pif\/}[igr]). The situation is more complicated there: {\em pif\/}[igr] is still more expressive than both {\em pif\/}[ogr] and {\em por\/}. However, {\em pif\/}[igr] still is not as expressive as the deterministic query construct of CDSP. Thus, we identify a hierarchy of intensional expressiveness for deterministic parallelism.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Extensible languages. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{Reynolds:1995:UFC, author = "John C. Reynolds", title = "Using functor categories to generate intermediate code", crossref = "ACM:1995:CRP", pages = "25--36", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p25-reynolds/", abstract = "In the early 80's Oles and Reynolds devised a semantic model of Algol-like languages using a category of functors from a category of store shapes to the category of predomains. Here we will show how a variant of this idea can be used to define the translation of an Algol-like language to intermediate code in a uniform way that avoids unnecessary temporary variables, provides control-flow translation of boolean expressions, permits online expansion of procedures, and minimizes the storage overhead of calls of closed procedures. The basic idea is to replace continuations by instruction sequences and store shapes by descriptions of the structure of the run-time stack.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ALGOL. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", } @InProceedings{Duesterwald:1995:DCI, author = "Evelyn Duesterwald and Rajiv Gupta and Mary Lou Soffa", title = "Demand-driven computation of interprocedural data flow", crossref = "ACM:1995:CRP", pages = "37--48", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p37-duesterwald/", abstract = "This paper presents a general framework for deriving demand-driven algorithms for interprocedural data flow analysis of imperative programs. The goal of demand-driven analysis is to reduce the time and/or space overhead of conventional exhaustive analysis by avoiding the collection of information that is not needed. In our framework, a demand for data flow information is modeled as a set of date flow queries. The derived demand-driven algorithms find responses to these queries through a partial reversal of the respective data flow analysis. Depending on whether minimizing time or space is of primary concern, result caching may be incorporated in the derived algorithm. Our framework is applicable to interprocedural data flow problems with a finite domain set. If the problem's flow functions are distributive, the derived demand algorithms provide as precise information as the corresponding exhaustive analysis. For problems with monotone but non-distributive flow functions the provided data flow solutions are only approximate. We demonstrate our approach using the example of interprocedural copy constant propagation.", acknowledgement = ack-nhfb, keywords = "algorithms; 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. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts.", } @InProceedings{Reps:1995:PID, author = "Thomas Reps and Susan Horwitz and Mooly Sagiv", title = "Precise interprocedural dataflow analysis via graph reachability", crossref = "ACM:1995:CRP", pages = "49--61", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p49-reps/", abstract = "The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow functions must distribute over the confluence operator (either union or intersection). This class of probable problems includes---but is not limited to---the classical separable problems (also known as ``gen/kill'' or ``bit-vector'' problems)---{\em e.g.\/}, reaching definitions, available expressions, and live variables. In addition, the class of problems that our techniques handle includes many non-separable problems, including truly-live variables, copy constant propagation, and possibly-uninitialized variables. Results are reported from a preliminary experimental study of C programs (for the problem of finding possibly-uninitialized variables).", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages; theory", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C. {\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, Path and circuit problems.", } @InProceedings{Sreedhar:1995:LTA, author = "Vugranam C. Sreedhar and Guang R. Gao", title = "A linear time algorithm for placing [phi]-nodes", crossref = "ACM:1995:CRP", pages = "62--73", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p62-sreedhar/", abstract = "Dataflow analysis framework based on Static Single Assignment (SSA) form and Sparse Evaluation Graphs (SEGs) demand fast computation of program points where data flow information must be merged, the so-called [phi]{\bf -nodes}. In this paper, we present a surprisingly simple algorithm for computing [phi]-nodes for arbitrary flowgraphs (reducible or irreducible) that runs in {\em linear\/} time. We employ a novel program representation---the {\bf DJ graph}---by augmenting the dominator tree of a flowgraph with edges which may lead to a potential ``merge'' of dataflow information. In searching for [phi]-nodes we never visit an edge in the DJ-graph more than once by guiding the search of nodes by their levels in the dominator tree. The algorithm has been implemented and the results are compared with the well known algorithm due to Cytron et al. A consistent and significant speedup has been observed over a range of 46 Fortran procedures taken from a number of benchmark programs. We also ran experiments on increasingly taller ladder graphs and confirmed the linear time complexity of our algorithm.", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @InProceedings{Altucher:1995:EFM, author = "Rita Z. Altucher and William Landi", title = "An extended form of must alias analysis for dynamic allocation", crossref = "ACM:1995:CRP", pages = "74--84", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p74-altucher/", abstract = "The paper presents methods that we have implemented to improve the quality of the def-uses reported for dynamically allocated locations. The methods presented are based on the Ruggieri/Murtagh naming scheme for dynamically created locations. We expand upon this scheme to name dynamically allocated locations for some user written allocation routines. Using this expanded naming scheme, we introduce an inexpensive, non-iterative, and localized calculation of {\em extended must alias\/} analysis to handle dynamically allocated locations, and show how this information can be used to improve def-use information. This is the first attempt to specify must alias information for names which represent a set of dynamically allocated locations. Empirical results are presented to illustrate the usefulness of our method. We consider this work a step towards developing practical re-engineering tools for C.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf D.4.2} Software, OPERATING SYSTEMS, Storage Management.", } @InProceedings{Emerson:1995:RAR, author = "E. Allen Emerson and Kedar S. Namjoshi", title = "Reasoning about rings", crossref = "ACM:1995:CRP", pages = "85--94", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p85-emerson/", abstract = "The ring is a useful means of structuring concurrent processes. Processes communicate by passing a token in a fixed direction; the process that possesses the token is allowed to make certain moves. Usually, correctness properties are expected to hold irrespective of the size of the ring. We show that the problem of checking many useful correctness properties for rings of {\em all\/} sizes can be reduced to checking them on a ring of small size. The results do not depend on the processes being finite state. We illustrate our results on examples.", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @InProceedings{Bouajjani:1995:VIS, author = "Ahmed Bouajjani and Rachid Echahed and Peter Habermehl", title = "Verifying infinite state processes with sequential and parallel composition", crossref = "ACM:1995:CRP", pages = "95--106", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p95-bouajjani/", abstract = "We investigate the verification problem of infinite-state process w.r.t. logic-based specifications that express properties which may be nonregular. We consider the process algebra PA which integrates and strictly subsumes the algebras BPA (basic process algebra) and BPP (basic parallel processes), by allowing both sequential and parallel compositions as well as nondeterministic choice and recursion. Many relevant properties of PA processes are nonregular, and thus can be expressed neither by classical temporal logics nor by finite state \omega-automata. Properties of particular interest are those involving constraints on numbers of occurrences of events. In order to express such properties, which are nonregular in general, we use the temporal logic PCTL which combines the branching-time temporal logic CTL with Presburger arithmetics. Then we tackle the verification problem of guarded PA processes w.r.t. PCTL formulas. We mainly prove that, while this problem is undecidable for the full PCTL, it is actually decidable for the class of guarded PA processes (and thus for the class of guarded BPA's and guarded BPP's), and a large fragment of PCTL called PCTL+.", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Algebraic approaches to semantics.", } @InProceedings{Bloom:1995:SOS, author = "Bard Bloom", title = "Structured operational semantics as a specification language", crossref = "ACM:1995:CRP", pages = "107--117", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p107-bloom/", abstract = "Standard specification languages have very limited abilities to define new operations on processes. We introduce the concept of a Protean specification language, with general definitional facilities supported by the appropriate theory. Protean languages allow elegant, readable, and useful specifications at all levels of abstraction. A good Protean specification language will admit methods of verifying that one specification is a refinement of another. We sketch a family of Protean specification languages (with references to the full details) which allow a vast amount of expressive power in defining operations, but nonetheless have all the essential theoretical and specification power of CCS and ACP. We illustrate these techniques by presenting several specifications of the job of protecting an arbitrary server by a checkpoint/backup scheme. The high-level specification of the protected server simply says, ``It does everything it did before, and it doesn't crash.'' The middle-level specification describes checkpointing cleanly and abstractly, without prescribing any particular implementation. The low-level specification is fairly close to an implementation. We show the high- and medium-level specifications equivalent by bisimulation relation techniques, and the medium- and low-level specifications equivalent by equational reasoning using automatically-generated equations. We also show that the operations expressing checkpointing behavior are not definable in standard process algebras.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Dubois:1995:EP, author = "Catherine Dubois and Fran{\c{c}}ois Rouaix and Pierre Weis", title = "Extensional polymorphism", crossref = "ACM:1995:CRP", pages = "118--129", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p118-dubois/", abstract = "We present the extensional polymorphism, a framework to type check ad hoc polymorphic functions. This formalism is compatible with parametric polymorphism, and supports a large class of functions defined by structural pattern matching on types.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", 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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML.", } @InProceedings{Harper:1995:CPU, author = "Robert Harper and Greg Morrisett", title = "Compiling polymorphism using intensional type analysis", crossref = "ACM:1995:CRP", pages = "130--141", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p130-harper/", abstract = "Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations even if the types of objects are known. We examine an alternative approach for compiling polymorphism where types are passed as arguments to polymorphic routines in order to determine the representation of an object. This approach allows monomorphic code to use natural, efficient representations, supports separate compilation of polymorphic definitions and, unlike coercion-based implementations of polymorphism, natural representations can be used for mutable objects such as refs and arrays. We are particularly interested in the typing properties of an intermediate language that allows run-time type analysis to be coded within the language. This allows us to compile many representation transformations and many language features without adding new primitive operations to the language. In this paper, we provide a core target language where type-analysis operators can be coded within the language and the types of such operators can be accurately tracked. The target language is powerful enough to code a variety of useful features, yet type checking remains decidable. We show how to translate an ML-like language into the target language so that primitive operators can analyze types to produce efficient representations. We demonstrate the power of the ``user-level'' operators by coding flattened tuples, marshalling, type classes, and a form of type {\bf dynamic} within the language.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\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 D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Leroy:1995:AFF, author = "Xavier Leroy", title = "Applicative functors and fully transparent higher-order modules", crossref = "ACM:1995:CRP", pages = "142--153", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p142-leroy/", abstract = "we present a variety of the Standard ML module system where parameterized abstract types (i.e. functors returning generative types) map provably equal arguments to compatible abstract types, instead of generating distinct types at each applications as in Standard ML. This extension solves the full transparency problem (how to give syntactic signatures for higher-order functors that express exactly their propagation of type equations), and also provides better support for non-closed code fragments.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Standard ML. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\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.", } @InProceedings{Biswas:1995:HFT, author = "Sandip K. Biswas", title = "Higher-order functors with transparent signatures", crossref = "ACM:1995:CRP", pages = "154--163", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p154-biswas/", abstract = "The programming language Standard ML provides first-order {\em functors\/}, i.e. modules parameterized by modules. First-order functors in the language have a simple and elegant static semantics. The type structure of higher-order modules, i.e. modules parameterized by functors, is well understood. But it is only in the recent past that we have seen an implementation of higher-order functors with a formally defined static semantics in a dialect of Standard ML, SML/NJ. A study of this static semantics shows it to be much more complicated than the static semantics of first-order functors. This paper investigates whether we can trade some semantic features in the module language to obtain a simpler static semantics, closer in spirit to that of first-order functors. This work helps in a conceptual understanding of the semantics of higher-order modules.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Standard ML. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @InProceedings{Vorobyov:1995:SDE, author = "Sergei G. Vorobyov", title = "Structural decidable extensions of bounded quantification", crossref = "ACM:1995:CRP", pages = "164--175", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p164-vorobyov/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\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.", } @InProceedings{Hoang:1995:LBT, author = "My Hoang and John C. Mitchell", title = "Lower bounds on type inference with subtypes", crossref = "ACM:1995:CRP", pages = "176--185", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p176-hoang/", abstract = "We investigate type inference for programming languages with subtypes. As described in previous work, there are several type inference problems for any given expression language, depending on the form of the subtype partial order and the ability to define new subtypes in programs. Our first main result is that for any specific subtype partial order, the problem of determining whether a lambda term is typable is algorithmically (polynomial-time) equivalent to a form of satisfiability problem over the same partial order. This gives the first exact characterization of the problem that is independent of the syntax of expressions. In addition, since this form of satisfiability problem is PSPACE-hard over certain partial orders, this equivalence strengthens the previous lower bound of NP-hard to PSPACE-hard. Our second main result is a lower bound on the length of most general types when the subtype hierarchy may change as a result of additional type declarations within the program. More specifically, given any input expression, a type inference algorithm tries to find a {\em most general\/} (or {\em principal\/}) typing. The property of a most general typing is that it has all other possible typings as instances. However, there are several sound notions of instance in the presence of subtyping. Our lower bound is that no sound definition of instance would allow the set of additional subtyping hypotheses about a term to grow less than linearly in the size of the term.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages.", } @InProceedings{Hofmann:1995:PS, author = "Martin Hofmann and Benjamin Pierce", title = "Positive subtyping", crossref = "ACM:1995:CRP", pages = "186--197", year = "1995", bibdate = "Fri May 07 12:25:53 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p186-hofmann/", abstract = "The statement {\em S\/} in [[{\em S\/}]]$\rightarrow$[[{\em T\/}]]$\rightarrow$[[{\em S\/}]] that updates the {\em T\/} part of an element of {\em S\/}. We give a realizability model and a sound equational theory for a second-order calculus of positive subtyping. Though weaker than familiar calculi of bounded quantification, positive subtyping retains sufficient power to model objects, encapsulation, and message passing. Moreover, inheritance may be implemented very straightforwardly in this setting, using the {\em put\/} functions arising from ordinary subtyping of records in place of the sophisticated systems of record extension and update often used for this purpose. The equational laws relating the behavior of coercions and {\em put\/} functions can be used to prove simple properties of the resulting classes in such a way that proofs for superclasses are ``inherited'' by subclasses.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\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.", } @InProceedings{Mackie:1995:GIM, author = "Ian Mackie", title = "The geometry of interaction machine", crossref = "ACM:1995:CRP", pages = "198--208", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p198-mackie/", abstract = "We investigate implementation techniques arising directly from Girard's Geometry of Interaction semantics for Linear Logic, specifically for a simple functional programming language (PCF). This gives rise to a very simple, compact, compilation schema and run-time system. We analyse various properties of this kind of computation that suggest substantial optimisations that could make this paradigm of implementation not only practical, but potentially more efficient than extant paradigms.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Logics of programs. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Flanagan:1995:SFU, author = "Cormac Flanagan and Matthias Felleisen", title = "The semantics of future and its use in program optimization", crossref = "ACM:1995:CRP", pages = "209--220", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p209-flanagan/", abstract = "The {\bf future} annotations of MultiLisp provide a simple method for taming the implicit parallelism of functional programs. Past research concerning {\bf future}s has focused on implementation issues. In this paper, we present a series of operational semantics for an idealized functional language with {\bf future}s with varying degrees of intensionality. We develop a set-based analysis algorithm from the most intensional semantics, and use that algorithm to perform {\em touch\/} optimization on programs. Experiments with the Gambit compiler indicates that this optimization substantially reduces program execution times.", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, MULTILISP. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Sands:1995:TCL, author = "David Sands", title = "Total correctness by local improvement in program transformation", crossref = "ACM:1995:CRP", pages = "221--232", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p221-sands/", abstract = "The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington's unfold-fold method. Unfortunately the unfold-fold method itself guarantees neither improvement in efficiency nor total-correctness. The correctness problem for unfold-fold is an instance of a strictly more general problem: transformation by locally equivalence-preserving steps does not necessarily preserve (global) equivalence. This paper presents a condition for the total correctness of transformations on recursive programs, which, for the first time, deals with higher-order functional languages (both strict and non-strict) including lazy data structures. The main technical result is an {\em improvement theorem\/} which says that if the local transformation steps are guided by certain optimisation concerns (a fairly natural condition for a transformation), then correctness of the transformation follows. The improvement theorem makes essential use of a formalised improvement-theory; as a rather pleasing corollary it also guarantees that the transformed program is a formal improvement over the original. The theorem has immediate practical consequences: $\bullet$ It is a powerful tool for proving the correctness of existing transformation methods for higher-order functional programs, without having to ignore crucial factors such as {\em memoization\/} or {\em folding\/}. We have applied the theorem to obtain a particularly simple proof of correctness for a higher-order variant of {\em deforestation\/}. $\bullet$ It yields a simple syntactic method for guiding and constraining the unfold/fold method in the general case so that total correctness (and improvement) is always guaranteed.", acknowledgement = ack-nhfb, keywords = "languages; theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes. {\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, Procedures, functions, and subroutines. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs.", } @InProceedings{Ariola:1995:CLC, author = "Zena M. Ariola and John Maraist and Martin Odersky and Matthias Felleisen and Philip Wadler", title = "A call-by-need lambda calculus", crossref = "ACM:1995:CRP", pages = "233--246", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p233-ariola/", abstract = "The mismatch between the operational semantics of the lambda calculus and the actual behavior of implementations is a major obstacle for compiler writers. They cannot explain the behavior of their evaluator in terms of source level syntax, and they cannot easily compare distinct implementations of different lazy strategies. In this paper we derive an equational characterization of call-by-need and prove it correct with respect to the original lambda calculus. The theory is a strictly smaller theory than the lambda calculus. Immediate applications of the theory concern the correctness proofs of a number of implementation strategies, {\em e.g.\/}, the call-by-need continuation passing transformation and the realization of sharing via assignments.", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\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.", } @InProceedings{Dawson:1995:UFE, author = "S. Dawson and C. R. Ramakrishnan and I. V. Ramakrishnan and K. Sagonas and S. Skiena and T. Swift and D. S. Warren", title = "Unification factoring for efficient execution of logic programs", crossref = "ACM:1995:CRP", pages = "247--258", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p247-dawson/", abstract = "The efficiency of resolution-based logic programming languages, such as Prolog, depends critically on selecting and executing sets of applicable clause heads to resolve against subgoals. Traditional approaches to this problem have focused on using indexing to determine the smallest possible applicable set. Despite their usefulness, these approaches ignore the non-determinism inherent in many programming languages to the extent that they do not attempt to optimize execution {\em after\/} the applicable set theory has been determined. Unification factoring seeks to rectify this omission by regarding the indexing and unification phases of clause resolution as a single process. This paper formalizes that process through the construction of {\em factoring automata\/}. A polynomial-time algorithm is given for constructing optimal factoring automata which preserve the clause selection strategy of Prolog. More generally, when the clause selection strategy is not fixed, constructing such an optimal automaton is shown to be NP-complete, solving an open trie minimization problem. Unification factoring is implemented through a source code transformation that preserves the full semantics of Prolog. This transformation is specified in the paper, and using it, several well-known programs show performance improvements of up to 100\% across three different systems. A prototype of unification factoring is available by anonymous ftp.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Reducibility and completeness. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Prolog.", } @InProceedings{Schauser:1995:SCP, author = "Klaus E. Schauser and David E. Culler and Seth C. Goldstein", title = "Separation constraint partitioning: a new algorithm for partitioning non-strict programs into sequential threads", crossref = "ACM:1995:CRP", pages = "259--271", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p259-schauser/", abstract = "In this paper we present substantially improved thread partitioning algorithms for modern implicitly parallel languages. We present a new block partitioning algorithm, {\em separation constraint partitioning\/}, which is both more powerful and more flexible than previous algorithms. Our algorithm is guaranteed to derive maximal threads. We present a theoretical framework for proving the correctness of our partitioning approach, and we show how separation constraint partitioning makes interprocedural partitioning viable. We have implemented the partitioning algorithms in an Id90 compiler for workstations and parallel machines. Using this experimental platform, we quantify the effectiveness of different partitioning schemes on whole applications.", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Parallel C. {\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 F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs.", } @InProceedings{Saraswat:1995:DTC, author = "Vijay A. Saraswat and Radha Jagadeesan and Vineet Gupta", title = "Default timed concurrent constraint programming", crossref = "ACM:1995:CRP", pages = "272--285", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p272-saraswat/", abstract = "We extend the model of [SJG94b] to express strong time-outs (and pre-emption): if an event {\em A\/} does not happen through time {\em t\/}, cause event {\em B\/} to happen at time {\em t\/}. Such constructs arise naturally in practice (e.g. in modeling transistors) and are supported in languages such as ESTEREL (through instantaneous watchdogs) and LUSTRE (through the ``current'' operator). The fundamental conceptual difficulty posed by these operators is that they are non-monotonic. We provide a simple compositional semantics to the non-monotonic version of concurrent constraint programming (CCP) obtained by changing the underlying logic from intuitionist logic to Reiter's default logic. This allows us to use the same construction (uniform extension through time) to develop Default Timed CCP ({\bf Default tcc}) as we had used to develop Timed CCP ({\bf tcc}) from CCP. Indeed the smooth embedding of CCP processes into {\bf Default cc} processes lifts to a smooth embedding of {\bf tcc} processes into {\bf Default tcc} processes. Interesting {\bf tcc} properties such as determinacy, multiform time, a uniform pre-emption construct (``clock''), full-abstraction, and compositional compilation into automata are preserved. {\bf Default tcc} thus provides a simple and natural (denotational) model capable of representing the full range of pre-emption constructs supported in ESTEREL, LUSTRE and other synchronous programming languages.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; theory; verification", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Nonmonotonic reasoning and belief revision. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Cardelli:1995:LDS, author = "Luca Cardelli", title = "A language with distributed scope", crossref = "ACM:1995:CRP", pages = "286--297", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p286-cardelli/", abstract = "Obliq is a lexically-scoped, untyped, interpreted language that supports distributed object-oriented computation. Obliq objects have state and are local to a site. Obliq computations can roam over the network, while maintaining network connections. Distributed lexical scoping is the key mechanism for managing distributed computation.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Bailey:1995:FMS, author = "Mark W. Bailey and Jack W. Davidson", title = "A formal model and specification language for procedure calling conventions", crossref = "ACM:1995:CRP", pages = "298--310", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p298-bailey/", abstract = "Procedure calling conventions are used to provide uniform procedure-call interfaces. Applications, such as compilers and debuggers, which generate, or process procedures at the machine-language abstraction level require knowledge of the calling convention. In this paper, we develop a formal model for procedure calling conventions called P-FSA's. Using this model, we are able to ensure several completeness and consistency properties of calling conventions. Currently, applications that manipulate procedures implement conventions in an {\em ad-hoc\/} manner. The resulting code is complicated with details, difficult to maintain, and often riddled with errors. To alleviate the situation, we introduce a calling convention specification language, called CCL. The combination of CCL and P-FSA's facilitates the accurate specification of conventions that can be shown to be both consistent and complete.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, Languages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters.", } @InProceedings{Plevyak:1995:OSE, author = "John Plevyak and Xingbin Zhang and Andrew A. Chien", title = "Obtaining sequential efficiency for concurrent object-oriented languages", crossref = "ACM:1995:CRP", pages = "311--321", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p311-plevyak/", abstract = "Concurrent object-oriented programming (COOP) languages focus the abstraction and encapsulation power of abstract data types on the problem of concurrency control. In particular, pure fine-grained concurrent object-oriented languages (as opposed to hybrid or data parallel) provides the programmer with a simple, uniform, and flexible model while exposing maximum concurrency. While such languages promise to greatly reduce the complexity of large-scale concurrent programming, the popularity of these languages has been hampered by efficiency which is often many {\em orders of magnitude\/} less than that of comparable sequential code. We present a sufficiency set of techniques which enables the efficiency of fine-grained concurrent object-oriented languages to equal that of traditional sequential languages (like C) when the required data is available. These techniques are empirically validated by the application to a COOP implementation of the Livermore Loops.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Proebsting:1995:OAC, author = "Todd A. Proebsting", title = "Optimizing an {ANSI C} interpreter with superoperators", crossref = "ACM:1995:CRP", pages = "322--332", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p322-proebsting/", abstract = "This paper introduces {\em superoperators\/}, an optimization technique for bytecoded interpreters. Superoperators are virtual machine operations automatically synthesized from smaller operations to avoid costly per-operation overheads. Superoperators decrease executable size and can double or triple the speed of interpreted programs. The paper describes a simple and effective heuristic for inferring powerful superoperators from the usage patterns of simple operators. The paper describes the design and implementation of a hybrid translator/interpreter that employs superoperators. From a specification of the superoperators (either automatically inferred or manually chosen), the system builds an efficient implementation of the virtual machine in assembly language. The system is easily retargetable and currently runs on the MIPS R3000 and the SPARC.", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", } @InProceedings{Liang:1995:MTM, author = "Sheng Liang and Paul Hudak and Mark Jones", title = "Monad transformers and modular interpreters", crossref = "ACM:1995:CRP", pages = "333--343", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p333-liang/", abstract = "We show how a set of {\em building blocks\/} can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many commonly known features, including simple expressions, three different function call mechanisms (call-by-name, call-by-value and lazy evaluation), references and assignment, nondeterminism, first-class continuations, and program tracing. The underlying mechanism of our system is {\em monad transformers\/}, a simple form of abstraction for introducing a wide range of computational behaviors, such as state, I/O, continuations, and exceptions. Our work is significant in the following respects. First, we have succeeded in designing a fully modular interpreter based on monad transformers that incudes features missing from Steele's, Espinosa's, and Wadler's earlier efforts. Second, we have found new ways to lift monad operations through monad transformers, in particular difficult cases not achieved in Moggi's original work. Third, we have demonstrated that interactions between features are reflected in liftings and that semantics can be changed by reordering monad transformers. Finally, we have implemented our interpreter in Gofer, whose constructor classes provide just the added power over Haskell's type classes to allow precise and convenient expression of our ideas. This implementation includes a method for constructing extensible unions and a form of subtyping that is interesting in its own right.", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{King:1995:SDS, author = "David J. King and John Launchbury", title = "Structuring depth-first search algorithms in {Haskell}", crossref = "ACM:1995:CRP", pages = "344--354", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p344-king/", abstract = "Depth-first search is the key to a wide variety of graph algorithms. In this paper we express depth-first search in a lazy functional language, obtaining a linear-time implementation. Unlike traditional imperative presentations, we use the structuring methods of functional languages to construct algorithms from individual reusable components. This style of algorithm construction turns out to be quite amenable to formal proof, which we exemplify through a calculational-style proof of a far from obvious strongly-connected components algorithm.", acknowledgement = ack-nhfb, keywords = "algorithms; measurement; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf D.2.m} Software, SOFTWARE ENGINEERING, Miscellaneous, Reusable software**. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms.", } @InProceedings{Sansom:1995:TSP, author = "Patrick M. Sansom and Simon L. Peyton Jones", title = "Time and space profiling for non-strict, higher-order functional languages", crossref = "ACM:1995:CRP", pages = "355--366", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p355-sansom/", abstract = "We present the first profiler for a compiled, non-strict, higher-order, purely functional language capable of measuring {\em time\/} as well as {\em space\/} usage. Our profiler is implemented in a production-quality optimising compiler for Haskell, has low overheads, and can successfully profile large applications. A unique feature of our approach is that we give a formal specification of the attribution of execution costs to cost centres. This specification enables us to discuss our design decisions in a precise framework. Since it is not obvious how to map this specification onto a particular implementation, we also present an implementation-oriented operational semantics, and prove it equivalent to the specification.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Palsberg:1995:TSE, author = "Jens Palsberg and Patrick O'Keefe", title = "A type system equivalent to flow analysis", crossref = "ACM:1995:CRP", pages = "367--378", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p367-palsberg/", abstract = "Flow-based safety analysis of higher-order languages has been studied by Shivers, and Palsberg and Schwartzbach. Open until now is the problem of finding a type system that accepts exactly the same programs as safety analysis. In this paper we prove that Amadio and Cardelli's type system with subtyping and recursive types accepts the same programs as a certain safety analysis. The proof involves mappings from types to flow information and back. As a result, we obtain an inference algorithm for the type system, thereby solving an open problem.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", 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. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Field:1995:PPS, author = "John Field and G. Ramalingam and Frank Tip", title = "Parametric program slicing", crossref = "ACM:1995:CRP", pages = "379--392", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p379-field/", abstract = "Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing slices directly from semantic specifications. These algorithms are based on combining the notion of {\em dynamic dependence tracking\/} in term rewriting systems with a program representation whose behavior is defined via an equational logic. Our approach is distinguished by the fact that changes to the behavior of the slicing algorithm can be accomplished through simple changes in rewriting rules that define the semantics of the program representation. Thus, e.g., different notions of dependence may be specified, properties of language-specific datatypes can be exploited, and various time, space, and precision tradeoffs may be made. This flexibility enables us to generalize the traditional notions of static and dynamic slices to that of a {\em constrained\/} slice, where any subset of the inputs of a program may be supplied.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, C.", } @InProceedings{Jagannathan:1995:UTF, author = "Suresh Jagannathan and Stephen Weeks", title = "A unified treatment of flow analysis in higher-order languages", crossref = "ACM:1995:CRP", pages = "393--407", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p393-jagannathan/", abstract = "We describe a framework for flow analysis in higher-order languages. It is both a synthesis and extension of earlier work in this area, most notably [20, 22] The framework makes explicit use of {\em flow graphs\/} for modeling control and data flow properties of untyped higher-order programs. The framework is parameterized, and can express a hierarchy of analyses with different cost/accuracy tradeoffs. The framework is also amenable to a direct, efficient implementation. We develop several instantiations of the framework, and prove their running-time complexity. In addition, we use the simplest instantiation to demonstrate the equivalence of a 0CFA style analysis and the set-based analysis of [8].", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Castagna:1995:CDB, author = "Giusee Castagna and Benjamin C. Pierce", title = "Corrigendum: decidable bounded quantification", crossref = "ACM:1995:CRP", pages = "408--408", year = "1995", bibdate = "Mon May 3 12:52:30 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/199448/p408-castagna/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines.", } @InProceedings{Ghiya:1996:ITD, author = "Rakesh Ghiya and Laurie J. Hendren", title = "Is it a tree, a {DAG}, or a cyclic graph? {A} shape analysis for heap-directed pointers in {C}", crossref = "ACM:1996:CRP", pages = "1--15", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p1-ghiya/", acknowledgement = ack-nhfb, keywords = "measurement; performance; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", } @InProceedings{Sagiv:1996:SSP, author = "Mooly Sagiv and Thomas Reps and Reinhard Wilhelm", title = "Solving shape-analysis problems in languages with destructive updating", crossref = "ACM:1996:CRP", pages = "16--31", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p16-sagiv/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Steensgaard:1996:PAA, author = "Bjarne Steensgaard", title = "Points-to analysis in almost linear time", crossref = "ACM:1996:CRP", pages = "32--41", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p32-steensgaard/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Jim:1996:WPT, author = "Trevor Jim", title = "What are principal typings and what are they good for?", crossref = "ACM:1996:CRP", pages = "42--53", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p42-jim/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Odersky:1996:PTA, author = "Martin Odersky and Konstantin L{\"a}ufer", title = "Putting type annotations to work", crossref = "ACM:1996:CRP", pages = "54--67", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p54-odersky/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Jones:1996:UPS, author = "Mark P. Jones", title = "Using parameterized signatures to express modular structure", crossref = "ACM:1996:CRP", pages = "68--78", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p68-jones/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Jackson:1996:FCS, author = "Daniel Jackson and Somesh Jha and Craig A. Damon", title = "Faster checking of software specifications by eliminating isomorphs", crossref = "ACM:1996:CRP", pages = "79--90", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p79-jackson/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @InProceedings{Govindarajan:1996:ORC, author = "Kannan Govindarajan and Bharat Jayaraman and Surya Mantha", title = "Optimization and relaxation in constraint logic languages", crossref = "ACM:1996:CRP", pages = "91--103", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p91-govindarajan/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Pienger:1996:PVI, author = "Nicholas Pienger", title = "Pure versus impure {Lisp}", crossref = "ACM:1996:CRP", pages = "104--109", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p104-pippenger/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, LISP.", } @InProceedings{Asperti:1996:CB, author = "Andrea Asperti", title = "On the complexity of beta-reduction", crossref = "ACM:1996:CRP", pages = "110--118", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p110-asperti/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes. {\bf D.2.8} Software, SOFTWARE ENGINEERING, Metrics, Complexity measures.", } @InProceedings{Proebsting:1996:FF, author = "Todd A. Proebsting and Scott A. Watterson", title = "Filter fusion", crossref = "ACM:1996:CRP", pages = "119--130", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p119-proebsting/", acknowledgement = ack-nhfb, keywords = "algorithms; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Engler:1996:CLH, author = "Dawson R. Engler and Wilson C. Hsieh and M. Frans Kaashoek", title = "{'C}: a language for high-level, efficient, and machine-independent dynamic code generation", crossref = "ACM:1996:CRP", pages = "131--144", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p131-engler/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", } @InProceedings{Consel:1996:GAR, author = "Charles Consel and Fran{\c{c}}ois No{\"e}l", title = "A general approach for run-time specialization and its application to {C}", crossref = "ACM:1996:CRP", pages = "145--156", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p145-consel/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Liu:1996:DAI, author = "Yanhong A. Liu and Scott D. Stoller and Tim Teitelbaum", title = "Discovering auxiliary information for incremental computation", crossref = "ACM:1996:CRP", pages = "157--170", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p157-liu/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Birkedal:1996:RIN, author = "Lars Birkedal and Mads Tofte and Magnus Vejlstrup", title = "From region inference to {von Neumann} machines via region representation inference", crossref = "ACM:1996:CRP", pages = "171--183", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p171-birkedal/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Ashley:1996:PFF, author = "J. Michael Ashley", title = "A practical and flexible flow analysis for higher-order languages", crossref = "ACM:1996:CRP", pages = "184--194", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p184-ashley/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Colby:1996:TPA, author = "Christopher Colby and Peter Lee", title = "Trace-based program analysis", crossref = "ACM:1996:CRP", pages = "195--207", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p195-colby/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{George:1996:IRC, author = "Lal George and Andrew W. Ael", title = "Iterated register coalescing", crossref = "ACM:1996:CRP", pages = "208--218", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p208-george/", acknowledgement = ack-nhfb, keywords = "algorithms; measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures.", } @InProceedings{Hoover:1996:GMS, author = "Roger Hoover and Kenneth Zadeck", title = "Generating machine specific optimizing compilers", crossref = "ACM:1996:CRP", pages = "219--229", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p219-hoover/", acknowledgement = ack-nhfb, keywords = "measurement; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Kurlander:1996:MCI, author = "Steven M. Kurlander and Charles N. Fischer", title = "Minimum cost interprocedural register allocation", crossref = "ACM:1996:CRP", pages = "230--241", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p230-kurlander/", acknowledgement = ack-nhfb, keywords = "measurement; performance; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Danvy:1996:TPE, author = "Olivier Danvy", title = "Type-directed partial evaluation", crossref = "ACM:1996:CRP", pages = "242--257", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p242-danvy/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Davies:1996:MAS, author = "Rowan Davies and Frank Pfenning", title = "A modal analysis of staged computation", crossref = "ACM:1996:CRP", pages = "258--270", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p258-davies/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{Minamide:1996:TCC, author = "Yasuhiko Minamide and Greg Morrisett and Robert Harper", title = "Typed closure conversion", crossref = "ACM:1996:CRP", pages = "271--283", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p271-minamide/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors.", } @InProceedings{Fegaras:1996:RCD, author = "Leonidas Fegaras and Tim Sheard", title = "Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space)", crossref = "ACM:1996:CRP", pages = "284--294", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p284-fegaras/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming.", } @InProceedings{PeytonJones:1996:CH, author = "Simon {Peyton Jones} and Andrew Gordon and Sigbjorn Finne", title = "{Concurrent Haskell}", crossref = "ACM:1996:CRP", pages = "295--308", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p295-peyton_jones/", acknowledgement = ack-nhfb, keywords = "languages; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent C.", } @InProceedings{Greiner:1996:PTP, author = "John Greiner and Guy E. Blelloch", title = "A provably time-efficient parallel implementation of full speculation", crossref = "ACM:1996:CRP", pages = "309--321", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p309-greiner/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.0} Software, PROGRAMMING LANGUAGES, General. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @InProceedings{Gupta:1996:SAR, author = "Manish Gupta and Edith Schonberg", title = "Static analysis to reduce synchronization costs in data-parallel programs", crossref = "ACM:1996:CRP", pages = "322--332", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p322-gupta/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures.", } @InProceedings{Niehren:1996:FCC, author = "Joachim Niehren", title = "Functional computation as concurrent computation", crossref = "ACM:1996:CRP", pages = "333--343", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p333-niehren/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures.", } @InProceedings{Honda:1996:CP, author = "Kohei Honda", title = "Composing processes", crossref = "ACM:1996:CRP", pages = "344--357", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p344-honda/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{Kobayashi:1996:LP, author = "Naoki Kobayashi and Benjamin C. Pierce and David N. Turner", title = "Linearity and the pi-calculus", crossref = "ACM:1996:CRP", pages = "358--371", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p358-kobayashi/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{Fournet:1996:RCJ, author = "C{\'e}dric Fournet and Georges Gonthier", title = "The reflexive {CHAM} and the join-calculus", crossref = "ACM:1996:CRP", pages = "372--385", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p372-fournet/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.1.0} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, General.", } @InProceedings{Gordon:1996:BFC, author = "Andrew D. Gordon and Gareth D. Rees", title = "Bisimilarity for a first-order calculus of objects with subtyping", crossref = "ACM:1996:CRP", pages = "386--395", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p386-gordon/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Abadi:1996:IOO, author = "Mart{\'\i}n Abadi and Luca Cardelli and Ramesh Viswanathan", title = "An interpretation of objects and object types", crossref = "ACM:1996:CRP", pages = "396--409", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p396-abadi/", acknowledgement = ack-nhfb, keywords = "theory", subject = "{\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Hughes:1996:PCR, author = "John Hughes and Lars Pareto and Amr Sabry", title = "Proving the correctness of reactive systems using sized types", crossref = "ACM:1996:CRP", pages = "410--423", year = "1996", bibdate = "Mon May 3 12:54:36 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/237721/p410-hughes/", acknowledgement = ack-nhfb, keywords = "theory; verification", subject = "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification.", } @InProceedings{Shapiro:1997:FAF, author = "Marc Shapiro and Susan Horwitz", title = "Fast and accurate flow-insensitive points-to analysis", crossref = "ACM:1997:CRP", pages = "1--14", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p1-shapiro/", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Ruf:1997:PDA, author = "Erik Ruf", title = "Partitioning dataflow analyses using types", crossref = "ACM:1997:CRP", pages = "15--26", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p15-ruf/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; measurement; performance; standardization; theory", 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 E.1} Data, DATA STRUCTURES. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Fradet:1997:ST, author = "Pascal Fradet and Daniel Le M{\'e}tayer", title = "Shape types", crossref = "ACM:1997:CRP", pages = "27--39", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p27-fradet/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.0} Software, PROGRAMMING LANGUAGES, General. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf G.2.0} Mathematics of Computing, DISCRETE MATHEMATICS, General. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Remy:1997:OMS, author = "Didier R{\'e}my and J{\'e}r{\^o}me Vouillon", title = "Objective {ML}: a simple object-oriented extension of {ML}", crossref = "ACM:1997:CRP", pages = "40--53", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p40-remy/", acknowledgement = ack-nhfb, keywords = "design; languages; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Chen:1997:RYO, author = "Chih-Ping Chen and Paul Hudak", title = "Rolling your own mutable {ADT} --- a connection between linear types and monads", crossref = "ACM:1997:CRP", pages = "54--66", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p54-chen/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; reliability; theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types.", } @InProceedings{Apt:1997:SIP, author = "Krzysztof R. Apt and Andrea Schaerf", title = "Search and imperative programming", crossref = "ACM:1997:CRP", pages = "67--79", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p67-apt/", acknowledgement = ack-nhfb, keywords = "design; languages; theory", subject = "{\bf D.1.0} Software, PROGRAMMING TECHNIQUES, General. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features.", } @InProceedings{Hanus:1997:UCM, author = "Michael Hanus", title = "A unified computation model for functional and logic programming", crossref = "ACM:1997:CRP", pages = "80--93", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p80-hanus/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @InProceedings{Middeldorp:1997:CNC, author = "Aart Middeldorp", title = "Call by need computations to root-stable form", crossref = "ACM:1997:CRP", pages = "94--105", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p94-middeldorp/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; reliability; theory; verification", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Necula:1997:PC, author = "George C. Necula", title = "Proof-carrying code", crossref = "ACM:1997:CRP", pages = "106--119", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p106-necula/", acknowledgement = ack-nhfb, keywords = "design; experimentation; languages; performance; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf E.4} Data, CODING AND INFORMATION THEORY. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification.", } @InProceedings{Plezbert:1997:DQT, author = "Michael P. Plezbert and Ron K. Cytron", title = "Does `just in time' = `better late than never'?", crossref = "ACM:1997:CRP", pages = "120--131", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p120-plezbert/", acknowledgement = ack-nhfb, keywords = "design; experimentation; languages; measurement; performance; theory", subject = "{\bf C.2.1} Computer Systems Organization, COMPUTER-COMMUNICATION NETWORKS, Network Architecture and Design, Internet. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @InProceedings{Bank:1997:PTJ, author = "Joseph A. Bank and Andrew C. Myers and Barbara Liskov", title = "Parameterized types for {Java}", crossref = "ACM:1997:CRP", pages = "132--145", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p132-bank/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, User interfaces. {\bf H.5.2} Information Systems, INFORMATION INTERFACES AND PRESENTATION, User Interfaces.", } @InProceedings{Odersky:1997:PJT, author = "Martin Odersky and Philip Wadler", title = "{Pizza} into {Java}: translating theory into practice", crossref = "ACM:1997:CRP", pages = "146--159", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p146-odersky/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @InProceedings{Hogstedt:1997:DIT, author = "Karin H{\"o}gstedt and Larry Carter and Jeanne Ferrante", title = "Determining the idle time of a tiling", crossref = "ACM:1997:CRP", pages = "160--173", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p160-hogstedt/", acknowledgement = ack-nhfb, keywords = "design; languages; measurement; performance; theory; verification", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency.", } @InProceedings{Godefroid:1997:MCP, author = "Patrice Godefroid", title = "Model checking for programming languages using {VeriSoft}", crossref = "ACM:1997:CRP", pages = "174--186", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p174-godefroid/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; measurement; performance; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Model theory. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs.", } @InProceedings{Diniz:1997:STP, author = "Pedro Diniz and Martin Rinard", title = "Synchronization transformations for parallel computing", crossref = "ACM:1997:CRP", pages = "187--200", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p187-diniz/", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; languages; measurement; performance; theory", subject = "{\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\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 G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming.", } @InProceedings{Lim:1997:MPM, author = "Amy W. Lim and Monica S. Lam", title = "Maximizing parallelism and minimizing synchronization with affine transforms", crossref = "ACM:1997:CRP", pages = "201--214", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p201-lim/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; measurement; performance; theory; verification", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.4.1} Software, OPERATING SYSTEMS, Process Management, Synchronization. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Concurrent programming structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Ong:1997:CFF, author = "C.-H. L. Ong and C. A. Stewart", title = "A {Curry--Howard} foundation for functional computation with control", crossref = "ACM:1997:CRP", pages = "215--227", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p215-ong/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML.", } @InProceedings{Boudol:1997:CDS, author = "G{\'e}rard Boudol", title = "The $\pi$-calculus in direct style", crossref = "ACM:1997:CRP", pages = "228--242", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p228-boudol/", acknowledgement = ack-nhfb, keywords = "design; experimentation; languages; performance; theory; verification", 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. {\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Pierce:1997:BEP, author = "Benjamin C. Pierce and Davide Sangiorgi", title = "Behavioral equivalence in the polymorphic pi-calculus", crossref = "ACM:1997:CRP", pages = "242--255", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p242-pierce/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\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, Operational semantics.", } @InProceedings{Palamidessi:1997:CEP, author = "Catuscia Palamidessi", title = "Comparing the expressive power of the synchronous and the asynchronous $\pi$-calculus", crossref = "ACM:1997:CRP", pages = "256--265", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p256-palamidessi/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.2.1} Software, SOFTWARE ENGINEERING, Requirements/Specifications, CCS.", } @InProceedings{Cardelli:1997:PFL, author = "Luca Cardelli", title = "Program fragments, linking, and modularization", crossref = "ACM:1997:CRP", pages = "266--277", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p266-cardelli/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; measurement; performance; theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Modules and interfaces. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Rehof:1997:MTA, author = "Jakob Rehof", title = "Minimal typings in atomic subtyping", crossref = "ACM:1997:CRP", pages = "278--291", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p278-rehof/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf F.1.3} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Measures and Classes, Reducibility and completeness.", } @InProceedings{Saibi:1997:TAT, author = "Amokrane Sa{\"\i}bi", title = "Typing algorithm in type theory with inheritance", crossref = "ACM:1997:CRP", pages = "292--301", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p292-saibi/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification.", } @InProceedings{Bourdoncle:1997:TCH, author = "Fran{\c{c}}ois Bourdoncle and Stephan Merz", title = "Type checking higher-order polymorphic multi-methods", crossref = "ACM:1997:CRP", pages = "302--315", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p302-bourdoncle/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Cousot:1997:TAI, author = "Patrick Cousot", title = "Types as abstract interpretations", crossref = "ACM:1997:CRP", pages = "316--331", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p316-cousot/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics.", } @InProceedings{Nielson:1997:ICF, author = "Flemming Nielson and Hanne Riis Nielson", title = "Infinitary control flow analysis: a collecting semantics for closure analysis", crossref = "ACM:1997:CRP", pages = "332--345", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p332-nielson/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic.", } @InProceedings{Lesens:1997:AVP, author = "David Lesens and Nicolas Halbwachs and Pascal Raymond", title = "Automatic verification of parameterized linear networks of processes", crossref = "ACM:1997:CRP", pages = "346--357", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p346-lesens/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; measurement; performance; theory; verification", subject = "{\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Unbounded-action devices. {\bf G.1.1} Mathematics of Computing, NUMERICAL ANALYSIS, Interpolation, Extrapolation. {\bf I.2.8} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Invariants. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Deutsch:1997:CEA, author = "Alain Deutsch", title = "On the complexity of escape analysis", crossref = "ACM:1997:CRP", pages = "358--371", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p358-deutsch/", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; languages; performance; reliability; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Biswas:1997:DSA, author = "Sandip K. Biswas", title = "A demand-driven set-based analysis", crossref = "ACM:1997:CRP", pages = "372--385", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p372-biswas/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory; verification", subject = "{\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf G.1.6} Mathematics of Computing, NUMERICAL ANALYSIS, Optimization. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Wand:1997:DSU, author = "Mitchell Wand and Gregory T. Sullivan", title = "Denotational semantics using an operationally-based term model", crossref = "ACM:1997:CRP", pages = "386--399", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p386-wand/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Seidl:1997:CSH, author = "H. Seidl and M. H. S{\o}rensen", title = "Constraints to stop higher-order deforestation", crossref = "ACM:1997:CRP", pages = "400--413", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p400-seidl/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory; verification", subject = "{\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.1.1} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", } @InProceedings{Pettorossi:1997:RNW, author = "Alberto Pettorossi and Maurizio Proietti and Sophie Renault", title = "Reducing nondeterminism while specializing logic programs", crossref = "ACM:1997:CRP", pages = "414--427", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p414-pettorossi/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf F.1.2} Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf I.2.2} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Automatic Programming, Program transformation. {\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming.", } @InProceedings{Sands:1997:SRP, author = "David Sands", title = "From {SOS} rules to proof principles: an operational metatheory for functional languages", crossref = "ACM:1997:CRP", pages = "428--441", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p428-sands/", acknowledgement = ack-nhfb, keywords = "design; languages; performance; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Kennedy:1997:RPU, author = "Andrew J. Kennedy", title = "Relational parametricity and units of measure", crossref = "ACM:1997:CRP", pages = "442--455", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p442-kennedy/", acknowledgement = ack-nhfb, keywords = "design; languages; measurement; performance; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Paige:1997:HLR, author = "Robert Paige and Zhe Yang", title = "High level reading and data structure compilation", crossref = "ACM:1997:CRP", pages = "456--469", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p456-paige/", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; languages; performance; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Jansson:1997:PPP, author = "Patrik Jansson and Johan Jeuring", title = "{PolyP} --- a polytypic programming language extension", crossref = "ACM:1997:CRP", pages = "470--482", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p470-jansson/", acknowledgement = ack-nhfb, keywords = "design; languages; measurement; performance; theory", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf E.4} Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation.", } @InProceedings{Jones:1997:FPT, author = "Mark P. Jones", title = "First-class polymorphism with type inference", crossref = "ACM:1997:CRP", pages = "483--496", year = "1997", bibdate = "Mon May 3 12:56:11 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/263699/p483-jones/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Nipkow:1998:JTS, author = "Tobias Nipkow and David von Oheimb", title = "Java$_{\rm light}$ is type-safe-definitely", crossref = "ACM:1998:CRP", pages = "161--170", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p161-nipkow/", acknowledgement = ack-nhfb, keywords = "design; languages; verification", 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, Java. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Mechanical verification. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Hannan:1998:HU, author = "John Hannan and Patrick Hicks", title = "Higher-order {unCurrying}", crossref = "ACM:1998:CRP", pages = "1--11", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p1-hannan/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\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, Polymorphism. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Debray:1998:AAE, author = "Saumya Debray and Robert Muth and Matthew Weiert", title = "Alias analysis of executable code", crossref = "ACM:1998:CRP", pages = "12--24", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p12-debray/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; performance; theory", 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. {\bf C.0} Computer Systems Organization, GENERAL, Instruction set design.", } @InProceedings{Blanchet:1998:EAC, author = "Bruno Blanchet", title = "Escape analysis: correctness proof, implementation and experimental results", crossref = "ACM:1998:CRP", pages = "25--37", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p25-blanchet/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; theory; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Application Builder. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Schmidt:1998:DFA, author = "David A. Schmidt", title = "Data flow analysis is model checking of abstract interpretations", crossref = "ACM:1998:CRP", pages = "38--48", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p38-schmidt/", acknowledgement = ack-nhfb, keywords = "algorithms; verification", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Model checking. {\bf D.4.8} Software, OPERATING SYSTEMS, Performance, Modeling and prediction.", } @InProceedings{Jones:1998:BGC, author = "Simon Peyton Jones and Mark Shields and John Launchbury and Andrew Tolmach", title = "Bridging the gulf: a common intermediate language for {ML} and {Haskell}", crossref = "ACM:1998:CRP", pages = "49--61", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p49-peyton_jones/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Ariola:1998:CMS, author = "Zena M. Ariola and Amr Sabry", title = "Correctness of monadic state: an imperative call-by-need calculus", crossref = "ACM:1998:CRP", pages = "62--74", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p62-ariola/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\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, Compilers.", } @InProceedings{Minamide:1998:FRD, author = "Yasuhiko Minamide", title = "A functional representation of data structures with a hole", crossref = "ACM:1998:CRP", pages = "75--84", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p75-minamide/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Application Builder. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs.", } @InProceedings{Morrisett:1998:SFT, author = "Greg Morrisett and David Walker and Karl Crary and Neal Glew", title = "From system {F} to typed assembly language", crossref = "ACM:1998:CRP", pages = "85--97", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p85-morrisett/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Macro and assembly languages. {\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, Polymorphism. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Barthou:1998:MSE, author = "Denis Barthou and Albert Cohen and Jean-Fran{\c{c}}ois Collard", title = "Maximal static expansion", crossref = "ACM:1998:CRP", pages = "98--106", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p98-barthou/", acknowledgement = ack-nhfb, keywords = "algorithms; performance", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf E.1} Data, DATA STRUCTURES, Arrays. {\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.", } @InProceedings{Knobe:1998:ASF, author = "Kathleen Knobe and Vivek Sarkar", title = "Array {SSA} form and its use in parallelization", crossref = "ACM:1998:CRP", pages = "107--120", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p107-knobe/", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation; performance", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf E.1} Data, DATA STRUCTURES, Arrays. {\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.", } @InProceedings{Ghiya:1998:PPA, author = "Rakesh Ghiya and Laurie J. Hendren", title = "Putting pointer analysis to work", crossref = "ACM:1998:CRP", pages = "121--133", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p121-ghiya/", acknowledgement = ack-nhfb, keywords = "algorithms; design; experimentation", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS. {\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 D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Ball:1998:EPV, author = "Thomas Ball and Peter Mataga and Mooly Sagiv", title = "Edge profiling versus path profiling: the showdown", crossref = "ACM:1998:CRP", pages = "134--148", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p134-ball/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages; theory", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\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, Network problems.", } @InProceedings{Stata:1998:TSJ, author = "Raymie Stata and Mart{\'\i}n Abadi", title = "A type system for {Java} bytecode subroutines", crossref = "ACM:1998:CRP", pages = "149--160", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p149-stata/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", 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, Java. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Flatt:1998:CM, author = "Matthew Flatt and Shriram Krishnamurthi and Matthias Felleisen", title = "Classes and mixins", crossref = "ACM:1998:CRP", pages = "171--183", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p171-flatt/", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.1.5} Software, PROGRAMMING TECHNIQUES, Object-oriented Programming. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\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, Type structure. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Collberg:1998:MCR, author = "Christian Collberg and Clark Thomborson and Douglas Low", title = "Manufacturing cheap, resilient, and stealthy opaque constructs", crossref = "ACM:1998:CRP", pages = "184--196", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p184-collberg/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; security", subject = "{\bf D.2.0} Software, SOFTWARE ENGINEERING, General, Protection mechanisms. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.2.11} Software, SOFTWARE ENGINEERING, Software Architectures, Information hiding. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts.", } @InProceedings{Palsberg:1998:PFI, author = "Jens Palsberg and Christina Pavlopoulou", title = "From polyvariant flow information to intersection and union types", crossref = "ACM:1998:CRP", pages = "197--208", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p197-palsberg/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", 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. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.0} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, General.", } @InProceedings{Jensen:1998:IPC, author = "Thomas P. Jensen", title = "Inference of polymorphic and conditional strictness properties", crossref = "ACM:1998:CRP", pages = "209--221", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p209-jensen/", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification, Correctness proofs. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Program analysis.", } @InProceedings{DeFouw:1998:FIC, author = "Greg DeFouw and David Grove and Craig Chambers", title = "Fast interprocedural class analysis", crossref = "ACM:1998:CRP", pages = "222--236", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p222-defouw/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages; performance", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, Flow charts. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{Bodik:1998:PVA, author = "Rastisalv Bod{\'\i}k and Sadun Anik", title = "Path-sensitive value-flow analysis", crossref = "ACM:1998:CRP", pages = "237--251", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p237-bodik/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation", subject = "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\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, Optimization.", } @InProceedings{Pierce:1998:LTI, author = "Benjamin C. Pierce and David N. Turner", title = "Local type inference", crossref = "ACM:1998:CRP", pages = "252--265", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p252-pierce/", acknowledgement = ack-nhfb, keywords = "algorithms; design; languages; measurement; theory", 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, Polymorphism. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs, Specification techniques.", } @InProceedings{Nishimura:1998:STD, author = "Susumu Nishimura", title = "Static typing for dynamic messages", crossref = "ACM:1998:CRP", pages = "266--278", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p266-nishimura/", acknowledgement = ack-nhfb, keywords = "algorithms; theory", 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, Polymorphism. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages.", } @InProceedings{Schubert:1998:SUT, author = "Aleksy Schubert", title = "Second-order unification and type inference for {Church}-style polymorphism", crossref = "ACM:1998:CRP", pages = "279--288", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p279-schubert/", acknowledgement = ack-nhfb, keywords = "algorithms; theory; verification", 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, Polymorphism. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computability theory. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems.", } @InProceedings{Shields:1998:DTS, author = "Mark Shields and Tim Sheard and Simon Peyton Jones", title = "Dynamic typing as staged type inference", crossref = "ACM:1998:CRP", pages = "289--302", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p289-shields/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory; verification", 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, Data types and structures. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Application Builder. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Distributed programming.", } @InProceedings{Asperti:1998:PBR, author = "Andrea Asperti and Harry G. Marison", title = "Parallel beta reduction is not elementary recursive", crossref = "ACM:1998:CRP", pages = "303--315", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p303-asperti/", acknowledgement = ack-nhfb, keywords = "languages; performance; theory", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Network problems.", } @InProceedings{Hu:1998:PCF, author = "Zhenjiang Hu and Masato Takeichi and Wei--Ngan Chin", title = "Parallelization in calculational forms", crossref = "ACM:1998:CRP", pages = "316--328", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p316-hu/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance; theory; verification", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs.", } @InProceedings{Jagannathan:1998:SLI, author = "Suresh Jagannathan and Peter Thiemann and Stephen Weeks and Andrew Wright", title = "Single and loving it: must-alias analysis for higher-order languages", crossref = "ACM:1998:CRP", pages = "329--341", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p329-jagannathan/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; languages; performance; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @InProceedings{Aiken:1998:BI, author = "Alexander Aiken and David Gay", title = "Barrier inference", crossref = "ACM:1998:CRP", pages = "342--354", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p342-aiken/", acknowledgement = ack-nhfb, keywords = "design; experimentation; languages; verification", subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming, Parallel programming. {\bf D.2.4} Software, SOFTWARE ENGINEERING, Software/Program Verification. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Concurrent, distributed, and parallel languages.", } @InProceedings{Smith:1998:SIF, author = "Geoffrey Smith and Dennis Volpano", title = "Secure information flow in a multi-threaded imperative language", crossref = "ACM:1998:CRP", pages = "355--364", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p355-smith/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; security; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.3.0} Software, PROGRAMMING LANGUAGES, General. {\bf D.2.0} Software, SOFTWARE ENGINEERING, General, Protection mechanisms. {\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming.", } @InProceedings{Heintze:1998:SCP, author = "Nevin Heintze and Jon G. Riecke", title = "The {SLam} calculus: programming with secrecy and integrity", crossref = "ACM:1998:CRP", pages = "365--377", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p365-heintze/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; security; theory; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.2.0} Software, SOFTWARE ENGINEERING, General, Protection mechanisms. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Riely:1998:TLD, author = "James Riely and Matthew Hennessy", title = "A typed language for distributed mobile processes (extended abstract)", crossref = "ACM:1998:CRP", pages = "378--390", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p378-riely/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Leroy:1998:SPT, author = "Xavier Leroy and Fran{\c{c}}ois Rouaix", title = "Security properties of typed applets", crossref = "ACM:1998:CRP", pages = "391--403", year = "1998", bibdate = "Mon May 3 12:57:52 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/268946/p391-leroy/", acknowledgement = ack-nhfb, keywords = "languages; security; theory; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Eidorff:1999:ATT, author = "Peter Harry Eidorff and Fritz Henglein and Christian Mossin and Henning Niss and Morten Heine S{\o}rensen and Mads Tofte", title = "{AnnoDomini}: from type theory to {Year 2000} conversion tool", crossref = "ACM:1999:PPA", pages = "1--14", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p1-eidorff/", acknowledgement = ack-nhfb, subject = "{\bf K.6.0} Computing Milieux, MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS, General. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, COBOL. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Wansbrough:1999:OUP, author = "Keith Wansbrough and Simon Peyton Jones", title = "Once upon a polymorphic type", crossref = "ACM:1999:PPA", pages = "15--28", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p15-wansbrough/", acknowledgement = ack-nhfb, keywords = "verification", subject = "{\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @InProceedings{Kobayashi:1999:QT, author = "Naoki Kobayashi", title = "Quasi-linear types", crossref = "ACM:1999:PPA", pages = "29--42", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p29-kobayashi/", acknowledgement = ack-nhfb, keywords = "languages; measurement; verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism.", } @InProceedings{Moran:1999:ILC, author = "Andrew Moran and David Sands", title = "Improvement in a lazy context: an operational theory for call-by-need", crossref = "ACM:1999:PPA", pages = "43--56", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p43-moran/", acknowledgement = ack-nhfb, keywords = "languages", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Operational semantics.", } @InProceedings{Yelland:1999:CAJ, author = "Phillip M. Yelland", title = "A compositional account of the {Java} virtual machine", crossref = "ACM:1999:PPA", pages = "57--69", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p57-yelland/", acknowledgement = ack-nhfb, keywords = "measurement; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf H.5.1} Information Systems, INFORMATION INTERFACES AND PRESENTATION, Multimedia Information Systems, Artificial, augmented, and virtual realities. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Haskell. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism.", } @InProceedings{OCallahn:1999:SCT, author = "Robert O'Callahn", title = "A simple, comprehensive type system for {Java} bytecode subroutines", crossref = "ACM:1999:PPA", pages = "70--78", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p70-o_callahn/", acknowledgement = ack-nhfb, subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics.", } @InProceedings{Cardelli:1999:TMA, author = "Luca Cardelli and Andrew D. Gordon", title = "Types for mobile ambients", crossref = "ACM:1999:PPA", pages = "79--92", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p79-cardelli/", acknowledgement = ack-nhfb, keywords = "verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Riely:1999:TPT, author = "James Riely and Matthew Hennessy", title = "Trust and partial typing in open systems of mobile agents", crossref = "ACM:1999:PPA", pages = "93--104", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p93-riely/", acknowledgement = ack-nhfb, keywords = "measurement; reliability", subject = "{\bf I.2.11} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Distributed Artificial Intelligence. {\bf C.5.3} Computer Systems Organization, COMPUTER SYSTEM IMPLEMENTATION, Microcomputers. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Sagiv:1999:PSA, author = "Mooly Sagiv and Thomas Reps and Reinhard Wilhelm", title = "Parametric shape analysis via $3$-valued logic", crossref = "ACM:1999:PPA", pages = "105--118", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p105-sagiv/", acknowledgement = ack-nhfb, keywords = "algorithms; measurement", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic and constraint programming. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Logic programming. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Ramalingam:1999:ASI, author = "G. Ramalingam and John Field and Frank Tip", title = "Aggregate structure identification and its application to program analysis", crossref = "ACM:1999:PPA", pages = "119--132", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p119-ramalingam/", acknowledgement = ack-nhfb, keywords = "algorithms; reliability", subject = "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", } @InProceedings{Chatterjee:1999:RCI, author = "Ramkrishna Chatterjee and Barbara G. Ryder and William A. Landi", title = "Relevant context inference", crossref = "ACM:1999:PPA", pages = "133--146", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p133-chatterjee/", acknowledgement = ack-nhfb, keywords = "algorithms; measurement", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Object-oriented languages. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Abadi:1999:CCD, author = "Mart{\'\i}n Abadi and Anindya Banerjee and Nevin Heintze and Jon G. Riecke", title = "A core calculus of dependency", crossref = "ACM:1999:PPA", pages = "147--160", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p147-abadi/", acknowledgement = ack-nhfb, keywords = "verification", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Kfoury:1999:PDT, author = "A. J. Kfoury and J. B. Wells", title = "Principality and decidable type inference for finite-rank intersection types", crossref = "ACM:1999:PPA", pages = "161--174", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p161-kfoury/", acknowledgement = ack-nhfb, keywords = "algorithms", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Filinski:1999:RLM, author = "Andrzej Filinski", title = "Representing layered monads", crossref = "ACM:1999:PPA", pages = "175--188", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p175-filinski/", acknowledgement = ack-nhfb, keywords = "verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory.", } @InProceedings{Gupta:1999:SPC, author = "Vineet Gupta and Radha Jagadeesan and Prakash Panangaden", title = "Stochastic processes as concurrent constraint programs", crossref = "ACM:1999:PPA", pages = "189--202", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p189-gupta/", acknowledgement = ack-nhfb, subject = "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES, Concurrent Programming. {\bf G.3} Mathematics of Computing, PROBABILITY AND STATISTICS, Stochastic processes. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Waddell:1999:ESS, author = "Oscar Waddell and R. Kent Dybvig", title = "Extending the scope of syntactic abstraction", crossref = "ACM:1999:PPA", pages = "203--215", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p203-waddell/", acknowledgement = ack-nhfb, subject = "{\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications.", } @InProceedings{Xi:1999:DTP, author = "Hongwei Xi and Frank Pfenning", title = "Dependent types in practical programming", crossref = "ACM:1999:PPA", pages = "214--227", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p214-xi/", acknowledgement = ack-nhfb, subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf D.1.1} Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Polymorphism.", } @InProceedings{Myers:1999:JPM, author = "Andrew C. Myers", title = "{JFlow}: practical mostly-static information flow control", crossref = "ACM:1999:PPA", pages = "228--241", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p228-myers/", acknowledgement = ack-nhfb, keywords = "reliability; security", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Java. {\bf D.4.6} Software, OPERATING SYSTEMS, Security and Protection. {\bf K.4.1} Computing Milieux, COMPUTERS AND SOCIETY, Public Policy Issues, Privacy. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Ertl:1999:OCS, author = "M. Anton Ertl", title = "Optimal code selection in {DAGs}", crossref = "ACM:1999:PPA", pages = "242--249", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p242-ertl/", acknowledgement = ack-nhfb, keywords = "measurement", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\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.", } @InProceedings{Glew:1999:TLM, author = "Neal Glew and Greg Morrisett", title = "Type-safe linking and modular assembly language", crossref = "ACM:1999:PPA", pages = "250--261", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p250-glew/", acknowledgement = ack-nhfb, subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Macro and assembly languages. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS, Linked representations. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types.", } @InProceedings{Crary:1999:TMM, author = "Karl Crary and David Walker and Greg Morrisett", title = "Typed memory management in a calculus of capabilities", crossref = "ACM:1999:PPA", pages = "262--275", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p262-crary/", acknowledgement = ack-nhfb, keywords = "algorithms", 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. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } @InProceedings{Pessaux:1999:TAU, author = "Fran{\c{c}}ois Pessaux and Xavier Leroy", title = "Type-based analysis of uncaught exceptions", crossref = "ACM:1999:PPA", pages = "276--290", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p276-pessaux/", acknowledgement = ack-nhfb, keywords = "algorithms; experimentation; measurement", subject = "{\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, ML. {\bf I.2.3} Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis.", } @InProceedings{Wand:1999:CSU, author = "Mitchell Wand and Igor Siveroni", title = "Constraint systems for useless variable elimination", crossref = "ACM:1999:PPA", pages = "291--302", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p291-wand/", acknowledgement = ack-nhfb, keywords = "algorithms; reliability; verification", subject = "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf G.4} Mathematics of Computing, MATHEMATICAL SOFTWARE, Algorithm design and analysis. {\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Specifying and Verifying and Reasoning about Programs. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages. {\bf F.2.1} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Numerical Algorithms and Problems, Computation of transforms.", } @InProceedings{Ruckert:1999:CG, author = "Martin Ruckert", title = "Continuous grammars", crossref = "ACM:1999:PPA", pages = "303--310", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p303-ruckert/", acknowledgement = ack-nhfb, keywords = "measurement; reliability; verification", 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, Parsing.", } @InProceedings{Collberg:1999:SWM, author = "Christian Collberg and Clark Thomborson", title = "Software watermarking: models and dynamic embeddings", crossref = "ACM:1999:PPA", pages = "311--324", year = "1999", bibdate = "Mon May 3 12:58:58 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/292540/p311-collberg/", acknowledgement = ack-nhfb, keywords = "security", subject = "{\bf D.2.0} Software, SOFTWARE ENGINEERING, General. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques. {\bf D.4.6} Software, OPERATING SYSTEMS, Security and Protection. {\bf F.3.2} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages.", } %%% ==================================================================== %%% These entries must come last because they are cross-referenced %%% by others above. From version 0.04, ``bibsort -byyear'' will %%% correctly position Book entries that contain booktitle information. @Proceedings{ACM:1990:PAS, editor = "{ACM}", booktitle = "Proceedings of the {ACM SIGPLAN} '90 Conference on Programming Language Design and Implementation, {White Plains, New York}, {June} 20--22, 1990", title = "Proceedings of the {ACM SIGPLAN} '90 Conference on Programming Language Design and Implementation, {White Plains, New York}, {June} 20--22, 1990", volume = "25(6)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 351", month = jun, year = "1990", CODEN = "SINODQ", ISBN = "0-89791-364-7", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.S53 1990", bibdate = "Tue Nov 10 07:57:14 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, abstract = "This conference proceedings contains 30 papers. The main subjects are code generation, code positioning, register allocation, representing control, program optimization, floating-point numbers accurately, optimizing dynamically-typed object-oriented programs, higher-order attribute grammars and editing environments, program and data dependence, demand-driven interpretation of imperative languages, analysis of pointers and structures, and compact representations for control dependence.", acknowledgement = ack-nhfb, classification = "722; 723", conference = "Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation", conferenceyear = "1990", journalabr = "SIGPLAN Not", keywords = "Code Generation; Computer Operating Systems; Computer Programming --- Object Oriented Programming; Computer Programming Languages --- Design; Computer Systems, Digital --- Parallel Processing; Computers, Digital --- Computational Methods; Data Abstraction; Data Processing --- Data Structures; Object-Oriented Languages; Optimizing Compilers; Program Compilers; Register Allocation", meetingaddress = "White Plains, NY, USA", meetingdate = "Jun 20--22 1990", meetingdate2 = "06/20--22/90", pagecount = "351", sponsor = "Assoc for Computing Machinery, Special Interest Group on Programming Languages", } @Proceedings{ACM:1990:PPS, editor = "{ACM}", booktitle = "POPL '90. Proceedings of the seventeenth annual ACM symposium on Principles of programming languages, January 17--19, 1990, San Francisco, CA", title = "{POPL} '90. Proceedings of the seventeenth annual {ACM} symposium on Principles of programming languages, January 17--19, 1990, San Francisco, {CA}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1990", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon May 03 18:57:52 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:1990:PSA, editor = "{ACM}", key = "ACM SIGPLAN PPOPP '90", booktitle = "Proceedings of the Second {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPOPP}, {Seattle, Washington}, {March} 14--16, 1990", title = "Proceedings of the Second {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPOPP}, {Seattle, Washington}, {March} 14--16, 1990", volume = "25(3)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 206", month = mar, year = "1990", ISBN = "0-89791-350-7", ISBN-13 = "978-0-89791-350-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA 76.7 A1095 v.25 no.3 1990", bibdate = "Fri Aug 19 16:15:38 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, keywords = "parallel programming (computer science) --- congresses", } @Proceedings{ACM:1991:PAS, editor = "{ACM}", key = "ACM SIGPLAN PLDI '91", booktitle = "Proceedings of the {ACM SIGPLAN} '91 Conference on Programming Language Design and Implementation, {Toronto, Ontario, Canada}, {June} 26--28, 1991", title = "Proceedings of the {ACM SIGPLAN} '91 Conference on Programming Language Design and Implementation, {Toronto, Ontario, Canada}, {June} 26--28, 1991", volume = "26(6)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 356", year = "1991", ISBN = "0-89791-428-7", ISBN-13 = "978-0-89791-428-4", LCCN = "QA76.7.S53 1991", bibdate = "Thu Aug 18 03:30:22 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number: 548910.", series = ser-SIGPLAN, acknowledgement = ack-nhfb, keywords = "programming languages (electronic computers) --- congresses", } @Proceedings{ACM:1991:PPE, editor = "{ACM}", booktitle = "POPL '91. Proceedings of the eighteenth annual ACM symposium on Principles of programming languages, January 21--23, 1991, Orlando, FL", title = "{POPL} '91. Proceedings of the eighteenth annual {ACM} symposium on Principles of programming languages, January 21--23, 1991, Orlando, {FL}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1991", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Mon May 03 19:00:08 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:1991:PTA, editor = "{ACM}", key = "ACM SIGPLAN PPOPP '91", booktitle = "Proceedings of the Third {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPOPP}: {Williamsburg, Virginia}, {April} 21--24, 1991", title = "Proceedings of the Third {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPOPP}: {Williamsburg, Virginia}, {April} 21--24, 1991", volume = "26(7)", publisher = pub-ACM, address = pub-ACM:adr, pages = "ii + 223", year = "1991", ISBN = "0-89791-390-6", ISBN-13 = "978-0-89791-390-4", LCCN = "QA76.7 .S54 v.26:7", bibdate = "Fri Aug 19 02:40:44 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, keywords = "parallel programming (computer science) --- congresses", } @Proceedings{Koopman:1991:PST, editor = "Philip J. {Koopman, Jr.}", booktitle = "The proceedings of the second and third annual workshops for the ACM Special Interest Group on Forth: SIGForth '90, February 16--18, 1990, Dallas, Texas \ldots{} SIGForth '91, March 7--9, 1991, San Antonio, Texas", title = "The proceedings of the second and third annual workshops for the {ACM} Special Interest Group on Forth : {SIGF}orth '90, February 16--18, 1990, Dallas, Texas \ldots{} {SIGF}orth '91, March 7--9, 1991, San Antonio, Texas", publisher = pub-ACM, address = pub-ACM:adr, pages = "ii + 134", year = "1991", ISBN = "0-89791-462-7", ISBN-13 = "978-0-89791-462-8", LCCN = "QA 76.73 F24 S53 1991", bibdate = "Tue May 04 07:39:28 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number 817911.", acknowledgement = ack-nhfb, } @Proceedings{ACM:1992:AVP, editor = "{ACM}", key = "ACM SIGPLAN ASPLOS '92", booktitle = "{ASPLOS-V} proceedings", title = "{ASPLOS-V} proceedings", publisher = pub-ACM, address = pub-ACM:adr, pages = "xi + 296", year = "1992", ISBN = "0-89791-534-8 (paperback), 0-89791-535-6 (hard cover)", ISBN-13 = "978-0-89791-534-2 (paperback), 978-0-89791-535-9 (hard cover)", LCCN = "QA76.9.A73I573 1992", bibdate = "Thu Aug 18 03:30:22 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "SIGGRAPH Computer architecture news, volume 20, Special issue, October 1992. SIGOPS Operating systems review, volume 26, special issue, October 1992. SIGPLAN ACM SIGPLAN notices, volume 27, number 9, September 1992.", acknowledgement = ack-nhfb, keywords = "computer architecture --- congresses; operating systems (computers) --- congresses; programming languages (electronic computers) --- congresses", } @Proceedings{ACM:1992:CRN, editor = "{ACM}", key = "ACM SIGPLAN POPL '92", booktitle = "Conference record of the Nineteenth Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the symposium, {Albuquerque, New Mexico}, {January} 19--22, 1992", title = "Conference record of the Nineteenth Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the symposium, {Albuquerque, New Mexico}, {January} 19--22, 1992", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 366", year = "1992", ISBN = "0-89791-453-8", ISBN-13 = "978-0-89791-453-6", LCCN = "QA76.7 .A15 1992", bibdate = "Mon May 03 18:38:52 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number 54990.", URL = "http://www.acm.org/pubs/contents/proceedings/plan/143165/index.html", acknowledgement = ack-nhfb, keywords = "electronic digital computers --- programming --- congresses; programming languages (electronic computers) --- congresses", } @Proceedings{ACM:1992:FPF, editor = "{ACM}", booktitle = "{FORTH '92}. Proceedings of the fourth annual workshop on {Forth} from the classroom to the real world, {March 5--7, 1992, Kansas City, MO}", title = "{FORTH '92}. Proceedings of the fourth annual workshop on {Forth} from the classroom to the real world, {March 5--7, 1992, Kansas City, MO}", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1992", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Tue May 04 06:54:24 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, } @Proceedings{ACM:1992:PAS, editor = "{ACM}", booktitle = "Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation, San Francisco, California, June 17--19, 1992", title = "Proceedings of the {ACM} {SIGPLAN} '92 Conference on Programming Language Design and Implementation, San Francisco, California, June 17--19, 1992", volume = "27(7)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 352", year = "1992", CODEN = "SINODQ", ISBN = "0-89791-475-9 (soft cover), 0-89791-476-7 (hard cover)", ISBN-13 = "978-0-89791-475-8 (soft cover), 978-0-89791-476-5 (hard cover)", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Nov 10 07:57:18 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number: 548920.", series = ser-SIGPLAN, abstract = "This conference contains 30 papers all of which are abstracted and indexed individually. The topics covered are: program debugging techniques; debugging optimized codes; concurrent compilers; abstract machine; false data dependency; loop transformations; pointer aliasing; program transformation; register allocation; and code replication.", acknowledgement = ack-nhfb, classification = "723.1", conference = "Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation", conferenceyear = "1992", journalabr = "SIGPLAN Not", keywords = "Abstract machine; Algorithms; Computer programming; Computer programming languages; Concurrent compilers; Dataflow analysis; Loop transformations; Optimized code debugging; Pointer aliasing; Program compilers; Program debugging", meetingaddress = "San Francisco, CA, USA", meetingdate = "Jun 17--19 1992", meetingdate2 = "06/17--19/92", pagecount = "352", sponsor = "ACM", } @Proceedings{ACM:1993:CRT, editor = "{ACM}", key = "ACM SIGPLAN POPL '93", booktitle = "Conference record of the Twentieth Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the symposium, {Charleston, South Carolina}, {January} 10--13, 1993", title = "Conference record of the Twentieth Annual {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the symposium, {Charleston, South Carolina}, {January} 10--13, 1993", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 510", year = "1993", ISBN = "0-89791-560-7 (soft cover), 0-89791-561-5 (series hard cover)", ISBN-13 = "978-0-89791-560-1 (soft cover), 978-0-89791-561-8 (series hard cover)", LCCN = "QA76.7 .A15 1993", bibdate = "Mon May 03 18:38:48 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number 549930.", URL = "http://www.acm.org/pubs/contents/proceedings/plan/158511/index.html", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6170 (Expert systems)", confdate = "10-13 Jan. 1993", conflocation = "Charleston, SC, USA", confsponsor = "ACM", keywords = "Compilers; Computational complexity; electronic digital computers --- programming --- congresses; Functional programming; Lambda calculus; Lazy evaluation; Logic programming; Object-oriented languages; Parallel computing; Parametricity; Polymorphism; Program testing/debugging; Programming language principles; programming languages (electronic computers) --- congresses; Register allocation; Typed languages", thesaurus = "Computational complexity; High level languages; Lambda calculus; Program compilers; Programming; Programming theory; Storage allocation", } @Proceedings{ACM:1993:PASa, editor = "{ACM}", title = "Proceedings of the {ACM SIGPLAN} Symposium on Partial Evaluation and Semantics-Based Program Manipulation. {PEPM}'93", publisher = pub-ACM, address = pub-ACM:adr, pages = "iv + 215", year = "1993", ISBN = "0-89791-594-1", ISBN-13 = "978-0-89791-594-6", LCCN = "QA76.7.S97 1993", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, confdate = "14--16 May 1993", conflocation = "Copenhagen, Denmark", confsponsor = "ACM", } @Proceedings{ACM:1993:ASH, editor = "{ACM}", key = "HOPL'93", booktitle = "ACM SIGPLAN HOPL-II. 2nd ACM SIGPLAN History of Programming Languages Conference (Preprints)", title = "{ACM SIGPLAN HOPL-II}. 2nd {ACM SIGPLAN} History of Programming Languages Conference (Preprints)", volume = "28(3)", publisher = pub-ACM, address = pub-ACM:adr, month = mar, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", confdate = "20-23 April 1993", conflocation = "Cambridge, MA, USA", confsponsor = "ACM", keywords = "Ada; ALGOL 68; C; C++; CLU; Concurrent Pascal; FORMAC; Forth; Icon; Lisp; Pascal; Prolog; Simulation languages; Smalltalk", thesaurus = "High level languages; History", } @Proceedings{ACM:1993:FAS, editor = "{ACM}", key = "PPPP'93", booktitle = "Fourth {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming", title = "Fourth {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming", volume = "28(7)", publisher = pub-ACM, address = pub-ACM:adr, month = jul, year = "1993", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 18:49:37 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C6110J (Object-oriented programming); C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "19-22 May 1993", conflocation = "San Diego, CA, USA", confsponsor = "ACM", keywords = "Comparative evaluation; Compilers; Concurrent OO languages; Data structures; Environments; Parallel languages; Parallel programming principles; Parallel programs; PPOPP; Shared/distributed memory systems implementations; Symbolic computation", thesaurus = "Data structures; Multiprocessing systems; Object-oriented languages; Parallel algorithms; Parallel languages; Parallel programming; Program compilers", } @Proceedings{ACM:1993:PASb, editor = "{ACM}", key = "ACM SIGPLAN PLDI '93", booktitle = "Proceedings of the {ACM SIGPLAN} '93 Conference on Programming Language Design and Implementation: {Albuquerque, New Mexico}, {June} 23--25, 1993", title = "Proceedings of the {ACM SIGPLAN} '93 Conference on Programming Language Design and Implementation: {Albuquerque, New Mexico}, {June} 23--25, 1993", volume = "28(6)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 313", year = "1993", ISBN = "0-89791-598-4", ISBN-13 = "978-0-89791-598-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7.A152 v. 28, no. 6", bibdate = "Thu Aug 18 03:30:22 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, keywords = "programming languages (electronic computers) --- congresses", } @Proceedings{ACM:1993:PFA, editor = "{ACM}", key = "ACM SIGPLAN PPOPP '93", booktitle = "Proceedings of the Fourth {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPOPP}: {San Diego, California}, {May} 19--22, 1993", title = "Proceedings of the Fourth {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPOPP}: {San Diego, California}, {May} 19--22, 1993", volume = "28(7)", publisher = pub-ACM, address = pub-ACM:adr, pages = "ix + 259", year = "1993", ISBN = "0-89791-589-5", ISBN-13 = "978-0-89791-589-2", LCCN = "QA76.7 .S54 v. 28:7", bibdate = "Thu Aug 18 03:30:22 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, keywords = "parallel programming --- congresses", } @Proceedings{ACM:1993:PSA, editor = "{ACM}", key = "ACM SIGPLAN HOPL '93", booktitle = "Preprints: the Second {ACM SIGPLAN} History of Programming Languages Conference ({HOPL-II}): {April} 20--23, 1993, {Cambridge, Massachusetts, USA}", title = "Preprints: the Second {ACM SIGPLAN} History of Programming Languages Conference ({HOPL-II}): {April} 20--23, 1993, {Cambridge, Massachusetts, USA}", volume = "28(3)", publisher = pub-ACM, address = pub-ACM:adr, pages = "xii + 370", year = "1993", ISBN = "0-89791-570-4", ISBN-13 = "978-0-89791-570-0", LCCN = "QA76.7 .S54 v.28:3", bibdate = "Fri Aug 19 01:49:52 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, keywords = "programming languages (electronic computers) --- congresses", } @Proceedings{ACM:1994:CRP, editor = "{ACM}", booktitle = "Conference record of {POPL} '94, 21st {ACM SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium: Portland, Oregon, January 17--21, 1994", title = "Conference record of {POPL} '94, 21st {ACM SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium: Portland, Oregon, January 17--21, 1994", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 492", year = "1994", ISBN = "0-89791-636-0", ISBN-13 = "978-0-89791-636-3", LCCN = "QA76.7 .A15 1994", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/contents/proceedings/plan/174675/index.html", abstract = "The following topics were dealt with: programming language principles; OOP; type theory; program correctness; lambda calculus; garbage collection; logic programming; scheduling; data flow graphs; functional programming; and continuation passing.", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "17--21 Jan. 1994", conflocation = "Portland, OR, USA", confsponsor = "ACM", keywords = "Continuation passing; Data flow graphs; Functional programming; Garbage collection; Lambda calculus; Logic programming; OOP; Program correctness; Programming language principles; Scheduling; Type theory", thesaurus = "High level languages; Lambda calculus; Object-oriented programming; Program compilers; Program verification; Storage management; Type theory", } @Proceedings{ACM:1994:PAS, editor = "{ACM}", key = "PESPPM'94", booktitle = "Proceedings of ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation", title = "Proceedings of {ACM SIGPLAN} Workshop on Partial Evaluation and Semantics-Based Program Manipulation", publisher = "Univ. Melbourne", address = "Melbourne, Vic., Australia", pages = "ii + 142", month = "????", year = "1994", bibdate = "Thu Dec 14 17:25:16 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "25 June 1994", conflocation = "Orlando, FL, USA", keywords = "Applications; Partial evaluation; Program analyses; Program transformation; Semantics-based program manipulation", pubcountry = "Australia", thesaurus = "Partial evaluation [compilers]; Program diagnostics; Program interpreters", } @Proceedings{ACM:1994:AWI, editor = "{ACM}", booktitle = "{ACM Workshop on Interface Definition Languages. Portland, OR, USA, 20 January, 1994}", title = "{ACM Workshop on Interface Definition Languages. Portland, OR, USA, 20 January, 1994}", volume = "29(8)", publisher = pub-ACM, address = pub-ACM:adr, pages = "138", month = aug, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6180 (User interfaces)", conftitle = "ACM Workshop on Interface Definition Languages", keywords = "high level languages; implementations; interface languages; interfaces; natural languages; user interface management systems; user interfaces", sponsororg = "ACM", treatment = "P Practical", } @Proceedings{ACM:1994:SIC, editor = "ACM", booktitle = "{Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI). San Jose, CA, USA, 4--7 October, 1994}", title = "{Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI). San Jose, CA, USA, 4--7 October, 1994}", volume = "29(11)", publisher = pub-ACM, address = pub-ACM:adr, pages = "328", month = nov, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, classification = "C5220 (Computer architecture); C6140 (Programming languages); C6150J (Operating systems)", conflocation = "", conftitle = "Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI)", keywords = "architectural support; code transformation; computer architecture; instrumentation; measurement; memory access; multithreading; operating systems; operating systems (computers); parallel machines; programming languages; shares memory multiprocessors; uniprocessor performance", sponsororg = "ACM; IEEE Comput. Soc", } @Proceedings{ACM:1994:ASC, editor = "{ACM}", booktitle = "{ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI). Orlando, FL, USA, 20--24 June, 1994}", title = "{ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI). Orlando, FL, USA, 20--24 June, 1994}", volume = "29(6)", publisher = pub-ACM, address = pub-ACM:adr, pages = "360", month = jun, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", conftitle = "ACM SIGPLAN '94 Conference on Programming Language Design and Implementation (PLDI)", keywords = "address calculation; array access errors; backtracking; cache performance; CLP; code replication; compilation techniques; continuation passing; garbage collected programs; high level languages; jump debugging; jump statements; lazy functional state threads; link-time optimisation; memory access coalescing; optimal tracing; optimisation; partial dead code elimination; pointer-based data structures; Presburger Formulas; program analysis tools; program compilers; program debugging; program optimisation; program structure tree; programming; programming language design; programming theory; programming theory program debugging; Prolog; register allocation; slicing programs; Standard ML; type analysis; zero-cost range splitting", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Proceedings{ACM:1994:NAC, editor = "{ACM}", booktitle = "{Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94. Portland, OR, USA, 23--27 October, 1994}", title = "{Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94. Portland, OR, USA, 23--27 October, 1994}", volume = "29(10)", publisher = pub-ACM, address = pub-ACM:adr, pages = "453", month = oct, year = "1994", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Fri Apr 24 18:36:02 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6110J (Object-oriented programming); C6120 (File organisation); C6140D (High level languages); C6150N (Distributed systems); C6160J (Object-oriented databases)", conftitle = "Ninth Annual Conference on Object-Oriented Programming Systems, Languages, and Applications. OOPSLA '94", keywords = "abstract data types; concurrent OOP; databases; distributed processing; exemplars; file systems; inheritance; language implementation; metaclasses; multiple inheritance; object orientation; object-oriented analysis; object-oriented databases; object-oriented languages; object-oriented methods; object-oriented programming; object-oriented programming systems; OODB benchmarking; OOP environments; persistent systems; Smalltalk; type theory", sponsororg = "ACM", treatment = "P Practical; T Theoretical or Mathematical", } @Proceedings{ACM:1995:ASW, key = "IR'95", booktitle = "ACM SIGPLAN Workshop on Intermediate Representations (IR'95)", title = "{ACM SIGPLAN} Workshop on Intermediate Representations ({IR}'95)", volume = "30(3)", publisher = pub-ACM, address = pub-ACM:adr, month = mar, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Dec 14 17:25:16 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6150C (Compilers, interpreters and other processors); C6150G (Diagnostic, testing, debugging and evaluating systems)", confdate = "22 Jan. 1995", conflocation = "San Francisco, CA, USA", keywords = "Compilation; Computer program manipulation; Data flow graphs; Dataflow analysis; Dominator trees; Retargetable intermediate representation; TOBEY intermediate languages", thesaurus = "Data flow analysis; Data flow graphs; Program compilers; Programming theory; Trees [mathematics]", } @Proceedings{ACM:1995:CRP, editor = "{ACM}", booktitle = "Conference record of {POPL} '95, 22nd {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium: San Francisco, California, January 22--25, 1995", title = "Conference record of {POPL} '95, 22nd {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium: San Francisco, California, January 22--25, 1995", publisher = pub-ACM, address = pub-ACM:adr, pages = "vii + 408", year = "1995", ISBN = "0-89791-692-1", ISBN-13 = "978-0-89791-692-9", LCCN = "QA 76.7 A11 1995", bibdate = "Mon May 3 17:47:49 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number: 549950.", URL = "http://www.acm.org/pubs/contents/proceedings/plan/199448/index.html", acknowledgement = ack-nhfb, alttitle = "Proceedings, 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL '95", annote = "Sponsored by the Association for Computing Machinery, Special Interest Group on Algorithms and Computation Theory (SIGACT), Special Interest Group on Programming Languages (SIGPLAN).", keywords = "Programming languages (Electronic computers) --- Congresses.", } @Proceedings{ACM:1995:OCO, editor = "{ACM}", booktitle = "OOPSLA '95: Conference on Object-Oriented Programming Systems, Languages, and Applications: conference proceedings. October 15--19, 1995, Austin, Texas", title = "{OOPSLA} '95: Conference on Object-Oriented Programming Systems, Languages, and Applications: conference proceedings. October 15--19, 1995, Austin, Texas", volume = "30(10)", publisher = pub-AW # " and " # pub-ACM, address = pub-AW:adr # " and " # pub-ACM:adr, pages = "xiii + 483", year = "1995", ISBN = "0-89791-703-0, 0-201-87810-0", ISBN-13 = "978-0-89791-703-2, 978-0-201-87810-3", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.64.C67 1995", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number 548951.", series = j-SIGPLAN, acknowledgement = ack-nhfb, source = "OOPSLA '95", sponsor = "ACM. Special Interest Group on Programming Languages.", } @Proceedings{Bilow:1995:OAP, editor = "Steven Craig Bilow and Patricia S. Bilow", booktitle = "OOPSLA '95: Addendum to the Proceedings", title = "{OOPSLA} '95: Addendum to the Proceedings", volume = "6(4)", publisher = pub-ACM, address = pub-ACM:adr, pages = "vi + 217", year = "1995", ISBN = "0-89791-721-9", ISBN-13 = "978-0-89791-721-6", ISSN = "1055-6400", LCCN = "QA 76.64 O56 v.6 no.4 1995", bibdate = "Fri Apr 30 12:33:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-OOPS-MESSENGER, acknowledgement = ack-nhfb, annote = "Addendum to the proceedings; See also 0578.6405 vol 30 no 10 1995 for Selected Papers and Programme.", source = "OOPSLA '95", } @Proceedings{Ferrante:1995:FAS, editor = "Jeanne Ferrante and David Padua", booktitle = "Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP", title = "Fifth {ACM SIGPLAN} Symposium on Principles and Practice of Parallel Programming, {PPoPP}", volume = "30(8)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 226", month = aug, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, abstract = "The following topics were dealt with: parallel programming; parallel languages; recurrent loop nests; dataflow analysis; program optimisation; image histogramming; array data alignment; multiprogramming; and active message handling.", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory); C6110P (Parallel programming); C6140D (High level languages); C6150N (Distributed systems software)", confdate = "19--21 July 1995", conflocation = "Santa Barbara, CA, USA", confsponsor = "ACM", keywords = "Active message handling; Array data alignment; Dataflow analysis; Image histogramming; Multiprogramming; Parallel languages; Parallel programming; Program optimisation; Recurrent loop nests", thesaurus = "Data flow computing; Message passing; Multiprogramming; Parallel languages; Parallel programming", } @Proceedings{Gerber:1995:ASW, editor = "Richard Gerber and Thomas Marlowe", booktitle = "ACM SIGPLAN 1995 Workshop on Languages, Compilers, and Tools for Real-Time Systems", title = "{ACM SIGPLAN} 1995 Workshop on Languages, Compilers, and Tools for Real-Time Systems", volume = "30(11)", publisher = pub-ACM, address = pub-ACM:adr, pages = "iii + 155", month = nov, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, abstract = "The following topics were dealt with: real time systems languages, compilers and tools; scheduling; formal specification; visual programming; parallel programming; and systems analysis.", acknowledgement = ack-nhfb, classification = "C0310F (Software development management); C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "21--22 June 1995", conflocation = "La Jolla, CA, USA", keywords = "Compilers; Formal specification; Parallel programming; Real time systems languages; Scheduling; Systems analysis; Visual programming", thesaurus = "Formal specification; High level languages; Program compilers; Programming; Real-time systems; Scheduling", } @Proceedings{Wirfs-Brock:1995:OTA, editor = "Rebecca J. Wirfs-Brock and Mary E. S. Loomis", booktitle = "{OOPSLA} '95: Tenth Annual Conference on Object-Oriented Programming Systems, Languages and Applications", title = "{OOPSLA} '95: Tenth Annual Conference on Object-Oriented Programming Systems, Languages and Applications", volume = "30(10)", publisher = pub-ACM, address = pub-ACM:adr, pages = "xiii + 483", year = "1995", CODEN = "SINODQ", ISBN = "0-201-87810-0", ISBN-13 = "978-0-201-87810-3", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Dec 30 17:26:15 MST 1995", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{Wall:1995:ASC, editor = "David W. Wall", booktitle = "ACM SIGPLAN '95 Conference on Programming Language Design and Implementation (PLDI)", title = "{ACM SIGPLAN} '95 Conference on Programming Language Design and Implementation ({PLDI})", volume = "30(6)", publisher = pub-ACM, address = pub-ACM:adr, pages = "8 + 327", month = jun, year = "1995", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Sep 7 07:51:54 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, abstract = "The following topics were dealt with: programming language design and implementation; data structures; branch prediction; compilers; storage management; parallel programming; and scheduling.", acknowledgement = ack-nhfb, classification = "C6110P (Parallel programming); C6120 (File organisation); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", confdate = "18--21 June 1995", conflocation = "La Jolla, CA, USA", confsponsor = "ACM", keywords = "Branch prediction; Compilers; Data structures; Parallel programming; Programming language design; Scheduling; Storage management", thesaurus = "Data structures; High level languages; Parallel programming; Program compilers; Scheduling; Storage management", } @Proceedings{ACM:1996:AVP, editor = "{ACM}", booktitle = "ASPLOS-VII proceedings / Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, Massachusetts, October 1--5, 1996", title = "{ASPLOS-VII} proceedings / Seventh International Conference on Architectural Support for Programming Languages and Operating Systems, Cambridge, Massachusetts, October 1--5, 1996", volume = "31(9)", publisher = pub-ACM, address = pub-ACM:adr, pages = "vii + 290", month = sep, year = "1996", CODEN = "SINODQ", ISBN = "0-89791-767-7", ISBN-13 = "978-0-89791-767-4", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Mon May 03 08:17:52 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Co-published as SIGPLAN Notices {\bf 31}(9), September 1996, as SIGOPS Operating Systems Review {\bf 30}(5), December 1996, and as SIGARCH Computer Architecture News, {\bf 24}(special issue), October 1996.", series = ser-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1996:CRP, editor = "{ACM}", booktitle = "Conference record of {POPL} '96, 23rd {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium: St. Petersburg Beach, Florida, 21--24 January 1996", title = "Conference record of {POPL} '96, 23rd {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium: St. Petersburg Beach, Florida, 21--24 January 1996", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 423", year = "1996", ISBN = "0-89791-769-3", ISBN-13 = "978-0-89791-769-8", LCCN = "QA76.7 A15 1996", bibdate = "Mon May 3 17:47:49 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number: 549960.", URL = "http://www.acm.org/pubs/contents/proceedings/plan/237721/index.html", acknowledgement = ack-nhfb, alttitle = "Proceedings, 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages POPL '96", keywords = "Programming languages (Electronic computers) --- Congresses.", } @Proceedings{ACM:1996:PASa, editor = "{ACM}", booktitle = "Proceedings of the {ACM SIGPLAN '96 Conference on Programming Language Design and Implementation ({PLDI}), Philadelphia, {PA} May 21--24, 1996, Sponsored by the Special Interest Group on Programming Languages, Association for Computing Machinery}", title = "Proceedings of the {ACM SIGPLAN '96 Conference on Programming Language Design and Implementation ({PLDI}), Philadelphia, {PA} May 21--24, 1996, Sponsored by the Special Interest Group on Programming Languages, Association for Computing Machinery}", volume = "31(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 300", month = may, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 10:59:33 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1996:PASb, editor = "{ACM}", booktitle = "Proceedings of the {ACM SIGPLAN '96 International Conference on Functional Programming (ICFP '96), May 24--26, 1996}", title = "Proceedings of the {ACM SIGPLAN '96 International Conference on Functional Programming (ICFP '96), May 24--26, 1996}", volume = "31(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "vi + 273", month = jun, year = "1996", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu Aug 15 10:59:33 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1997:CRP, editor = "{ACM}", booktitle = "Conference record of POPL '97, the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the symposium, Paris, France, 15--17 January 1997", title = "Conference record of {POPL} '97, the 24th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the symposium, Paris, France, 15--17 January 1997", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 497", year = "1997", ISBN = "0-89791-853-3", ISBN-13 = "978-0-89791-853-4", LCCN = "QA 76.7 A11 1997", bibdate = "Mon May 3 17:47:49 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", URL = "http://www.acm.org/pubs/contents/proceedings/plan/263699/index.html", acknowledgement = ack-nhfb, keywords = "Electronic digital computers --- Programming --- Congresses; Programming languages (Electronic computers) --- Congresses.", } @Proceedings{ACM:1997:PAS, editor = "ACM", booktitle = "Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), Las Vegas, Nevada, 15--18 June 1997", title = "Proceedings of the {ACM} {SIGPLAN} '97 Conference on Programming Language Design and Implementation ({PLDI}), Las Vegas, Nevada, 15--18 June 1997", volume = "32(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 365", year = "1997", ISBN = "0-89791-907-6", ISBN-13 = "978-0-89791-907-4", LCCN = "QA 76.7 A1095 v.32 no.5 1997", bibdate = "Thu May 13 12:54:38 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1997:PFT, editor = "{ACM}", title = "{POPL} the first ten years: {ACM Symposium on Principles of Programming Languages} proceedings compendium, 1973--1983", publisher = pub-ACM, address = pub-ACM:adr, year = "1997", ISBN = "0-89791-947-5", ISBN-13 = "978-0-89791-947-0", LCCN = "????", bibdate = "Mon May 3 17:47:49 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "CD ROM only.", acknowledgement = ack-nhfb, alttitle = "POPL: the first ten years proceedings compendium 1973 - 1983 Principles of programming languages", annote = "System requirements: Microsoft Windows 3.x, 95, or NT; Apple Macintosh; Unix; Acrobat Reader and Search 3.0; CD-ROM drive.", keywords = "Congresses; Electronic digital computers --- Programming --- Congresses; Programming languages (Electronic Programming computers)", } @Proceedings{ACM:1998:AWJ, editor = "{ACM}", booktitle = "ACM 1998 Workshop on Java for High-Performance Network Computing", title = "{ACM} 1998 Workshop on Java for High-Performance Network Computing", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1998", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Thu Apr 27 10:40:59 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "Also published as {\em Concurrency: Practice and Experience}, {\bf 10}(11--13), September 1998, CODEN CPEXEI, ISSN 1040-3108.", URL = "http://www.cs.ucsb.edu/conferences/java98/program.html", acknowledgement = ack-nhfb, } @Proceedings{ACM:1998:CRP, editor = "ACM", booktitle = "Conference record of POPL '98: the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the Symposium, San Diego, California, 19--21 January 1998", title = "Conference record of {POPL} '98: the 25th {ACM} {SIGPLAN-SIGACT} Symposium on Principles of Programming Languages: papers presented at the Symposium, San Diego, California, 19--21 January 1998", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 408", year = "1998", ISBN = "0-89791-979-3", ISBN-13 = "978-0-89791-979-1", LCCN = "QA76.7 .A15 1998", bibdate = "Mon May 3 17:47:49 MDT 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number: 549981.", URL = "http://www.acm.org/pubs/contents/proceedings/plan/268946/index.html", acknowledgement = ack-nhfb, alttitle = "POPL '98 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages Principles of programming languages Proceedings 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages", keywords = "Electronic digital computers --- Programming --- Congresses; Programming languages (Electronic computers) --- Congresses.", } @Proceedings{ACM:1998:PASa, editor = "ACM", booktitle = "Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), Montr{\'e}al, Canada, 17--19 June 1998", title = "Proceedings of the {ACM} {SIGPLAN} '98 Conference on Programming Language Design and Implementation ({PLDI}), Montr{\'e}al, Canada, 17--19 June 1998", volume = "33(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 357", month = may, year = "1998", CODEN = "SINODQ", ISBN = "0-89791-987-4", ISBN-13 = "978-0-89791-987-6", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", LCCN = "QA76.7 .S54 v.33 no.5", bibdate = "Thu May 13 12:57:59 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = ser-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1998:PASb, editor = "{ACM}", booktitle = "Proceedings of the 1998 {ACM SIGPLAN\slash SIGSOFT} Workshop on Program Analysis for Software Tools and Engineering", title = "Proceedings of the 1998 {ACM SIGPLAN\slash SIGSOFT} Workshop on Program Analysis for Software Tools and Engineering", volume = "33(7)", publisher = pub-ACM, address = pub-ACM:adr, year = "1998", bibdate = "Sat Oct 28 08:38:35 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, classification = "722.1; 723; 723.1; 723.1.1; 723.2; 723.5", keywords = "C (programming language); Computer aided software engineering; Computer architecture; Computer software maintenance; Computer software selection and evaluation; Data flow analysis; Data storage equipment; Data structures; Galois connection; Interfaces (computer); Large scale systems; Legacy code modularization; Legacy systems; Multiple source code analysis; Pointer aliasing; Program compilers; Program debugging; Program profiling; Software package mansart; Software package optview; Static pointer analysis; Static program slicing", } @Proceedings{ACM:1999:PASa, editor = "ACM", booktitle = "Proceedings of the ACM SIGPLAN '99 Conference on Programming Language Design and Implementation (PLDI '99), Atlanta, Georgia, 2--4 May 1999", title = "Proceedings of the {ACM} {SIGPLAN} '99 Conference on Programming Language Design and Implementation ({PLDI} '99), Atlanta, Georgia, 2--4 May 1999", volume = "34(5)", publisher = pub-ACM, address = pub-ACM:adr, pages = "x + 304", year = "1999", ISBN = "1-58113-094-5", ISBN-13 = "978-1-58113-094-2", LCCN = "????", bibdate = "Thu Apr 27 07:12:05 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/pldi/301122/index.html; http://www.acm.org/pubs/contents/proceedings/pldi/301618/index.html; http://www.cs.rutgers.edu/pldi99/program.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1999:PASb, editor = "{ACM}", booktitle = "Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES'99), Atlanta, Georgia, USA, May 5, 1999", title = "Proceedings of the {ACM} {SIGPLAN} 1999 Workshop on Languages, Compilers, and Tools for Embedded Systems ({LCTES}'99), Atlanta, Georgia, {USA}, May 5, 1999", volume = "34(7)", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", month = jul, year = "1999", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Thu Apr 27 07:05:06 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1999:PASc, editor = "{ACM}", booktitle = "Proceedings of the 1999 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP'99), Atlanta, Georgia, 4--6 May 1999", title = "Proceedings of the 1999 {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming ({PPOPP}'99), Atlanta, Georgia, 4--6 May 1999", volume = "34(8)", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", month = aug, year = "1999", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Thu Apr 27 07:03:12 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1999:PASd, editor = "{ACM}", booktitle = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '99): September 27--29, 1999, Paris, France", title = "Proceedings of the {ACM} {SIGPLAN} International Conference on Functional Programming ({ICFP} '99): September 27--29, 1999, Paris, France", volume = "34(9)", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 283", month = sep, year = "1999", ISBN = "1-58113-111-9", ISBN-13 = "978-1-58113-111-6", LCCN = "????", bibdate = "Sat Oct 02 08:33:05 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", note = "ACM order number: 565990.", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1999:PASe, editor = "{ACM}", booktitle = "Proceedings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages \& Applications (OOPSLA '99), Denver, Colorado, USA, November 1--5, 1999", title = "Proceedings of the 1999 {ACM} {SIGPLAN} Conference on Object-Oriented Programming Systems, Languages \& Applications ({OOPSLA} '99), Denver, Colorado, {USA}, November 1--5, 1999", volume = "34(10)", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1999", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Thu Apr 27 07:08:39 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1999:PASf, editor = "{ACM}", booktitle = "Proceedings of the 2000 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), Boston, Massachusetts, USA, January 22--23, 2000", title = "Proceedings of the 2000 {ACM} {SIGPLAN} Workshop on Partial Evaluation and Semantics-Based Program Manipulation ({PEPM} '00), Boston, Massachusetts, {USA}, January 22--23, 2000", volume = "34(10)", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "1999", ISBN = "1-58113-201-8", ISBN-13 = "978-1-58113-201-4", LCCN = "????", bibdate = "Thu Apr 27 07:08:39 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, acknowledgement = ack-nhfb, } @Proceedings{ACM:1999:PPA, editor = "{ACM}", booktitle = "POPL '99. Proceedings of the 26th ACM SIGPLAN-SIGACT on Principles of programming languages, January 20--22, 1999, San Antonio, TX", title = "{POPL} '99. Proceedings of the 26th {ACM} {SIGPLAN-SIGACT} on Principles of programming languages, January 20--22, 1999, San Antonio, {TX}", publisher = pub-ACM, address = pub-ACM:adr, pages = "viii + 324", year = "1999", ISBN = "1-58113-095-3", ISBN-13 = "978-1-58113-095-9", LCCN = "????", bibdate = "Mon May 03 18:41:35 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, URL = "http://www.acm.org/pubs/contents/proceedings/plan/292540/index.html", acknowledgement = ack-nhfb, } @Proceedings{ACM:2000:PAS, editor = "{ACM}", booktitle = "Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation January 22--23, 2000, Boston, MA USA", title = "Proceedings of the 2000 {ACM} {SIGPLAN} workshop on Partial evaluation and semantics-based program manipulation January 22--23, 2000, Boston, {MA} {USA}", volume = "34(11)", publisher = pub-ACM, address = pub-ACM:adr, pages = "????", year = "2000", ISBN = "????", ISBN-13 = "????", LCCN = "????", bibdate = "Thu Apr 27 07:21:37 2000", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib", series = j-SIGPLAN, URL = "http://www.acm.org/pubs/contents/proceedings/pepm/328690/", acknowledgement = ack-nhfb, }