%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.10", %%% date = "09 July 2008", %%% time = "21:44:10 MDT", %%% filename = "actainfo.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "http://www.math.utah.edu/~beebe", %%% checksum = "53562 27225 97754 1051989", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "Acta Informatica, BibTeX, bibliography", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a COMPLETE bibliography of %%% publications in the journal Acta Informatica %%% (CODEN AINFA2, ISSN 0001-5903 (printed %%% version), 1432-0525 (electronic version)), %%% published by Springer-Verlag. %%% %%% Publication began with volume 1, number 1, in %%% 1971. The journal was published quarterly %%% through the end of 1975, then eight times %%% yearly until the end of 1996, and monthly %%% since the beginning of 1997. %%% %%% The publisher has a World Wide Web site %%% for the journal at %%% %%% http://link.springer.de/link/service/journals/00236/ %%% http://link.springer.de/link/service/journals/00236/tocs.htm %%% %%% with mirrors at %%% %%% http://link.springer-ny.com/link/service/journals/00236/ %%% http://link.springer-ny.com/link/service/journals/00236/tocs.htm %%% %%% This journal is unusual in that some volumes %%% span two years, some issues are assigned two %%% or more consecutive issue numbers, and no %%% months were prominently associated with issue %%% numbers until about volume 11. [The year/volume %%% confusion is rampant in databases, and took a %%% great deal of tedious editing and checking to %%% correct.] Citations in the journal to papers %%% in the journal normally just give volume, %%% pages, and year data. %%% %%% Almost all articles are published in English, %%% but 33 are in German, and 18 in French, and %%% none of those are more recent than 1986. %%% English translations are supplied for all of %%% the French and German titles. In later %%% issues, the journal covers and title pages %%% include English title translations and %%% abstracts; the author of this bibliography %%% will be grateful for improved translations of %%% early titles from readers of this file. %%% %%% Cross-references are supplied for all %%% comments, corrigenda, errata, and remarks, so %%% that citing one will automatically provide %%% citations of the others. %%% %%% At version 1.10, the year coverage looked %%% like this: %%% %%% 1971 ( 11) 1984 ( 28) 1997 ( 43) %%% 1972 ( 17) 1985 ( 37) 1998 ( 40) %%% 1973 ( 30) 1986 ( 44) 1999 ( 18) %%% 1974 ( 26) 1987 ( 36) 2000 ( 27) %%% 1975 ( 28) 1988 ( 40) 2001 ( 28) %%% 1976 ( 42) 1989 ( 41) 2002 ( 25) %%% 1977 ( 37) 1990 ( 29) 2003 ( 32) %%% 1978 ( 54) 1991 ( 31) 2004 ( 26) %%% 1979 ( 35) 1992 ( 35) 2005 ( 26) %%% 1980 ( 49) 1993 ( 33) 2006 ( 26) %%% 1981 ( 52) 1994 ( 36) 2007 ( 35) %%% 1982 ( 48) 1995 ( 33) 2008 ( 14) %%% 1983 ( 55) 1996 ( 37) %%% 19xx ( 2) %%% %%% Article: 1286 %%% %%% Total entries: 1286 %%% %%% About a fifth of the entries below have %%% missing issue months; citations in the %%% journal itself do not normally give that %%% information, and some major databases also %%% regrettably omit it. All journal issues from %%% at least volume 3 on carry month, and %%% sometimes day, information on the cover, %%% although in a few cases the library volumes %%% that I consulted had been carelessly trimmed %%% during binding, and that data was lost. I %%% have supplied month and day values for all %%% entries for which I have reliable data. %%% %%% The journal Web site HTML files contain %%% ``online publication'' day, month, and year %%% data, but it is unclear whether this is the %%% same as that for the paper edition. I have %%% collected this data and included it in a %%% table in the bibliography below. %%% %%% This bibliography was prepared by merging %%% data from the TeX Users Group bibliography %%% archive, the BibNet Project archive, the %%% Compendex database, the OCLC Contents1st %%% database, the huge Karlsruhe computer science %%% bibliography archive, the MathSciNet %%% database, and the journal Web pages. %%% Questionable values have been resolved by %%% searches in the Zentrallblat fuer Mathematik %%% database, and by consulting original journal %%% issues [only volumes 3 (1973) -- 28 (1991) %%% were available to the author, because of %%% library journal budget cuts, sigh...]. %%% %%% Numerous errors in the sources noted above %%% have been corrected. Spelling has been %%% verified with the UNIX spell and GNU ispell %%% programs using the exception dictionary %%% stored in the companion file with extension %%% .sok. %%% %%% 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 within each journal, %%% using bibsort -bypages. %%% %%% 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{ "\hyphenation{}" # "\ifx \undefined \cprime \def \cprime {$\mathsurround=0pt '$}\fi" # "\ifx \undefined \k \let \k = \c \fi" # "\ifx \undefined \ocirc \def \ocirc #1{{\accent'27#1}}\fi" # "\ifx \undefined \scr \let \scr = \cal \fi" # "\ifx \undefined \mathbb \def \mathbb #1{{\bf #1}} \fi" } %%% ==================================================================== %%% Acknowledgement abbreviations: @String{ack-js = "Joachim Schrod, Institute for Theoretical Informatics, Computer Science Department, Technical University of Darmstadt, Germany, e-mail: \path|schrod@iti.informatik.th-darmstadt.de|"} @String{ack-nhfb = "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|http://www.math.utah.edu/~beebe/|"} %%% ==================================================================== %%% Journal abbreviations: @String{j-ACTA-INFO = "Acta Informatica"} %%% ==================================================================== %%% Publication year/volume/number/day/month summary used by a small %%% utility, fix-missing-day-month.awk, to supply missing day/month %%% values, and check for inconsistencies: %%% %%% 1971 1 1 ?? jan %%% 1971 1 2 ?? oct %%% 1972 1 3 ?? feb %%% 1972 1 4 ?? nov %%% %%% 1973 2 1 ?? ???? %%% 1973 2 2 ?? aug %%% 1973 2 3 ?? ???? %%% 1973 2 4 ?? dec %%% %%% 1973 3 1 31 dec %%% 1974 3 2 7 may %%% 1974 3 3 22 jul %%% 1974 3 4 4 oct %%% %%% 1974 4 1 1 nov %%% 1975 4 2 ?? feb %%% 1975 4 3 31 jul %%% 1975 4 4 ?? ???? %%% %%% 1975 5 1--3 19 dec %%% 1975 5 4 19 dec %%% %%% 1976 6 1 31 mar %%% 1976 6 2 2 jul %%% 1976 6 3 10 aug %%% 1976 6 4 ?? ???? %%% %%% 1976 7 1 15 oct %%% 1976 7 2 ?? ???? %%% 1977 7 3 20 jan %%% 1977 7 4 1 feb %%% %%% 1977 8 1 29 mar %%% 1977 8 2 24 may %%% 1977 8 3 9 aug %%% 1977 8 4 25 nov %%% %%% 1977 9 1 13 dec %%% 1978 9 2 3 apr %%% 1978 9 3 5 may %%% 1978 9 4 21 jun %%% %%% 1978 10 1 4 aug %%% 1978 10 2 7 sep %%% 1978 10 3 2 oct %%% 1978 10 4 27 nov %%% %%% 1978 11 1 18 dec %%% 1979 11 2 3 jan %%% 1979 11 3 22 mar %%% 1979 11 4 30 may %%% %%% 1979 12 1 25 jun %%% 1979 12 2 24 jul %%% 1979 12 3 ?? oct %%% 1979 12 4 ?? nov %%% %%% 1980 13 1 ?? jan %%% 1980 13 2 ?? feb %%% 1980 13 3 ?? mar %%% 1980 13 4 ?? may %%% %%% 1980 14 1 ?? jun %%% 1980 14 2 ?? aug %%% 1980 14 3 ?? sep %%% 1980 14 4 ?? oct %%% %%% 1981 15 1 ?? dec %%% 1981 15 2 ?? dec %%% 1981 15 3 ?? jun %%% 1981 15 4 ?? aug %%% %%% 1981 16 1 ?? aug %%% 1981 16 2 ?? oct %%% 1981 16 3 ?? nov %%% 1981 16 4 ?? dec %%% %%% 1982 17 1 ?? apr %%% 1982 17 2 ?? jun %%% 1982 17 3 ?? aug %%% 1982 17 4 ?? oct %%% %%% 1982 18 1 ?? nov %%% 1982 18 2 ?? nov %%% 1982 18 3 ?? dec %%% 1983 18 4 ?? jan %%% %%% 1983 19 1 ?? apr %%% 1983 19 2 ?? apr %%% 1983 19 3 ?? jul %%% 1983 19 4 ?? sep %%% %%% 1983 20 1 ?? oct %%% 1983 20 2 ?? nov %%% 1983 20 3 ?? dec %%% 1983 20 4 ?? dec %%% %%% 1984 21 1 ?? may %%% 1984 21 2 ?? aug %%% 1984 21 3 ?? oct %%% 1984 21 4 ?? nov %%% 1984 21 5 ?? dec %%% 1985 21 6 ?? mar %%% %%% 1985 22 1 ?? apr %%% 1985 22 2 ?? jun %%% 1985 22 3 ?? aug %%% 1985 22 4 ?? oct %%% 1985 22 5 ?? dec %%% 1986 22 6 ?? mar %%% %%% 1986 23 1 ?? mar %%% 1986 23 2 ?? may %%% 1986 23 3 ?? jun %%% 1986 23 4 ?? aug %%% 1986 23 5 ?? sep %%% 1986 23 6 ?? nov %%% %%% 1987 24 1 ?? feb %%% 1987 24 2 ?? apr %%% 1987 24 3 ?? jun %%% 1987 24 4 ?? aug %%% 1987 24 5 ?? sep %%% 1987 24 6 ?? nov %%% %%% 1988 25 1 ?? jan %%% 1988 25 2 ?? feb %%% 1988 25 3 ?? apr %%% 1988 25 4 ?? may %%% 1988 25 5 ?? jun %%% 1988 25 6 ?? aug %%% %%% 1988 26 1--2 ?? oct %%% 1988 26 3 ?? nov %%% 1989 26 4 ?? feb %%% 1989 26 5 ?? mar %%% 1989 26 6 ?? jul %%% 1989 26 7 ?? sep %%% 1989 26 8 ?? oct %%% %%% 1989 27 1 ?? nov %%% 1989 27 2 ?? nov %%% 1989 27 3 ?? dec %%% 1990 27 4 ?? mar %%% 1990 27 5 ?? apr %%% 1990 27 6 ?? may %%% 1990 27 7 ?? jul %%% 1990 27 8 ?? sep %%% %%% 1990 28 1 ?? nov %%% 1990 28 2 ?? dec %%% 1991 28 3 ?? feb %%% 1991 28 4 ?? apr %%% 1991 28 5 ?? may %%% 1991 28 6 ?? jul %%% 1991 28 7 ?? oct %%% 1991 28 8 ?? nov %%% %%% 1992 29 1 ?? feb %%% 1992 29 2 ?? apr %%% 1992 29 3 ?? jun %%% 1992 29 4 ?? jul %%% 1992 29 5 ?? sep %%% 1992 29 6--7 ?? nov %%% 1992 29 8 ?? dec %%% %%% 1993 30 1 ?? jan %%% 1993 30 2 ?? mar %%% 1993 30 3 ?? may %%% 1993 30 4 ?? jul %%% 1993 30 5 ?? aug %%% 1993 30 6 ?? sep %%% 1993 30 7 ?? oct %%% 1993 30 8 ?? nov %%% %%% 1994 31 1 ?? jan %%% 1994 31 2 ?? ???? %%% 1994 31 3 ?? apr %%% 1994 31 4 ?? jun %%% 1994 31 5 ?? aug %%% 1994 31 6 ?? sep %%% 1994 31 7 ?? oct %%% 1994 31 8 ?? nov %%% %%% 1995 32 1 ?? feb %%% 1995 32 2 ?? ???? %%% 1995 32 3 ?? ???? %%% 1995 32 4 ?? ???? %%% 1995 32 5 ?? ???? %%% 1995 32 6 ?? ???? %%% 1995 32 7 ?? oct %%% 1995 32 8 ?? nov %%% %%% 1996 33 1 ?? ???? %%% 1996 33 2 ?? ???? %%% 1996 33 3 ?? may %%% 1996 33 4 ?? ???? %%% 1996 33 5 ?? ???? %%% 1996 33 6 ?? ???? %%% 1996 33 7 ?? ???? %%% 1996 33 8 ?? nov %%% %%% 1997 34 1 ?? ???? %%% 1997 34 2 ?? ???? %%% 1997 34 3 ?? ???? %%% 1997 34 4 ?? ???? %%% 1997 34 5 ?? ???? %%% 1997 34 6 ?? ???? %%% 1997 34 7 ?? ???? %%% 1997 34 8 ?? ???? %%% 1997 34 9 ?? ???? %%% 1997 34 10 ?? ???? %%% 1997 34 11 ?? ???? %%% 1997 34 12 ?? ???? %%% %%% 1998 35 2 ?? feb %%% 1998 35 3 ?? ???? %%% 1998 35 4 ?? ???? %%% 1998 35 5 ?? ???? %%% 1998 35 6 ?? jun %%% 1998 35 7 ?? ???? %%% 1998 35 8 ?? ???? %%% 1998 35 9 ?? ???? %%% 1998 35 10 ?? ???? %%% 1998 35 11 ?? ???? %%% 1998 35 12 ?? ???? %%% %%% 1999 36 1 ?? ???? %%% 1999 36 2 ?? ???? %%% 1999 36 3 ?? ???? %%% 1999 36 4 ?? ???? %%% 1999 36 5 ?? ???? %%% %%% The Web site has these ``online publication'' or ``last change'' %%% dates; it is unclear where any of these are related to paper %%% publication dates: %%% %%% 1995 32 1 3 oct 1997 %%% 1995 32 2 3 oct 1997 %%% 1995 32 3 3 oct 1997 %%% 1995 32 4 3 oct 1997 %%% 1995 32 5 3 oct 1997 %%% 1995 32 6 3 oct 1997 %%% 1995 32 7 3 oct 1997 %%% 1995 32 8 3 oct 1997 %%% %%% 1996 33 1 28 sep 1997 %%% 1996 33 2 28 sep 1997 %%% 1996 33 3 28 sep 1997 %%% 1996 33 4 28 sep 1997 %%% 1996 33 5 28 sep 1997 %%% 1996 33 6 28 sep 1997 %%% 1996 33 7 28 sep 1997 %%% 1996 33 8 28 sep 1997 %%% %%% 1997 34 1 28 apr 1997 %%% 1997 34 2 28 apr 1997 %%% 1997 34 3 28 apr 1997 %%% 1997 34 4 28 apr 1997 %%% 1997 34 5 5 may 1997 %%% 1997 34 6 27 may 1997 %%% 1997 34 7 8 jul 1997 %%% 1997 34 8 29 jul 1997 %%% 1997 34 9 29 aug 1997 %%% 1997 34 10 24 sep 1997 %%% 1997 34 11 29 oct 1997 %%% 1997 34 12 26 nov 1997 %%% %%% 1998 35 1 26 jan 1998 %%% 1998 35 2 12 feb 1998 %%% 1998 35 3 13 mar 1998 %%% 1998 35 4 8 apr 1998 %%% 1998 35 5 5 may 1998 %%% 1998 35 6 29 may 1998 %%% 1998 35 7 2 jul 1998 %%% 1998 35 8 6 aug 1998 %%% 1998 35 9 19 aug 1998 %%% 1998 35 10 6 oct 1998 %%% 1998 35 11 10 nov 1998 %%% 1998 35 12 14 dec 1998 %%% %%% 1999 36 1 21 jan 1999 %%% 1999 36 2 9 feb 1999 %%% 1999 36 3 25 mar 1999 %%% 1999 36 4 8 jul 1999 %%% 1999 36 05 13 sep 1999 %%% %%% ==================================================================== %%% Bibliography entries, sorted in publication order: @Article{Mihalache:19xx:GSR, author = "V. Mihalache and Gheorghe P{\u{a}}un and Grzegorz Rozenberg and Arto Salomaa", title = "Generating strings by replication: a simple case", journal = j-ACTA-INFO, volume = "??", number = "??", pages = "??--??", month = "????", year = "19xx", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/dna.bib", note = "To appear (in 1999 or 2000??).", } @Article{Smith:19xx:SDG, author = "Douglas R. Smith", title = "Structure and Design of Global Search Algorithms", journal = j-ACTA-INFO, volume = "??", number = "??", pages = "??--??", month = "????", year = "19xx", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Par.Arch.Indep.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/rewrite.bib", note = "To appear (in 1999 or 2000??).", } @Article{Coffman:1971:PPE, author = "Edward G. Coffman and Brian Randell", title = "Performance Predictions for Extended Paged Memories", journal = j-ACTA-INFO, volume = "1", number = "1", pages = "1--13", month = jan, year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Knuth:1971:OBS, author = "Donald E. Knuth", title = "Optimum Binary Search Trees", journal = j-ACTA-INFO, volume = "1", number = "1", pages = "14--25", month = jan, year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/is.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/online.competitive.algorithms.bib", annote = "Trees optimized by access frequency.", } @Article{Turski:1971:MDS, author = "Wladyslaw M. Turski", title = "A Model for Data Structures and Its Applications. {I}", journal = j-ACTA-INFO, volume = "1", number = "1", pages = "26--34", month = jan, year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Wirth:1971:PLP, author = "Niklaus Wirth", title = "The Programming Language {Pascal}", journal = j-ACTA-INFO, volume = "1", number = "1", pages = "35--63", month = jan, year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; ftp://ftp.ira.uka.de/pub/bibliography/Math/sparse.linear.systems.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/CLiCS.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", note = "See comments \cite{Habermann:1973:CCP,Lecarme:1975:MCP}.", abstract = "British standard 1982; Australian standard 1983; ISO ?", checked = "4 September 1990", keywords = "imperative programming language definition; Pascal; PLD", } @Article{Claus:1971:VPS, author = "Volker Claus", title = "{Ein Vollst{\"a}ndigkeitssatz f{\"u}r Programme und Schaltkreise}. ({German}) [{A} Completeness Condition for Programs and Circuits]", journal = j-ACTA-INFO, volume = "1", number = "1", pages = "64--78", month = jan, year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Knuth:1971:TSA, author = "Donald E. Knuth", title = "Top-Down Syntax Analysis", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "79--110", month = "????", year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "parse; parser; parsing; top down", } @Article{Langmaack:1971:ARC, author = "Hans Langmaack", title = "Application of Regular Canonical Systems to Grammars Translatable from Left to Right", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "111--114", month = "????", year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Dijkstra:1971:HOS, author = "Edsger W. Dijkstra", title = "Hierarchical Ordering of Sequential Processes", journal = j-ACTA-INFO, volume = "1", number = "2", pages = "115--138", month = oct, year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Sun Jan 15 17:52:42 1984", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/os.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/ProbAlgs.bib", note = "Reprinted in {\em Operating Systems Techniques\/}, C.A.R. Hoare and R.H. Perrot, Eds., Academic Press, 1972, pp. 72--93. This paper introduces the classical synchronization problem of Dining Philosophers.", abstract = "One of the primary functions of an operating system is to rebuild a machine that must be regarded as non-deterministic (on account of cycle stealing and interrupts) into a more or less deterministic automaton. Taming the degree of indeterminacy in steps will lead to a layered operating system. A bottom layer will be discussed and so will the adequacy of the interface it presents. An analysis of the requirements of the correctness proofs will give us an insight into the logical issues at hand. A `director-secretary' relationship will be introduced to reflect a possible discipline in the use of sequencing primitives.", keywords = "Deadlocks; operating systems synchronization communication; Semaphore", } @Article{Schonhage:1971:SBK, author = "A. Sch{\"o}nhage", title = "{Schnelle Berechnung von Kettenbruchentwicklungen}. ({German}) [{Fast} Calculation of Expansions of Continued Fractions]", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "139--144", month = "????", year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q05 90C32", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/PCV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/arith.bib", } @Article{Hwang:1971:OME, author = "F. K. Hwang and Shen Lin", title = "Optimal Merging of 2 Elements with {$n$} Elements", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "145--158", month = "????", year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Wed Nov 12 10:18:48 1986", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", owner = "seufert", } @Article{Perrin:1971:CAA, author = "Dominique Perrin and J.-F. Perrot", title = "Congruences et Automorphismes des Automates Finis. ({French}) [{Congruences} and Automorphisms of Finite Automata]", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "159--172", month = "????", year = "1971", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Bayer:1972:OML, author = "Rudolf Bayer and Edward M. McCreight", title = "Organization and Maintenance of Large Ordered Indexes", journal = j-ACTA-INFO, volume = "1", number = "3", pages = "173--189", month = feb, year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Tue Jun 17 22:32:13 1986", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/database.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Math/sparse.linear.systems.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "Also published in/as: ACM SIGFIDET 1970, pp.107--141.", annote = "Algorithms and performance analysis for tree structured files, Btrees.", keywords = "organization; B-Trees", owner = "ahn", } @Article{Hansen:1972:CTS, author = "Per Brinch Hansen", title = "A Comparison of Two Synchronizing Concepts", journal = j-ACTA-INFO, volume = "1", number = "3", pages = "190--199", month = feb, year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Wed Dec 10 14:35:02 1986", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", note = "See comments \cite{Courtois:1972:CCT} and reply \cite{Hansen:1973:RCC}.", annote = "Also, reply to Acta Inf., Vol.2 No.2, pp.189--190, Aug.1973", owner = "seufert", } @Article{Coffman:1972:OST, author = "Edward G. Coffman and R. L. Graham", title = "Optimal Scheduling for Two-Processor Systems", journal = j-ACTA-INFO, volume = "1", number = "3", pages = "200--213", month = feb, year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/instruction.level.parallel.processing.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Load.Balance.1.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/ovr.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/scheduling.bib; ftp://ftp.math.utah.edu/pub/tex/bib/ovr.bib", } @Article{Clint:1972:PPJ, author = "M. Clint and C. A. R. Hoare", title = "Program Proving: Jumps and Functions", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "214--224", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", note = "See remarks \cite{Ashcroft:1976:RPP}.", } @Article{Kaufholz:1972:PEA, author = "Gerd Kaufholz", title = "{Der programmierbare endliche Automat}. ({German}) [{The} Programmable Finite Automaton]", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "225--241", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Rozenberg:1972:DCP, author = "Grzegorz Rozenberg", title = "Direction Controlled Programmed Grammars", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "242--252", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib", } @Article{Walter:1972:I, author = "Hermann Walter", title = "{Inhibitionsfelder}. ({German}) [{Inhibition} fields]", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "253--269", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hoare:1972:PCD, author = "C. Anthony R. Hoare", title = "Proof of correctness of data representations", journal = j-ACTA-INFO, volume = "1", number = "4", pages = "271--281", month = nov, year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/compling.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/H/HoareCAR.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/algebraic.spec.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", annote = "8 references.", keywords = "abstract data types; Data Abstraction; functional", } @Article{Turski:1972:MDS, author = "Wladyslaw M. Turski", title = "A Model for Data Structures and its Applications. ({Part II})", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "282--289", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Bayer:1972:SBB, author = "Rudolf Bayer", title = "Symmetric Binary {B}-Trees: Data Structure and Maintenance Algorithms", journal = j-ACTA-INFO, volume = "1", number = "4", pages = "290--306", month = nov, year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N05 05C05 68R10", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", annote = "Algorithms and performance analysis for indexes, including splitting.", xxtitle = "Symmetric Binary Btrees: Data Structure and Maintenance Algorithms", } @Article{Hu:1972:LUB, author = "T. C. Hu and K. C. Tan", title = "Least Upper Bound on the Cost of Optimum Binary Search Trees", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "307--310", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{McKellar:1972:BAS, author = "A. C. McKellar and C. K. Wong", title = "Bounds on Algorithms for String Generation", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "311--319", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Strassen:1972:BP, author = "Volker Strassen", title = "{Berechnung und Programm. I}. ({German}) [{Calculation} and Programs. {I}]", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "320--335", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hartmanis:1972:NDS, author = "Juris Hartmanis", title = "On Non-Determinancy in Simple Computing Devices", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "336--344", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schnorr:1972:EAZ, author = "Claus-Peter Schnorr and H. Stimm", title = "{Endliche Automaten und Zufallsfolgen}. ({German}) [Finite Automata and Random Sequnces]", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "345--359", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schott:1972:AAI, author = "G. Schott", title = "Automatic Analysis of Inflectional Morphemes in {German} Nouns", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "360--374", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Courtois:1972:CCT, author = "P. J. Courtois and F. Heymans and David Lorge Parnas", title = "Comments on {{\em A Comparison of Two Synchronizing Concepts}} by {Per Brinch Hansen}", journal = j-ACTA-INFO, volume = "1", number = "??", pages = "375--376", month = "????", year = "1972", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See \cite{Hansen:1972:CTS,Hansen:1973:RCC}.", } @Article{Lauesen:1973:JSG, author = "S{\o}ren Lauesen", title = "Job Scheduling Guaranteeing Reasonable Turn-Around Times", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "1--11", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Anderson:1973:ELP, author = "T. Anderson and J. Eve and James J. Horning", title = "Efficient {{\em LR($1$)}} Parsers", journal = j-ACTA-INFO, volume = "2", number = "1", pages = "12--39", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Salomaa:1973:SFC, author = "Arto K. Salomaa", title = "On Sentential Forms of Context-Free Grammars", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "40--49", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib", } @Article{Clint:1973:PPC, author = "M. Clint", title = "Program Proving: Co-routines", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "50--63", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Strassen:1973:BPI, author = "Volker Strassen", title = "{Berechnung und Programm. II}. ({German}) [{Calculation} and Programs. {II}]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "64--79", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Stoss:1973:RP, author = "H.-J. Sto{\ss}", title = "{Rangierkomplexit{\"a}t von Permutationen}. ({German}) [{The} Switching Complexity of Permutations]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "80--96", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See remarks \cite{Klingler:1981:GBA}.", } @Article{Gries:1973:DAH, author = "David Gries", title = "Describing an Algorithm by {Hopcroft}", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "97--109", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Langmaack:1973:CPP, author = "Hans Langmaack", title = "On Correct Procedure Parameter Transmission in Higher Programming Languages", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "110--142", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Genrich:1973:S, author = "H. J. Genrich and Kurt Lautenbach", title = "{Synchronisationsgraphen}. ({German}) [{Synchronization} Graphs]", journal = j-ACTA-INFO, volume = "2", number = "2", pages = "143--161", month = aug, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", annote = "Directed graphs used to describe control flow and state changes, conditions of deadlock avoidance (in German).", } @Article{Culik:1973:SJM, author = "Karel Cul{\'\i}k and Michael A. Arbib", title = "Sequential and Jumping Machines and their Relation to Computers", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "162--171", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ehrich:1973:MMV, author = "Hans-Dieter Ehrich", title = "{Minimale und $m$-minimale Variablenmengen f{\"u}r partielle Boole'sche Funktionen}. ({German}) [{Minimal} and $m$-Minimal Sets of Variables for Partial {Boolean} Functions]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "172--179", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Boasson:1973:DFL, author = "Luc Boasson and Maurice Nivat", title = "Sur diverses familles de langages ferm{\'e}es par transductions rationelle. ({French}) [{On} Diverse Families of Languages Closed by Rational Transductions]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "180--188", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hansen:1973:RCC, author = "Per Brinch Hansen", title = "A Reply to Comments on {{\em A Comparison of Two Synchronizing Concepts}}", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "189--190", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See \cite{Hansen:1972:CTS,Courtois:1972:CCT}.", } @Article{Ullman:1973:FAE, author = "Jeffrey D. Ullman", title = "Fast Algorithms for the Elimination of Common Subexpressions", journal = j-ACTA-INFO, volume = "2", number = "3", pages = "191--213", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N05 68Q25", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/optimization.bib; ftp://ftp.ira.uka.de/pub/bibliography/Math/sparse.linear.systems.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "algorithms; common subexpressions; eliminations", } @Article{Rozenberg:1973:DSL, author = "Grzegorz Rozenberg and Aristid Lindenmayer", title = "Developmental Systems with Locally Catenative Formulas", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "214--248", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib", } @Article{Savitch:1973:NMA, author = "Walter J. Savitch", title = "A Note on Multihead Automata and Context-Sensitive Languages", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "249--252", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Kandzia:1973:TPL, author = "Peter Kandzia", title = "{Zur Theorie der Partiell-linearen Realisierungen endlicher Automaten}. ({German}) [{On} the Theory of Partial Linear Realizations of Finite Automata]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "253--282", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Claus:1973:MAP, author = "Volker Claus", title = "{Die mittlere Additionsdauer eines Paralleladdierwerks}. ({German}) [{The} Median Addition Time of a Parallel Adder]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "283--291", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Earley:1973:RLD, author = "Jay Earley", title = "Relational Level Data Structures for Programming Languages", journal = j-ACTA-INFO, volume = "2", number = "4", pages = "293--309", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", annote = "Definition of a system which handles set relations, clear mathematical exposition.", } @Article{Langmaack:1973:POS, author = "Hans Langmaack", title = "On Procedures as Open Subroutines. {I}", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "311--333", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hoare:1973:ADP, author = "C. A. R. Hoare and Niklaus Wirth", title = "An Axiomatic Definition of the Programming Language {Pascal}", journal = j-ACTA-INFO, volume = "2", number = "4", pages = "335--355", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Collberg.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/H/HoareCAR.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", note = "See addenda and corrigenda \cite{Hoare:1974:ACA}.", abstract = "The axiomatic definition method proposed in reference [5] is extended and applied to define the meaning of the programming language Pascal. The whole language is covered with the exception of real arithmetic and go to statements.", annote = "8 references.", checked = "4 January 1994", keywords = "axiomatic; Pascal; PROGLANG; proof; SEMANTIC", } @Article{Menzel:1973:ETL, author = "W. Menzel", title = "An Extension of the Theory of Learning Systems", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "357--381", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Boasson:1973:FLT, author = "Luc Boasson and J. P. Crestin and Maurice Nivat", title = "Familles de langages translatables et ferm{\'e}es par crochet. ({French}) [{Families} of Translatable Bracket-Closed Languages]", journal = j-ACTA-INFO, volume = "2", number = "??", pages = "383--393", month = "????", year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gelenbe:1973:PSD, author = "Erol Gelenbe and Paolo Tiberio and J. C. A. Boekhorst", title = "Page Size in Demand Paging Systems", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "1--23", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Tue Nov 10 15:32:44 1981", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib", keywords = "memory hierarchy", } @Article{Schlumberger:1973:ODM, author = "Maurice Schlumberger and Jean Vuillemin", title = "Optimal Disk Merge Patterns", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "25--35", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Nahapetian:1973:NFG, author = "A. Nahapetian", title = "Node Flows in Graphs with Conservative Flow", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "37--41", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Fox:1973:RNM, author = "B. L. Fox", title = "Reducing the Number of Multiplikations in Iterative Processes", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "43--45", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Habermann:1973:CCP, author = "A. Nico Habermann", title = "Critical Comments on the Programming Language {Pascal}", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "47--57", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", note = "See \cite{Wirth:1971:PLP,Lecarme:1975:MCP}.", annote = "Complaints about the report's shortcomings, and the confusion of ranges, types, and structures. Also complains about gotos. 9 references.", } @Article{Cremers:1973:NFC, author = "Armin B. Cremers", title = "Normal Forms for Context-Sensitive Grammars", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "59--73", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib", } @Article{Eichner:1973:LRE, author = "Lutz Eichner", title = "{Lineare Realisierbarkeit endlicher Automaten {\"u}ber endlichen K{\"o}rpern}. ({German}) [{Linearly} Realizable Finite Automata over Finite Fields]", journal = j-ACTA-INFO, volume = "3", number = "1", pages = "75--100", day = "31", month = dec, year = "1973", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Betteridge:1974:ASA, author = "Terry Betteridge", title = "An Analytic Storage Allocation Model", journal = j-ACTA-INFO, volume = "3", number = "2", pages = "101--122", day = "7", month = may, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/gc.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Heaps.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Horowitz:1974:UVC, author = "Ellis Horowitz", title = "A Unified View of the Complexity of Evaluation and Interpolation", journal = j-ACTA-INFO, volume = "3", number = "2", pages = "123--133", day = "7", month = may, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hoare:1974:CCF, author = "C. A. R. Hoare and Peter E. Lauer", title = "Consistent and Complementary Formal Theories of the Semantics of Programming Languages", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "135--153", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/logic.bib", annote = "30 references.", } @Article{Schuler:1974:WCS, author = "P. F. Schuler", title = "Weakly Context-Sensitive Languages as Model for Programming Languages", journal = j-ACTA-INFO, volume = "3", number = "2", pages = "155--170", day = "7", month = may, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "context-sensitive language", } @Article{Kaufholz:1974:VM, author = "Gerd Kaufholz", title = "{{\"U}ber die Vernetzungsstruktur von Maschinen}. ({German}) [{On} the Network Structure of Machines]", journal = j-ACTA-INFO, volume = "3", number = "2", pages = "171--186", day = "7", month = may, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Benson:1974:AMT, author = "David B. Benson", title = "An Abstract Machine Theory for Formal Language Parsers", journal = j-ACTA-INFO, volume = "3", number = "2", pages = "187--202", day = "7", month = may, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Kuck:1974:BPE, author = "David J. Kuck and Yoichi Muraoka", title = "Bounds on the Parallel Evaluation of Arithmetic Expressions Using Associativity and Commutativity", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "203--216", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Thu Oct 2 14:36:03 1986", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib", owner = "seufert", } @Article{Paul:1974:KS, author = "Wolfgang J. Paul and H.-J. Sto{\ss}", title = "{Zur Komplexit{\"a}t von Sortierproblemen}. ({German}) [{On} the Complexity of the Sorting Problem]", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "217--225", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Langmaack:1974:POS, author = "Hans Langmaack", title = "On Procedures as Open Subroutines. {II}", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "227--241", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Manna:1974:AAT, author = "Zohar Manna and Amir Pnueli", title = "Axiomatic Approach to Total Correctness of Programs", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "243--263", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Wed Dec 10 14:27:15 1986", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", owner = "seufert", } @Article{Ehrenfeucht:1974:NVH, author = "Andrzej Ehrenfeucht and Grzegorz Rozenberg", title = "Nonterminals Versus Homomorphisms in Defining Languages for Some Classes of Rewriting Systems", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "265--283", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Penttonen:1974:DLC, author = "Martti Penttonen", title = "On Derivation Languages Corresponding to Context-Free Grammars", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "285--291", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Berstel:1974:CG, author = "Jean Berstel", title = "Sur une Conjecture de {S. Greibach}", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "293--295", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hoare:1974:ACA, author = "C. A. R. Hoare and N. Wirth", title = "Addenda and Corrigenda to {{\em An Axiomatic Definition of the Programming Language Pascal}}", journal = j-ACTA-INFO, volume = "3", number = "3", pages = "296--296", day = "22", month = jul, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Fri Oct 08 22:02:37 1999", note = "See \cite{Hoare:1973:ADP}.", acknowledgement = ack-nhfb, } @Article{Gotlieb:1974:CSS, author = "C. C. Gotlieb and Frank Wm. Tompa", title = "Choosing a Storage Schema", journal = j-ACTA-INFO, volume = "3", number = "4", pages = "297--319", day = "4", month = oct, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gelenbe:1974:AAG, author = "Erol Gelenbe and Jaques Lenfant and Dominique Potier", title = "Analyse d'un algorithme de gestion simultan{\'e}e {M}{\'e}moire centrale---Disque de pagination. ({French}) [{Analysis} of a Simultaneous Management Algorithm for Central Memory and Paging Disk]", journal = j-ACTA-INFO, volume = "3", number = "4", pages = "321--345", day = "4", month = oct, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Garey:1974:PBS, author = "M. R. Garey and R. L. Graham", title = "Performance Bounds on the Splitting Algorithm for Binary Testing", journal = j-ACTA-INFO, volume = "3", number = "4", pages = "347--355", day = "4", month = oct, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Nielsen:1974:NHCb, author = "Mogens Nielsen and Grzegorz Rozenberg and Arto Salomaa and Sven Skyum", title = "Nonterminals, Homomorphisms and Codings in Different Variations of {OL}-Systems. {II}. {Nondeterministic} Systems", journal = j-ACTA-INFO, volume = "3", number = "4", pages = "357--364", day = "4", month = oct, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ecker:1974:ELA, author = "K. Ecker and H. Ratschek", title = "{Eigenschaften der von linearen Automaten erkennbaren Worte}. ({German}) [{Characteristics} of Words Recognized by Linear Automata]", journal = j-ACTA-INFO, volume = "3", number = "4", pages = "365--383", day = "4", month = oct, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Eichner:1974:TLR, author = "Lutz Eichner", title = "{Total lineare Realisierbarkeit endlicher Automaten}. ({German}) [{Total} Linear Realizability of Finite Automata]", journal = j-ACTA-INFO, volume = "3", number = "4", pages = "385--397", day = "4", month = oct, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Finkel:1974:QTD, author = "Raphael A. Finkel and Jon Louis Bentley", title = "Quad Trees: {A} Data Structure for Retrieval on Composite Keys", journal = j-ACTA-INFO, volume = "4", number = "1", pages = "1--9", day = "1", month = nov, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Pre.1975.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/att.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/algobib.bib", keywords = "data structure; database; multidimensional search; quad-trees; tree", } @Article{Brandwajn:1974:MTS, author = "A. Brandwajn", title = "A Model of a Time Sharing Virtual Memory System Solved Using Equivalence and Decomposition Methods", journal = j-ACTA-INFO, volume = "4", number = "1", pages = "11--47", day = "1", month = nov, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1974.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", date = "13/05/93", descriptors = "NIL", enum = "7058", language = "English", location = "SEL: Wi", references = "0", revision = "16/01/94", } @Article{Fayolle:1974:SPB, author = "Guy Fayolle and Erol Gelenbe and Jacques Labetoulle and D. Bastin", title = "The Stability Problem of Broadcast Packet Switching Computer Networks", journal = j-ACTA-INFO, volume = "4", number = "1", pages = "49--53", day = "1", month = nov, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hotz:1974:SAK, author = "G{\"u}nter Hotz", title = "{Sequentielle Analyse kontextfreier Sprachen}. ({German}) [{Sequential} Analysis of Context-Free Grammars]", journal = j-ACTA-INFO, volume = "4", number = "1", pages = "55--75", day = "1", month = nov, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Khabbaz:1974:MPA, author = "Nabil A. Khabbaz", title = "Multipass Precedence Analysis", journal = j-ACTA-INFO, volume = "4", number = "1", pages = "77--85", day = "1", month = nov, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Nielsen:1974:NHCa, author = "Mogens Nielsen and Grzegorz Rozenberg and Arto Salomaa and Sven Skyum", title = "Nonterminals, Homomorphisms and Codings in Different Variations of {OL}-Systems. {I}. {Deterministic} Systems", journal = j-ACTA-INFO, volume = "4", number = "1", pages = "87--106", day = "1", month = nov, year = "1974", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib", } @Article{Breitbart:1975:AFE, author = "Yuri Breitbart and Allen Reiter", title = "Algorithms for Fast Evaluation of {Boolean} Expressions", journal = j-ACTA-INFO, volume = "4", number = "2", pages = "107--116", month = feb, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Newton:1975:PPI, author = "Glen Newton", title = "Proving Properties of Interacting Processes", journal = j-ACTA-INFO, volume = "4", number = "2", pages = "117--126", month = feb, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Spitzen:1975:VSD, author = "Jay M. Spitzen and Ben Wegbreit", title = "The Verification and Synthesis of Data Structures", journal = j-ACTA-INFO, volume = "4", number = "2", pages = "127--144", month = feb, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", annote = "Generator induction.", } @Article{Igarashi:1975:APVa, author = "Shigeru Igarashi and Ralph L. London and David C. Luckham", title = "Automatic program verification. {I}. {A} logical basis and its implementation", journal = j-ACTA-INFO, volume = "4", number = "2", pages = "145--182", month = feb, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", xxauthor = "S. Igarishi and R. L. London and D. C. Luckham", } @Article{Earley:1975:APS, author = "Jay Earley", title = "Ambiguity and Precedence in Syntax Description", journal = j-ACTA-INFO, volume = "4", number = "2", pages = "183--192", month = feb, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ibarra:1975:HVH, author = "Oscar H. Ibarra and Chul E. Kim", title = "On $3$-Head Versus $2$-Head Finite Automata", journal = j-ACTA-INFO, volume = "4", number = "2", pages = "193--200", month = feb, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ehrich:1975:GTDa, author = "Hans-Dieter Ehrich", title = "{Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil I: Datenstrukturen und Schemata}. ({German}) [{Foundation} of a Theory of Data Structures and Access Systems. {Part I}. Data Structures and Schemata]", journal = j-ACTA-INFO, volume = "4", number = "3", pages = "201--211", day = "31", month = jul, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gimpel:1975:NPT, author = "James F. Gimpel", title = "Nonlinear Pattern Theory", journal = j-ACTA-INFO, volume = "4", number = "3", pages = "213--229", day = "31", month = jul, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Lecarme:1975:MCP, author = "Olivier Lecarme and Pierre Desjardins", title = "More Comments on the Programming Language {Pascal}", journal = j-ACTA-INFO, volume = "4", number = "3", pages = "231--243", day = "31", month = jul, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", note = "See \cite{Wirth:1971:PLP,Habermann:1973:CCP}. An earlier version appeared in ACM SIGPLAN Notices, October, 1975.", annote = "30 references.", } @Article{Zislis:1975:SDC, author = "Paul M. Zislis", title = "Semantic Decomposition of Computer Programs: An Aid to Program Testing", journal = j-ACTA-INFO, volume = "4", number = "3", pages = "243--269", day = "31", month = jul, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Levy:1975:ACS, author = "J.-P. L{\'e}vy", title = "Automatic Correction of Syntax-Errors in Programming Languages", journal = j-ACTA-INFO, volume = "4", number = "3", pages = "271--292", day = "31", month = jul, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Guibas:1975:PIB, author = "Leonidas J. Guibas", title = "A Principle of Independence for Binary Tree Searching", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "293--298", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ehrich:1975:GTDb, author = "Hans-Dieter Ehrich", title = "{Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. Teil II: Zugriffssysteme}. ({German}) [{Foundation} of a Theory of Data Structures and Access Systems. {Part II}. Access Systems]", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "299--310", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Breitbart:1975:BBA, author = "Yuri Breitbart and Allen Reiter", title = "A Branch-and-Bound Algorithm to Obtain an Optimal Evaluation Tree for Monotonic {Boolean} Functions", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "311--319", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Paul:1975:BMU, author = "Wolfgang J. Paul", title = "{Boolesche Minimalpolynome und {\"U}berdeckungsprobleme}. ({German}) [{Boolean} Minimal Polynomials and Coverage Problems]", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "321--336", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Rosen:1975:DGG, author = "Barry K. Rosen", title = "Deriving Graphs from Graphs by Applying a Production", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "337--357", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gragra.bib", added = "1996-03-13-10-09-20", } @Article{Schuler:1975:WAC, author = "P. F. Schuler", title = "{WCS}-Analysis of the Context-Sensitive", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "359--371", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Nielsen:1975:ESC, author = "Mogens Nielsen", title = "{EOL} systems with control devices", journal = j-ACTA-INFO, volume = "4", number = "4", pages = "373--386", month = "????", year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib", } @Article{vanWijngaarden:1975:RRA, author = "Adriaan van Wijngaarden and B. J. Mailloux and J. E. L. Peck and C. H. A. Koster and M. Sintzoff and C. H. Lindsey and L. G. L. T. Meertens and R. G. Fisker", title = "Revised Report on the Algorithmic Language {ALGOL 68}", journal = j-ACTA-INFO, volume = "5", number = "1--3", pages = "1--236", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/CLiCS.bib", checked = "4 September 1990", } @Article{Nehmer:1975:DPC, author = "J. Nehmer", title = "Dispatcher Primitives for the Construction of Operating System Kernels", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "237--255", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N05", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", } @Article{Giloi:1975:IGI, author = "Wolfgang K. Giloi and J. Encarna{\c{c}}{\~a}o and S. Savitt", title = "Interactive Graphics on Intelligent Terminals in a Time-Sharing Environment", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "257--271", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Rice:1975:PAA, author = "John R. Rice", title = "Parallel Algorithms for Adaptive Quadrature {II} Metalgorithm Correctness", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "273--285", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Mehlhorn:1975:NOB, author = "Kurt Mehlhorn", title = "Nearly Optimal Binary Search Trees", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "287--295", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/online.competitive.algorithms.bib", } @Article{Lauer:1975:FSC, author = "P. E. Lauer and Roy H. Campbell", title = "Formal Semantics of a Class of High-Level Primitives for Coordinating Concurrent Processes", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "297--332", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Wed Dec 29 21:20:34 1982", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/is.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/os.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", note = "See addenda and corrigenda \cite{Lauer:1977:ACF}.", abstract = "High level programs for generating systems of cooperating concurrent processes are classified according to syntactic criteria. Their semantic characterization by means of Petri Nets, a mathematical theory of system descriptions, induces a corresponding syntactic classification on the latter. This permits the transferal of intuitively important semantical results of Petri Net theory to their corresponding programs. As a consequence it becomes possible to determine a certain kind of semantic correctness of a programm mereley by its syntactic classification. Alternate solutions to a well known synchronization problem are treated in this way.", comment = "Addenda and Corrigenda: Acta Informatica 7: 325 (1977)", keywords = "Petri-nets; Semantik; Synchronization", } @Article{Katz:1975:CLT, author = "Shmuel M. Katz and Zohar Manna", title = "A Closer Look at Termination", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "333--352", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", } @Article{Deussen:1975:DCV, author = "Peter Deussen", title = "A Decidability Criterion for {van Wijngaarden} Grammars", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "353--375", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ginsburg:1975:SGF, author = "Seymour Ginsburg and Edwin H. Spanier", title = "Substitution of Grammar Forms", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "377--386", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schuler:1975:NDC, author = "P. F. Schuler", title = "A Note on Degrees of Context-Sensitivity", journal = j-ACTA-INFO, volume = "5", number = "4", pages = "387--394", day = "19", month = dec, year = "1975", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Coffman:1976:AMM, author = "E. G. {Coffman, Jr.} and Ravi Sethi", title = "Algorithms Minimizing Mean Flow Time: Schedule Length Properties", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "1--14", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/att.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "ctr127", } @Article{Neuhold:1976:SPC, author = "Erich J. Neuhold and T. Weller", title = "Specification and Proving of Command Programs", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "15--40", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Darlington:1976:SWA, author = "John L. Darlington and Rod M. Burstall", title = "A System which Automatically Improves Programs", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "41--60", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/Learning.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/lisp.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", abstract = "Here we given methods of mechanically converting programs that are easy to understand into more efficient ones, converting recursion equations using high level operations into lower level flowchart programs. The main transformations involved are \begin{enumerate} \item recursion removal \item eliminating common subexpressions and combining loops \item replacing procedure calls by thier bodies \item introducing assignments which overwrite list cells no longer in use (compile time garbage collection) \end{enumerate}.", checked = "19940609", keywords = "common subexpressions; compile time garbage collection; inlining; LISP; program transformation; recursion removal; transformations functional", refs = "17", sjb = "Recursion removal is achieved by requiring the programmer to use certain recursion schemata for which efficient iterative versions are known. Assuming that any pre-conditions on the use of the schemata hold, the recursive version can easily be replaced by the iterative one (See \cite{Meijer:Fokkinga:Paterson:fplca:1991} which state a number of these schemata as higher-order functions). Compile time garbage collection is achieved by expanding out expressions into a symbolic state and then symbolically evaluating this to determine which cells can be shared. An interactive system has been developed which allows a user to input a function and then apply the various transformations described in the paper. An example is given of the optimisation of a set union function and a sorting program.", source = "Dept. Library", xxnote = "Journal has authors: J. Darlington and R. M. Burstall", } @Article{Ershov:1976:AMA, author = "A. P. Ershov", title = "Axiomatics for Memory Allocation", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "61--75", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "In the paper, a method of labelling is applied to constructing a correct and complete transformation system, which allows one, for any program scheme, to construct systematically any permissible memory allocation for variables of the scheme. Permissible memory allocations are assumed to be such allocations that preserve all information flow connections from the initial scheme.", checked = "19940609", keywords = "memory allocation; theory", refs = "4", source = "Dept. Library", } @Article{Galil:1976:HCP, author = "Zvi Galil", title = "Hierarchies of Complete Problems", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "77--88", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Book:1976:INA, author = "Ronald V. Book and Ashok K. Chandra", title = "Inherently Nonplanar Automata", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "89--94", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Monien:1976:TMT, author = "Burkhard Monien", title = "Transformational Methods and their Application to Complexity Problems", journal = j-ACTA-INFO, volume = "6", number = "1", pages = "95--108", day = "31", month = mar, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See corrigenda \cite{Monien:1977:CTM}.", } @Article{Anderson:1976:SMP, author = "E. R. Anderson and F. C. Belz and E. K. Blum", title = "{SEMANOL(73)}. {A} Metalanguage for Programming the Semantics of Programming Languages", journal = j-ACTA-INFO, volume = "6", number = "2", pages = "109--131", day = "2", month = jul, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Karr:1976:ARA, author = "Michael Karr", title = "On affine relationships among variables of a program", journal = j-ACTA-INFO, volume = "6", number = "2", pages = "133--151", day = "2", month = jul, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Moenck:1976:APH, author = "Robert T. Moenck", title = "Another Polynomial Homomorphism", journal = j-ACTA-INFO, volume = "6", number = "2", pages = "153--169", day = "2", month = jul, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Tarjan:1976:EDS, author = "Robert Endre Tarjan", title = "Edge-Disjoint Spanning Trees and Depth-First Search", journal = j-ACTA-INFO, volume = "6", number = "2", pages = "171--185", day = "2", month = jul, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Franta:1976:MAC, author = "W. R. Franta", title = "The Mathematical Analysis of the Computer System Modeled as a Two Stage Cyclic Queue", journal = j-ACTA-INFO, volume = "6", number = "2", pages = "187--209", day = "2", month = jul, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Nutt:1976:SRA, author = "Gary J. Nutt", title = "Some Resource Allocation Policies in a Multi Associative Processor", journal = j-ACTA-INFO, volume = "6", number = "3", pages = "211--225", day = "10", month = aug, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schmid:1976:EIC, author = "Hans Albrecht Schmid", title = "On the Efficient Implementation of Conditional Critical Regions and the Construction of Monitors", journal = j-ACTA-INFO, volume = "6", number = "3", pages = "227--249", day = "10", month = aug, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", abstract = "A method is presented that allows the efficient implementation of conditional critical regions combined with scheduling of the waiting processes. It is based on the knowledge of static and invariant relations that exist among the condi tional critical regions of a process system. Mathematical methods are applied in order to show the nature of these relations, and to determine them for practical applications. By collecting the conditional critical regions in a program module, a monitor is obtained. Its rather abstract user level allows clear and well structured programming style. It also shows some advantages in comparison to other monitor proposals on the implementation level.", keywords = "concurrency READ; Critical Region; Monitors", } @Article{Courtois:1976:DMP, author = "P.-J. Courtois and H. Vantilborgh", title = "A Decomposable Model of Program Paging Behaviour", journal = j-ACTA-INFO, volume = "6", number = "3", pages = "251--275", day = "10", month = aug, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Math/Matrix.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", kwds = "memory hierarchy, Markov chain, nearly uncoupled system", } @Article{Backhouse:1976:AAI, author = "Roland C. Backhouse", title = "An Alternative Approach to the Improvement of {{\em LR($k$)}} Parsers", journal = j-ACTA-INFO, volume = "6", number = "3", pages = "277--296", day = "10", month = aug, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schneider:1976:GPG, author = "Hans J{\"u}rgen Schneider and Hartmut Ehrig", title = "Grammars on Partial Graphs", journal = j-ACTA-INFO, volume = "6", number = "3", pages = "297--316", day = "10", month = aug, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gragra.bib", added = "1996-03-13-10-09-20", } @Article{Ashcroft:1976:RPP, author = "E. A. Ashcroft and M. Clint and C. A. R. Hoare", title = "Remarks on {{\em Program Proving: Jumps and Functions}} by {M. Clint} and {C. A. R. Hoare}", journal = j-ACTA-INFO, volume = "6", number = "3", pages = "317--318", day = "10", month = aug, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/H/HoareCAR.bib", note = "See \cite{Clint:1972:PPJ}.", } @Article{Owicki:1976:APT, author = "Susan Speer Owicki and David Gries", editor = "Springer-Verlag", title = "An Axiomatic Proof Technique for Parallel Programs {I}", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "319--340", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/G/GriesD.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.2.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", checked = "4 January 1994", enteredby = "Glenn S Benson (benson at dove)", timestamp = "Wed Jul 9 21:44:10 2008", } @Article{Cohen:1976:ISF, author = "Jacques Cohen and Martin Roth", title = "On the Implementation of {Strassen}'s Fast Multiplication Algorithm", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "341--355", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Dijkstra:1976:GTD, author = "Edsger W. Dijkstra", title = "On a Gauntlet Thrown by {David Gries}", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "357--359", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Taniguchi:1976:ACS, author = "Kenichi Taniguchi and Tadeo Kasami", title = "An {$O(n)$} Algorithm for Computing the Set of Available Expressions of {$D$}-Charts", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "361--364", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Brandwajn:1976:MVM, author = "A. Brandwajn", title = "A Model of a Virtual Memory System", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "365--386", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Wharton:1976:RAP, author = "R. M. Wharton", title = "Resolution of Ambiguity in Parsing", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "387--395", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Maurer:1976:GFT, author = "Hermann A. Maurer and D. Wood", title = "On Grammar Forms with Terminal Context", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "397--402", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Heise:1976:OCA, author = "Werner Heise", title = "Optimal Codes, {$n$}-Arcs and {Laguerre} Geometry", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "403--406", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ehrenfeucht:1976:PCL, author = "Andrzej Ehrenfeucht and Grzegorz Rozenberg", title = "On Proving that Certain Languages are not {ETOL}", journal = j-ACTA-INFO, volume = "6", number = "4", pages = "407--415", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Zuczek:1976:NAP, author = "R. Zuczek", title = "A New Approach to Parallel Computing", journal = j-ACTA-INFO, volume = "7", number = "1", pages = "1--13", day = "15", month = oct, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Lamport:1976:SIP, author = "Leslie Lamport", title = "The Synchronization of Independent Processes", journal = j-ACTA-INFO, volume = "7", number = "1", pages = "15--34", day = "15", month = oct, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gelenbe:1976:PMC, author = "Erol Gelenbe and Richard R. Muntz", title = "Probabilistic Models of Computer Systems---{Part I} (Exact Results)", journal = j-ACTA-INFO, volume = "7", number = "1", pages = "35--60", day = "15", month = oct, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", annote = "This paper is a survey of certain known results concerning networks of queues. The choice of the topics presented has been made with special emphasis on mathematical results which can be applied to the analysis and synthesis of mathematical or simulation models of complex computer systems in which an ensemble of resources is shared among a set of user programs. The subjects covered include the Jackson, and Gordon and Newell theorems; the work\ldots{}.", date = "22/03/84", descriptors = "Queueing system; survey; analytical model", enum = "1083", language = "English", location = "RWTH-AC-DFV: TELL", references = "38", revision = "21/04/91", } @Article{Madsen:1976:LPE, author = "Ole Lehrmann Madsen and Bent Bruun Kristensen", title = "{{\em LR}}-Parsing of Extended Context Free Grammars", journal = j-ACTA-INFO, volume = "7", number = "1", pages = "61--73", day = "15", month = oct, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "CFG with repetition *, alternation $|$, and parenthesis =$>$ ECFG", keywords = "CFG; context free grammar; LR parser; parse; parser", } @Article{Walter:1976:GG, author = "H. K.-G. Walter", title = "Grammarforms and Grammarhomomorphisms", journal = j-ACTA-INFO, volume = "7", number = "1", pages = "75--93", day = "15", month = oct, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schnorr:1976:NCT, author = "Claus-Peter Schnorr", title = "The Network Complexity and the {Turing} Machine Complexity of Finite Functions", journal = j-ACTA-INFO, volume = "7", number = "1", pages = "95--107", day = "15", month = oct, year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D10 68Q25 94C10", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gaver:1976:MMM, author = "Donald P. Gaver and George Humfeld", title = "Multitype Multiprogramming Models", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "111--121", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gelenbe:1976:BSQ, author = "Erol Gelenbe and Guy Pujolle", title = "The Behaviour of a Single-Queue in a General Queueing Network", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "123--136", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", annote = "We Developed a method based on diffusion approximations in order to compute, under general conditions, the queue length distribution of a single queue in a network of queues. Several applications of this approach to computer network performance analysis and to time-sharing systems are presented. The accuracy of model predictions are evaluated by comparison with known exact results in particular cases, with simulation experiments and with the \ldots{}.", date = "22/03/84", descriptors = "Queueing network; queue length; distribution; diffusion approximation", enum = "1084", language = "English", location = "RWTH-AC-DFV: TELL", references = "18", revision = "21/04/91", } @Article{Giammo:1976:VCP, author = "Thomas Giammo", title = "Validation of a Computer Performance Model of the Exponential Queuing Network Family", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "137--152", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", annote = "The applicability and accuracy of a general queueing network approach to the modeling of computer performance was tested in an actual production environment. The validation exercise established that such an approach had both sufficient flexibility and precision to be used in long range planning efforts. The accuracy of the results further suggests that these techniques may be successfully extended to a wide range of uses.", date = "22/03/84", descriptors = "Exponential queueing network; application; case study", enum = "1113", language = "English", location = "RWTH-AC-DFV: TELL", references = "14", revision = "21/04/91", } @Article{Landwehr:1976:EPM, author = "Carl E. Landwehr", title = "An Endogenous Priority Model for Load Control in Combined Batch-Interactive Computer Systems", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "153--166", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Buzen:1976:FOL, author = "Jeffrey P. Buzen", title = "Fundamental Operational Laws of Computer System Performance", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "167--182", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibdate = "Wed Oct 7 21:23:57 1981", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/simulan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/storage.bib", annote = "A number of laws are derived establish relationships between throughput, response time, device utilization space-time products and various other factors related to computer system performance. These laws are obtained through the operational method of computer system analysis. The operational method, which is formally introduced in this paper, differs significantly from the conventional stochastic modeling approach and is based on a set of \ldots{}.", date = "22/03/84", descriptors = "Operational Analysis; performance evaluation; method; Survey", enum = "485", language = "English", location = "RWTH-AC-DFV: TELL", references = "14", revision = "21/04/91", } @Article{Labetoulle:1976:SQN, author = "Jacques Labetoulle and Guy Pujolle", title = "A Study of Queueing Networks with Deterministic Service and Application to Computer Networks", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "183--195", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1976.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", annote = "We consider a packet-switching network as a queueing system with constant service times: that means the lengths of the packets are equal. We study such a network by isolating a particular path which we treat as tandem queueing system. Two aspects will be examined: the study of the response time of such a system, and the throughput of such a system when time-outs are used to destroy packets. The results we obtain show that when the interference \ldots{}.", date = "22/03/84", descriptors = "Tandem queue; packet switching; CYCLADES; constant service time", enum = "1844", language = "English", location = "RWTH-AC-DFV: TELL", references = "17", revision = "21/04/91", } @Article{Denning:1976:OM, author = "Peter J. Denning and Kevin C. Kahn and Jacques Leroudier and Dominique Potier and Rajan Suri", title = "Optimal Multiprogramming", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "197--216", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Spirn:1976:MQS, author = "Jeffrey R. Spirn", title = "Multi-Queue Scheduling of Two Tasks", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "217--226", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Welch:1976:SCM, author = "Peter D. Welch", title = "On the Self Contained Modelling of {DB/DC} Systems", journal = j-ACTA-INFO, volume = "7", number = "2", pages = "227--247", month = "????", year = "1976", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Pager:1977:PGM, author = "David Pager", title = "A Practical General Method for Constructing {{\em LR($k$)}} Parsers", journal = j-ACTA-INFO, volume = "7", number = "3", pages = "249--268", day = "20", month = jan, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Kern:1977:SF, author = "Werner Kern", title = "{Speicheroptimale Formel{\"u}bersetzung}. ({German}) [{Storage} Optimal Formula Translation]", journal = j-ACTA-INFO, volume = "7", number = "3", pages = "269--287", day = "20", month = jan, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Rosenberg:1977:SSB, author = "Arnold L. Rosenberg and Larry J. Stockmeyer", title = "Storage Schemes for Boundedly Extendible Arrays", journal = j-ACTA-INFO, volume = "7", number = "3", pages = "289--303", day = "20", month = jan, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Kam:1977:MDF, author = "John B. Kam and Jeffrey D. Ullman", title = "Monotone Data Flow Analysis Frameworks", journal = j-ACTA-INFO, volume = "7", number = "3", pages = "305--317", day = "20", month = jan, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.compiler.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/optimization.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/U/UllmanJD.bib", note = "Data Flow Analysis", } @Article{Shostak:1977:RUM, author = "Robert E. Shostak", title = "On the Role of Unification in Mechanical Theorem Proving", journal = j-ACTA-INFO, volume = "7", number = "3", pages = "319--323", day = "20", month = jan, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Lauer:1977:ACF, author = "P. E. Lauer and Roy H. Campbell", title = "Addenda and Corrigenda: {{\em Formal Semantics of a Class of High-Level Primitives for Coordinating Concurrent Processes}}", journal = j-ACTA-INFO, volume = "7", number = "3", pages = "325--325", day = "20", month = jan, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See \cite{Lauer:1975:FSC}.", } @Article{Sedgewick:1977:AQP, author = "Robert Sedgewick", title = "The Analysis of {Quicksort} Programs", journal = j-ACTA-INFO, volume = "7", number = "4", pages = "327--355", day = "1", month = feb, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/algobib.bib", } @Article{Kowaltowski:1977:AAS, author = "Tomasz Kowaltowski", title = "Axiomatic Approach to Side Effects and General Jumps", journal = j-ACTA-INFO, volume = "7", number = "4", pages = "357--360", day = "1", month = feb, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", } @Article{MacVeigh:1977:EDR, author = "Donal T. {MacVeigh, S. J.}", title = "Effect of Data Representation on Cost of Sparse Matrix Operations", journal = j-ACTA-INFO, volume = "7", number = "4", pages = "361--394", day = "1", month = feb, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", xxnote = "Yes, author first name is Donal, not Donald.", } @Article{Schonhage:1977:SMP, author = "A. A. Sch{\"o}nhage", title = "{Schnelle Multiplikation von Polynomen {\"u}ber K{\"o}rpern der Charakteristik $2$}. ({German}) [{Fast} Multiplication of Polynomials over Fields of Characteristic $2$]", journal = j-ACTA-INFO, volume = "7", number = "4", pages = "395--398", day = "1", month = feb, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Perrot:1977:MSL, author = "J.-F. Perrot", title = "Mono{\"\i}des syntactiques des langages alg{\'e}briques. ({French}) [{Syntactic} Monoids of Algebraic Languages]", journal = j-ACTA-INFO, volume = "7", number = "4", pages = "399--413", day = "1", month = feb, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Watt:1977:PPA, author = "David A. Watt", title = "The Parsing Problem for Affix-Grammars", journal = j-ACTA-INFO, volume = "8", number = "1", pages = "1--20", day = "29", month = mar, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Affix grammars are an extension of context-free grammars which retain most of their advantages and eliminate most of their limitations with respect to the definition of programming languages and the specification of their translators. The extension allows definition of context-sensitive syntax features, and also allows semantics to be linked to syntax. In this paper, the parsing problem for affix grammars is explored and shown to be closely related to the parsing problem for context-free grammars. This enables a standard context-free parser constructor to be generalised to a constructor for affix grammars, essentially by addition of a preprocessor. The resulting constructors are compared with previously implemented or proposed constructors.", checked = "19940503", keywords = "affix grammars; divers.affix; parsing", refs = "18", sjb = "The introduction explains that affix grammars (AGs) of Koster \cite{Koster:a68i:1972} provide a unified notation for defining phrase structure and context-sensitive constraints. Each nonterminal in an AG may have associated with it a fixed number of affixes. These represent attributes of the corresponding language constructs. The affixes may be passed as parameters to primitive predicates. These are arbitrary functions which impose the necessary context-sensitive constrains on the affixes. [The predicates are defined separately from the AG; thus the formalisation of the AG is only partial] A distinction is made between derived affixes and inherited ones. It is the usual distinction made about attributes in attributed grammars. [Is there really a difference between affix grammars and attribute grammars?] The differences between AGs and TLGs is that the latter makes no distinction between inherited and derived attributes. Also in TLGs the predicates are defined grammatically [Whatever that means]. As shown in Watt's Ph.d \cite{Watt:phd:1974} TLGs do not lend themselves to automatic construction of efficient parsers. \subsubsection*{An example of an Affix Grammar} To handle simple define before use. For example the following would be valid :- \begin{example} dcl x use x end \end{example} whereas the following would be invalid :- \begin{example} dcl x use y end dcl x dcl x use x end \end{example} The BNF for this simple language is :- \begin{example} program \(\rightarrow\) list seq 'end' list \(\rightarrow\) 'dcl' tag list \(\rightarrow\) list 'dcl' tag seq \(\rightarrow\) seq \(\rightarrow\) seq 'use' tag tag \(\rightarrow\) 'x' tag \(\rightarrow\) 'y' tag \(\rightarrow\) 'z' \end{example} To cope with the context sensitive stuff, affixes are added :- \begin{example} program : list\(\uparrow\)SET, set\(\downarrow\)SET,'end'. list\(\uparrow\)SET: 'dcl', tag\(\uparrow\)TAG,declare\(\downarrow\)\emptyset\(\downarrow\)TAG\(\uparrow\)SET. list\(\uparrow\)SET: list\(\uparrow\)SET1, 'dcl', tag\(\uparrow\)TAG,declare\(\downarrow\)SET1\(\downarrow\)TAG\(\uparrow\)SET. seq\(\downarrow\)SET: seq\(\downarrow\)SET: seq\(\downarrow\)SET, 'use', tag\(\uparrow\)TAG,identity\(\downarrow\)SET\(\downarrow\)TAG. tag\(\uparrow\)x: 'x' tag\(\uparrow\)y: 'y' tag\(\uparrow\)z: 'z' \end{example} The syntax of the BNF has now changed slightly. The ``\(\rightarrow\)'' has changed to ``:'', items are now separated by ``,'' rather than whitespace and each production ends with ``.''. The ``\(\uparrow\)'' and ``\(\downarrow\)'' signify the direction of the affix i.e. derived and inherited respectively. The definition contains reference to two primitive functions. These are defined as follows (in no particular format) :- \begin{example} declare(s\(\sb{1}\), t, s\(\sb{2}\)) = if t \(\in\) s\(\sb{1}\) then \(false\) else s\(\sb{2}\) = s\(\sb{1}\) \(\cup\) \{t\} identify(s, t) = t \(\in\) s \end{example} \subsubsection*{Definition of Affix Grammars} Two pages of dense definitions. e.g. an affix grammar is an 8 tuple \ldots. \subsubsection*{Well-formed Affix Grammars} Equally mind numbing stuff about what it is to be a well-formed affix grammar. \subsubsection*{Parsing Strategy} How you actually parse these things. Consider parsing :- \begin{example} dcl x use x end \end{example} This initially matches the rule :- \begin{example} list\(\uparrow\)SET: 'dcl', tag\(\uparrow\)TAG,declare\(\downarrow\)\emptyset\(\downarrow\)TAG\(\uparrow\)SET. \end{example} In a top down parse ``SET'' will be initially undefined. The ``dcl'' will be parsed by the rule and then the ``x'' will be dealt with by the rule :- \begin{example} tag\(\uparrow\)x: 'x' \end{example} Thus the value of ``TAG'' is now ``x''. The function ``declare'' is then called and thus the affix ``SET'' becomes \{x\}. One way of actually implementing the above is to have an affix stack. The rest of the paper then goes on to discuss the stack method.", } @Article{Luckham:1977:PTW, author = "David C. Luckham and Norihisa Suzuki", title = "Proof of Termination within a Weak Logic of Programs", journal = j-ACTA-INFO, volume = "8", number = "1", pages = "21--36", day = "29", month = mar, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", abstract = "A weak logic of programs is a formal system in which statements that mean ``the program halts'' cannot be expressed. In order to prove termination, we would usually have to use a stronger logical system. In this paper we show how we can prove termination of both iterative and recursive programs within a weak logic by augmenting the programs with counters and adding bound assertions on the counters as loop invariants and entry conditions. Thus, most of the existing verifiers which are based on weak logic of programs can be used to prove termination of programs without any modification. We give examples of proofs of termination and of upper bounds on computation time that were obtained using a Pascal program verifier. the use of the method to locate causes of non-termination is also illustrated.", checked = "19940503", keywords = "termination; weak logic", refs = "16", } @Article{Majster:1977:EDG, author = "Mila E. Majster", title = "Extended Directed Graphs, a Formalism for Structured Data and Data Structures", journal = j-ACTA-INFO, volume = "8", number = "1", pages = "37--59", day = "29", month = mar, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", abstract = "This paper concerns the problem of definition and description of structured data. A formalism based on the notion of the extended directed graph is developed. Operations and data structure classes are defined. Properties of data structures are studied; in particular, the definition of a data structure by means of its operations is investigated.", checked = "19940503", keywords = "directed graphs", refs = "16", } @Article{Mitrani:1977:CPF, author = "Isi Mitrani and J. H. Hine", title = "Complete Parameterized Families of Job Scheduling Strategies", journal = j-ACTA-INFO, volume = "8", number = "1", pages = "61--73", day = "29", month = mar, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "The concept of a family of scheduling strategies in which a few parameters may be varied to achieve different performance levels is introduced. the use of such families in satisfying performance requirements stated in terms of average response times for jobs of different classes is studied. A performance requirement is said to be achievable if, given the loading conditions on the system, there exists a scheduling strategy which satisfies it. A family of scheduling strategies is said to be complete if every achievable performance requirement can be satisfied by a strategy from the family. Sufficient conditions for a parameterized family to be complete are proven. Three parameterized families are discussed, one in detail. Completeness of the three families is demonstrated and simulation results illustrating some properties of implementation are presented.", checked = "19940503", keywords = "job scheduling", refs = "5", } @Article{Maurer:1977:EF, author = "Hermann A. Maurer and Arto Salomaa and Derick Wood", title = "{EOL} Forms", journal = j-ACTA-INFO, volume = "8", number = "1", pages = "75--96", day = "29", month = mar, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "In this paper the notions of ``L form'' and its ``interpretations'' are introduced to define families of structurally similar L systems. the families of L systems thus defined are studied from a number of different points of view. It is felt that this novel approach will shed new light on many questions concerning L systems.", checked = "19940503", keywords = "L systems; rewrite systems", refs = "18", } @Article{Tennent:1977:LDM, author = "Robert D. Tennent", title = "Language Design Methods Based on Semantic Principles", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "97--112", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", note = "See remarks \cite{Berry:1981:RRD}.", abstract = "Two language design methods based on principles derived from the denotational approach to programming language semantics are described and illustrated by an application to the language Pascal. The principles are, firstly, the correspondence between parametric and declarative mechanisms, and secondly, a principle of abstraction for programming languages adapted from set theory. Several useful extensions and generalizations of Pascal emerge by applying these principles, including a solution to the array parameter problem, and a modularization facility.", checked = "19940503", keywords = "denotation semantics; DS; L4REF; language design; orthogonal orthogonality module; Pascal; principle of correspondence", refs = "45", sjb = "Defines the principle of correspondence and then lists 9 cases where Pascal fails to uphold it. Describes a revised version of Pascal that avoids the highlighted problems and extends Pascal to new areas including generic parameters. Amongst the good suggestions is to introduce {\tt private} {\em decls} {\tt within} {\em more-decls} which allows {\em decls} to be used inside {\em more-decls} but only allowing {\em more-decls} to be externally visible. The paper is full of good ideas like this. Many of the suggestions have now (1994) been adopted by other languages.", } @Article{Russell:1977:EBC, author = "Bruce Russell", title = "On an Equivalence between Continuation and Stack Semantics", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "113--123", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "A class of continuation models and a class of stack models for defining the semantics of programming languages are specified. A transformation is given that maps any continuation model into an equivalent stack model, and the equivalence is proved. The transformation is illustrated for an example language which includes goto and recursive procedures.", checked = "19940503", keywords = "continuations; proof of equivalence; stack semantics", refs = "13", } @Article{Francez:1977:BRC, author = "Nissim Francez and Boris Klebansky and Amir Pnueli", title = "Backtracking in Recursive Computations", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "125--144", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "A mathematical (denotational) semantics is constructed for a formalism of recursive equations with the {\em Alternative} operator. This formalism enables the combination of recursion and backtracking. The semantics is defined by applying fixpoint theory to set valued functions. We introduce the notion of strategy to produce subset of the result. Two implementations are suggested using an auxiliary stack. the concept of a sub-fixpoint is introduced, and the implementations are shown to be incomplete even w.r.t. sub-fixpoint values. One special strategy, the leftmost strategy, which stems from problems such as pattern matching and parsing, is discussed.", annote = "denotational semantics of recursive equations with the alternative operator. Can use recursion and backtracking. Uses set valued functions in semantics.", checked = "19940503", keywords = "alternative operator; backtracking; choice; denotational semantics; fixpoint; nondeterministic; recursion; semantics", refs = "15", } @Article{Ernst:1977:RIP, author = "George W. Ernst", title = "Rules of Inference for Procedure Calls", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "145--152", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "The semantics of procedures and parameters were formalized by Hoare \cite{Hoare:soal:1971} in terms of axioms and rules of inference. Igarashi et al. \cite{Igarashi:London:Luckham:acta:1975} reformulated Hoare's system. This paper extends their rule of inference for procedure calls to allow \begin{enumerate} \item actual variable parameters to occur in actual value parameters; \item the body of a procedure to contain global variables that do not occur in assignment positions; \item post-conditions and ``internal'' assertions of a procedure to refer to the initial values of variable parameters. \end{enumerate} None of these are allowed in Hoare's system or the system of Igarashi, London and Luckham. An attractive feature of these extensions is that they do not increase the complexity of the rules of inference.", checked = "19940503", refs = "5", } @Article{Munch-Andersen:1977:SAJ, author = "Bo Munch-Andersen and Torben U. Zahle", title = "Scheduling According to Job Priority with Prevention of Deadlock and Permanent Blocking", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "153--175", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q68", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Some job scheduling algorithms have been developed which prevent deadlock and permanent blocking. the jobs are assumed to be ordered according to a priority rule indicating the order in which requests for resources should be considered. Each job has an upper limit on the resources demanded, and each job will eventually return all resources allocated to it. The main advantages of the developed algorithms are: \begin{enumerate} \item New low priority jobs will never block older higher priority jobs. \item Requests are always granted if they cannot delay higher priority jobs. \item Any priority rule may be chosen. \end{enumerate}", checked = "19940503", refs = "9", } @Article{Seiferas:1977:IAD, author = "Joel I. Seiferas", title = "Iterative Arrays with Direct Central Control", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "177--192", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "A generalized iterative array model in which the next state of each finite-state computing element may depend on the signs of its location's coordinates and the current state of the computing element at the array origin (``direct central control'') is shown to be no more powerful for on-line time-bounded operation than the standard model of Cole. Applications include a simple iterative array simulation of multihead Turing machines of the same dimension, a simulation without time loss of a further generalized iterative array model with multiple ``array heads'' which may be shifted locally in the array or reset instantaneously to each other's locations, and simplified versions of several published iterative array algorithms.", checked = "19940503", refs = "17", } @Article{Deussen:1977:VWG, author = "Peter Deussen and Kurt Mehlhorn", title = "{Van Wijngaarden} Grammars and Space Complexity Class {EXSPACE}", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "193--199", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Top-down and bottom-up decision strategies for van Wijngaarden grammars led to type $R$ and type $L$ van Wijngaarden grammars. The corresponding language families are now shown to be equal and, furthermore, to equal EXSPACE. Thus, EXSPACE is characterised syntactically, and the closure properties of type $L$ and type $R$ languages are those of EXSPACE.", checked = "19940503", refs = "4", } @Article{Agerwala:1977:SES, author = "Tilak Agerwala", title = "Some Extended Semaphore Primitives", journal = j-ACTA-INFO, volume = "8", number = "3", pages = "201--220", day = "9", month = aug, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", abstract = "This paper presents a proposal for synchronizing primitives obtained as an extension of Dijkstra's $P, V$ primitives. The extended primitives are shown to be complete: they can represent any desired interaction between processes without the use of conditionals. The usefulness of these primitives is illustrated by presenting simple solutions to a series of coordination problems of increasing complexity. Two selected problems are used to illustrate disadvantages of existing synchronizing mechanisms. The extended primitives shift some of the burden from the programmer to the system since they are easier to use but more difficult to implement. However, even though each primitive operation may take longer to execute (as compared to the simple $P, V$ primitives) the total system overhead can be substantially less especially for complex coordination problems. The paper presents a straightforward but efficient implementation of the extended primitives.", checked = "19940503", keywords = "Semaphore", refs = "16", } @Article{Donahue:1977:LCU, author = "James E. Donahue", title = "Locations Considered Unnecessary", journal = j-ACTA-INFO, volume = "8", number = "3", pages = "221--242", day = "9", month = aug, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Recent papers have attacked the use of locations, or pointers, as data objects in programs. This paper considers a generalization of this attack -- attempting to remove locations from the underlying semantic model. Using the ``mathematical semantics'' of Scott and Strachey, we show that reference parameters and Algol scope rules for procedures, two constructs requiring the notion of reference, can be replaced with alternative constructs not requiring locations in the definition. Some conclusions are also drawn about the use of mathematical semantics as a language design tool.", checked = "19940503", keywords = "denotational semantics; programming language design", refs = "9", sjb = "Gives a denotational definition of a simple Pascal-like language using call-by-reference semantics but with the restriction that each parameter must be distinct and that no parameter can also be accessed as a global variable. Then gives another definition using call-by-value-result semantics with the same restrictions. Then goes on to prove that the semantics are weakly equivalent (that's my term, not his). Based on this, it is possible to remove locations completely if global variables are removed. Such a definition is given. Since this is a major restriction, another definition is given in which this restriction is weakened by introducing ``modules'' which delimit the scope of variables. Again a definition of the semantics is given. There are limitations though, assignments to array components cannot be dealt with directly, and passing components of arrays cannot be allowed. In each case, alternatives are suggested.", } @Article{Kroger:1977:LLA, author = "Fred Kr{\"o}ger", title = "{LAR}: {A} Logic of Algorithmic Reasoning", journal = j-ACTA-INFO, volume = "8", number = "3", pages = "243--266", day = "9", month = aug, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Reasoning about programs involves some logical framework which seems to go beyond classical predicate logic. LAR is an extension of predicate logic by additional concepts which are to formalize our ``natural'' reasoning about algorithms. Semantically, this extension introduces an underlying ``time scale'' on which formulas are considered and ``time shifting'' connectives. Besides a full model-theoretic treatment, a consistent and complete formal system for LAR is given. the pure logical system can serve as a basis for various theories. As an example, a theory of ``while program schemes'' is developed which contains Hoare's correctness proof system.", checked = "19940503", refs = "17", } @Article{Igarashi:1977:GPD, author = "Yoshihide Igarashi", title = "General Properties of Derivational Complexity", journal = j-ACTA-INFO, volume = "8", number = "3", pages = "267--283", day = "9", month = aug, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "The purpose of this paper is to establish a certain correspondence between shortest derivations of phrase structure grammars and Turing machine computations, and to show how to connect the derivational complexity introduced by Gladkij to Blum's axioms for partial recursive functions and their step-counting functions. It is shown that main theorems on Blum's axiomatic theory of computational complexity can be transferred to the case of derivational complexity.", checked = "19940503", refs = "15", } @Article{Asveld:1977:IDS, author = "Peter R. J. Asveld and Joost Engelfriet", title = "Iterated Deterministic Substitution", journal = j-ACTA-INFO, volume = "8", number = "3", pages = "285--302", day = "9", month = aug, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Deterministic substitution of languages means substituting the same word (form a given language) for all occurrences of a symbol. For an arbitrary family $K$ of languages the notion of deterministic $K$-iteration grammar is introduced, which is essentially the iteration of a finite number of deterministic substitutions of languages from $K$. The families of languages generated by these grammars are investigated.", checked = "19940503", refs = "24", } @Article{Eve:1977:CTC, author = "J. Eve and R. Kurki-Suonio", title = "On computing the transitive closure of a relation", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "303--314", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon Tarjan's algorithm \cite{Tarjan:sicomp:1972} for finding the strongly connected components of a directed graph. A new formulation, justifying a somewhat simplified statement of the latter, characterises weaker restrictions on the form of the graph traversal than Tarjan's depth first conditions and reveals aspects of the behaviour of this algorithm which have been obscure hitherto. If $V$ is the number of vertices in the directed graph representing the relation then the worst case behaviour, $O(V^3)$ is inferior to existing algorithms \cite{Artazarov:Dinic:Kronrod:Faradzev:1970,Furman:1970} which require $O(V^{3}/\log V)$ and $O(V^{\log _{2} 7} \log V)$ operations respectively. The best case performance, $O(V^2)$ operations, is better. Viewed in this way, it is similar to algorithms \cite{Purdom:bit:1970,Syslo:Dzikiewicz:1975,Warshall:jacm:1962} but it combines the improved efficiency in the presence of strongly connected components which characterises the algorithms \cite{Purdom:bit:1970,Syslo:Dzikiewicz:1975} with the advantages of Warshall's algorithm \cite{Warshall:jacm:1962}, namely, succinctness, a single traversal of the directed graph and ability to exploit the availability of Boolean vector operations.", annote = "Improves on Tarjan algorithm $O(V^3)$ worst case worse than existing algorithms but $O(V^2)$ best cases better than others.", checked = "19940503", keywords = "algorithm; component; directed graph; graph; relation; strongly connected component; transitive closure", refs = "8", } @Article{Tennent:1977:NAR, author = "Robert D. Tennent", title = "On a New Approach to Representation Independent Data Classes", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "315--324", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", abstract = "An approach to definition of abstract data classes suggested by J. C. Reynolds is investigated in the context of a PASCAL-like language. The issues of inheritance and parameterization of classes are considered, and new design solutions proposed.", annote = "Discusses parameterization and access to operations of a type. 24 references.", checked = "19940503", keywords = "generic arguments; parameterization; type classes", refs = "24", sjb = "Notes that in some languages it is possible to parameterize routines, but that it is often not possible to place restrictions on what are valid instantiations. For example, it is desirable to indicate that a particular type is being used as an ``index'' or that another type must have an ordering relationship defined on it. Suggets additional keywords such as ``index'' that can be added to generic parameter lists to restrict the types accordingly SML modules and Haskell type classes are examples of this, with the difference that they let the programmer define the different classes rather than having them fixes as seems to be the case in Tennet's proposal. Not sure what the word ``inheritance'' refers to in the abstract since the paper doesn't mention ``inheritance'' as it is understood in OO.", } @Article{Ramsperger:1977:CAD, author = "N. Ramsperger", title = "Concurrent Access to Data", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "325--334", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "Problems caused by concurrent access to data can be solved by locking. This, however, diminishes efficiency and may cause deadlocks among the accessing processes. In this paper the structuring of data sets is deduced from assertions about accesses which may be performed simultaneously. this structuring supports the development of operations which synchronize concurrent access to these data. Thus the provisions for locking are transferred from programs to data structures where the requests for locking actually arise. The synchronization operations will exclude all undesired interferences and will maximize the number of possible simultaneous accesses in accordance with the original assertions.", checked = "19940503", refs = "10", } @Article{Conradi:1977:SCC, author = "Reidar Conradi", title = "Some Comments on {{\em Concurrent Readers and Writers}}", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "335--340", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See remarks \cite{Silberschatz:1978:RSC}.", abstract = "A more compact and efficient algorithm for synchronization of concurrent readers and writers is presented, and which grants writers effective priority over readers. A synchronization primitive $P*$, which only decrements a semaphore value by one, is also described.", checked = "19940503", refs = "6", } @Article{Kameda:1977:FCR, author = "Hisao Kameda and Calvin C. Gotlieb", title = "A Feedback-Coupled Resource Allocation Policy for Multiprogrammed Computer Systems", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "341--357", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "An earlier paper on an adaptive workload balancing strategy to achieve efficient resource utilization is extended to include memory cost. The scheme corrects for the imbalance in resource utilization by bringing into play the ``Invisible Hand'' of classical economics. In this framework, the memory price and the bid, $W_{ij}$, of each user program $U_{j}$ for resource $R_{i}$ are calculated adaptively. These prices are not apparent to the users, but they are rather shadow prices determined from the characteristics of user programs, the current resource congestion, and the budget constraints of users. There emerge a set of effective priorities for user programs based on the bid prices, $W_{ij}$, and these determine the scheduling of programs. An imbalance due to high congestion of some resource will result in a relative decrease of priority for heavy users of that resource and a relative increase for light users. Some ideas on an actual implementation scheme are described on an approximation to the above abstract scheme. It is shown that this approximate scheme will also tend to balance resource utilization.", checked = "19940503", refs = "9", } @Article{Parent:1977:NIP, author = "Michel Parent and Dominique Potier", title = "A Note on the Influence of Program Loading on the Page Fault Rate", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "359--370", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "We define and analyse in this paper the concept of modified life time function. This concept is introduced in order to take into account both internal and external factors which influence the mean time between page faults of a program executing on a page-on-demand multiprogramming system. The analysis is based on a probabilistic model of a program paging activity during its execution. The intrinsic behaviour of the program in its address space as well as the memory allotment and the swapping policy are considered in the model, and the interactions of these different factors are analysed. The results point out that the influence of the external factors on the life time function of a program is significant, and provide some insight on the non-convex shape of observed life time functions. Numerical illustrations are presented, and it is shown that the analysis can be used to quantify the performance of preloading policies.", checked = "19940503", refs = "17", } @Article{Monien:1977:LPD, author = "Burkhard Monien", title = "The {LBA}-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "371--382", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", abstract = "It is shown that, NTAPE($n$) is equal to TAPE($n$) if and only if every language $L \subset \dashv \{1\}* \vdash$ which is acceptable by a nondeterministic two-way one-counter automaton whose counter length is bounded by the length of its input is contained in TAPE(log $n$).", checked = "19940503", refs = "8", } @Article{Monien:1977:CTM, author = "Burkhard Monien", title = "Corrigenda: {{\em Transformational Methods and Their Application to Complexity Problems}}", journal = j-ACTA-INFO, volume = "8", number = "4", pages = "383--384", day = "25", month = nov, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See \cite{Monien:1976:TMT}.", checked = "19940503", refs = "8", } @Article{Bayer:1977:COB, author = "Rudolf Bayer and Mario Schkolnick", title = "Concurrency of Operations on {B}-Trees", journal = j-ACTA-INFO, volume = "9", number = "1", pages = "1--21", day = "13", month = dec, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/is.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1977.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "Reprinted in M. Stonebraker, Readings in Database Sys., Morgan Kaufmann, San Mateo, CA, 1988. Also published in/as: IBM, San Jose, Res. Lab, Res. R. RJ 1791, May, 1976.", keywords = "database systems concurrency deadlock", } @Article{Lee:1978:WCA, author = "D. T. Lee and C. K. Wong", title = "Worst-Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "23--29", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Pager:1978:EUP, author = "David Pager", title = "Eliminating Unit Productions from {{\em LR}} Parsers", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "31--59", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Sokolowski:1978:ATC, author = "Stefan Sokolowski", title = "Axioms for Total Correctness", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "61--71", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Paredaens:1978:CMF, author = "Jan Paredaens and R. Vyncke", title = "A Class of Measures on Formal Languages", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "73--86", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Avenhaus:1978:SKGa, author = "J{\"u}rgen Avenhaus and Klaus Madlener", title = "{Subrekursive Komplexit{\"a}t bei Gruppen: I. Gruppen mit vorgeschriebener Komplexit{\"a}t}. ({German}) [{Subrecursive} Complexity on Groups. {I}. Groups of Given Complexity]", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "87--104", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hansen:1978:RSH, author = "Wilfried J. Hansen and Hendrik Boom", title = "The Report on the Standard Hardware Representation for {ALGOL 68}", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "105--119", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Correll:1978:PPC, author = "Claus H. Correll", title = "Proving Programs Correct through Refinement", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "121--132", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "program proving", } @Article{Francez:1978:PMC, author = "Nissim Francez and Amir Pnueli", title = "A Proof Method for Cyclic Programs", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "133--157", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "81e:68014", MRreviewer = "Przemys{\l}aw Prusinkiewicz", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Yao:1978:RT, author = "Andrew Chi-Chih Yao", title = "On Random $2$-$3$ Trees", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "159--170", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1978.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/algobib.bib", } @Article{Book:1978:CFG, author = "Ronald V. Book", title = "On the Complexity of Formal Grammars", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "171--181", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Avenhaus:1978:SKGb, author = "J{\"u}rgen Avenhaus and Klaus Madlener", title = "{Subrekursive Komplexit{\"a}t bei Gruppen: II. Der Einbettungssatz von Higman f{\"u}r entscheidbare Gruppen}. ({German}) [{Subrecursive} Complexity on Groups. {II}. {Higman}'s Embedding Theorem for Decidable Groups]", journal = j-ACTA-INFO, volume = "9", number = "2", pages = "183--193", day = "3", month = apr, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D40 (20F10)", MRnumber = "80d:03044", MRreviewer = "George Hutchinson", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Pratt:1978:PAO, author = "Terrence W. Pratt", title = "Program Analysis and Optimization through Kernel-Control Decomposition", journal = j-ACTA-INFO, volume = "9", number = "3", pages = "195--216", day = "5", month = may, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hoffmann:1978:DCC, author = "Christoph M. Hoffmann", title = "Design and Correctness of a Compiler for a Non-Procedural Language", journal = j-ACTA-INFO, volume = "9", number = "3", pages = "217--241", day = "5", month = may, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B99 (68G15)", MRnumber = "81e:68028", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Cremers:1978:OIS, author = "Armin B. Cremers and Thomas N. Hibbard", title = "Orthogonality of Information Structures", journal = j-ACTA-INFO, volume = "9", number = "3", pages = "243--261", day = "5", month = may, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20", MRnumber = "81e:68021", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/is.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Coffman:1978:PMN, author = "Edward G. {Coffman, Jr.} and Joseph Y.-T. Leung and D. W. Ting", title = "Bin Packing: Maximizing the Number of Pieces Packed", journal = j-ACTA-INFO, volume = "9", number = "3", pages = "263--271", day = "5", month = may, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (90B05)", MRnumber = "81e:68032", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rosenberg:1978:DET, author = "Arnold L. Rosenberg", title = "Data Encodings and Their Costs", journal = j-ACTA-INFO, volume = "9", number = "3", pages = "273--292", day = "5", month = may, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Cremers:1978:FBD, author = "Armin B. Cremers and Thomas N. Hibbard", title = "Functional Behavior in Data Spaces", journal = j-ACTA-INFO, volume = "9", number = "4", pages = "293--307", day = "21", month = jun, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Stadel:1978:ZNK, author = "Manfred Stadel", title = "{Die Zeitkomplexit{\"a}t des Normalisierungsproblems bei kontextsensitiven Grammatiken}. ({German}) [{The} Time Complexity of the Normalization Problem of Context-Sensitive Grammars]", journal = j-ACTA-INFO, volume = "9", number = "4", pages = "309--329", day = "21", month = jun, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Krzesinski:1978:MNM, author = "Anthony E. Krzesinski and Peter Teunissen", title = "A Multiclass Network Model of a Demand Paging Computer System", journal = j-ACTA-INFO, volume = "9", number = "4", pages = "331--343", day = "21", month = jun, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", } @Article{Hule:1978:GOF, author = "H. Hule and Hermann A. Maurer and Thomas Ottmann", title = "Good {OL} Forms", journal = j-ACTA-INFO, volume = "9", number = "4", pages = "345--353", day = "21", month = jun, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Warren:1978:SMS, author = "Henry S. {Warren, Jr.}", title = "Static Main Storage Packing Problems", journal = j-ACTA-INFO, volume = "9", number = "4", pages = "355--376", day = "21", month = jun, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Deussen:1978:UAG, author = "Peter Deussen", title = "A Unified Approach to the Generation and the Acception of Formal Languages", journal = j-ACTA-INFO, volume = "9", number = "4", pages = "377--390", day = "21", month = jun, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{London:1978:PRP, author = "Ralph L. London and John V. Guttag and James J. Horning and Butler W. Lampson and J. G. Mitchell and Gerald J. Popek", title = "Proof Rules for the Programming Language {Euclid}", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "1--26", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", checked = "4 September 1990", sjb = "See \cite{London:Guttag:Horning:Lampson:Mitchell:Popek:pc:1978} for an earlier version of this paper.", } @Article{Guttag:1978:ASA, author = "John V. Guttag and James J. Horning", title = "The algebraic specification of abstract data types", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "27--52", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/pennbib.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/larch.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/softeng.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib", keywords = "abstract data types; algebraic specification; Rewrite", } @Article{Howden:1978:APT, author = "William E. Howden", title = "Algebraic Program Testing", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "53--66", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", } @Article{Laurinolli:1978:BQR, author = "Teuvo Laurinolli", title = "Bounded Quantification and Relations Recognizable by Finite Automata", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "67--78", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Culik:1978:UEP, author = "Karel {Culik II}", title = "The Ultimate Equivalence Problem for {DOL} Systems", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "79--84", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Montangero:1978:IMC, author = "Carlo Montangero and Giuliano Pacini and Maria Simi and Franco Turini", title = "Information Management in Context Trees", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "85--94", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Liu:1978:PAM, author = "Jane W. S. Liu and C. L. Liu", title = "Performance Analysis of Multiprocessor Systems Containing Functionally Dedicated Processors", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "95--104", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Bartsch:1978:CLG, author = "B. Bartsch and G. Bolch", title = "A Conservation Law for {G/G/m} Queueing Systems", journal = j-ACTA-INFO, volume = "10", number = "1", pages = "105--109", day = "4", month = aug, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/Erlangen.5.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", keywords = "L5-Archiv", } @Article{Paul:1978:TST, author = "Wolfgang J. Paul and Robert Endre Tarjan", title = "Time-Space Trade-Offs in a Pebble Game", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "111--115", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (05C99 68E10)", MRnumber = "80j:68033", MRreviewer = "Forbes D. Lewis", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ben-Ari:1978:IPS, author = "Mordechai Ben-Ari", title = "Ianov Pushdown Schemes Are Contained in {Boolean} Recursive Schemes", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "117--125", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Sabelfeld:1978:ATF, author = "V. K. Sabel{\cprime}fel{\cprime}d", title = "{{\"A}quivalente Transformationen f{\"u}r Flu{\ss}diagramme}. ({German}) [{Equivalence} Transformations of Program Schemes]", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "127--155", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "80a:68019", MRreviewer = "Jerzy Tiuryn", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wallis:1978:DPP, author = "Peter J. L. Wallis", title = "The Design of a Portable Programming Language", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "157--167", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Wotschke:1978:NCC, author = "Detlef Wotschke and Celia Wrathall", title = "A Note on Classes of Complements and the {LBA} Problem", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "169--173", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "80a:68095", MRreviewer = "S. A. Greibach", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Franck:1978:CLP, author = "Reinhold Franck", title = "A Class of Linearly Parsable Graph Grammars", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "175--201", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gragra.bib", added = "1996-03-13-10-09-20", } @Article{Maxson:1978:LRS, author = "Carlton J. Maxson", title = "Linear Regular Sets", journal = j-ACTA-INFO, volume = "10", number = "2", pages = "203--208", day = "7", month = sep, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Lewi:1978:EPG, author = "J. Lewi and Karel De Vlaminck and J. Huens and M. Huybrechts", title = "The {{\em ELL($1$)}} Parser Generator and the Error Recovery Mechanism", journal = j-ACTA-INFO, volume = "10", number = "3", pages = "209--228", day = "2", month = oct, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hehner:1978:RML, author = "Eric C. R. Hehner", title = "On Removing the Machine from the Language", journal = j-ACTA-INFO, volume = "10", number = "3", pages = "229--243", day = "2", month = oct, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Babich:1978:MADa, author = "Wayne A. Babich and Mehdi Jazayeri", title = "The Method of Attributes for Data Flow Analysis: {Part I}. {Exhaustive} Analysis", journal = j-ACTA-INFO, volume = "10", number = "3", pages = "245--264", day = "2", month = oct, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68B10)", MRnumber = "80a:68020", MRreviewer = "M. G. Gontsa", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "applic.DFA", } @Article{Babich:1978:MADb, author = "Wayne A. Babich and Mehdi Jazayeri", title = "The Method of Attributes for Data Flow Analysis: {Part II}. {Demand} Analysis", journal = j-ACTA-INFO, volume = "10", number = "3", pages = "265--272", day = "2", month = oct, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Choy:1978:OTC, author = "D. M. Choy and C. K. Wong", title = "Optimal $\alpha-\beta$ trees with capacity constraint", journal = j-ACTA-INFO, volume = "10", number = "3", pages = "273--296", day = "2", month = oct, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (05C05 68H05)", MRnumber = "80a:68038", MRreviewer = "Fabrizio Luccio", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Biskup:1978:CRM, author = "Joachim Biskup", title = "On the Complementation Rule for Multivalued Dependencies in Database Relations", journal = j-ACTA-INFO, volume = "10", number = "3", pages = "297--305", day = "2", month = oct, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15", MRnumber = "80b:68025", MRreviewer = "W. W. Armstrong", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Celentano:1978:ILP, author = "Augusto Celentano", title = "Incremental {{\em LR}} Parsers", journal = j-ACTA-INFO, volume = "10", number = "4", pages = "307--321", day = "27", month = nov, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "incremental parsing; LR; parse; parser; parsing", } @Article{Meersman:1978:TLM, author = "Robert Meersman and Grzegorz Rozenberg", title = "Two-Level Meta-Controlled Substitution Grammars", journal = j-ACTA-INFO, volume = "10", number = "4", pages = "323--339", day = "27", month = nov, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "80h:68063", MRreviewer = "P. Deussen", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Eichner:1978:SLRa, author = "Lutz Eichner", title = "The Semigroups of Linearly Realizable Finite Automata {I}", journal = j-ACTA-INFO, volume = "10", number = "4", pages = "341--367", day = "27", month = nov, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "369--390. 68D30 (20M35)", MRnumber = "81f:68066", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", } @Article{Eichner:1978:SLRb, author = "Lutz Eichner", title = "The Semigroups of Linearly Realizable Finite Automata {II}", journal = j-ACTA-INFO, volume = "10", number = "4", pages = "369--390", day = "27", month = nov, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "369--390. 68D30 (20M35)", MRnumber = "81f:68066", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", } @Article{Darlington:1978:SSS, author = "John Darlington", title = "A Synthesis of Several Sorting Algorithms", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "1--30", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (68C05 68E05)", MRnumber = "80e:68024", MRreviewer = "Amitava Bagchi", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; MathSciNet database", note = "See remarks \cite{Barstow:1980:RSS} and corrections \cite{Jacobs:1988:CSS}.", acknowledgement = ack-nhfb, checked = "19940225", keywords = "algorithm synthesis; program synthesis; sorting", } @Article{Huet:1978:PAP, author = "G{\'e}rard P. Huet and Bernard Lang", title = "Proving And Applying Program Transformations Expressed With second-Order Patterns", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "31--55", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "80b:68023", MRreviewer = "A. Pliuskevicien\.e", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/pennbib.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bcp.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "program transformation", } @Article{Silberschatz:1978:RSC, author = "Abraham Silberschatz and Brian Johnson", title = "Remarks on {{\em Some Comments on Concurrent Readers and Writers}} by {Reidar Conradi}", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "57--60", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See \cite{Conradi:1977:SCC}.", } @Article{Adleman:1978:ITS, author = "Leonard M. Adleman and Kellogg S. Booth and Franco P. Preparata and Walter L. Ruzzo", title = "Improved Time and Space Bounds for {Boolean} Matrix Multiplication", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "61--70", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (94C10)", MRnumber = "80f:68038", MRreviewer = "N. A. Karpova", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{McColl:1978:CHB, author = "William F. McColl", title = "Complexity hierarchies for {Boolean} functions", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "71--77", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C10 (68C25)", MRnumber = "80b:94041", MRreviewer = "Claus-Peter Schnorr", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ginsburg:1978:PRG, author = "Seymour Ginsburg and Derick Wood", title = "Precedence Relations in Grammar Forms", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "79--88", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (68F25)", MRnumber = "80b:68085", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Greibach:1978:HTT, author = "S. A. Greibach", title = "Hierarchy Theorems for Two-Way Finite State Transducers", journal = j-ACTA-INFO, volume = "11", number = "1", pages = "89--101", day = "18", month = dec, year = "1978", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F10", MRnumber = "80c:68061", MRreviewer = "Ronald E. Prather", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Adams:1979:EVM, author = "C. Adams and Erol Gelenbe and J. Vicard", title = "An Experimentally Validated Model of the Paging Drum", journal = j-ACTA-INFO, volume = "11", number = "2", pages = "103--117", day = "3", month = jan, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Jones:1979:CTD, author = "Cliff B. Jones", title = "Constructing a Theory of a Data Structure as an Aid to Program Development", journal = j-ACTA-INFO, volume = "11", number = "2", pages = "119--137", day = "3", month = jan, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/vdm.bib", annote = "22 references.", } @Article{Arbib:1979:PRG, author = "Michael A. Arbib and Suad Alagi{\'c}", title = "Proof Rules for {\bf Goto}s", journal = j-ACTA-INFO, volume = "11", number = "2", pages = "139--148", day = "3", month = jan, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", } @Article{Merzenich:1979:BOT, author = "Wolfgang Merzenich", title = "A Binary Operation on Trees and an Initial Algebra Characterization for Finite Tree Types", journal = j-ACTA-INFO, volume = "11", number = "2", pages = "149--168", day = "3", month = jan, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (05C05)", MRnumber = "80d:68077", MRreviewer = "V. Yu. Me{\u{\i}}tus", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Heilbrunner:1979:DEE, author = "Stephan Heilbrunner", title = "On the Definition of {{\em ELR($k$)}} and {{\em ELL($k$)}} Grammars", journal = j-ACTA-INFO, volume = "11", number = "2", pages = "169--176", day = "3", month = jan, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25 (68F05)", MRnumber = "80d:68107", MRreviewer = "Anton Nijholt", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{LaLonde:1979:CLP, author = "Wilf R. LaLonde", title = "Constructing {{\em LR}} Parsers for Regular Right Part Grammars", journal = j-ACTA-INFO, volume = "11", number = "2", pages = "177--193", day = "3", month = jan, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "80d:68109", MRreviewer = "Anton Nijholt", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Coleman:1979:CTP, author = "D. Coleman and J. W. Hughes", title = "The Clean Termination of {Pascal} Programs", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "195--210", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", annote = "8 references.", } @Article{Topor:1979:CSW, author = "Rodney W. Topor", title = "The Correctness of the {Schorr-Waite} List Marking Algorithm", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "211--221", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (68C05)", MRnumber = "80c:68014", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/gc.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/state.functional.programming.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; MathSciNet database", acknowledgement = ack-nhfb, comments = "proves the correctness of the link reversal algorithm by Deutsch-Schorr-Waite", } @Article{Gries:1979:SWG, author = "David Gries", title = "The {Schorr--Waite} Graph Marking Algorithm", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "223--232", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/garbage.collection.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/gc.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/state.functional.programming.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", comments = "proves the correctness of the link reversal algorithm by Deutsch-Schorr-Waite", } @Article{Latteux:1979:ILA, author = "Michel Latteux", title = "Intersections de langages alg{\'e}briques born{\'e}s. ({French}) [{Intersections} of Bounded Algebraic Languages]", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "233--240", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "80e:68186", MRreviewer = "M. Novotn\'y", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Autebert:1979:OCA, author = "Jean-Michel Autebert", title = "Op{\'e}rations de Cylindre et applications s{\'e}quentielles gauches inverses. ({French}) [Cylinder operations and sequential left-inverse applications]", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "241--258", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Asveld:1979:ELM, author = "Peter R. J. Asveld and Joost Engelfriet", title = "Extended Linear Macro Grammars, Iteration Grammars, and Register Programs", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "259--285", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "80k:68055", MRreviewer = "K. L. Yushchenko", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hehner:1979:DCO, author = "Eric C. R. Hehner", title = "{\bf do} considered {\bf od}: {A} contribution to the programming calculus", journal = j-ACTA-INFO, volume = "11", number = "3", pages = "287--304", day = "22", month = mar, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", } @Article{Bouchet:1979:PRS, author = "P. Bouchet", title = "Proc{\'e}dures de reprise dans les syst{\`e}mes de gestion de base de donn{\'e}es r{\'e}parties. ({French}) [{Recovery} Techniques for Distributed Database Management Systems]", journal = j-ACTA-INFO, volume = "11", number = "4", pages = "305--340", day = "30", month = may, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Unterauer:1979:DWB, author = "Karl Unterauer", title = "Dynamic Weighted Binary Search Trees", journal = j-ACTA-INFO, volume = "11", number = "4", pages = "341--362", day = "30", month = may, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (68C25 68H05)", MRnumber = "80h:68057", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kemp:1979:ANR, author = "R. Kemp", title = "The Average Number of Registers Needed to Evaluate a Binary Tree Optimally", journal = j-ACTA-INFO, volume = "11", number = "4", pages = "363--372", day = "30", month = may, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (68C25)", MRnumber = "80e:68170", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{vanLeeuwen:1979:ULC, author = "Jan {van Leeuwen}", title = "A Useful Lemma for Context-Free Programmed Grammars", journal = j-ACTA-INFO, volume = "11", number = "4", pages = "373--386", day = "30", month = may, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "80f:68086", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{vanLamsweerde:1979:FDS, author = "Axel {van Lamsweerde} and Michel Sintzoff", title = "Formal Derivation of Strongly Correct Concurrent Programs", journal = j-ACTA-INFO, volume = "12", number = "1", pages = "1--31", day = "25", month = jun, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "80e:68034", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Alt:1979:LBS, author = "Helmut Alt", title = "Lower Bounds on Space Complexity for Contextfree Recognition", journal = j-ACTA-INFO, volume = "12", number = "1", pages = "33--61", day = "25", month = jun, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (68C25)", MRnumber = "80e:68177", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Horibe:1979:MER, author = "Yasuichi Horibe and Tibor O. H. Nemetz", title = "On the Max-Entropy Rule for a Binary Search Tree", journal = j-ACTA-INFO, volume = "12", number = "1", pages = "63--72", day = "25", month = jun, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (68H05)", MRnumber = "80f:68076", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Steensgaard-Madsen:1979:PCR, author = "J{\o}rgen Steensgaard-Madsen", title = "Pascal---Clarifications and Recommended Extensions", journal = j-ACTA-INFO, volume = "12", number = "1", pages = "73--94", day = "25", month = jun, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib", annote = "Concentrates on the type system in Pascal. 2 references", } @Article{Burton:1979:GRD, author = "Warren Burton", title = "Generalized Recursive Data Structures", journal = j-ACTA-INFO, volume = "12", number = "2", pages = "95--108", day = "24", month = jul, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Lauer:1979:CSS, author = "P. E. Lauer and P. R. Torrigiani and M. W. Shields", title = "{COSY} --- {A} system specification language based on paths and processes", journal = j-ACTA-INFO, volume = "12", number = "2", pages = "109--158", day = "24", month = jul, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/is.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", } @Article{Iglehart:1979:RSR, author = "Donald L. Iglehart and Gerald S. Shedler", title = "Regenerative Simulation of Response Times in Networks of Queues with Multiple Job Types", journal = j-ACTA-INFO, volume = "12", number = "2", pages = "159--175", day = "24", month = jul, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C15 (68J05)", MRnumber = "80d:68045", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1979.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "The authors consider passage time simulation in closed networks of queues having multiple job types. The results provide a means of obtaining, from a single replication, point and interval estimates for passage times of the several job types. They also yield a statistically more efficient estimation procedure for passage times of a single job type.", country = "USA", date = "19/03/80", descriptors = "Simulation; response time; queueing network; priority; time in system; independent cycles", enum = "1457", language = "English", location = "RWTH-AC-DFV: TELL; TUDD-IfN-TK: Li-Ord.Le", references = "0", revision = "15/02/92", } @Article{Book:1979:LAS, author = "Ronald V. Book", title = "On Languages Accepted by Space-Bounded Oracle Machines", journal = j-ACTA-INFO, volume = "12", number = "2", pages = "177--185", day = "24", month = jul, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F10 (68D45)", MRnumber = "80e:68200", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Turnbull:1979:GDL, author = "C. J. M. Turnbull and E. S. Lee", title = "Generalized Deterministic Left To Right Parsing", journal = j-ACTA-INFO, volume = "12", number = "3", pages = "187--207", month = oct, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "81b:68105", MRreviewer = "Anton Nijholt", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wilhelm:1979:CUD, author = "Reinhard Wilhelm", title = "Computation and Use of Data Flow Information in Optimizing Compilers", journal = j-ACTA-INFO, volume = "12", number = "3", pages = "209--225", month = oct, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "applic.DFA", } @Article{Commentz-Walter:1979:SDT, author = "Beate Commentz-Walter", title = "Size-depth trade-off in monotone {Boolean} formulae", journal = j-ACTA-INFO, volume = "12", number = "3", pages = "227--243", month = oct, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (03G05 94C10)", MRnumber = "80m:68038", MRreviewer = "Dorothy Bollman", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Cohen:1979:MPS, author = "J. W. Cohen", title = "The Multiple Phase Service Network with Generalized Processor Sharing", journal = j-ACTA-INFO, volume = "12", number = "3", pages = "245--284", month = oct, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68C15)", MRnumber = "80i:60128", MRreviewer = "F. P. Kelly", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Gelenbe:1979:PMC, author = "Erol Gelenbe", title = "Probabilistic models of computer systems. {II}. {Diffusion} approximations, waiting times and batch arrivals", journal = j-ACTA-INFO, volume = "12", number = "4", pages = "285--303", month = nov, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68J10 (60K25 68A05 68C15)", MRnumber = "80k:68090", MRreviewer = "Ralph L. Disney", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hikita:1979:CRP, author = "Teruo Hikita", title = "On a Class of Recursive Procedures and Equivalent Iterative Ones", journal = j-ACTA-INFO, volume = "12", number = "4", pages = "305--320", month = nov, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (68B05)", MRnumber = "80k:68020", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mikou:1979:AOP, author = "N. Mikou and S. Tucci", title = "Analyse et optimisation d'une proc{\'e}dure de reprise dans un syst{\`e}me de gestion de donn{\'e}es centralis{\'e}es. ({French}) [{Analysis} and Optimization of a Recovery Technique in a Management System of Centralized Data]", journal = j-ACTA-INFO, volume = "12", number = "4", pages = "321--338", month = nov, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68A05", MRnumber = "80j:68007", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Soisalon-Soininen:1979:MTG, author = "Eljas Soisalon-Soininen and Esko Ukkonen", title = "A Method for Transforming Grammars into {{\em LL($k$)}} Form", journal = j-ACTA-INFO, volume = "12", number = "4", pages = "339--369", month = nov, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81i:68115", MRreviewer = "I. M. Havel", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mehlhorn:1979:SRB, author = "Kurt Mehlhorn", title = "Some Remarks on {Boolean} Sums", journal = j-ACTA-INFO, volume = "12", number = "4", pages = "371--375", month = nov, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C10", MRnumber = "80j:94039", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nishimura:1979:SMP, author = "Hirokazu Nishimura", title = "Sequential Method in Propositional Dynamic Logic", journal = j-ACTA-INFO, volume = "12", number = "4", pages = "377--400", month = nov, year = "1979", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03B60 (68C01)", MRnumber = "81c:03019", MRreviewer = "R. E. Ladner", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Dijkstra:1980:SBA, author = "Edsger W. Dijkstra", title = "Some Beautiful Arguments Using Mathematical Induction", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "1--8", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "00A05", MRnumber = "81e:00001", MRreviewer = "K. C. Stacey", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hoffmann:1980:SPL, author = "Christoph M. Hoffmann", title = "Semantic Properties of {Lucid}'s Compute Clause and its Compilation", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "9--20", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (68F20)", MRnumber = "81a:68015", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Heidelberger:1980:VRT, author = "Philip Heidelberger", title = "Variance Reduction Techniques for the Simulation of {Markov} Process", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "21--37", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gonnet:1980:ACA, author = "Gaston H. Gonnet and Lawrence D. Rogers and J. Alan George", title = "An Algorithmic and Complexity Analysis of Interpolation Search", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "39--52", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (65D05)", MRnumber = "81f:68054", MRreviewer = "C. Dagnino", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Galil:1980:AEM, author = "Zvi Galil", title = "Applications of Efficient Mergeable Heaps for Optimization Problems on Trees", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "53--58", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Reisch:1980:GPV, author = "Stefan Reisch", title = "{Gobang ist PSPACE-vollst{\"a}ndig}. ({German}) [{Gobang} is {PSPACE}-Complete]", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "59--66", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "90D05 (68C25)", MRnumber = "81e:90110", MRreviewer = "Aviezri S. Fraenkel", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Siekmann:1980:PCG, author = "J{\"o}rg H. Siekmann and Graham Wrightson", title = "Paramodulated Connection Graphs", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "67--86", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03B35 (68G15)", MRnumber = "82b:03036", MRreviewer = "M. M. Richter", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Maurer:1980:GGC, author = "Hermann A. Maurer and Arto K. Salomaa and Derick Wood", title = "On Generators and Generative Capacity of {EOL} Forms", journal = j-ACTA-INFO, volume = "13", number = "1", pages = "87--107", month = jan, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81f:68085", MRreviewer = "S. Ginsburg", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wegener:1980:NLB, author = "Ingo Wegener", title = "A new Lower Bound on the Monotone Network Complexity of {Boolean} Sums", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "109--114", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (94C10)", MRnumber = "81g:68075", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rohrich:1980:MAC, author = "Johannes R{\"o}hrich", title = "Methods for the Automatic Construction of Error Correcting Parsers", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "115--139", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25 (68D35)", MRnumber = "81d:68117", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Fischer:1980:ELE, author = "Charles N. Fischer and Donn R. Milton and Sam B. Quiring", title = "Efficient {{\em LL($1$)}} Error Correction and Recovery Using Only Insertions", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "141--154", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25 (68B99)", MRnumber = "81d:68116", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "error correction; LL", } @Article{Bentley:1980:EWC, author = "Jon Louis Bentley and Hermann A. Maurer", title = "Efficient Worst-Case Data Structures for Range Searching", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "155--168", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68E05)", MRnumber = "81a:68021", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/att.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Clarke:1980:PCC, author = "Edmund Melson Clarke", title = "Proving Correctness of Coroutines Without History Variables", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "169--188", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "81a:68013", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Reutenauer:1980:OLI, author = "Christophe Reutenauer", title = "An {Ogden}-Like Iteration Lemma for Rational Power Series", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "189--197", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81d:68107", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kintala:1980:ANF, author = "Chandra M. R. Kintala and Detlef Wotschke", title = "Amounts of Nondeterminism in Finite Automata", journal = j-ACTA-INFO, volume = "13", number = "2", pages = "199--204", month = feb, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68D25 (68C25)", MRnumber = "81e:68065", MRreviewer = "David B. Benson", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Tompa:1980:PES, author = "Frank Wm. Tompa", title = "A Practical Example of the Specification of Abstract Data Types", journal = j-ACTA-INFO, volume = "13", number = "3", pages = "205--224", month = mar, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15", MRnumber = "81a:68027", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Barstow:1980:RSS, author = "David R. Barstow and John Darlington", title = "Remarks on {{\em A Synthesis of Several Sorting Algorithms}} by {John Darlington}", journal = j-ACTA-INFO, volume = "13", number = "3", pages = "225--227", month = mar, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (68B10 68E05)", MRnumber = "82a:68053", MRreviewer = "Amitava Bagchi", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; MathSciNet database", note = "See \cite{Darlington:1978:SSS,Jacobs:1988:CSS}.", acknowledgement = ack-nhfb, } @Article{Kastens:1980:OAG, author = "Uwe Kastens", title = "Ordered Attributed Grammars", journal = j-ACTA-INFO, volume = "13", number = "3", pages = "229--256", month = mar, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81a:68083", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See also: Bericht 7/78, Institut f{\"u}r Informatik II, University Karlsruhe (1978).", acknowledgement = ack-nhfb, keywords = "attribute grammars; class eval; ordered", } @Article{Rozenberg:1980:CFG, author = "Grzegorz Rozenberg and D. Wood", title = "Context-Free Grammars With Selective Rewriting", journal = j-ACTA-INFO, volume = "13", number = "3", pages = "257--268", month = mar, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81g:68111", MRreviewer = "Joffroy Beauquier", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Buning:1980:UAI, author = "Hans Kleine B{\"u}ning and Lutz Priese", title = "Universal Asynchronous Iterative Arrays of {Mealy} Automata", journal = j-ACTA-INFO, volume = "13", number = "3", pages = "269--285", month = mar, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68D20", MRnumber = "81e:68062", MRreviewer = "Katsushi Inoue", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rollik:1980:APG, author = "H. A. Rollik", title = "Automaten in planaren Graphen. ({German}) [{Automata} in Planar Graphs]", journal = j-ACTA-INFO, volume = "13", number = "3", pages = "287--298", month = mar, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68D90 (68E10)", MRnumber = "81e:68073", MRreviewer = "L{\'a}szl{\'o} T. K{\'o}czy", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Franta:1980:APC, author = "William R. Franta and Mark Benedict Bilodeau", title = "Analysis of a Prioritized {CSMA} Protocol Based on Staggered Delays", journal = j-ACTA-INFO, volume = "13", number = "4", pages = "299--324", month = may, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Berztiss:1980:DFT, author = "A. T. Berztiss", title = "Depth-First {$K$}-Trees and Critical Path Analysis", journal = j-ACTA-INFO, volume = "13", number = "4", pages = "325--346", month = may, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (05C20 68C15)", MRnumber = "81g:68090", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Latteux:1980:GAL, author = "Michel Latteux", title = "Sur les g{\'e}n{\'e}rateurs alg{\'e}briques et lin{\'e}aires. ({French}) [{Algebraic} and Linear Generators]", journal = j-ACTA-INFO, volume = "13", number = "4", pages = "347--363", month = may, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F10", MRnumber = "81d:68112", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Maurer:1980:RBR, author = "Hermann A. Maurer and Maurice Nivat", title = "Rational Bijection of Rational Sets", journal = j-ACTA-INFO, volume = "13", number = "4", pages = "365--378", month = may, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81h:68072", MRreviewer = "S. Ginsburg", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Morito:1980:UBA, author = "Susumu Morito and Harvey M. Salkin", title = "Using the {Blankinship} Algorithm to Find the General Solution of a Linear {Diophantine} Equation", journal = j-ACTA-INFO, volume = "13", number = "4", pages = "379--382", month = may, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "10B05 (10A30)", MRnumber = "81h:10021", MRreviewer = "H. London", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mescheder:1980:NAO, author = "Bernhard Mescheder", title = "On the Number of Active-Operations Needed to Compute the Discrete {Fourier} Transform", journal = j-ACTA-INFO, volume = "13", number = "4", pages = "383--408", month = may, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (94A11)", MRnumber = "81g:68069", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Russell:1980:CCP, author = "Bruce Russell", title = "Correctness of the Compiling Process Based on Axiomatic Semantics", journal = j-ACTA-INFO, volume = "14", number = "1", pages = "1--20", month = jun, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B05 (68C01)", MRnumber = "81f:68017", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Lamport:1980:HLC, author = "Leslie Lamport", title = "The ``{Hoare} Logic'' of Concurrent Programs", journal = j-ACTA-INFO, volume = "14", number = "1", pages = "21--37", month = jun, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (68C01)", MRnumber = "81f:68024", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.2.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; MathSciNet database", acknowledgement = ack-nhfb, enteredby = "Glenn S Benson (benson@dove)", keywords = "concurrent programs; Hoare logic", timestamp = "6-Apr-89, 3:22pm", } @Article{Plateau:1980:EPA, author = "Brigitte Plateau", title = "Evaluation des Performances d'un Algorithme de Contr{\^o}le de la Coh{\'e}rence d'une Base de Donn{\'e}es {R}{\'e}partie. ({French}) [{Performance} Evaluation of a Concurrency Control Algorithm for a Distributed Database]", journal = j-ACTA-INFO, volume = "14", number = "1", pages = "39--62", month = jun, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ellis:1980:CSI, author = "Carla Schlatter Ellis", title = "Concurrent Search and Insertion in $2$-$3$ Trees", journal = j-ACTA-INFO, volume = "14", number = "1", pages = "63--86", month = jun, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68E05)", MRnumber = "81f:68028", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Philipp:1980:SPG, author = "Reiner Philipp and Ernst-J{\"u}rgen Prau{\ss}", title = "{{\"U}ber Separatoren in planaren Graphen}. ({German}) [Separators in Planar Graphs]", journal = j-ACTA-INFO, volume = "14", number = "1", pages = "87--106", month = jun, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "05C40 (05C10 68E10)", MRnumber = "82a:05062", MRreviewer = "A. K. Dewdney", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bromley:1980:MFB, author = "Allan G. Bromley", title = "Memory Fragmentation in Buddy Methods for Dynamic Storage Allocation", journal = j-ACTA-INFO, volume = "14", number = "2", pages = "107--117", month = aug, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/gc.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Heaps.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Vaishnavi:1980:OMS, author = "Vijay K. Vaishnavi and Hans-Peter Kriegel and D. Wood", title = "Optimum Multiway Search Trees", journal = j-ACTA-INFO, volume = "14", number = "2", pages = "119--133", month = aug, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05 (68C25)", MRnumber = "81g:68088", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nakajima:1980:HPS, author = "Reiji Nakajima and Michio Honda and Hayao Nakahara", title = "Hierarchical Program Specification and Verification --- a Many-sorted Logical Approach", journal = j-ACTA-INFO, volume = "14", number = "2", pages = "135--155", month = aug, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib", annote = "IOTA allows one to build theories and write the implementations. Validation of data and procedural abstractions. Generalization of type parameterization. 22 references.", } @Article{Soisalon-Soininen:1980:SOE, author = "Eljas Soisalon-Soininen", title = "On the Space Optimizing Effect of Eliminating Single Productions from {$LR$} Parsers", journal = j-ACTA-INFO, volume = "14", number = "2", pages = "157--174", month = aug, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "81f:68098", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wegner:1980:PTL, author = "Lutz Michael Wegner", title = "On Parsing Two-Level Grammars", journal = j-ACTA-INFO, volume = "14", number = "2", pages = "175--193", month = aug, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "81f:68099", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "grammar; two level; van wijngaarden; vanwijngaarden", } @Article{Casanova:1980:GPS, author = "Marco A. Casanova and Philip A. Bernstein", title = "General Purpose Schedulers for Database Systems", journal = j-ACTA-INFO, volume = "14", number = "3", pages = "195--220", month = sep, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C15 (68B15)", MRnumber = "81j:68046", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See erratum \cite{Casanova:1981:EGP}.", acknowledgement = ack-nhfb, } @Article{Galil:1980:AMF, author = "Zvi Galil", title = "An {$O(V^{5/3} E^{2/3})$} Algorithm for the Maximal Flow Problem", journal = j-ACTA-INFO, volume = "14", number = "3", pages = "221--242", month = sep, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "90B10 (68C25)", MRnumber = "81i:90073", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/netflow.bib; MathSciNet database", note = "Preliminary version in Proc. 19th FOCS, pages 231--245, 1978.", acknowledgement = ack-nhfb, } @Article{Paul:1980:A, author = "Wolfgang J. Paul and Ernst J. Prau{\ss} and R{\"u}diger Reischuk", title = "On Alternation", journal = j-ACTA-INFO, volume = "14", number = "3", pages = "243--255", month = sep, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C40 (03D10)", MRnumber = "82e:68048a", MRreviewer = "Ryszard Janicki", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Commentz-Walter:1980:SDT, author = "Beate Commentz-Walter and J{\"u}rgen Sattler", title = "Size-depth Tradeoff in Non-monotone {Boolean} Formulae", journal = j-ACTA-INFO, volume = "14", number = "3", pages = "257--269", month = sep, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C10 (03D15 03G05 68C25)", MRnumber = "82g:94026", MRreviewer = "A. Massarotti", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nijholt:1980:SNF, author = "Anton Nijholt", title = "A Survey of Normal Form Covers for Context Free Grammars", journal = j-ACTA-INFO, volume = "14", number = "3", pages = "271--294", month = sep, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "82e:68082", MRreviewer = "J.-M. Autebert", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kemp:1980:NDI, author = "R. Kemp", title = "A Note on the Density of Inherently Ambiguous Context-free Languages", journal = j-ACTA-INFO, volume = "14", number = "3", pages = "295--298", month = sep, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "82a:68143", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Purdom:1980:SRL, author = "Paul Walton {Purdom, Jr.} and Cynthia A. Brown", title = "Semantic Routines and {{\em LR($k$)}} Parsers", journal = j-ACTA-INFO, volume = "14", number = "4", pages = "299--315", month = oct, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "81m:68064", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Moll:1980:LCP, author = "Karl-Rudolf R. Moll", title = "Left Context Precedence Grammars", journal = j-ACTA-INFO, volume = "14", number = "4", pages = "317--335", month = oct, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (03D05 68F25)", MRnumber = "82j:68079", MRreviewer = "Mark Benard", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wand:1980:FOI, author = "Mitchell Wand", title = "First-Order Identities as a Defining Language", journal = j-ACTA-INFO, volume = "14", number = "4", pages = "337--357", month = oct, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "81m:68024", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/W/WandM.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/algebraic.spec.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; MathSciNet database", note = "Originally Report 29, Computer Science Department, Indiana University, 1977", acknowledgement = ack-nhfb, keywords = "denotational operational semantics logic algebra first-order", } @Article{Nishimura:1980:DCP, author = "Hirokazu Nishimura", title = "Descriptively Complete Process Logic", journal = j-ACTA-INFO, volume = "14", number = "4", pages = "359--369", month = oct, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03B45)", MRnumber = "82b:68012", MRreviewer = "R. Parikh", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/logic.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kroger:1980:IPR, author = "Fred Kr{\"o}ger", title = "Infinite Proof Rules for Loops", journal = j-ACTA-INFO, volume = "14", number = "4", pages = "371--389", month = oct, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03F07)", MRnumber = "82d:68011", MRreviewer = "Henner Kr{\"o}ger", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Paul:1980:AIG, author = "Wolfgang J. Paul and R{\"u}diger Reischuk", title = "On Alternation {II}. {A} Graph Theoretic Approach to Determinism Versus Nondeterminism", journal = j-ACTA-INFO, volume = "14", number = "4", pages = "391--403", month = oct, year = "1980", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C40 (03D10)", MRnumber = "82e:68048b", MRreviewer = "Ryszard Janicki", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bauer:1981:KS, author = "Friedrich L. Bauer and Andrei P. Ershov and M. Paul and Alan J. Perlis", title = "{Klaus Samelson}", journal = j-ACTA-INFO, volume = "15", number = "1", pages = "1--2", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "01A70", MRnumber = "81k:01025", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wright:1981:BST, author = "William E. Wright", title = "Binary Search Trees in Secondary Memory", journal = j-ACTA-INFO, volume = "15", number = "1", pages = "3--17", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (68B15)", MRnumber = "81k:68049", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Boxma:1981:AAE, author = "Onno J. Boxma and Alan G. Konheim", title = "Approximate Analysis of Exponential Queueing Systems with Blocking", journal = j-ACTA-INFO, volume = "15", number = "1", pages = "19--66", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "90B22 (60K25)", MRnumber = "81m:90052", MRreviewer = "Ralph L. Disney", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, date = "12/12/84", descriptors = "Queueing system; Queueing network; blocking", enum = "373", language = "English", location = "TUDD-IfN-TK: Li-Ord.Le", references = "0", revision = "21/04/91", } @Article{Baccelli:1981:ASF, author = "Fran{\c{c}}ois Baccelli", title = "Analysis of a Service Facility with Periodic Checkpointing", journal = j-ACTA-INFO, volume = "15", number = "1", pages = "67--81", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "90B25 (68A05)", MRnumber = "82c:90040", MRreviewer = "Erol Gelenbe", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Berry:1981:RRD, author = "Daniel M. Berry", title = "Remarks on {R. D. Tennent}'s {{\em Language Design Methods Based on Semantic Principles: {Algol 68}, {A} Language Designed Using Semantic Principles}}", journal = j-ACTA-INFO, volume = "15", number = "1", pages = "83--98", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See \cite{Tennent:1977:LDM}.", } @Article{Purdom:1981:BML, author = "Paul Walton {Purdom, Jr.} and Cynthia A. Brown and Edward L. Robertson", title = "Backtracking with Multi-Level Dynamic Search Rearrangement", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "99--113", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05", MRnumber = "81m:68049", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/LogicProgramming/constr.logic.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Purdom:1981:PEL, author = "Paul Walton {Purdom, Jr.} and Cynthia A. Brown", title = "Parsing Extended {{\em LR($k$)}} Grammars", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "115--127", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "81m:68065", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kuich:1981:CPU, author = "Werner Kuich", title = "The Characterization of Parallel Ultralinear Grammars by Rational Power Series", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "129--139", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "81m:68059", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kou:1981:FAS, author = "L. Kou and George Markowsky and Leonard Berman", title = "A Fast Algorithm for {Steiner} Trees", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "141--145", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (05C05 68E10)", MRnumber = "83a:68052", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/Steiner.bib; MathSciNet database", abstract = "From (Prabhu Manyem, 2/'95)", acknowledgement = ack-nhfb, keywords = "algorithm; computing; CS; CSci; Steiner; tree", } @Article{Wegener:1981:ICH, author = "Ingo Wegener", title = "An Improved Complexity Hierarchy on the Depth of {Boolean} Functions", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "147--152", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C10", MRnumber = "82i:94036", MRreviewer = "Jean-Marie Laborde", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rodriguez:1981:IFC, author = "F. Rodriguez", title = "Ind{\'e}pendance Forte de Certaines Op{\'e}rations. ({French}) [{Strong} Independence of Certain Operations]", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "153--166", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "83g:68111", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Reisch:1981:HPV, author = "Stefan Reisch", title = "{Hex ist PSPACE-vollst{\"a}ndig}. ({German}) [{Hex} is {PSPACE}-Complete]", journal = j-ACTA-INFO, volume = "15", number = "2", pages = "167--191", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (90D05)", MRnumber = "83d:68043", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Moore:1981:ADT, author = "Daniel J. Moore and Bruce Russell", title = "Axiomatic Data Type Specifications: {A} First Order Theory of Linear Lists", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "193--207", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03B99)", MRnumber = "82j:68007", MRreviewer = "J. Paredaens", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Araki:1981:FLE, author = "Toshiro Araki and Nobuki Tokura", title = "Flow Languages Equal Recursively Enumerable Languages", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "209--217", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (03D05)", MRnumber = "82h:68099", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Apt:1981:RAP, author = "Krzysztof R. Apt", title = "Recursive Assertions and Parallel Programs", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "219--232", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03D80)", MRnumber = "82h:68009", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Back:1981:PTC, author = "R. J. R. Back", title = "Proving Total Correctness of Nondeterministic Programs in Infinitary Logic", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "233--249", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03C75)", MRnumber = "82h:68010", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Daduna:1981:DTR, author = "Hans Daduna and R. Schassberger", title = "A Discrete-Time Round-Robin Queue with {Bernoulli} Input and General Arithmetic Service Time Distributions", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "251--263", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68C15 90B22)", MRnumber = "82j:60170", MRreviewer = "Carl M. Harris", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "We present a discrete-time round-robin queue with a last-in-first-served rule: a newly arriving job receives a quantum of service immediately and only thereafter joins the tail of the queue. For Bernoulli input and general arithmetic service times we compute steady-state probabilities and mean response times.", date = "12/09/84", descriptors = "Round robin; FIFO; simulation; queueing system; discrete time process; binomial distribution; service time; LIFO; response time; geometric distribution; workload", enum = "694", language = "English", location = "RWTH-AC-DFV: BIBLIOTHEK", references = "11", revision = "15/02/92", } @Article{Kemp:1981:LGG, author = "R. Kemp", title = "{{\em LR($0$)}} Grammars Generated by {{\em LR($0$)}} Parsers", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "265--280", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "82h:68113", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Levin:1981:PTC, author = "Gary Marc Levin and David Gries", title = "A Proof Technique for Communicating Sequential Processes", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "281--302", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (94A05)", MRnumber = "82h:68013", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.2.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/security.bib; MathSciNet database", acknowledgement = ack-nhfb, enteredby = "Glenn S Benson (benson@dove)", timestamp = "6-Apr-89, 3:20pm", } @Article{Anderaa:1981:EHN, author = "Stal O. Anderaa and Egon B{\"o}rger", title = "The Equivalence of {Horn} and Network Complexity for {Boolean} Functions", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "303--307", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D15 (03G05 68C25 94C10)", MRnumber = "83b:03048a", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mayr:1981:PVR, author = "Ernst W. Mayr", title = "Persistence of Vector Replacement Systems is Decidable", journal = j-ACTA-INFO, volume = "15", number = "3", pages = "309--318", month = jun, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68D90", MRnumber = "82f:68060", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Booth:1981:CEA, author = "Kellogg S. Booth and Richard J. Lipton", title = "Computing Extremal and Approximate Distances in Graphs Having Unit Cost Edges", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "319--328", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (05C38)", MRnumber = "82k:68033", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Lipski:1981:EAF, author = "Witold {Lipski, Jr.} and Franco P. Preparata", title = "Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "329--346", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (05C35 05C70 52-04 52A45 68C25)", MRnumber = "82m:68069", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Iglehart:1981:RSR, author = "Donald L. Iglehart and Gerald S. Shedler", title = "Regenerative Simulation of Response Times in Networks of Queues: Statistical Efficiency", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "347--363", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (62F25 68C15 68J05)", MRnumber = "84e:60138", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1981.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, date = "13/05/93", descriptors = "Simulation; statistical technique", enum = "7423", language = "English", location = "SEL: Wi", references = "0", revision = "16/01/94", } @Article{Cartwright:1981:LA, author = "Robert Cartwright and Derek C. Oppen", title = "The Logic of Aliasing", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "365--384", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03B99)", MRnumber = "83b:68007", MRreviewer = "Henry Africk", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{deBruin:1981:GSS, author = "Arie de Bruin", title = "Goto Statements: Semantics and Deduction Systems", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "385--424", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Wurges:1981:STB, author = "Harald W{\"u}rges", title = "A Specification Technique Based on Predicate Transformers", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "425--445", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "82i:68013", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Tokuda:1981:EUR, author = "Takehiro Tokuda", title = "Eliminating Unit Reductions from {{\em LR($k$)}} Parsers Using Minimum Contexts", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "447--470", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (68F05 68F25)", MRnumber = "82i:68012", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Casanova:1981:EGP, author = "Marco A. Casanova and Philip A. Bernstein", title = "Erratum: {{\em General Purpose Schedulers for Database System}}", journal = j-ACTA-INFO, volume = "15", number = "4", pages = "471--471", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C15 (68B15)", MRnumber = "82i:68023", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See \cite{Casanova:1980:GPS}.", acknowledgement = ack-nhfb, } @Article{Kedem:1981:CDG, author = "Zvi M. Kedem and Abraham Silberschatz", title = "A Characterization of Database Graphs Admitting a Simple Locking Protocol", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "1--13", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Clint:1981:UHV, author = "M. Clint", title = "On the Use of History Variables", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "15--30", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Hamlet:1981:RTP, author = "Richard G. Hamlet", title = "Reliability Theory of Program Testing", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "31--43", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Stadel:1981:BVI, author = "Manfred Stadel", title = "{Behandlung verschiedener INTEGER-Darstellungen durch optimierende Compiler}. ({German}) [Treatment of Various {INTEGER}-Representation by Optimizing Compiler]", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "45--56", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schassberger:1981:RTD, author = "R. Schassberger", title = "On the Response Time Distribution in a Discrete Round-Robin Queue", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "57--62", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68C15 90B22)", MRnumber = "82k:60200", MRreviewer = "Nasser Hadidi", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Janssens:1981:CCF, author = "Dirk Janssens and Grzegorz Rozenberg", title = "A Characterization of Context-Free String Languages by Directed Node Label Controlled Graph Grammars", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "63--85", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (05C99)", MRnumber = "82j:68075", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gragra.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/traces.bib; MathSciNet database", acknowledgement = ack-nhfb, added = "1996-03-13-10-09-20", } @Article{Pritchard:1981:ALL, author = "Paul Pritchard", title = "Another Look at the ``Longest Ascending Subsequence'' Problem", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "87--91", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "10L05 (10A40 68C05)", MRnumber = "84f:10073", MRreviewer = "R. F. Churchhouse", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Best:1981:FMA, author = "Eike Best and Brian Randell", title = "A Formal Model of Atomicity in Asynchronous Systems", journal = j-ACTA-INFO, volume = "16", number = "1", pages = "93--124", month = aug, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Ostrand:1981:PRG, author = "Thomas J. Ostrand and Marvin C. Paull and Elaine J. Weyuker", title = "Parsing Regular Grammars with Finite Lookahead", journal = j-ACTA-INFO, volume = "16", number = "2", pages = "125--138", month = oct, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "82j:68088", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Claus:1981:BEP, author = "Volker Claus", title = "The {$(n, k)$}-Bounded Emptiness-Problem for Probabilistic Acceptors and Related Problems", journal = j-ACTA-INFO, volume = "16", number = "2", pages = "139--160", month = oct, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68G20 (03D05)", MRnumber = "82j:68095", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Olderog:1981:SCH, author = "Ernst-R{\"u}diger Olderog", title = "Sound and Complete {Hoare}-like Calculi Based on Copy Rules", journal = j-ACTA-INFO, volume = "16", number = "2", pages = "161--197", month = oct, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "83c:68018", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Blikle:1981:CTI, author = "Andrzej Blikle", title = "The Clean Termination of Iterative Programs", journal = j-ACTA-INFO, volume = "16", number = "2", pages = "199--217", month = oct, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "83c:68015", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "25 references.", } @Article{Martin:1981:ADS, author = "Alain J. Martin", title = "An Axiomatic Definition of Synchronization Primitives", journal = j-ACTA-INFO, volume = "16", number = "2", pages = "219--235", month = oct, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Fenner:1981:ATR, author = "Trevor I. Fenner and George Loizou", title = "An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions", journal = j-ACTA-INFO, volume = "16", number = "2", pages = "237--252", month = oct, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (10-04 10A45)", MRnumber = "83b:68020", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ramanathan:1981:PAD, author = "Jayashree Ramanathan and Ken Kennedy", title = "Pathlistings Applied to Data Flow Analysis", journal = j-ACTA-INFO, volume = "16", number = "3", pages = "253--273", month = nov, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (05C20)", MRnumber = "83a:68013", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Engelfriet:1981:FPO, author = "Joost Engelfriet and Gilberto Fil{\`e}", title = "The Formal Power of One-Visit Attribute Grammars", journal = j-ACTA-INFO, volume = "16", number = "3", pages = "275--302", month = nov, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "83a:68088", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "sema", } @Article{Goldschlager:1981:PCF, author = "Leslie M. Goldschlager", title = "$\varepsilon$-productions in context-free grammars", journal = j-ACTA-INFO, volume = "16", number = "3", pages = "303--308", month = nov, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "83a:68089", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hennessy:1981:FDR, author = "John L. Hennessy and Richard B. Kieburtz", title = "The Formal Definition of a Real-Time Language", journal = j-ACTA-INFO, volume = "16", number = "3", pages = "309--345", month = nov, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Klingler:1981:GBA, author = "Thomas Klingler and Stefan Reisch", title = "A Gap Between the Actual Complexity of Permutations and Their Entropy Defined by {Sto{\ss}}", journal = j-ACTA-INFO, volume = "16", number = "3", pages = "347--362", month = nov, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (05A05 68B15)", MRnumber = "83g:68061", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See \cite{Stoss:1973:RP}.", acknowledgement = ack-nhfb, } @Article{Markowsky:1981:BHT, author = "George Markowsky", title = "Best {Huffman} Trees", journal = j-ACTA-INFO, volume = "16", number = "3", pages = "363--370", month = nov, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "05C05 (68C25 68E10)", MRnumber = "83m:05049", MRreviewer = "M. C. Golumbic", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Manna:1981:PFP, author = "Zohar Manna and Richard J. Waldinger", title = "Problematic Features of Programming Languages: {A} Situational-Calculus Approach", journal = j-ACTA-INFO, volume = "16", number = "4", pages = "371--426", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (68C01)", MRnumber = "84c:68008", MRreviewer = "M. R. Levy", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/state.functional.programming.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Alblas:1981:CAE, author = "Henk Alblas", title = "A Characterization of Attribute Evaluation in Passes", journal = j-ACTA-INFO, volume = "16", number = "4", pages = "427--464", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F20", MRnumber = "84e:68100", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See also: memorandum 315, Onderafdeling der Informatica, Tech. Hogeschool Twente (September 1980).", acknowledgement = ack-nhfb, keywords = "class eval", } @Article{Lengauer:1981:BWP, author = "Thomas Lengauer", title = "Black-White Pebbles and Graph Separation", journal = j-ACTA-INFO, volume = "16", number = "4", pages = "465--475", month = dec, year = "1981", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (05C20)", MRnumber = "83f:68041", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Gergely:1982:TIP, author = "T. Gergely and L. {\'U}ry", title = "A Theory of Interactive Programming", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "1--20", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "83g:68021", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Arnold:1982:SBP, author = "A. Arnold", title = "Synchronized Behaviours of Processes and Rational Relations", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "21--29", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20", MRnumber = "84h:68017", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Liu:1982:SST, author = "C. L. Liu and Jane W. S. Liu and Arthur L. Liestman", title = "Scheduling with Slack Time", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "31--41", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Shore:1982:ITA, author = "John E. Shore", title = "Information Theoretic Approximations for {M/G/1} und {G/G/1} Queuing Systems", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "43--61", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "90B22 (60K25 68J10)", MRnumber = "83f:90064", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "This paper presents new results concerning the use of information theoretic inference techniques in system modeling and concerning the widespread applicability of certain simple queuing theory formulas. For the case when an M/G/1 queue provides a reasonable system model but when information about the service time probability density is limited to knowledge of a few moments, entropy maximization and cross-entropy minimization are used to derive \ldots{}.", date = "12/03/84", descriptors = "M/G/1; G/G/1; information theory; queueing approximation", enum = "2896", language = "English", location = "RWTH-AC-DFV: TELL", references = "34", revision = "21/04/91", } @Article{Miyano:1982:HTM, author = "Satoru Miyano", title = "A Hierarchy Theorem for Multihead Stack-Counter Automata", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "63--67", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F10", MRnumber = "83g:68118", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rozenberg:1982:CEF, author = "Grzegorz Rozenberg and R. Verraedt", title = "Completeness of {EOL} Forms is Decidable", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "69--87", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (68C25)", MRnumber = "84h:68057", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Huynh:1982:RCI, author = "Thiet-Dung Huynh", title = "Remarks on the Complexity of an Invariant of Context-Free Grammars", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "89--99", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (20F10)", MRnumber = "83k:68072", MRreviewer = "A. A. Iskander", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Martinez:1982:PBP, author = "Michel Martinez", title = "Program Behavior Prediction and Prepaging", journal = j-ACTA-INFO, volume = "17", number = "1", pages = "101--120", month = apr, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Rabin:1982:CCP, author = "Michael O. Rabin", title = "The Choice Coordination Problem", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "121--134", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20", MRnumber = "83j:68031", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kessels:1982:ACM, author = "Joep L. W. Kessels", title = "Arbitration Without Common Modifiable Variables", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "135--141", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20", MRnumber = "83j:68029", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Vasudevan:1982:ILF, author = "Sridhar Vasudevan", title = "Inner Loops in Flowgraphs and Code Optimization", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "143--155", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "83i:68036", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Huddleston:1982:NDS, author = "Scott Huddleston and Kurt Mehlhorn", title = "A New Data Structure for Representing Sorted Lists", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "157--184", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05 (68B15)", MRnumber = "83j:68069", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Raiha:1982:TAG, author = "Kari-Jouko R{\"a}ih{\"a} and Mikko Saarinen", title = "Testing Attribute Grammars for Circularity", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "185--192", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "83i:68117", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "circ", } @Article{Autebert:1982:FLG, author = "Jean-Michel Autebert and Joffroy Beauquier and Luc Boasson", title = "Formes de langages et de grammaires. ({French}) [{Grammar} and language forms]", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "193--213", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "83j:68083", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Itai:1982:RG, author = "Alon Itai and Michael Rodeh", title = "Representation of Graphs", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "215--219", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (05C30 68C25)", MRnumber = "83j:68078", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Huwig:1982:MPP, author = "Hagen Huwig", title = "{Ein Modell des $P=NP$-Problems mit einer positiven L{\"o}sung}. ({German}) [{A} Model of the ${P}={NP}$ Problem with a Positive Solution]", journal = j-ACTA-INFO, volume = "17", number = "2", pages = "221--243", month = jun, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D15 (03G30 18B99 20M35 68C25)", MRnumber = "84f:03037", MRreviewer = "M. M. Richter", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Doberkat:1982:DRH, author = "Ernst-Erich Doberkat", title = "Deleting the Root of a Heap", journal = j-ACTA-INFO, volume = "17", number = "3", pages = "245--265", month = aug, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10", MRnumber = "83j:68075", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/heap.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Abstract. The average behavior of the familiar algorithm for root deletion is considered, when every heap has the same probability to occur. The analysis centers around the notion of a viable path in the tree representation, i.e. such a path the label which replaces the label of the root may be allowed to travel when the heap is reconstructed. In case the size of the heap is a power of 2 it is shown that both the expected number of comparisons and of interchanges are asymptotically equal to the respective numbers in the worst case.", refersto = "\cite{Aho$^+$74}, \cite{Doberkat80}, \cite{Doberkat81}, \cite{Doberkat82}, \cite{Knuth73}", } @Article{Overmars:1982:DMD, author = "Mark H. Overmars and Jan {van Leeuwen}", title = "Dynamic Multi-Dimensional Data Structures Based on Quad- and {$K$-$D$} Trees", journal = j-ACTA-INFO, volume = "17", number = "3", pages = "267--285", month = aug, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05 (68C25)", MRnumber = "83j:68070", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Intro.Algorithms.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Based on Quad- and k-d trees this ref via enews.", keywords = "datastructure; DS; pseudo-quad-tree; quad tree; quad-tree", } @Article{Baccelli:1982:PAE, author = "Fran{\c{c}}ois Baccelli and Thierry Fleury", title = "On Parsing Arithmetic Expressions in a Multiprocessing Environment", journal = j-ACTA-INFO, volume = "17", number = "3", pages = "287--310", month = aug, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "83j:68099", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Staphylopatis:1982:PCP, author = "A. Staphylopatis", title = "Performance Considerations in the Parallel Execution of Numerical Algorithms on two Processors", journal = j-ACTA-INFO, volume = "17", number = "3", pages = "311--325", month = aug, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C15", MRnumber = "83j:68042", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Snyder:1982:RSI, author = "Lawrence Snyder", title = "Recognition and Selection of Idioms for Code Optimization", journal = j-ACTA-INFO, volume = "17", number = "3", pages = "327--348", month = aug, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B05 (68C05)", MRnumber = "83j:68010", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Demers:1982:SDP, author = "A. Demers and C. Keleman and Bernd Reusch", title = "On Some Decidable Properties of Finite State Translations", journal = j-ACTA-INFO, volume = "17", number = "3", pages = "349--364", month = aug, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C30", MRnumber = "83k:68042", MRreviewer = "E. B. Kinber", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Cristian:1982:RDT, author = "Flaviu Cristian", title = "Robust Data Types", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "365--397", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15", MRnumber = "84a:68015", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/misc.1.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Leung:1982:EFL, author = "Clement H. C. Leung and Q. H. Choo", title = "The Effect of Fixed-Length Record Implementation on File System Response", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "399--409", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1982.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{JaJa:1982:SEA, author = "Joseph J{\'a}J{\'a} and Janos Simon", title = "Space Efficient Algorithms for Some Graph Theoretical Problems", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "411--423", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E10 (05C99)", MRnumber = "84a:68069", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Blum:1982:PCR, author = "Norbert Blum", title = "On the Power of Chain Rules in Context Free Grammars", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "425--433", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (03D05)", MRnumber = "84a:68075", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Soisalon-Soininen:1982:CRC, author = "Eljas Soisalon-Soininen and Derick Wood", title = "On a Covering Relation for Context-Free Grammars", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "435--449", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25 (68F20)", MRnumber = "84b:68115", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Asveld:1982:CTO, author = "Peter R. J. Asveld and J. V. Tucker", title = "Complexity theory and the operational structure of algebraic programming systems", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "451--476", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25", MRnumber = "84a:68034", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Pritchard:1982:EWS, author = "Paul Pritchard", title = "Explaining the Wheel Sieve", journal = j-ACTA-INFO, volume = "17", number = "4", pages = "477--485", month = oct, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "10A25 (10H32)", MRnumber = "84g:10015", MRreviewer = "M. C. Wunderlich", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Dewar:1982:SMA, author = "Robert B. K. Dewar and Susan M. Merritt and Micha Sharir", title = "Some Modified Algorithms for {Dijkstra}'s Longest Upsequence Problem", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "1--15", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (05A05 68E05)", MRnumber = "84b:68028", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ramirez:1982:ORP, author = "Ra{\'u}l J. Ram{\'\i}rez and Frank Wm. Tompa and J. Ian Munro", title = "Optimum Reorganization Points for Arbitrary Database Costs", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "17--30", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Budd:1982:TNC, author = "Timothy A. Budd and Dana Angluin", title = "Two Notions of Correctness and Their Relation to Testing", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "31--45", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68B10)", MRnumber = "84b:68013", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Broy:1982:PAT, author = "Manfred Broy and Martin Wirsing", title = "Partial Abstract Types", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "47--64", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "84b:68007", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/B/BroyM.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Studies hierarchical abstract types with conditional equations as formulas. Discussion of different kinds of homomorphisms, initial and weakly terminal models. Full abstraction. Specification of the semantics of programming languages. 41 references.", } @Article{Leguy:1982:LSC, author = "Jeannine Leguy", title = "Langages satur{\'e}s et cones d{\'e}croissants Langages et cones bifid{\`e}les. ({French}) [{Saturated} Languages and Decreasing Cones. Bifaithful Languages and Bifaithful Cones]", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "65--78", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "84b:68100", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Langmaack:1982:TPF, author = "Hans Langmaack", title = "On Termination Problems for Finitely Interpreted {ALGOL}-like Programs", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "79--108", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (03B70)", MRnumber = "85e:68059", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Frougny:1982:HGC, author = "Christiane Frougny and Jacques Sakarovitch and Erich Valkema", title = "On the {Hotz} Group of a Context-Free Grammar", journal = j-ACTA-INFO, volume = "18", number = "1", pages = "109--115", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (20F05 20M35)", MRnumber = "84d:68079", MRreviewer = "M. Kunze", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Reisig:1982:DBS, author = "Wolfgang Reisig", title = "Deterministic Buffer Synchronization of Sequential Processes", journal = j-ACTA-INFO, volume = "18", number = "2", pages = "117--134", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68D15 (68B20)", MRnumber = "84b:68058", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Carter:1982:FAC, author = "Lynn Robert Carter", title = "Further Analysis of Code Generation for a Single Register Machine", journal = j-ACTA-INFO, volume = "18", number = "2", pages = "135--147", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68D15 (68C25)", MRnumber = "84b:68057", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ernst:1982:VPP, author = "George W. Ernst and Jainendra K. Navlakha and William F. Ogden", title = "Verification of Programs with Procedure-Type Parameters", journal = j-ACTA-INFO, volume = "18", number = "2", pages = "149--169", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10", MRnumber = "84b:68008", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nakatsu:1982:LCS, author = "Narao Nakatsu and Yahiko Kambayashi and Shuzo Yajima", title = "A longest common subsequence algorithm suitable for similar text strings", journal = j-ACTA-INFO, volume = "18", number = "2", pages = "171--179", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05", MRnumber = "84c:68022", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", abstract = "draws diagrams back to front, fast for similar strings, Also see Hirschberg, and see Ukkonen '83.", acknowledgement = ack-nhfb, keywords = "LCS; LCSS; longest common subsequence; sequence; string; strings", } @Article{Pettorossi:1982:DVE, author = "Alberto Pettorossi and Rod M. Burstall", title = "Deriving Very Efficient Algorithms for Evaluating Linear Recurrence Relations Using the Program Transformation Technique", journal = j-ACTA-INFO, volume = "18", number = "2", pages = "181--206", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (10-04)", MRnumber = "84b:68032", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/is.bib; ftp://ftp.ira.uka.de/pub/bibliography/LogicProgramming/Constr.logic.prog.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Brown:1982:LBL, author = "Donna J. Brown and Brenda S. Baker and Howard P. Katseff", title = "Lower Bounds for On-Line Two-Dimensional Packing Algorithms", journal = j-ACTA-INFO, volume = "18", number = "2", pages = "207--225", month = nov, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (52-04 90B35)", MRnumber = "84i:68058", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/att.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/online.competitive.algorithms.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nicolas:1982:LII, author = "Jean-Marie M. Nicolas", title = "Logic For Improving Integrity Checking in Relational Data Bases", journal = j-ACTA-INFO, volume = "18", number = "3", pages = "227--253", month = dec, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68H05)", MRnumber = "84c:68012", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/nonmono.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1982.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Allen:1982:CON, author = "Brian Allen", title = "On the Costs of Optimal and Near-Optimal Binary Search Trees", journal = j-ACTA-INFO, volume = "18", number = "3", pages = "255--263", month = dec, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05 (05C05)", MRnumber = "84c:68048", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nielson:1982:DFD, author = "Flemming Nielson", title = "A Denotational Framework for Data Flow Analysis", journal = j-ACTA-INFO, volume = "18", number = "3", pages = "265--287", month = dec, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B05 (68B10 68F20)", MRnumber = "84h:68008", MRreviewer = "Siegmar Gerber", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/LogicProgramming/constr.logic.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "dataflow functional", } @Article{Anderson:1982:AII, author = "S. O. Anderson and R. C. Backhouse", title = "An Alternative Implementation of an Insertion-Only Recovery Technique", journal = j-ACTA-INFO, volume = "18", number = "3", pages = "289--298", month = dec, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F25", MRnumber = "84f:68068", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/sigplan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/A/AndersonSO.bib; ftp://ftp.math.utah.edu/pub/tex/bib/sigplan1980.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "algorithms; languages; performance; theory", review = "ACM CR 40746", subject = "D.2.5 Software, SOFTWARE ENGINEERING, Testing and Debugging, Error handling and recovery \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Parsing", } @Article{Winklmann:1982:CSPa, author = "Karl Winklmann", title = "On the complexity of some problems concerning the use of procedures. {I}", journal = j-ACTA-INFO, volume = "18", number = "3", pages = "299--318", month = dec, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25", MRnumber = "84d:68048a", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Agrawala:1982:ESG, author = "Ashok K. Agrawala and Satish K. Tripathi", title = "On an Exponential Server with General Cyclic Arrivals", journal = j-ACTA-INFO, volume = "18", number = "3", pages = "319--334", month = dec, year = "1982", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25", MRnumber = "84e:60132", MRreviewer = "Do Le Minh", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1982.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "A En/M/1 queue is defined as a single server queue with exponential sevice time and general cyclic arrival distributions of cycle length $n$. The waiting time distribution for such a queue is proved to be a sum of $n$ exponential terms; this is a generalization of G/M/1 queue results. Based on this a method for obtaining the steady-state waiting time distributions for En/M/1 queues is introduced. An example is presented to show an application.", country = "USA", date = "12/03/84", descriptors = "G/M/1; arrival process", enum = "41", language = "English", location = "RWTH-AC-DFV: TELL; UniS-IND: Rg", references = "13", revision = "19/03/92", } @Article{Culik:1983:SAV, author = "Karel {Culik II} and J. Gruska and Arto Salomaa", title = "Systolic Automata for {VLSI} on Balanced Trees", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "335--344", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F10 (68D20)", MRnumber = "84k:68048", MRreviewer = "William R. Edwards", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{vanLeeuwen:1983:SBS, author = "Jan {van Leeuwen} and Mark H. Overmars", title = "Stratified Balanced Search Trees", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "345--359", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05 (05C05)", MRnumber = "84b:68080", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Eriksen:1983:CAR, author = "Ole Eriksen and J{\o}rgen Staunstrup", title = "Concurrent Algorithms for Root Searching", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "361--376", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C05 (26-04 65H05 68C25)", MRnumber = "84b:68029", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Supowit:1983:CDT, author = "Kenneth J. Supowit and Edward M. Reingold", title = "The Complexity of Drawing Trees Nicely", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "377--392", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25 (05C05 68E10)", MRnumber = "84c:68033", bibdate = "Sat Oct 9 09:56:22 MDT 1999", note = "See corrigendum \cite{Akkerman:2004:CDT}.", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/graphics.1.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Typesetting/trees.bib; ftp://ftp.math.utah.edu/pub/tex/bib/trees.bib; MathSciNet database", abstract = "We investigate the complexity of producing aesthetically pleasing drawings of binary trees, drawings that are as narrow as possible. The notion of what is aesthetically pleasing is embodied in several constraints on the placement of nodes, relative to other nodes. Among the results we give are: (1) There is no obvious `principle of optimality' that can be applied, since globally narrow, aesthetic placements of trees may require wider than necessary subtrees. (2) A previously suggested heuristic can produce drawings on n-node trees that are theta(n) times as wide as necessary. (3) The problem can be reduced in polynomial time to linear programming; hence, if the coordinates assigned to the nodes are continuous variables, then the problem can be solved in polynomial time. (4) If the placement is restricted to the integral lattice then the problem is NP-hard, as is its approximation to within a factor of about 4 per cent.", acknowledgement = ack-nhfb, keywords = "display; draw; drawing; layout; plot; plotting; tree; trees", owner = "robyn", } @Article{Slutzki:1983:FSR, author = "Giora Slutzki", title = "Finite State Relational Programs", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "393--409", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B05 (68B10)", MRnumber = "84b:68006", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Winklmann:1983:CSP, author = "Karl Winklmann", title = "On the complexity of some problems concerning the use of procedures. {II}", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "411--430", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C25", MRnumber = "84d:68048b", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Banatre:1983:NDW, author = "Jean-Pierre Ban{\^a}tre and Patrice Frison and Patrice Quinton", title = "A Network for the Detection of Words in Continuous Speech", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "431--448", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68G10", MRnumber = "84b:68120", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nain:1983:PTE, author = "Philippe Nain", title = "Partage de t{\^a}ches entre [deux] processeurs homog{\`e}nes. ({French}) [{Task} Scheduling Between Two Homogeneous Processors]", journal = j-ACTA-INFO, volume = "18", number = "4", pages = "449--466", month = jan, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68C15", MRnumber = "84b:68036", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kung:1983:OTC, author = "H. T. Kung and Christos H. Papadimitriou", title = "An Optimality Theory of Concurrency Control for Databases", journal = j-ACTA-INFO, volume = "19", number = "1", pages = "1--11", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68H05)", MRnumber = "84f:68018", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1983.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "information vs concurrency.", } @Article{Tsuda:1983:TLTa, author = "Takao Tsuda and Takashi Sato", title = "Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. {Part I}. Transposition of Tabular Data Structures", journal = j-ACTA-INFO, volume = "19", number = "1", pages = "13--33", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15", MRnumber = "84f:68019", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1983.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kuspert:1983:SUB, author = "Klaus K{\"u}spert", title = "Storage Utilization in {$B^*$}-Trees with a Generalized Overflow Technique", journal = j-ACTA-INFO, volume = "19", number = "1", pages = "35--55", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68E05", MRnumber = "84f:68048", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Taylor:1983:CAS, author = "Richard N. Taylor", title = "Complexity of Analyzing the Synchronization Structure of Concurrent Programs", journal = j-ACTA-INFO, volume = "19", number = "1", pages = "57--84", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20 (68C25)", MRnumber = "84f:68022", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/debug_3.1.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.debug.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Iwama:1983:UPU, author = "Kazuo Iwama", title = "The Universe Problem for Unrestricted Flow Languages", journal = j-ACTA-INFO, volume = "19", number = "1", pages = "85--96", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05 (68D45 68F25)", MRnumber = "84f:68058", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bergstra:1983:SMS, author = "Jan A. Bergstra and J. Terlouw", title = "Standard Model Semantics for {DSL}. {A} Data Type Specification Language", journal = j-ACTA-INFO, volume = "19", number = "1", pages = "97--113", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B10 (03B15)", MRnumber = "84f:68010", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{File:1983:IRA, author = "Gilberto Fil{\'e}", title = "Interpretation and Reduction of Attribute Grammars", journal = j-ACTA-INFO, volume = "19", number = "2", pages = "115--150", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45", MRnumber = "85a:68089", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See also: memorandum 359, Onderafdeling der Informatica, Tech. Hogeschool Twente (1981).", acknowledgement = ack-nhfb, keywords = "tag", } @Article{Pfaff:1983:COI, author = "G{\"u}nther E. Pfaff", title = "The Construction of Operator Interfaces Based on Logical Input Devices", journal = j-ACTA-INFO, volume = "19", number = "2", pages = "151--166", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Tsuda:1983:TLTb, author = "Takao Tsuda and Akira Urano and Takashi Sato", title = "Transposition of Large Tabular Data Structures with Applications to Physical Database Organization. {Part II}. Applications to Physical Database Organization", journal = j-ACTA-INFO, volume = "19", number = "2", pages = "167--182", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schurfeld:1983:NLB, author = "Ute Sch{\"u}rfeld", title = "New Lower Bounds on the Formula Size of {Boolean} Functions", journal = j-ACTA-INFO, volume = "19", number = "2", pages = "183--194", month = apr, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "06E99 (94C10)", MRnumber = "84g:06023", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Queille:1983:FRP, author = "J.-P. P. Queille and Joseph Sifakis", title = "Fairness and Related Properties in Transition Systems: a Temporal Logic to deal with Fairness", journal = j-ACTA-INFO, volume = "19", number = "3", pages = "195--220", month = jul, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q90 (03B45 03B70)", MRnumber = "85e:68076", MRreviewer = "G. Memmi", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kearns:1983:IRC, author = "John P. Kearns and Mary Lou Soffa", title = "The Implementation of Retention in a Coroutine Environment", journal = j-ACTA-INFO, volume = "19", number = "3", pages = "221--233", month = jul, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20", MRnumber = "84i:68038", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "coroutine", } @Article{Engels:1983:OSS, author = "Gregor Engels and Udo Pletat and Hans-Dieter Ehrich", title = "An Operational Semantics for Specifications of Abstract Data Types with Error Handling", journal = j-ACTA-INFO, volume = "19", number = "3", pages = "235--253", month = jul, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q65 (68Q55)", MRnumber = "85a:68129", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nielson:1983:CSW, author = "Hanne Riis Nielson", title = "Computation Sequences: {A} Way to Characterize Classes of Attribute Grammars", journal = j-ACTA-INFO, volume = "19", number = "3", pages = "255--268", month = jul, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "85a:68105", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Typesetting/font.bib; ftp://ftp.math.utah.edu/pub/tex/bib/font.bib; MathSciNet database", note = "See also: report DAIMI PB-138, Computer Science Department, Aarhus University, {\AA}rhus, Denmark (1981).", abstract = "Caracterise les GAs ANC/FNC en terme de s{\'e}quences de calculs. L'id{\'e}e est d'avoir sur chaque NT un ensemble de partitions de ses attributs, totalement ordonn{\'e}es, repr{\'e}sentant les contextes sup{\'e}rieurs. On en d{\'e}duit des {\'e}valuateurs top-down d{\'e}terministes. Cf File (CAAP '86). Le probl{\`e}me est que ces {\'e}valuateurs peuvent avoir une taille exponentielle; en revanche, ils ne font aucun recalcul. (mj)", acknowledgement = ack-nhfb, keywords = "attribute grammar; class eval tag; classification", mynote = "Caracterise les GAs ANC/FNC en terme de s{\'e}quences de calculs. L'id{\'e}e est d'avoir sur chaque NT un ensemble de partitions de ses attributs, totalement ordonn{\'e}es, repr{\'e}sentant les contextes sup{\'e}rieurs. On en d{\'e}duit des {\'e}valuateurs top-down d{\'e}terministes. Cf File (CAAP '86). Le probl{\`e}me est que ces {\'e}valuateurs peuvent avoir une taille exponentielle; en revanche, ils ne font aucun recalcul. (mj)", } @Article{MeyeraufderHeide:1983:EUP, author = "Friedhelm {Meyer auf der Heide}", title = "Efficiency of Universal Parallel Computers", journal = j-ACTA-INFO, volume = "19", number = "3", pages = "269--296", month = jul, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Schmitt:1983:NRO, author = "Alfred Schmitt", title = "On the Number of Relational Operators Necessary to Compute Certain Functions of Real Variables", journal = j-ACTA-INFO, volume = "19", number = "3", pages = "297--304", month = jul, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q25 (03D15 68P10)", MRnumber = "85e:68032", MRreviewer = "Joseph Ja'Ja'", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Vardi:1983:IMD, author = "Moshe Y. Vardi", title = "Inferring Multivalued Dependencies From Functional and Join Dependencies", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "305--324", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15 (68C05 68H05)", MRnumber = "84k:68019", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/1983.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Suzuki:1983:TMS, author = "Ichiro Suzuki and Tadao Kasami", title = "Three Measures for Synchronic Dependence in {Petri} Nets", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "325--338", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q90", MRnumber = "85a:68141", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{El-Affendi:1983:MEA, author = "M. A. El-Affendi and Demetres D. Kouvatsos", title = "A Maximum Entropy Analysis of the {M/G/1} and {G/M/1} Queueing Systems at Equilibrium", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "339--355", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68M20)", MRnumber = "85c:60154", MRreviewer = "D. C. McNickle", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ruohonen:1983:SVP, author = "Keijo Ruohonen", title = "On Some Variants of {Post}'s Correspondence Problem", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "357--367", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D03 (03D35 05A99 68Q20)", MRnumber = "85d:03082", MRreviewer = "Michael Anshel", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Agrawal:1983:EIL, author = "Rakesh Agrawal and Keith D. Detro", title = "An Efficient Incremental {{\em LR}} Parser for Grammars With Epsilon Productions", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "369--376", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N20 (68Q50)", MRnumber = "85c:68004", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hromkovic:1983:OWM, author = "Juraj Hromkovi{\v{c}}", title = "One-Way Multihead Deterministic Finite Automata", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "377--384", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F10", MRnumber = "84k:68049", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Klein:1983:LTB, author = "Peter Klein and Friedhelm {Meyer auf der Heide}", title = "A Lower Time Bound for the Knapsack Problem on Random Access Machines", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "385--395", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q25 (68Q05 90C10)", MRnumber = "85d:68034", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Sommerhalder:1983:PLR, author = "R. Sommerhalder and S. C. {van Westrhenen}", title = "Parallel Language Recognition in Constant Time by Cellular Automata", journal = j-ACTA-INFO, volume = "19", number = "4", pages = "397--407", month = sep, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45 (68Q80)", MRnumber = "85a:68097", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wirsing:1983:HAD, author = "Martin Wirsing and Peter Pepper and Helmut Partsch and Walter Dosch and Manfred Broy", title = "On hierarchies of abstract data types", journal = j-ACTA-INFO, volume = "20", number = "1", pages = "1--33", month = oct, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B15", MRnumber = "84i:68032", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/B/BroyM.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "43 references.", } @Article{He:1983:GPT, author = "Jifeng He", title = "General Predicate Transformer and the Semantics of a Programming Language With Go To Statement", journal = j-ACTA-INFO, volume = "20", number = "1", pages = "35--57", month = oct, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F20 (68B10)", MRnumber = "84i:68142", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Damm:1983:SRH, author = "Werner Damm and Bernhard Josko", title = "A Sound and Relatively $^*$Complete {Hoare}-Logic for a Language With Higher Type Procedures", journal = j-ACTA-INFO, volume = "20", number = "1", pages = "59--101", month = oct, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (03B70)", MRnumber = "85c:68048", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Chandra:1983:SBV, author = "Ashok K. Chandra and Lawrence T. Kou and George Markowsky and Shmuel Zaks", title = "On sets of {Boolean} $n$-vectors with all $k$-projections surjective", journal = j-ACTA-INFO, volume = "20", number = "1", pages = "103--111", month = oct, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C10", MRnumber = "84j:94040", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kameda:1983:NMQ, author = "Hisao Kameda", title = "A Note on Multi-queue Scheduling of Two Tasks", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "113--120", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68B20 (68C15)", MRnumber = "84m:68019", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Akdag:1983:PAC, author = "Herman Akdag", title = "Performances of an Algorithm Constructing a Nearly Optimal Binary Tree", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "121--132", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05", MRnumber = "85b:68006", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bucher:1983:TSS, author = "W. Bucher", title = "Two-Symbol {DOS} Systems Generating Regular Languages", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "133--142", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68F05", MRnumber = "84m:68060", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mannila:1983:RMO, author = "Heikki Mannila and Kari-Jouko R{\"a}ih{\"a}", title = "On the Relationship of Minimum and Optimum Covers for a Set of Functional Dependencies", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "143--158", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15 (68Q25)", MRnumber = "86a:68019", MRreviewer = "Witold Lipski", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold/Unknown.year.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Coppo:1983:SP, author = "Mario Coppo", title = "On the Semantics of Polymorphism", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "159--170", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03B40 (68Q55)", MRnumber = "85k:03008", MRreviewer = "R. Hindley", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/prog.lang.theory.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Semantic characterization of terms which can be assigned a type. 16 references.", keywords = "check; checking; computing; CSci; datatype; lattice; model; polymorphic; polymorphism; theory; type", } @Article{Goodman:1983:NCP, author = "Nathan Goodman and Oded Shmueli", title = "{NP}-complete Problems Simplified on Tree Schemas", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "171--178", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15 (05C65 68R10)", MRnumber = "85b:68012", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Pansiot:1983:HFC, author = "Jean-Jacques Pansiot", title = "Hi{\'e}rarchie et fermeture de certaines classes de tag-syst{\`e}mes. ({French}) [{Hierarchy} and Closure Properties of Certain Classes of Tag-Systems]", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "179--196", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45 (03D03 68Q80)", MRnumber = "85j:68062", MRreviewer = "A. Salomaa", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ronse:1983:TSC, author = "Christian Ronse", title = "A Three-Stage Construction for Multiconnection Networks", journal = j-ACTA-INFO, volume = "20", number = "2", pages = "197--206", month = nov, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C05 (94B10)", MRnumber = "84m:94037", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1983.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, date = "19/02/88", descriptors = "Switching network", enum = "2593", language = "English", location = "PKI-OEG: Li.Fach JT", references = "4", revision = "21/04/91", } @Article{Ben-Ari:1983:TLB, author = "Mordechai Ben-Ari and Amir Pnueli and Zohar Manna", title = "The Temporal Logic of Branching Time", journal = j-ACTA-INFO, volume = "20", number = "3", pages = "207--226", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03B45 (68N05)", MRnumber = "85a:03021", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Simon:1983:PMT, author = "Hans-Ulrich U. Simon", title = "Pattern Matching in Trees and Nets", journal = j-ACTA-INFO, volume = "20", number = "3", institution = "U Saarlandes", pages = "227--248", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45", MRnumber = "85a:68096", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1984.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "image multiplicity comparison", } @Article{Marque-Pucheu:1983:RST, author = "G. Marque-Pucheu", title = "Rational Set of Trees and The Algebraic Semantics of Logic Programming", journal = j-ACTA-INFO, volume = "20", number = "3", pages = "249--260", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55", MRnumber = "85a:68114", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/LogicProgramming/log.prog.85.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", abstract = "This paper presents a new semantics for logic programming (algebraic semantics), which defines the computation of a logic program as the solution of a system of tree equations. These equations are solved for a particular class of logic programs and the solutions of these equations are shown to be rational sets of trees.", acknowledgement = ack-nhfb, keywords = "programming theory", } @Article{Bannister:1983:TAF, author = "Joseph A. Bannister and Kishor S. Trivedi", title = "Task Allocation in Fault-Tolerant Distributed Systems", journal = j-ACTA-INFO, volume = "20", number = "3", pages = "261--281", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M20 (68N25)", MRnumber = "85a:68007", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib; MathSciNet database", acknowledgement = ack-nhfb, owner = "seufert", } @Article{Pohlmann:1983:LPA, author = "Werner Pohlmann", title = "{{\em LR}} Parsing for Affix Grammars", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "283--300", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "85a:68108", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "divers.affix", } @Article{Martin:1983:GPR, author = "Alain J. Martin", title = "A General Proof Rule for Procedures in Predicate Transformer Semantics", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "301--313", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68Q60)", MRnumber = "85a:68115", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mili:1983:RAD, author = "Ali Mili", title = "A Relational Approach to the Design of Deterministic Programs", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "315--328", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (68N05)", MRnumber = "85a:68123", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Francez:1983:PPT, author = "Nissim Francez", title = "Product Properties and Their Direct Verification", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "329--344", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (68Q55)", MRnumber = "85a:68118", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Flajolet:1983:PEE, author = "Philippe Flajolet", title = "On the Performance Evaluation of Extendible Hashing and Trie Searching", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "345--369", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68P10)", MRnumber = "85a:68022", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/hash.bib; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; MathSciNet database", abstract = "A class of trees occurs both in digital searching and in schemes for maintaining dynamic has tables. The author studies the distribution of height in these trees using the saddle point method of complex analysis. As a result, a precise evaluation is derived of the memory requirements of extendible hashing --- a dynamic hashing scheme --- and some related implementation issues is discussed.", acknowledgement = ack-nhfb, classification = "723", journalabr = "Acta Inf", keywords = "computer programming; extendible hashing; trie searching", } @Article{Fraenkel:1983:TCP, author = "Aviezri S. Fraenkel and Moshe Mor and Y. Perl", title = "Is Text Compression by Prefixes and Suffixes Practical?", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "371--389", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68U15 (94A29)", MRnumber = "85c:68084", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kleijn:1983:GPR, author = "H. C. M. Kleijn and Grzegorz Rozenberg", title = "On the Generative Power of Regular Pattern Grammars", journal = j-ACTA-INFO, volume = "20", number = "4", pages = "391--411", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "85a:68100", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/fernau.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bayer:1984:DMS, author = "Rudolf Bayer and Peter Schlichtiger", title = "Data Management Support for Database Management", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "1--28", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Chapman:1984:LPG, author = "N. P. Chapman", title = "{{\em LALR($1,1$)}} Parser Generation for Regular Right Part Grammars", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "29--45", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "85e:68047", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Szwarcfiter:1984:OMS, author = "Jayme Luiz Szwarcfiter", title = "Optimal Multiway Search Trees for Variable Size Keys", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "47--60", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P10", MRnumber = "85e:68011", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hennessy:1984:AFD, author = "Matthew Hennessy", title = "Axiomatising Finite Delay Operators", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "61--88", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10 (03B70 68Q55)", MRnumber = "85k:68032", MRreviewer = "Ir{\`e}ne Guessarian", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "pcalc ccs", } @Article{Best:1984:FCS, author = "Eike Best and Klaus Voss", title = "Free Choice Systems Have Home States", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "89--100", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q90", MRnumber = "85k:68071", MRreviewer = "Ryszard Janicki", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Tsakalidis:1984:MOG, author = "Athanasios K. Tsakalidis", title = "Maintaining Order in a Generalized Linked List", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "101--112", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05", MRnumber = "85e:68009", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Huang:1984:GBS, author = "Shou Hsuan Stephen Huang and C. K. Wong", title = "Generalized Binary Split Trees", journal = j-ACTA-INFO, volume = "21", number = "1", pages = "113--123", month = may, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P10", MRnumber = "85e:68010", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Lubachevsky:1984:AAV, author = "Boris D. Lubachevsky", title = "An Approach to Automating the Verification of Compact Parallel Coordination Programs: Part 1", journal = j-ACTA-INFO, volume = "21", number = "2", pages = "125--169", month = aug, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60", MRnumber = "86h:68121", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/att.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "Part II: Technical Report No. 64, February (1983), Courant Institute of Mathematical Sciences, New York University", acknowledgement = ack-nhfb, } @Article{Blum:1984:CAO, author = "Norbert Blum and Martin Seysen", title = "Characterization of all Optimal Networks for a Simultaneous Computation of {AND} and {NOR}", journal = j-ACTA-INFO, volume = "21", number = "2", pages = "171--181", month = aug, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "94C05", MRnumber = "85m:94039", MRreviewer = "Claude Benzaken", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Gillett:1984:BTE, author = "Will D. Gillett", title = "On Binary Tree Encodements", journal = j-ACTA-INFO, volume = "21", number = "2", pages = "183--192", month = aug, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (05C05 94C10)", MRnumber = "86h:68017", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ibarra:1984:CSB, author = "Oscar H. Ibarra and Sam M. Kim", title = "A Characterization of Systolic Binary Tree Automata and Applications", journal = j-ACTA-INFO, volume = "21", number = "2", institution = "U Minn", pages = "193--207", month = aug, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q05 (03D05)", MRnumber = "86k:68015", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1984.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "language mathematics", } @Article{Autebert:1984:BLA, author = "Jean-Michel Autebert and Joffroy Beauquier and Luc Boasson and Fran{\c{c}}oise Gire", title = "Bicentres de langages alg{\'e}briques. ({French}) [{Bicenters} of Context-Free Languages]", journal = j-ACTA-INFO, volume = "21", number = "2", pages = "209--227", month = aug, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45", MRnumber = "86m:68074", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Devroye:1984:PAH, author = "Luc Devroye", title = "A Probabilistic Analysis of the Height of Tries and of the Complexity of Triesort", journal = j-ACTA-INFO, volume = "21", number = "3", pages = "229--237", month = oct, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P10", MRnumber = "86g:68020", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bird:1984:UCP, author = "R. S. Bird", title = "Using Circular Programs to Eliminate Multiple Traversals of Data", journal = j-ACTA-INFO, volume = "21", number = "3", pages = "239--250", month = oct, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/RISC.parlab.bib", note = "(LA has)", abstract = "This paper describes a technique for transforming functional programs that repeatedly traverse a data structure into more efficient alternatives that do not. The transformation makes essential use of lazy evaluation and local recursion (such as provided by letrec, or its equivalent) to build a circular program that, on one pass over the structure, determines the effects of the individual traversals and the combines them.", descr = "plfun,pa-lazy,pttra", keywords = "FP; functional programming; functional recursion; lazy evaluation; need; recursion; recursive", owner = "pcl", } @Article{Barringer:1984:LCU, author = "H. Barringer and J. H. Cheng and Cliff B. Jones", title = "A Logic Covering Undefinedness in Program Proofs", journal = j-ACTA-INFO, volume = "21", number = "3", pages = "251--269", month = oct, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (03B70 68N05)", MRnumber = "86g:68119", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/deduction.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Axiomatization and examples. 33 references.", checked = "10 September 1993", keywords = "Non-Termination; Partial Functions; Three-Valued Logic", } @Article{Guting:1984:ODC, author = "Ralf Hartmut G{\"u}ting", title = "Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles", journal = j-ACTA-INFO, volume = "21", number = "3", institution = "U Dortmund", pages = "271--291", month = oct, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68U05", MRnumber = "86g:68149", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1984.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "image part form", } @Article{Bergstra:1984:ASP, author = "Jan A. Bergstra and J. V. Tucker", title = "The Axiomatic Semantics of Programs Based on {Hoare}'s Logic", journal = j-ACTA-INFO, volume = "21", number = "3", pages = "293--320", month = oct, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (03B70)", MRnumber = "86g:68105", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Iglehart:1984:SOA, author = "Donald L. Iglehart and Gerald S. Shedler", title = "Simulation Output Analysis for Local Area Computer Networks", journal = j-ACTA-INFO, volume = "21", number = "4", pages = "321--338", month = nov, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M20 (60K20 68U20)", MRnumber = "86g:68011", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mehlhorn:1984:RDS, author = "Kurt Mehlhorn and Uzi Vishkin", title = "Randomized and Deterministic Simulations of {PRAMs} by Parallel Machines with Restricted Granularity of Parallel Memories", journal = j-ACTA-INFO, volume = "21", number = "4", pages = "339--374", month = nov, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10", MRnumber = "86h:68049", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Par.Arch.Indep.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Deransart:1984:SCT, author = "Pierre Deransart and Martin Jourdan and Bernard Lorho", title = "Speeding up Circularity Tests for Attribute Grammars", journal = j-ACTA-INFO, volume = "21", number = "4", pages = "375--391", month = nov, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "86d:68039", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See also: rapport RR 211, INRIA, Rocquencourt (May 1983).", acknowledgement = ack-nhfb, keywords = "circ", } @Article{Choffrut:1984:RTC, author = "Christian Choffrut and Karel {Culik II}", title = "On Real-Time Cellular Automata and Trellis Automata", journal = j-ACTA-INFO, volume = "21", number = "4", institution = "U Paris/U Waterloo", pages = "393--407", month = nov, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q80 (03D05)", MRnumber = "86g:68127", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1984.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/cellular.automata.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/picture.languages.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "LANGUAGE; MATHEMATICS", } @Article{Coffman:1984:PGG, author = "Edward G. {Coffman, Jr.} and Michael A. Langston", title = "A Performance Guarantee for the Greedy Set-Partitioning Algorithm", journal = j-ACTA-INFO, volume = "21", number = "4", pages = "409--415", month = nov, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68R05 (05A17 68Q25)", MRnumber = "86g:68138", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Costa:1984:FCC, author = "Gerardo Costa and Colin Stirling", title = "A Fair Calculus of Communicating Systems", journal = j-ACTA-INFO, volume = "21", number = "5", pages = "417--441", month = dec, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10", MRnumber = "86g:68048", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/RISC.parlab.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, descr = "ptsem", keywords = "pcalc ccs fairness READ", owner = "pcl", } @Article{Sannella:1984:STS, author = "D. T. Sannella", title = "A Set--Theoretic Semantics for {CLEAR}", journal = j-ACTA-INFO, volume = "21", number = "5", pages = "443--472", month = dec, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (03B70)", MRnumber = "86e:68070", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/math.prog.construction.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bulyonkov:1984:PMC, author = "Mikhail A. Bulyonkov", title = "Polyvariant Mixed Computation for Analyzer Programs", journal = j-ACTA-INFO, volume = "21", number = "5", pages = "473--484", month = dec, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q99 (68N99)", MRnumber = "776 462", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/pennbib.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/partial-eval.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "An algorithm for mixed computation of low-level non-structured imperative programs is presented. The algorithm is shown to terminate and produce correct results when applied to the class of so-called analyzer programs, a definition of which is also given.", } @Article{Leung:1984:PDQ, author = "Clement H. C. Leung and Q. H. Choo", title = "The Paging Drum Queue: {A} Uniform Perspective and Further Results", journal = j-ACTA-INFO, volume = "21", number = "5", pages = "485--500", month = dec, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M20", MRnumber = "86e:68014", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hertel:1984:SSS, author = "Stefan Hertel and Martti M{\"a}ntyl{\"a} and Kurt Mehlhorn and J{\"u}rg Nievergelt", title = "Space Sweep Solves Intersection of Convex Polyhedra", journal = j-ACTA-INFO, volume = "21", number = "5", institution = "U Saarlandes/HUT/ETH", pages = "501--519", month = dec, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68U05 (52-04)", MRnumber = "87c:68072", MRreviewer = "David Avis", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib; ftp://ftp.ira.uka.de/pub/bibliography/Graphics/siggraph/1985.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "computational geometry; image part form; intersection testing; large dimensionality", } @Article{Bauer:1984:FCR, author = "G{\"u}nther Bauer and Friedrich Otto", title = "Finite Complete Rewriting Systems and the Complexity of the Word Problem", journal = j-ACTA-INFO, volume = "21", number = "5", pages = "521--540", month = dec, year = "1984", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D40 (03D15 68Q15)", MRnumber = "86m:03074", MRreviewer = "Philip W. Grant", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/kstokker.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/rewrite.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wright:1985:SAP, author = "William E. Wright", title = "Some average performance measures for the {$B$}-tree", journal = j-ACTA-INFO, volume = "21", number = "6", pages = "541--557", month = mar, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15", MRnumber = "86e:68027", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "access method database algorithm", } @Article{Fisher:1985:PLB, author = "A. J. Fisher", title = "Practical {{\em LL($1$)}}-Based Parsing of {van Wijngaarden} Grammars", journal = j-ACTA-INFO, volume = "21", number = "6", pages = "559--584", month = mar, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "86e:68063", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/transputer.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Chen:1985:DFR, author = "Marina C. Chen and Martin Rem", title = "Deadlock-Freedom in Resource Contentions", journal = j-ACTA-INFO, volume = "21", number = "6", pages = "585--598", month = mar, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N25", MRnumber = "86e:68019", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Berry:1985:DSS, author = "Daniel M. Berry", title = "A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism", journal = j-ACTA-INFO, volume = "21", number = "6", pages = "599--627", month = mar, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68Q10)", MRnumber = "86d:68044", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/RISC.parlab.bib; MathSciNet database", acknowledgement = ack-nhfb, descr = "ptsem", owner = "pcl", } @Article{Lenfant:1985:PDO, author = "Jacques Lenfant and Serge Tah{\'e}", title = "Permuting data with the {Omega} network", journal = j-ACTA-INFO, volume = "21", number = "6", pages = "629--641", month = mar, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M10", MRnumber = "86h:68011", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Valk:1985:RVS, author = "R{\"u}diger Valk and Matthias Jantzen", title = "The Residue of Vector Sets with Applications to Decidability Problems in {Petri} Nets", journal = j-ACTA-INFO, volume = "21", number = "6", pages = "643--674", month = mar, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q90", MRnumber = "86j:68100", MRreviewer = "Dorothy Bollman", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bechtold:1985:TSC, author = "Michael Bechtold and Guy Pujolle and Otto Spaniol", title = "Throughput of a Satellite Channel Communication", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "1--14", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Kingston:1985:ATA, author = "Jeffrey H. Kingston", title = "Analysis of Tree Algorithms for the Simulation Event List", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "15--33", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68U20", MRnumber = "789 843", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1985.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, date = "13/05/93", descriptors = "Simulation; event set", enum = "7502", language = "English", location = "SEL: Wi", references = "0", revision = "16/01/94", } @Article{Schneider:1985:TET, author = "Fred B. Schneider and Richard Conway and Dale Skeen", title = "Thrifty Execution of Task Pipelines", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "35--45", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15", MRnumber = "86i:68025", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mili:1985:SIF, author = "Ali Mili and Jules Desharnais and Jean-Raymond Gagn{\'e}", title = "Strongest Invariant Functions: Their Use in the Systematic Analysis of While Statements", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "47--66", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60", MRnumber = "87g:68050", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Jacobs:1985:GCU, author = "Dean Jacobs and David Gries", title = "General Correctness: {A} Unification of Partial and Total Correctness", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "67--83", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (68Q55)", MRnumber = "86i:68089", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ottmann:1985:PTU, author = "Thomas Ottmann and Michael Schrapp and Derick Wood", title = "Purely Top-Down Updating Algorithms for Stratified Search Trees", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "85--100", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P10", MRnumber = "86i:68018", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Loveland:1985:PBB, author = "Donald W. Loveland", title = "Performance Bounds for Binary Testing with Arbitrary Weights", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "101--114", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (68M15)", MRnumber = "86i:68048", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Monien:1985:RNA, author = "Burkhard Monien and Ewald Speckenmeyer", title = "{Ramsey} Numbers and an Approximation Algorithm for the Vertex Cover Problem", journal = j-ACTA-INFO, volume = "22", number = "1", pages = "115--123", month = apr, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "05C55 (05C35 05C70 68Q25)", MRnumber = "87b:05099", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/graph.coloring.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/interactive.proofs.bib; MathSciNet database", note = "NCPY", acknowledgement = ack-nhfb, keywords = "graph coloring", } @Article{Meghini:1985:QFR, author = "Carlo Meghini and Costantino Thanos", title = "Querying Fragmented Relations in a Distributed Database", journal = j-ACTA-INFO, volume = "22", number = "2", pages = "125--138", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Bruno:1985:STE, author = "John Bruno", title = "On Scheduling Tasks with Exponential Service Times and In-Tree Precedence Constraints", journal = j-ACTA-INFO, volume = "22", number = "2", pages = "139--148", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N25 (90B35)", MRnumber = "86m:68011", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Cunningham:1985:RSL, author = "R. J. Cunningham and A. J. J. Dick", title = "Rewrite Systems on a Lattice of Types", journal = j-ACTA-INFO, volume = "22", number = "2", pages = "149--169", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q65", MRnumber = "87c:68057", MRreviewer = "Laurent Kott", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/rewrite.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Sack:1985:AMH, author = "J{\"o}rg-R{\"u}diger Sack and Thomas Strothotte", title = "An Algorithm for Merging Heaps", journal = j-ACTA-INFO, volume = "22", number = "2", pages = "171--186", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P10", MRnumber = "86m:68021", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/heap.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Summary. We present an algorithm to merge priority queues organized as heaps. The worst case number of comparisons required to merge two heaps of sizes $k$ and $n$ is {$O(\log n \cdot \log k)$}. The algorithm requires {$O(k + \log n \cdot \log k)$} data movements if heaps are implemented using arrays and {$O(\log n \cdot \log n)$} for a pointer-based implementation. Previous algorithms require either {$O(n + k)$} data movements and comparisons, or {$O(k \cdot \log(\log n+k))$} comparisons and {$O(k \cdot \log(n + k))$} data movements. The algorithm presented in this paper improves on the previous algorithms for the case when $k > \log n$.", refersto = "\cite{Aho$^+$74}, \cite{Aho$^+$83}, \cite{Brown78}, \cite{Floyd64}, \cite{Francon$^+$78}, \cite{Gonnet84}, \cite{Gonnet$^+$82}, \cite{Knuth73}, \cite{Tarjan83}, \cite{Vuillemin78}, \cite{Williams64}", } @Article{Chiba:1985:DPG, author = "Norishige Chiba and Kazunori Onoguchi and Takao Nishizeki", title = "Drawing Plane Graphs Nicely", journal = j-ACTA-INFO, volume = "22", number = "2", institution = "Tohoku U", pages = "187--201", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68R10 (05-04 05C10)", MRnumber = "86m:68116", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "display; draw; format; image part pattern; layout; nice; planar; plane graph; pretty print", } @Article{Kamimura:1985:EGI, author = "Tsutomu Kamimura", title = "An Effectively Given Initial Semigroup", journal = j-ACTA-INFO, volume = "22", number = "2", pages = "203--227", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (03B70 03D99)", MRnumber = "87a:68115", MRreviewer = "Ji{\v{r}}{\'\i} Ad{\'a}mek", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Dunne:1985:LBM, author = "Paul E. S. Dunne", title = "A {$2.5n$} Lower Bound on the Monotone Network Complexity of {$T_3^n$}", journal = j-ACTA-INFO, volume = "22", number = "2", pages = "229--240", month = jun, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q15 (94C10)", MRnumber = "86m:68050", MRreviewer = "Ingo Wegener", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rembowski:1985:PQI, author = "Bogdan Rembowski", title = "A Priority Queue With Interruptions of Service Permitted After a Time Quantum", journal = j-ACTA-INFO, volume = "22", number = "3", pages = "241--251", month = aug, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M20 (90B22)", MRnumber = "87a:68028", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "Erweiterte Warteschlangen und Bedienzeit", } @Article{Krishnamurthy:1985:SPT, author = "Balakrishnan Krishnamurthy", title = "Short Proofs for Tricky Formulas", journal = j-ACTA-INFO, volume = "22", number = "3", pages = "253--275", month = aug, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03B35 (03B05 03D15 68T15)", MRnumber = "87d:03031", MRreviewer = "John Hooley", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Gonczarowski:1985:DPM, author = "Jakob Gonczarowski", title = "Decidable Properties of Monadic Recursive Schemas With a Depth Parameter", journal = j-ACTA-INFO, volume = "22", number = "3", pages = "277--310", month = aug, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D05 (68Q05 68Q45)", MRnumber = "87d:03109", MRreviewer = "George Tourlakis", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rudnicki:1985:PPP, author = "Piotr Rudnicki and W{\l}odzimierz Drabent", title = "Proving Properties of {Pascal} Programs in {MIZAR 2}", journal = j-ACTA-INFO, volume = "22", number = "3", pages = "311--331", month = aug, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Bruno:1985:PBD, author = "John L. Bruno and Peter J. Downey", title = "Probabilistic Bounds for Dual Bin-Packing", journal = j-ACTA-INFO, volume = "22", number = "3", institution = "UCSB/U Ariz", pages = "333--345", month = aug, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q25 (68N25)", MRnumber = "87a:68079", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1985.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/online.competitive.algorithms.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "image part pattern", } @Article{Kfoury:1985:NSC, author = "A. J. Kfoury and Pawe{\l} Urzyczyn", title = "Necessary and Sufficient Conditions for the Universality of Programming Formalisms", journal = j-ACTA-INFO, volume = "22", number = "4", pages = "347--377", month = oct, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q65 (03D80)", MRnumber = "87a:68122", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Chung:1985:CPS, author = "Moon-Jung Chung and W. Michael Evangelist and Ivan Hal Sudborough", title = "Complete Problems for Space Bounded Subclasses of {NP}", journal = j-ACTA-INFO, volume = "22", number = "4", pages = "379--395", month = oct, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q15 (03D15)", MRnumber = "87e:68028", MRreviewer = "Diana Schmidt", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Sonnenschein:1985:GSC, author = "Michael Sonnenschein", title = "Global Storage Cells for Attributes in an Attribute Grammar", journal = j-ACTA-INFO, volume = "22", number = "4", pages = "397--420", month = oct, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "87b:68066", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "alloc", mynote = "Prend le contrepied de la m{\'e}thode usuelle pour l'optimisation m{\'e}moire: il decide a priori quelles occurrences d'attribut seront stock{\'e}es dans des variables globales, puis regarde si on peut transformer la grammaire pour l'{\'e}valuer avec cette contrainte. (mj)", } @Article{Huynh:1985:CWP, author = "Dung T. Huynh", title = "Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension", journal = j-ACTA-INFO, volume = "22", number = "4", pages = "421--432", month = oct, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03D15 (03D40 20M05 68Q15)", MRnumber = "87f:03109", MRreviewer = "M. M. Richter", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Beynon:1985:RCE, author = "Meurig Beynon", title = "Replaceability and Computational Equivalence for Monotone {Boolean} Functions", journal = j-ACTA-INFO, volume = "22", number = "4", pages = "433--449", month = oct, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q15 (03G05 06E30 94C10)", MRnumber = "87a:68061", MRreviewer = "Ingo Wegener", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Lloyd:1985:WCP, author = "Errol L. Lloyd and Michael C. Loui", title = "On the Worst Case Performance of Buddy Systems", journal = j-ACTA-INFO, volume = "22", number = "4", pages = "451--473", month = oct, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68N25)", MRnumber = "87a:68031", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Miyakawa:1985:ODT, author = "Masahiro Miyakawa", title = "Optimum Decision Trees---An Optimal Variable Theorem and its Related Applications", journal = j-ACTA-INFO, volume = "22", number = "5", pages = "475--498", month = dec, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (68N05 90A05 90B50)", MRnumber = "87m:68031", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Heilbrunner:1985:TPC, author = "Stephan Heilbrunner", title = "Truly Prefix-Correct Chain-Free {{\em LR($1$)}} Parsers", journal = j-ACTA-INFO, volume = "22", number = "5", pages = "499--536", month = dec, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "822 325", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Moller:1985:ASI, author = "Bernhard M{\"o}ller", title = "On the Algebraic Specification of Infinite Objects---Ordered and Continuous Models of Algebraic Types", journal = j-ACTA-INFO, volume = "22", number = "5", pages = "537--578", month = dec, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q65 (03B70 06F99 68Q55)", MRnumber = "87j:68082", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Latteux:1985:FOC, author = "Michel Latteux and B. Leguy and B. Ratoandromanana", title = "The Family of One-Counter Languages is Closed Under Quotient", journal = j-ACTA-INFO, volume = "22", number = "5", pages = "579--588", month = dec, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45 (03D05)", MRnumber = "87h:68094", MRreviewer = "P. Turakainen", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/picture.languages.bib; MathSciNet database", acknowledgement = ack-nhfb, source = "http://www.informatik.uni-trier.de/~ley/db/journals/acta/acta22.html#LatteuxLR85", } @Article{Hromkovic:1985:FTW, author = "Juraj Hromkovi{\v{c}}", title = "Fooling a Two-Way Nondeterministic Multihead Automaton with Reversal Number Restriction", journal = j-ACTA-INFO, volume = "22", number = "5", pages = "589--594", month = dec, year = "1985", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q05 (03D05)", MRnumber = "87h:68034", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Caspi:1986:FMD, author = "Paul Caspi and Nicolas Halbwachs", title = "A Functional Model for Describing and Reasoning About Time Behaviour of Computing Systems", journal = j-ACTA-INFO, volume = "22", number = "6", pages = "595--627", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10 (68Q55)", MRnumber = "87h:68040", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nipkow:1986:NDD, author = "Tobias Nipkow", title = "Non-deterministic data types: models and implementations", journal = j-ACTA-INFO, volume = "22", number = "6", pages = "629--661", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q65", MRnumber = "87h:68118", MRreviewer = "Horst Reichel", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/N/NipkowT.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "34 references.", } @Article{Reusch:1986:MCI, author = "Bernd Reusch and W. Merzenich", title = "Minimal Coverings for Incompletely Specified Sequential Machines", journal = j-ACTA-INFO, volume = "22", number = "6", pages = "663--678", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q05", MRnumber = "87h:68038", MRreviewer = "Ronald E. Prather", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Diekert:1986:IHG, author = "Volker Diekert", title = "Investigations on {Hotz} Groups for Arbitrary Grammars", journal = j-ACTA-INFO, volume = "22", number = "6", pages = "679--698", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45 (20M05 20M35 68Q50)", MRnumber = "88d:68049", MRreviewer = "H. J{\"u}rgensen", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/traces.bib; MathSciNet database", acknowledgement = ack-nhfb, annote = "Revised and extended version of STACS'85 Conference paper, Lecture Notes in Computer Science {\bf 182}(87--97), 1985, Springer-Verlag.", } @Article{Rudnicki:1986:PPP, author = "Piotr Rudnicki and W{\l}odzimierz Drabent", title = "Proving Properties of {Pascal} Programs in {MIZAR 2}", journal = j-ACTA-INFO, volume = "22", number = "6", pages = "699--707", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Dijkstra:1986:SFA, author = "Edsger W. Dijkstra and A. J. M. {van Gasteren}", title = "A Simple Fixpoint Argument Without the Restriction to Continuity", journal = j-ACTA-INFO, volume = "23", number = "1", pages = "1--7", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (03B70)", MRnumber = "87h:68106", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Olderog:1986:SOS, author = "Ernst-R{\"u}diger R. Olderog and C. A. R. Hoare", title = "Specification-Oriented Semantics for Communicating Processes", journal = j-ACTA-INFO, volume = "23", number = "1", pages = "9--66", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N05 (68N25 68Q10 68Q55)", MRnumber = "87j:68018", MRreviewer = "Manfred Broy", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "CCS; concurrent; CSP; parallel; pcalc safety binder(csp); semantics; specification", } @Article{Duponcheel:1986:AFP, author = "L. Duponcheel and M. Duponcheel", title = "Acceptable Functional Programming Systems", journal = j-ACTA-INFO, volume = "23", number = "1", pages = "67--98", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N05 (68Q05 68Q55)", MRnumber = "87k:68011", MRreviewer = "E. Fehr", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Otto:1986:DWM, author = "Friedrich Otto", title = "On Deciding Whether a Monoid is a Free Monoid or is a Group", journal = j-ACTA-INFO, volume = "23", number = "1", pages = "99--110", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "20M05 (03D05 03D40 68R99)", MRnumber = "87i:20100", MRreviewer = "Ronald V. Book", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Mahmoud:1986:AIP, author = "Hosam M. Mahmoud", title = "On the Average Internal Path Length of {$m$}-ary Search Trees", journal = j-ACTA-INFO, volume = "23", number = "1", pages = "111--117", month = mar, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68P10)", MRnumber = "87i:68008", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bengelloun:1986:IPS, author = "S. A. Bengelloun", title = "An Incremental Primal Sieve", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "119--125", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "11Y11 (68Q25)", MRnumber = "87g:11170", MRreviewer = "H. J. Godwin", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Heckmann:1986:EEP, author = "Reinhold Heckmann", title = "An Efficient {{\em ELL($1$)}}-Parser Generator", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "127--148", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "848 636", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nakata:1986:GEL, author = "Ikuo Nakata and Masataka Sassa", title = "Generation of Efficient {{\em LALR}} Parsers for Regular Right Part Grammars", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "149--162", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "848 637", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Becker:1986:ARP, author = "M. Becker and Kurt Mehlhorn", title = "Algorithms for Routing in Planar Graphs", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "163--176", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (05-04 05C10 68R10 90B10)", MRnumber = "87h:68054", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Rosenberg:1986:FAE, author = "Catherine Rosenberg", title = "Files d'attente exponentielles ayant des param{\`e}tres non-stationnaires dans le temps. ({French}) [{Exponential} Queueing Systems with Non-Stationary [Time] Parameters]", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "177--192", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68M20 90B22)", MRnumber = "848 639", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Soundararajan:1986:TCC, author = "N. Soundararajan", title = "Total Correctness of {CSP} Programs", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "193--215", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (68Q10)", MRnumber = "87h:68116", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Paterson:1986:NOH, author = "Michael S. Paterson and Ingo Wegener", title = "Nearly Optimal Hierarchies for Network and Formula Size", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "217--221", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q15 (94C10)", MRnumber = "87k:68048", MRreviewer = "Norbert Blum", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wu:1986:FAA, author = "Y. F. Wu and Peter Widmayer and C. K. Wong", title = "A Faster Approximation Algorithm for the {Steiner} Problem in Graphs", journal = j-ACTA-INFO, volume = "23", number = "2", pages = "223--229", month = may, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q25 (05C05 05C35 68R10)", MRnumber = "87j:68059", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Makowsky:1986:EPD, author = "Johann A. Makowsky and Moshe Y. Vardi", title = "On the Expressive Power of Data Dependencies", journal = j-ACTA-INFO, volume = "23", number = "3", pages = "231--244", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15 (03B70 68Q99)", MRnumber = "88b:68031", MRreviewer = "J. Paredaens", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bucher:1986:RTD, author = "W. Bucher", title = "A Regularity Test for Dual Bordered {OS} Systems", journal = j-ACTA-INFO, volume = "23", number = "3", pages = "245--253", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45", MRnumber = "88d:68048", MRreviewer = "Martti Penttonen", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Calzarossa:1986:WMR, author = "Maria Calzarossa and M. Italiani and Giuseppe Serazzi", title = "A Workload Model Representative of Static and Dynamic Characteristics", journal = j-ACTA-INFO, volume = "23", number = "3", pages = "255--266", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", } @Article{Tamminen:1986:CMS, author = "Markku Tamminen and W. K. Luk and Paolo Sipala and L. S. Woo and C. K. Wong", title = "Constructing Maximal Slicings From Geometry", journal = j-ACTA-INFO, volume = "23", number = "3", institution = "IBM +", pages = "267--288", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1986.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", keywords = "image part pattern", } @Article{Rozenberg:1986:GTC, author = "Grzegorz Rozenberg and Emo Welzl", title = "Graph Theoretic Closure Properties of the Family of Boundary {NLC} Graph Languages", journal = j-ACTA-INFO, volume = "23", number = "3", pages = "289--309", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50 (05C99)", MRnumber = "88b:68119", MRreviewer = "Curtis R. Cook", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/gragra.bib; MathSciNet database", acknowledgement = ack-nhfb, added = "1996-03-13-10-09-20", } @Article{Krivanek:1986:NHP, author = "Mirko K{\v{r}}iv{\'a}nek and Jaroslav Mor{\'a}vek", title = "{NP}-Hard Problems in Hierarchical-Tree Clustering", journal = j-ACTA-INFO, volume = "23", number = "3", pages = "311--323", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q25 (62H30 68T10)", MRnumber = "87k:68064", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wagner:1986:CCP, author = "Klaus W. Wagner", title = "The Complexity of Combinatorial Problems with Succinct Input Representation", journal = j-ACTA-INFO, volume = "23", number = "3", pages = "325--356", month = jun, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q15", MRnumber = "88i:68040", MRreviewer = "Sam M. Kim", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bijlsma:1986:EGM, author = "A. Bijlsma and J. G. Wiltink and P. A. Matthews", title = "Equivalence of the {Gries} and {Martin} Proof Rules for Procedure Calls", journal = j-ACTA-INFO, volume = "23", number = "4", pages = "357--360", month = aug, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60", MRnumber = "87k:68098", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Wyrostek:1986:PTW, author = "Piotr Wyrostek", title = "Precedence Technique is not Worse than {{\em SLR($1$)}}", journal = j-ACTA-INFO, volume = "23", number = "4", pages = "361--392", month = aug, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "87g:68044", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Farrow:1986:CSO, author = "Rodney Farrow and Daniel M. Yellin", title = "A Comparison of Storage Optimizations in Automatically-Generated Attribute Evaluators", journal = j-ACTA-INFO, volume = "23", number = "4", pages = "393--427", month = aug, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", note = "See also: Technical Report, Department of Comp. Sc., Columbia University, New York, NY (January 1985).", keywords = "alloc", mynote = "Tr{\`e}s bonne comparaison des optimisations en place effectu{\'e}es par GAG et LINGUIST-86. Les auteurs en d{\'e}duisent quelques id{\'e}es pour les am{\'e}liorer tous les deux. Valable pour FNC-2. {\`A} lire. (mj)", } @Article{Koutny:1986:MRP, author = "Maciej Koutny", title = "The {Merlin-Randell} Problem of Train Journeys", journal = j-ACTA-INFO, volume = "23", number = "4", pages = "429--463", month = aug, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q90 (68Q10 68Q60)", MRnumber = "88e:68089", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Nicola:1986:SSQ, author = "Victor F. Nicola", title = "A Single Server Queue with Mixed Types of Interruptions", journal = j-ACTA-INFO, volume = "23", number = "4", pages = "465--486", month = aug, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68M20 90B22)", MRnumber = "88d:60239", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "Erweiterte Warteschlangen und Bedienzeitunterbrechung", } @Article{Hehner:1986:PM, author = "Eric C. R. Hehner and Lorene E. Gupta and Andrew J. Malton", title = "Predicative Methodology", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "487--505", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68N05)", MRnumber = "87k:68090", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/leavens.bib; MathSciNet database", note = "See erratum \cite{Hehner:1988:EPM}.", acknowledgement = ack-nhfb, } @Article{Graf:1986:LSP, author = "Susanne Graf and Joseph Sifakis", title = "A Logic for the Specification and Proof of Regular Controllable Processes of {CCS}", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "507--527", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (03B70 68Q55)", MRnumber = "88e:68084", MRreviewer = "Bernhard Josko", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/CLiCS.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "pcalc equivalence ccs regular processes binder", } @Article{Lee:1986:GBT, author = "C. C. Lee and D. T. Lee and C. K. Wong", title = "Generating Binary Trees of Bounded Height", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "529--544", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68R10)", MRnumber = "87k:68016", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kouvatsos:1986:MEG, author = "Demetres D. Kouvatsos", title = "Maximum Entropy and the {G/G/1/N} Queue", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "545--565", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68M20 90B22)", MRnumber = "87k:60227", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Reichardt:1986:DGG, author = "Johannes Reichardt", title = "Deterministic Grammars and Grammar Morphisms", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "567--583", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "88d:68063", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Maon:1986:EST, author = "Yael Maon", title = "On the Equivalence of Some Transductions Involving Letter to Letter Morphisms on Regular Languages", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "585--596", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45", MRnumber = "88d:68056", MRreviewer = "P. Turakainen", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Culik:1986:SDP, author = "Karel {Culik II} and Juhani Karhum{\"a}ki", title = "Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence", journal = j-ACTA-INFO, volume = "23", number = "5", pages = "597--605", month = sep, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q05 (03D05 68Q45)", MRnumber = "88b:68041", MRreviewer = "Yasuyoshi Inagaki", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Berzins:1986:MSE, author = "Valdis Berzins", title = "On Merging Software Extensions", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "607--619", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55", MRnumber = "87i:68046", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Geist:1986:RLC, author = "Robert Geist and Mark Smotherman and Kishor S. Trivedi and Joanne Bechta Dugan", title = "The Reliability of Life-Critical Computer Systems", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "621--642", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Gelenbe:1986:ADC, author = "Erol Gelenbe and David Finkel and Satish K. Tripathi", title = "Availability of a Distributed Computer System with Failures", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "643--655", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib", } @Article{Cantor:1986:ITA, author = "J. Cantor and A. Ephremides and D. Horton", title = "Information Theoretic Analysis for a General Queueing System at Equilibrium with Application to Queues in Tandem", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "657--678", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "60K25 (68M20 90B22 94A17)", MRnumber = "87m:60207", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1986.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, date = "23/09/88", descriptors = "Queueing system", enum = "495", language = "English", location = "UniS-IND", references = "27", revision = "21/04/91", } @Article{Balcazar:1986:SSG, author = "Jos{\'e} L. Balc{\'a}zar and Ronald V. Book", title = "Sets with Small Generalized {Kolmogorov} Complexity", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "679--688", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q15 (03D15 68Q30)", MRnumber = "87k:68041", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bublitz:1986:DGM, author = "Siegfried Bublitz", title = "Decomposition of Graphs and Monotone Formula Size of Homogeneous Functions", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "689--696", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q25 (05A15 06E30 68R10)", MRnumber = "88c:68045", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Iliopoulos:1986:MCC, author = "Costas S. Iliopoulos", title = "{Monte Carlo} Circuits for the {Abelian} Permutation Group Intersection Problem", journal = j-ACTA-INFO, volume = "23", number = "6", pages = "697--705", month = nov, year = "1986", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (20B99 20F10 68Q15 68Q25)", MRnumber = "87j:68046", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Cousot:1987:EII, author = "Patrick Cousot and Radhia Cousot", title = "{${\rm Sometime}={\rm always}+{\rm recursion}\equiv{\rm always}$} on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs", journal = j-ACTA-INFO, volume = "24", number = "1", pages = "1--31", month = feb, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60", MRnumber = "88b:68128", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Janicki:1987:FSC, author = "Ryszard Janicki", title = "A Formal Semantics for Concurrent Systems with a Priority Relation", journal = j-ACTA-INFO, volume = "24", number = "1", pages = "33--55", month = feb, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10 (68Q55 68Q60 68Q90)", MRnumber = "89h:68044", MRreviewer = "R{\"u}diger Valk", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/sydcat.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Takeichi:1987:PPE, author = "Masato Takeichi", title = "Partial Parameterization Eliminates Multiple Traversals of Data Structures", journal = j-ACTA-INFO, volume = "24", number = "1", pages = "57--77", month = feb, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/RISC.parlab.bib", abstract = "The use of higher order functions in functional programming opens up the possibility of defining functions by partial parameterization, and lazy evaluation brings out a new approach in programming methodology. This paper describes a new transformation technique based on partial parameterization and fully lazy evaluation for eliminating multiple traversals of data structures. It uses no particular mechanisms in functional programming, whereas it transforms a wider class of programs into efficient ones than that proposed so far.", abstract-2 = "Using partial parameterization and lazy evaluation, a transformation can eliminate multiple traversals of a data structure. See Bird circular programs.", descr = "plfun-lazy,pttra", keywords = "applicative programming; circular program; evaluation; FP; functional; lazy; need; transformation", owner = "pcl", } @Article{Goldreich:1987:ELR, author = "Oded Goldreich and Liuba Shrira", title = "Electing a Leader in a Ring with Link Failures", journal = j-ACTA-INFO, volume = "24", number = "1", pages = "79--91", month = feb, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M10", MRnumber = "88b:68006", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Leung:1987:ASA, author = "Clement H. C. Leung", title = "Analysis of Space Allocation in a Generally Fragmented Linear Store", journal = j-ACTA-INFO, volume = "24", number = "1", pages = "93--104", month = feb, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N25 (68Q25)", MRnumber = "881 263", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Vidyasankar:1987:GTS, author = "K. Vidyasankar", title = "Generalized Theory of Serializability", journal = j-ACTA-INFO, volume = "24", number = "1", pages = "105--119", month = feb, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15", MRnumber = "88b:68035", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/Discrete.event.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kunde:1987:LBS, author = "Manfred Kunde", title = "Lower Bounds for Sorting on Mesh-Connected Architectures", journal = j-ACTA-INFO, volume = "24", number = "2", institution = "TU Munchen", pages = "121--130", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P10 (68Q25 68Q35)", MRnumber = "889 279", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1987.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "information processing; time", } @Article{Loizou:1987:LPJ, author = "G. Loizou and P. Thanisch", title = "Losslessness and Project-Join Constructibility in Relational Databases", journal = j-ACTA-INFO, volume = "24", number = "2", pages = "131--144", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15", MRnumber = "88c:68016", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Murtagh:1987:RPN, author = "Thomas P. Murtagh", title = "Redundant Proofs of Non-Interference in {Levin-Gries} {CSP} Program Proofs", journal = j-ACTA-INFO, volume = "24", number = "2", pages = "145--156", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60", MRnumber = "88c:68065", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Heilbrunner:1987:UUM, author = "Stephan Heilbrunner and Steffen H{\"o}lldobler", title = "The Undecidability of the Unification and Matching Problem for Canonical Theories", journal = j-ACTA-INFO, volume = "24", number = "2", pages = "157--171", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50 (03B35 03D35 68T15)", MRnumber = "88j:68100", MRreviewer = "Laurent Kott", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/rewrite.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Szpankowski:1987:ACR, author = "Wojciech Szpankowski", title = "An Analysis of a Contention Resolution Algorithm: Another Approach", journal = j-ACTA-INFO, volume = "24", number = "2", pages = "173--190", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M10 (68Q25)", MRnumber = "88d:68002", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Harris:1987:SLP, author = "Lawrence A. Harris", title = "{{\em SLR($1$)}} and {{\em LALR($1$)}} Parsing for Unrestricted Grammars", journal = j-ACTA-INFO, volume = "24", number = "2", pages = "191--209", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "88c:68061", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{DeNicola:1987:EET, author = "Rocco {De Nicola}", title = "Extensional Equivalences for Transition Systems", journal = j-ACTA-INFO, volume = "24", number = "2", pages = "211--237", month = apr, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10", MRnumber = "88d:68018", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/des.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Discrete.event.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "pcalc equivalence binder", } @Article{Mili:1987:RHD, author = "Ali Mili and Jules Desharnais and Fatma Mili", title = "Relational Heuristics for the Design of Deterministic Programs", journal = j-ACTA-INFO, volume = "24", number = "3", pages = "239--276", month = jun, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N99 (68Q60 68Q99)", MRnumber = "89a:68025", MRreviewer = "Bernhard Josko", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Devroye:1987:BPA, author = "Luc Devroye", title = "Branching Processes in the Analysis of the Heights of Trees", journal = j-ACTA-INFO, volume = "24", number = "3", pages = "277--298", month = jun, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68P10)", MRnumber = "88j:68022", MRreviewer = "G. Louchard", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/algobib.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "probabilistic analysis; search problems; trees", owner = "flajolet", } @Article{Alblas:1987:OPT, author = "Henk Alblas", title = "One-pass Transformations of Attributed Program Trees", journal = j-ACTA-INFO, volume = "24", number = "3", pages = "299--352", month = jun, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50 (68N15)", MRnumber = "88d:68060", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", note = "See also: memorandum INF-86-30, Onderafdeling der Informatica, Tech. Hogeschool Twente (October 1986).", acknowledgement = ack-nhfb, keywords = "tat", mynote = "Determine des conditions suffisantes qui assurent qu'on n'a pas besoin de faire une reevaluation incrementale des attributs entre deux transformations d'arbres dans la meme passe. (mj)", } @Article{Kumar:1987:LSA, author = "S. Kiran Kumar and C. Pandu Rangan", title = "A Linear Space Algorithm for the {LCS} Problem", journal = j-ACTA-INFO, volume = "24", number = "3", pages = "353--362", month = jun, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (68Q25)", MRnumber = "89c:68044", MRreviewer = "Jean-Claude Spehner", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", abstract = "linear space by divide and conquer like Hirschberg but O(n(m-p)) time where string lengths $m$ and $n$ and $|$LCS$|$=p Uses idea of ``perfect cut''.", acknowledgement = ack-nhfb, keywords = "alignment; divide and conquer; fast; LCS; LCSS; linear; longest common subsequence; perfect cut; sequence; similarity; space; strings", } @Article{Becker:1987:ETO, author = "Bernd Becker", title = "An Easily Testable Optimal-Time {VLSI}-Multiplier", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "363--380", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M15", MRnumber = "88g:68010", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hoogewijs:1987:PPL, author = "Albert Hoogewijs", title = "Partial-Predicate Logic in Computer Science", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "381--393", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "03B70 (03B50 03B60 68Q60)", MRnumber = "88k:03059", MRreviewer = "Petr Jirk\ocirc u", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kapur:1987:SCR, author = "Deepak Kapur and Paliath Narendran and Hant{\`a}o Zhang", title = "On sufficient completeness and related properties of term rewriting systems", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "395--415", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50 (03B25 03B35 68Q65)", MRnumber = "89a:68136", MRreviewer = "Klaus Madlener", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib; ftp://ftp.ira.uka.de/pub/bibliography/Theory/rewrite.bib; MathSciNet database", acknowledgement = ack-nhfb, keyword = "Rewrite Methods", } @Article{Peters:1987:PAS, author = "Joseph G. Peters and Larry Rudolph", title = "Parallel Approximation Schemes for Subset Sum and Knapsack Problems", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "417--432", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (68Q10 90C09 90C10)", MRnumber = "89a:68093", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Schmidt:1987:LUP, author = "Ursula Schmidt", title = "Long Unavoidable Patterns", journal = j-ACTA-INFO, volume = "24", number = "4", institution = "U Karlsruhe", pages = "433--445", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45 (03D05)", MRnumber = "89b:68041", MRreviewer = "Dani{\`e}le Beauquier", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1987.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "image multiplicity comparison", } @Article{Dunne:1987:RVG, author = "Paul E. S. Dunne", title = "A Result on {$k$}-Valent Graphs and Its Application to a Graph Embedding Problem", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "447--459", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "05C35 (05C10)", MRnumber = "88h:05051", MRreviewer = "Saul Stahl", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kempf:1987:TOL, author = "M. Kempf and Rudolf Bayer and Ulrich G{\"u}ntzer", title = "Time Optimal Left to Right Construction of Position Trees", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "461--474", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (05C05 68R10)", MRnumber = "88h:68031", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Bender:1987:OWC, author = "Edward A. Bender and Cheryl E. Praeger and Nicholas C. Wormald", title = "Optimal Worst Case Trees", journal = j-ACTA-INFO, volume = "24", number = "4", pages = "475--489", month = aug, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (05C05 68P10 68Q25 68R10)", MRnumber = "88j:68021", MRreviewer = "Peter Eades", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{deBakker:1987:OMS, author = "J. W. {de Bakker} and J.-J. Ch. Meyer", title = "Order and Metric in the Stream Semantics of Elemental Concurrency", journal = j-ACTA-INFO, volume = "24", number = "5", pages = "491--511", month = sep, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68Q10 68Q90)", MRnumber = "89a:68144", MRreviewer = "Manfred Broy", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Blazewicz:1987:MMF, author = "J. B{\l}a{\.{z}}ewicz and W. Kubiak and H. R{\"o}ck and J. Szwarcfiter", title = "Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints", journal = j-ACTA-INFO, volume = "24", number = "5", pages = "513--524", month = sep, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N25 (68Q25 90B35)", MRnumber = "89a:68023", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Duda:1987:PEF, author = "Andrzej Duda and Tadeusz Czach{\'o}rski", title = "Performance Evaluation of Fork and Join Synchronization Primitives", journal = j-ACTA-INFO, volume = "24", number = "5", pages = "525--553", month = sep, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68M20", MRnumber = "909 339", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1987.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/Os/IMMD_IV.bib; MathSciNet database", acknowledgement = ack-nhfb, date = "13/05/93", descriptors = "Queueing network; analysis", enum = "7236", keywords = "Fork-Join Performance; NELS 88; SOUZ 87", language = "English", location = "SEL: Wi", references = "0", revision = "16/01/94", } @Article{Chowdhury:1987:WCP, author = "Shyamal K. Chowdhury and Pradip K. Srimani", title = "Worst Case Performance of Weighted Buddy Systems", journal = j-ACTA-INFO, volume = "24", number = "5", pages = "555--564", month = sep, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N25 (68P99 68Q25)", MRnumber = "88h:68011", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Chazelle:1987:STG, author = "Bernard Chazelle", title = "Some Techniques for Geometric Searching with Implicit Set Representations", journal = j-ACTA-INFO, volume = "24", number = "5", institution = "Princeton U", pages = "565--582", month = sep, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68U05 (68Q20 68R05)", MRnumber = "88m:68054", MRreviewer = "Herbert Edelsbrunner", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1987.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "image part pattern", } @Article{Cunto:1987:ITS, author = "Walter Cunto and Jose Luis Gascon", title = "Improving Time and Space Efficiency in Generalized Binary Search Trees", journal = j-ACTA-INFO, volume = "24", number = "5", pages = "583--594", month = sep, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05", MRnumber = "88i:68013", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Huang:1987:DSI, author = "Chua-Huang Huang and Christian Lengauer", title = "The Derivation of Systolic Implementations of Programs", journal = j-ACTA-INFO, volume = "24", number = "6", pages = "595--632", month = nov, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q35", MRnumber = "918 996", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kastens:1987:LAA, author = "Uwe Kastens", title = "Lifetime Analysis for Attributes", journal = j-ACTA-INFO, volume = "24", number = "6", pages = "633--651", month = nov, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50 (68M99)", MRnumber = "88m:68035", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "alloc", } @Article{Lao:1987:CBC, author = "Marek J. Lao", title = "Combinator-Based Compilation of Recursive Functions with Different Parameter Passing Modes", journal = j-ACTA-INFO, volume = "24", number = "6", pages = "653--678", month = nov, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68N05 (03B70 68Q55)", MRnumber = "918 998", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Horwitz:1987:EGI, author = "Susan Horwitz and Alan J. Demers and Tim Teitelbaum", title = "An Efficient General Iterative Algorithm for Dataflow Analysis", journal = j-ACTA-INFO, volume = "24", number = "6", pages = "679--694", month = nov, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q20 (68N05)", MRnumber = "918 999", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Kamin:1987:ETS, author = "Samuel Kamin", title = "The Expressive Theory of Stacks", journal = j-ACTA-INFO, volume = "24", number = "6", pages = "695--709", month = nov, year = "1987", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q60 (03B70)", MRnumber = "89d:68054", MRreviewer = "Alexey P. Stolboushkin", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Hehner:1988:TCC, author = "Eric C. R. Hehner and Andrew J. Malton", title = "Termination Conventions and Comparative Semantics", journal = j-ACTA-INFO, volume = "25", number = "1", pages = "1--14", month = jan, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68N05)", MRnumber = "923 395", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Finkel:1988:FNO, author = "Alain Finkel and Annie Choquet", title = "{FIFO} nets without order deadlock", journal = j-ACTA-INFO, volume = "25", number = "1", pages = "15--36", month = jan, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q90", MRnumber = "89a:68167", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Tsakalidis:1988:NCA, author = "Athanasios K. Tsakalidis", title = "The Nearest Common Ancestor in a Dynamic Tree", journal = j-ACTA-INFO, volume = "25", number = "1", pages = "37--54", month = jan, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68Q20)", MRnumber = "89a:68030", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Vianu:1988:DSU, author = "Victor Vianu", title = "Database Survivability Under Dynamic Constraints", journal = j-ACTA-INFO, volume = "25", number = "1", pages = "55--84", month = jan, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P15", MRnumber = "89a:68042", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ganapathi:1988:ICG, author = "Mahadevan Ganapathi and Charles N. Fischer", title = "Integrating Code Generation and Peephole Optimization", journal = j-ACTA-INFO, volume = "25", number = "1", pages = "85--109", month = jan, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib", } @Article{Bauer:1988:CEA, author = "Friedrich L. Bauer and Martin Wirsing", title = "Crypt-equivalent algebraic specifications", journal = j-ACTA-INFO, volume = "25", number = "2", pages = "111--153", month = feb, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68Q60)", MRnumber = "89e:68075", MRreviewer = "J.-J. Ch. Meyer", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Reps:1988:IEA, author = "Thomas W. Reps", title = "Incremental Evaluation for Attribute Grammars with Unrestricted Movement Between Tree Modifications", journal = j-ACTA-INFO, volume = "25", number = "2", pages = "155--178", month = feb, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q50", MRnumber = "928 425", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, keywords = "incr", mynote = "Papier d'inter{\^e}t p{\^u}rement th{\'e}orique montrant comment adapter la m{\'e}thode de Reps pour les GAs NC ({\`a} base de graphes caract{\'e}ristiques) de fa{\c{c}}on {\`a} ne pas avoir {\`a} tenir {\`a} jour ces graphes {\`a} chaque mouvement du curseur. Papier bien {\'e}crit mais assez inutile. (mj)", } @Article{Bouge:1988:ESA, author = "Luc Boug{\'e}", title = "On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes", journal = j-ACTA-INFO, volume = "25", number = "2", pages = "179--201", month = feb, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q10", MRnumber = "89a:68060", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Ehrenfeucht:1988:RUM, author = "Andrzej Ehrenfeucht and Hendrik Jan Hoogeboom and Grzegorz Rozenberg", title = "Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata", journal = j-ACTA-INFO, volume = "25", number = "2", pages = "203--231", month = feb, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q45 (68Q50)", MRnumber = "89d:68041", MRreviewer = "Gheorghe P{\u{a}}un", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Sannella:1988:TFD, author = "Donald T. Sannella and Andrzej Tarlecki", title = "Toward formal development of programs from algebraic specifications: implementations revisited", journal = j-ACTA-INFO, volume = "25", number = "3", pages = "233--281", month = apr, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68Q55 (68N05 68Q65)", MRnumber = "90f:68113", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib; ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib; MathSciNet database", acknowledgement = ack-nhfb, } @Article{Zhang:1988:SOT, author = "Ming-Hua Zhang", title = "A Second Order Theory of Data Types", journal = j-ACTA-INFO, volume = "25", number = "3", pages = "283--303", month = apr, year = "1988", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", MRclass = "68P05 (68Q65)", MRnumber = "89