%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.05",
%%% date = "11 January 2004",
%%% time = "10:45:22 MST",
%%% filename = "scicomputprogram.bib",
%%% address = "Center for Scientific Computing
%%% 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 = "10409 13858 52275 522066",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "BibTeX, bibliography, Science of Computer
%%% Programming",
%%% supported = "yes",
%%% docstring = "This is a bibliography of publications in the
%%% journal Science of Computer Programming
%%% (CODEN SCPGD4, ISSN 0167-6423), originally
%%% published by North-Holland, later by Elsevier
%%% Science Publishers B.V..
%%%
%%% Publication began with Volume 1, Number 1, in
%%% 1981. The journal appeared three times
%%% yearly through 1985, and since then, has
%%% appeared six times yearly, with two volumes
%%% per year.
%%%
%%% The journal is unusual in that multiple
%%% numbered issues sometimes appear in a single
%%% physical issue, and volumes sometimes cross
%%% year boundaries.
%%%
%%% Coverage should be complete, except possibly
%%% for one or two papers in each of Volumes 11
%%% and 14, where there are page gaps of 13 and
%%% 15 respectively. The author will be grateful
%%% if any reader can clarify this.
%%%
%%% The publisher has a World Wide Web site
%%% for the journal at
%%%
%%% http://www.elsevier.com/locate/scico
%%% http://www.elsevier.com/inca/publications/store/5/0/5/6/2/3/
%%%
%%% At version 1.05, the year coverage looked
%%% like this:
%%%
%%% 1981 ( 7) 1989 ( 17) 1997 ( 26)
%%% 1982 ( 17) 1990 ( 32) 1998 ( 33)
%%% 1983 ( 12) 1991 ( 15) 1999 ( 26)
%%% 1984 ( 13) 1992 ( 19) 2000 ( 37)
%%% 1985 ( 14) 1993 ( 21) 2001 ( 34)
%%% 1986 ( 26) 1994 ( 26) 2002 ( 50)
%%% 1987 ( 28) 1995 ( 23) 2003 ( 46)
%%% 1988 ( 21) 1996 ( 28)
%%% 19xx ( 1)
%%%
%%% Article: 565
%%% Proceedings: 7
%%%
%%% Total entries: 572
%%%
%%% 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; the author's local library does not
%%% have this journal, so it has not been
%%% possible to check with original issues.
%%%
%%% 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{}"}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
Center for Scientific Computing,
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-SCI-COMPUT-PROGRAM = "Science of Computer Programming"}
%%% ====================================================================
%%% Publisher abbreviations:
@String{pub-ELSEVIER = "Elsevier"}
@String{pub-ELSEVIER:adr = "Amsterdam, The Netherlands"}
@String{pub-SV = "Springer-Verlag Inc."}
@String{pub-SV:adr = "New York, NY, USA"}
%%% ====================================================================
%%% Series abbreviations:
@String{ser-LNCS = "Lecture Notes in Computer Science"}
%%% ====================================================================
%%% Bibliography entries, sorted in publication order:
@Article{Cai:19xx:CRU,
author = "W. Cai and D. B. Skillicorn",
title = "Calculating Recurrences Using the {Bird-Meertens}
Formalism",
journal = j-SCI-COMPUT-PROGRAM,
volume = "??",
number = "??",
pages = "??--??",
year = "19xx",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Contrib.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Parallel/Multi.bib",
xxnote = "Submitted March 1992; does not appear to have been
published.",
}
@Article{Sintzoff:1981:E,
author = "Michel Sintzoff",
title = "Editorial",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "1--2",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib",
}
@Article{Dijkstra:1981:WW,
author = "Edsger W. Dijkstra",
title = "A Word of Welcome",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "3--4",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
}
@Article{Manna:1981:DSU,
author = "Zohar Manna and Richard Waldinger",
title = "Deductive Synthesis of the Unification Algorithm",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "5--48",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68B10 (03B35 68G15)",
MRnumber = "83f:68009",
bibdate = "Sun Oct 10 08:24:00 MDT 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/dna.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/Seiferas/1996.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
}
@Article{Hoare:1981:CTC,
author = "C. A. R. Hoare",
title = "A Calculus of Total Correctness for Communicating
Processes",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "49--72",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68B05",
MRnumber = "83d:68008",
bibdate = "Sun Oct 10 08:24:00 MDT 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
}
@Article{Bauer:1981:PWS,
author = "F. L. Bauer and M. Broy and W. Dosch and R. Gnatz and
B. Krieg-Br{\"u}ckner and A. Laut and M. Luckmann and
T. Matzner and B. M{\"o}ller and H. Partsch and P.
Pepper and K. Samelson and R. Steinbr{\"u}ggen and M.
Wirsing and H. W{\"o}ssner",
title = "Programming in a Wide Spectrum Language: {A}
Collection of Examples",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "73--114",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Ai/planning.scheduling.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/action.semantics.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/Hypatia/B/BroyM.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib",
keywords = "functional",
}
@Article{Best:1981:SDE,
author = "E. Best and F. Cristian",
title = "Systematic Detection of Exception Occurrences",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "115--144",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
}
@Article{Feijen:1981:BRP,
author = "W. H. J. Feijen",
title = "{Bulterman}'s Reshuffling Problem",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "1--2",
pages = "145--147",
month = oct,
year = "1981",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
bibdate = "Fri Feb 22 12:02:19 2002",
}
@Article{Sufrin:1982:FSD,
author = "Bernard Sufrin",
title = "Formal Specification of a Display-Oriented Text
Editor",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "3",
pages = "157--202",
month = may,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Oxford, Computing Lab, Oxford, Engl",
classification = "723; 741",
journalabr = "Sci Comput Program",
keywords = "data processing; display devices --- Applications;
display-oriented text editor",
}
@Article{Sethi:1982:CEE,
author = "Ravi Sethi",
title = "Circular Expressions --- Elimination of Static
Environments",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "3",
pages = "203--222",
month = may,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/interactive.proofs.bib",
note = "Also see Automata, Languages and Programming, Eighth
Colloquium, Acre Israel, Lecture Notes in Computer
Science {\it 115}, pp. 378-392, Springer Verlag,
Berlin, 1981.",
acknowledgement = ack-nhfb,
affiliation = "Bell Lab, Murray Hill, NJ, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming languages; denotational
semantics; flow diagram; functional",
}
@Article{Dijkstra:1982:SAS,
author = "Edsger W. Dijkstra",
title = "Smoothsort, an Alternative for Sorting in Situ",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "3",
pages = "223--233",
month = may,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68E05",
MRnumber = "83g:68090",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/att.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
note = "See errata \cite{Dijkstra:1982:ESA}.",
acknowledgement = ack-nhfb,
affiliation = "Burroughs Corp, Nuenen, Neth",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming --- Algorithms; computer systems
programming; heapsort; smoothsort; sorting in situ",
}
@Article{Schmitz:1982:EPS,
author = "Lothar Schmitz",
title = "An Exercise in Program Synthesis: Algorithms for
Computing the Transitive Closure of a Relation",
journal = j-SCI-COMPUT-PROGRAM,
volume = "1",
number = "3",
pages = "235--254",
month = may,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68C05 (68B05)",
MRnumber = "83g:68045",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Hochschule der Bundeswehr M{\"u}nchen, Fachbereich
Informatik, Neubiberg, West Ger",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer systems programming ---
Synthesis; recursion equation derivations; transitive
closure algorithms",
}
@Article{Lengauer:1982:MPCa,
author = "Christian Lengauer and Eric C. R. Hehner",
title = "A Methodology for Programming with Concurrency: An
Informal Presentation",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "1",
pages = "1--18",
month = oct,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Computer Systems Research Group,
Toronto, Ont, Can",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; concurrent programs; execution
time; semantics",
}
@Article{Lengauer:1982:MPCb,
author = "Christian Lengauer",
title = "A Methodology for Programming with Concurrency: The
Formalism",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "1",
pages = "19--52",
month = oct,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Computer Systems Research Group,
Toronto, Ont, Can",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer systems programming; refinement proof system;
semantics; test proof system",
}
@Article{Guttag:1982:SNP,
author = "John V. Guttag and Jim J. Horning and Jeannette W.
Wing",
title = "Some notes on putting formal specifications to
productive use",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "1",
pages = "53--68",
month = oct,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.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/logic.program.construction.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib",
acknowledgement = ack-nhfb,
affiliation = "MIT, Lab for Computer Science, Cambridge, Mass, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming languages; formal specification
languages; program development process",
}
@Article{Heilbrunner:1982:TRR,
author = "Stephan Heilbrunner and Werner Pohlmann",
title = "A Technique for Recursion Removal Based on String
Homomorphisms",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "1",
pages = "69--81",
month = oct,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68C05 (68B05)",
MRnumber = "84a:68027",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Hochschule der Bundeswehr M{\"u}nchen, Fachbereich
Informatik, Neubiberg, West Ger",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; homomorphism on string;
recursion removal",
}
@Article{Dijkstra:1982:ESA,
author = "Edsger W. Dijkstra",
title = "Errata: {``Smoothsort, an alternative for sorting in
situ'' [Sci. Comput. Programming {\bf 1} (1981/82), no.
3, 223--233; MR 83g:68090]}",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "1",
pages = "85--85",
month = oct,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68E05",
MRnumber = "84b:68077",
bibdate = "Sun Oct 10 08:24:00 MDT 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
note = "See \cite{Dijkstra:1982:SAS}.",
acknowledgement = ack-nhfb,
}
@Article{London:1982:ISF,
author = "Philip E. London and Martin S. Feather",
title = "Implementing Specification Freedoms",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "2",
pages = "91--131 (or 91--132??)",
month = nov,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California, Information Science Inst,
Marina del Rey, Calif, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming --- Algorithms; computer
programming languages; computer software ---
Reliability; formal specification languages; mapping
issues; specificational freedom",
}
@Article{Rem:1982:FSP,
author = "Martin Rem and Young Il Choo",
title = "A Fixed-Space Program of Linear Output Complexity for
the Problem of the Three Vessels",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "2",
pages = "133--141",
month = nov,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68C05 (68B05)",
MRnumber = "84e:68030",
bibdate = "Sun Oct 10 08:24:00 MDT 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
}
@Article{Misra:1982:FRE,
author = "J. Misra and David Gries",
title = "Finding Repeated Elements",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "2",
pages = "143--152",
month = nov,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68C25",
MRnumber = "84d:68044",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/dershowitz.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin, Dep of Computer Science,
Austin, Tex, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "array elements comparison; computer programming;
optimal algorithm",
}
@Article{Elrad:1982:DDP,
author = "Tzilla E. Elrad and Nissim Francez",
title = "Decomposition of Distributed Programs into
Communication-Closed Layers",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "3",
pages = "155--173",
month = dec,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib",
acknowledgement = ack-nhfb,
affiliation = "Illinois Inst of Technology, Chicago, Ill, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating processes (tasks); communication-closed
layers; computer programming; distributed programs
decomposition",
}
@Article{Lamport:1982:ACP,
author = "Leslie Lamport",
title = "An Assertional Correctness Proof of a Distributed
Algorithm",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "3",
pages = "175--206",
month = dec,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (68M10)",
MRnumber = "85d:68048",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "SRI Int, Computer Science Lab, Menlo Park, Calif,
USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "assertional correctness; computer networks; computer
programming; concurrent program verification;
distributed algorithm; message-routing tables",
}
@Article{Gries:1982:NSS,
author = "David Gries",
title = "A Note on a Standard Strategy for Developing Loop
Invariants and Loops",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "3",
pages = "207--214",
month = dec,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Dep of Computer Science, Ithaca, NY,
USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; loop development; loop
invariants development",
}
@Article{Mints:1982:JSS,
author = "Grigori Mints and Enn Tyugu",
title = "Justifications of the Structural Synthesis of
Programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "3",
pages = "215--240",
month = dec,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B70 68N05)",
MRnumber = "85e:68060",
MRreviewer = "A. V. An\={\i}s\={\i}mov",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/opt.par.compiler.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Inst of Cybernetics, Tallinn, EstSSR",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "automatic program synthesis; computer programming;
inference rules; structural synthesis",
}
@Article{Emerson:1982:UBT,
author = "E. Allen Emerson and Edmund M. Clarke",
title = "Using branching time temporal logic to synthesize
synchronization skeletons",
journal = j-SCI-COMPUT-PROGRAM,
volume = "2",
number = "3",
pages = "241--266",
month = dec,
year = "1982",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin, Computer Sciences Dep,
Austin, Tex, USA",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "branching time temporal logic; concurrent programs;
finite model property; mathematical programming;
synchronization skeletons",
}
@Article{Partsch:1983:ETD,
author = "H. Partsch",
title = "An Exercise in the Transformational Derivation of an
Efficient Program by Joint Development of Control and
Data Structure",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "1",
pages = "1--35",
month = apr,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N05",
MRnumber = "85a:68015",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/AG.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.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,
affiliation = "Technische Univ, Inst f{\"u}r Informatik, Munich, West
Ger",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; program development",
}
@Article{Pritchard:1983:CSN,
author = "Paul A. Pritchard",
title = "A Case Study of Number-Theoretic Computation:
Searching for Primes in Arithmetic Progression",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "1",
pages = "37--63",
month = apr,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "11Y55 (11-04 11B25)",
MRnumber = "85g:11119",
MRreviewer = "Sol Weintraub",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Dep of Computer Science, Ithaca, NY,
USA",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; mathematical techniques ---
Number Theory; number-theoretic computation",
}
@Article{Apt:1983:PRT,
author = "K. R. Apt and E.-R. Olderog",
title = "Proof rules and transformations dealing with
fairness",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "1",
pages = "65--100",
month = apr,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B70)",
MRnumber = "85a:68117",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ de Paris 7, Paris, Fr",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; mathematical programming;
nondeterministic do-od-programs; proof rules; random
assignment; transformations dealings with fairness",
}
@Article{Francez:1983:ENC,
author = "Nissim Francez",
title = "Extended Naming Conventions for Communicating
Processes",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "1",
pages = "101--114",
month = apr,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10",
MRnumber = "85f:68029",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Research Cent, Mathematical
Sciences Dep, Yorktown Heights, NY, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating sequential processes; computed
communication targets; computer programming languages;
cooperating proofs; distributed programs verification;
information science; naming conventions",
}
@Article{Paulson:1983:HOI,
author = "Lawrence C. Paulson",
title = "A Higher-Order Implementation of Rewriting",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "2",
pages = "119--149 (or 119--150??)",
month = aug,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68G15 (03B35)",
MRnumber = "84m:68088",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
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/SCP.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;
MathSciNet database",
URL = "http://www.cl.cam.ac.uk/Research/Reports/TR035-lcp-rewriting.dvi.gz",
acknowledgement = ack-nhfb,
affiliation = "Univ of Cambridge, Computer Lab, Cambridge, Engl",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer metatheory; functional; functional
programming; higher-order functions; higher-order
functions, LCF, conversions; interactive theorem
prover; rewriting rules",
scope = "appl",
}
@Article{Kahn:1983:MFS,
author = "G. Kahn and B. Lang and B. M{\'e}l{\`e}se and E.
Morcos",
title = "{Metal}: {A} formalism to specify formalisms",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "2",
pages = "151--188",
month = aug,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.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/rewrite.bib",
abstract = "via enews",
acknowledgement = ack-nhfb,
affiliation = "Inst Natl de Recherche en Informatique et en
Automatique, Le Chesnay, Fr",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming languages; context sensitive
grammar, CSG, attribute, checking, metal; formalisms
manipulation; metal language; tree manipulation
language mentol; virtual tree building machine",
}
@Article{Dix:1983:EIC,
author = "Trevor I. Dix",
title = "Exceptions and Interrupts in {CSP}",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "2",
pages = "189--204",
month = aug,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/SEL-HPC.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Melbourne, Dep of Computer Science, Parkville,
Victoria, Aust",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating sequential processes (CSP); computer
programming languages; CSP, CCS, exception, interrupt,
communication, parallel; interrupts; preemptive
commands",
}
@Article{Katajainen:1983:AIK,
author = "Jyrki Katajainen and Olli Nevalainen",
title = "An Alternative for the Implementation of {Kruskal}'s
Minimal Spanning Tree Algorithm",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "2",
pages = "205--216",
month = aug,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Turku, Dep of Mathematical Sciences, Turku,
Finl",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "bucket sort; computer programming; Kruskal's minimal
spanning tree; sorting",
}
@Article{Rem:1983:SPEa,
author = "M. Rem",
title = "Small Programming Exercises",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "2",
pages = "217--222",
month = aug,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "mathematical programming; programming exercises",
}
@Article{Ganzinger:1983:IML,
author = "Harald Ganzinger",
title = "Increasing modularity and language-independency in
automatically generated compilers",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "3",
pages = "223--278",
month = dec,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N20",
MRnumber = "86e:68018",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Functional.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
MathSciNet database",
note = "See also: Bericht TUM-I8306, Institut f{\"u}r
Informatik, Tech. University M{\"u}nchen (July 1983).",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ M{\"u}nchen, Inst f{\"u}r Informatik,
Munich, West Ger",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "abstract semantic algebras; automatic compiler
generation; computer operating systems; computer
programming languages; computer software --- Modular
Construction; language independent modules; modular
compiler description; sema",
}
@Article{Barbuti:1983:SAS,
author = "R. Barbuti and A. Martelli",
title = "A structured approach to static semantics
correctness",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "3",
pages = "279--312 (or 279--311??)",
month = dec,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68F20",
MRnumber = "84m:68077",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ di Pisa, Dep di Informatica, Pisa, Italy",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming --- Algorithms; computer
programming languages; correctness proof; fundamental
semantic concepts; simple imperative language; static
checking algorithm; static semantics",
}
@Article{Rem:1983:SPEb,
author = "M. Rem",
title = "Small Programming Exercises $2$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "3",
number = "3",
pages = "313--319",
month = dec,
year = "1983",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
}
@Article{Schneider:1984:FTB,
author = "Fred B. Schneider and David Gries and Richard D.
Schlichting",
title = "Fault-Tolerant Broadcasts",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "1",
pages = "1--15",
month = apr,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68M10",
MRnumber = "85e:68004",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/formal.hardware.verification.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Dep of Computer Science, Ithaca, NY,
USA",
classification = "722; 723",
journalabr = "Sci Comput Program",
keywords = "computer networks --- Protocols; computer systems,
digital; fault tolerant broadcast protocol; operating
systems distributed systems networks fault tolerance",
}
@Article{Partsch:1984:STD,
author = "H. Partsch",
title = "Structuring Transformational Developments: {A} Case
Study Based on {Earley}'s Recognizer",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "1",
pages = "17--44",
month = apr,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N05",
MRnumber = "85e:68006",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ M{\"u}nchen, Inst f{\"u}r Informatik,
Munich, West Ger",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; Earley's recognizer;
transformational programming",
}
@Article{Abrial:1984:MCP,
author = "Jean-Raymond R. Abrial",
title = "The Mathematical Construction of a Program",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "1",
pages = "45--86",
month = apr,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B35 03B70)",
MRnumber = "86g:68118",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/Ciancarini.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/dependability.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
annote = "This paper is an exercise in program construction
using mathematics as a tool. The program which the
author undertook the construction of is a general
purpose proof checker. It is 'general purpose' in that
it may take as input the axiomatization of a formal
theory together with a proof written within this
theory. As output it delivers a result which tells us
whether the proof is correct or not. In order to test
the generality of the proposed approach, the author
uses the proof checker to check proofs written within
theories such as propositional calculus and predicate
calculus and set theory.",
classification = "723; 921",
journalabr = "Sci Comput Program",
keyword = "formal methods, semantics",
keywords = "computer programming; general purpose proof checker;
mathematical construction; mathematical techniques ---
Set Theory; predicate calculus; program construction;
programming theory; propositional calculus; set
theory",
page = "45-86",
}
@Article{Rem:1984:SPEa,
author = "M. Rem",
title = "Small Programming Exercises $3$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "1",
pages = "87--94",
month = apr,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
}
@Article{Broy:1984:SAL,
author = "Manfred Broy and Friedrich L. Bauer",
title = "A Systematic Approach to Language Constructs for
Concurrent Programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "2",
pages = "103--139",
month = aug,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10 (68N15)",
MRnumber = "86g:68046",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ Passau, Fakult{\"a}t f{\"u}r Mathematik und
Informatik, Passau, West Ger",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer programming languages
--- Applications; concurrent programming; language
constructs",
}
@Article{Sokolowski:1984:PCT,
author = "Stefan Soko{\l}owski",
title = "Partial Correctness: The Term-Wise Approach",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "2",
pages = "141--157",
month = aug,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B70)",
MRnumber = "87i:68052",
MRreviewer = "W. Damm",
bibdate = "Sun Oct 10 08:24:00 MDT 1999",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
}
@Article{Gerth:1984:PSC,
author = "Rob Gerth and Willem P. {De Roever}",
title = "A Proof System for Concurrent {ADA} Programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "2",
pages = "159--204",
month = aug,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B70)",
MRnumber = "85j:68073",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Utrecht, Dep of Computer Science, Utrecht,
Neth",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "ada programming language; computer programming;
concurrency fragment (cf); correctness of ada programs;
proof system",
}
@Article{Rem:1984:SPEb,
author = "M. Rem",
title = "Small Programming Exercises $4$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "2",
pages = "205--210",
month = aug,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
classification = "723; 901",
journalabr = "Sci Comput Program",
keywords = "computer programming --- Algorithms; computer
software; problem analysis; problem of mirrors;
programming exercises",
}
@Article{Wagner:1984:CQP,
author = "Robert Wagner and Robert Geist",
title = "The Crippled Queen Placement Problem",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "3",
pages = "221--248",
month = dec,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q20 (68R05)",
MRnumber = "86g:68068",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Duke Univ, Dep of Computer Science, Durham, NC, USA",
classification = "723; 921; 922",
journalabr = "Sci Comput Program",
keywords = "computer aided design --- Mathematical Models;
computer programming; crippled queen placement problem;
difficulty in debugging; execution speed; mathematical
techniques --- Combinatorial Mathematics; textual
compactness and clarity; top-down tree of design",
}
@Article{Shyamasundar:1984:SLF,
author = "R. K. Shyamasundar",
title = "A Simple Livelock-Free Algorithm for Packet
Switching",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "3",
pages = "249--256",
month = dec,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68M10",
MRnumber = "86f:68011",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Tata Inst of Fundamental Research, Natl Cent for
Software Development \& Computing Techniques, Bombay,
India",
affiliationaddress = "\& Computing Techniques, Bombay, India",
classification = "718; 723",
journalabr = "Sci Comput Program",
keywords = "banker's algorithm; computer networks; computer
programming; computers --- Data Communication Systems;
data transmission --- Packet Switching; deadlock-free
algorithm; livelock-free algorithm; packets in cycle;
store-and-forward deadlock (sfd)",
}
@Article{Manna:1984:APP,
author = "Zohar Manna and Amir Pnueli",
title = "Adequate Proof Principles for Invariance and Liveness
Properties of Concurrent Programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "3",
pages = "257--290 (or 257--289??)",
month = dec,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B70)",
MRnumber = "86j:68092",
MRreviewer = "Michael Bauer",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/Bmethod.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ, Computer Science Dep, Stanford, CA,
USA",
classification = "721; 723; 921",
journalabr = "Sci Comput Program",
keywords = "adequate proof principles; automata theory ---
Computational Linguistics; computer programming;
concurrent programs; invariance and liveness
properties; program instructions; well-founded
assertions",
}
@Article{Cointe:1984:EVV,
author = "Pierre Cointe",
title = "Une extension de {VLISP} vers les objets. ({French})
[{An} extension of {VLISP} to objects]",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "3",
pages = "291--322",
month = dec,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N15",
MRnumber = "776 777",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "IRCAM, Paris, Fr",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer programming languages
--- lisp; data processing --- Data Structures;
hierarchical classes; lisp control structure; message
passing; object-oriented programming; VLISP extension",
language = "French",
}
@Article{Rem:1984:SPEc,
author = "M. Rem",
title = "Small programming exercises $5$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "4",
number = "3",
pages = "323--333",
month = dec,
year = "1984",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N99",
MRnumber = "776 778",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
affiliationaddress = "Eindhoven, Neth",
classification = "921",
journalabr = "Sci Comput Program",
keywords = "binary relation; directed graphs; graph
representation; mathematical programming; mathematical
techniques --- Graph Theory; set of vertices; small
programming exercises",
}
@Article{Koomen:1985:ASV,
author = "C. J. Koomen",
title = "Algebraic specification and verification of
communication protocols",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "1",
pages = "1--36",
month = feb,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10 (68Q60)",
MRnumber = "86e:68038",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/SCP.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,
affiliation = "Philips Research Lab, Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "algebraic specification; calculus of communication
systems (ccs); communication protocols; computer
networks --- Protocols; computers; switching nodes;
verification",
}
@Article{Smith:1985:DDC,
author = "Douglas R. Smith",
title = "The design of divide and conquer algorithms",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "1",
pages = "37--58",
month = feb,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q20 (68P10)",
MRnumber = "86e:68046",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "US Naval Postgraduate Sch, Dep of Computer Science,
Monterey, CA, USA",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer systems programming ---
Sorting; divide and conquer algorithms; list of
numbers; mathematical techniques --- Set Theory",
}
@Article{Tarlecki:1985:LSP,
author = "Andrzej Tarlecki",
title = "A language of specified programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "1",
pages = "59--81",
month = feb,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (68N15)",
MRnumber = "86c:68058",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/Ciancarini.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Polish Acad of Sciences, Inst of Computer Science,
Warsaw, Pol",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming languages; computer programs ---
Analysis; provably-correct programs; specified
programs",
}
@Article{Jalili:1985:GIE,
author = "Fahimeh Jalili",
title = "A general incremental evaluator for attribute
grammars",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "1",
pages = "83--96",
month = feb,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q50",
MRnumber = "86e:68066",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Siemens Research \& Technology Lab, Princeton, NJ,
USA",
classification = "721; 723; 921",
journalabr = "Sci Comput Program",
keywords = "attribute evaluator; attribute grammars; automata
theory; computer programming languages; dependency
graphs; mathematical techniques --- Trees;
production-labelled semantic tree",
}
@Article{Rem:1985:SPEa,
author = "M. Rem",
title = "Small Programming Exercises $6$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "1",
pages = "97--106",
month = feb,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
affiliationaddress = "Eindhoven, Neth",
classification = "921",
journalabr = "Sci Comput Program",
keywords = "directed graphs; mathematical programming;
mathematical techniques --- Graph Theory;
tripartitioning technique; vertices and arcs",
}
@Article{Meyer:1985:SPS,
author = "Bertrand Meyer and Jean-Marc Nerson and Soon Hae Ko",
title = "Showing Programs on a Screen",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "2",
pages = "111--142",
month = jun,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Santa Barbara, Computer Science
Dep, Santa Barbara, CA, USA",
affiliationaddress = "Barbara, CA, USA",
classification = "722; 723; 741",
journalabr = "Sci Comput Program",
keywords = "calculus of windows; cepage structural editor;
computer peripheral equipment --- Imaging Techniques;
computer programming --- Algorithms; data processing
--- Data Structures; display devices; screen
allocation",
}
@Article{Paulson:1985:VUA,
author = "Lawrence C. Paulson",
title = "Verifying the Unification Algorithm in {LCF}",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "2",
pages = "143--169",
month = jun,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68T15",
MRnumber = "86m:68126",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Cambridge, Computer Lab, Cambridge, Engl",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer metatheory --- Programming Theory; computer
programming; domain-theoretic logic; theory of
substitutions and unification; unification algorithm",
}
@Article{Bergstra:1985:TDA,
author = "J. A. Bergstra and J. V. Tucker",
title = "Top-Down Design and the Algebra of Communicating
Processes",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "2",
pages = "171--199",
month = jun,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10",
MRnumber = "86m:68041",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cent for Mathematics \& Computer Science, Amsterdam,
Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "algebraic tools; axioms for communicating processes
(acp); computer networks --- Protocols; computer
programming --- Mathematical Models; computers;
concurrent systems; levels of abstraction; top-down
design",
}
@Article{Finance:1985:MLC,
author = "Jean-Pierre Finance and Jeanine Souqui{\`e}res",
title = "A method and a language for constructing iterative
programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "2",
pages = "201--218",
month = jun,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N05",
MRnumber = "793 535",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cent de Recherche en Informatique de Nancy,
Vandoeuvre-les-Nancy, Fr",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer programming languages;
intermediate objects; iterative programs; problem
static solution; support language",
}
@Article{Rem:1985:SPEb,
author = "M. Rem",
title = "Small Programming Exercises $7$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "2",
pages = "219--229",
month = jun,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
affiliationaddress = "Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "binary representations of numbers; computer
programming; longest recurring segment; mathematical
techniques --- Trees; programming exercises; segments
of arrays",
}
@Article{Souquieres:1985:DII,
author = "Jeanine Souqui{\`e}res and Jean-Pierre Finance",
title = "Description and Improvement of Iterative Program
Transformations",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "3",
pages = "233--264",
month = oct,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N05",
MRnumber = "811 613",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cent de Recherche en Informatique de Nancy,
Vandoeuvre-les-Nancy, Fr",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer programming languages;
iterative program transformations; mathematical
techniques --- Iterative Methods; program construction
method; sequence data types; sequential languages;
transformations rules",
}
@Article{Martin:1985:DME,
author = "Alain J. Martin",
title = "Distributed Mutual Exclusion on a Ring of Processes",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "3",
pages = "265--276",
month = oct,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10 (68N25)",
MRnumber = "87a:68056",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "California Inst of Technology, Pasadena, CA, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communication sequential process (CSP); computer
programming languages; distributed mutual exclusion;
information theory --- Communication Channels;
interleaving rules; ring of processes; semantics",
}
@Article{Moitra:1985:ACC,
author = "Abha Moitra",
title = "Automatic construction of {CSP} programs from
sequential nondeterministic programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "3",
pages = "277--307",
month = oct,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10",
MRnumber = "87a:68058",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Computer Science Dep, Ithaca, NY, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating processes; communication sequential
process program; computer programming; computer
programming languages; CSP; distributed program
construction; information theory --- Communication
Channels; sequential non-deterministic programs",
}
@Article{Rem:1985:SPEc,
author = "M. Rem",
title = "Small Programming Exercises $8$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "5",
number = "3",
pages = "309--316",
month = oct,
year = "1985",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computer Science, Eindhoven, Neth",
affiliationaddress = "Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "auxiliary arrays; computer programming; eventually
periodic sequences; mathematical programming;
programming exercises",
}
@Article{McCurley:1986:DDA,
author = "Robert McCurley and Fred B. Schneider",
title = "Derivation of a Distributed Algorithm for Finding
Paths in Directed Networks",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "1",
pages = "1--9",
month = jan,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Ithaca, NY, USA",
classification = "723; 731",
journalabr = "Sci Comput Program",
keywords = "computer networks; computer programming; derivation;
directed networks; distributed algorithm; electric
networks, communication --- Topology; information
theory --- Communication Channels",
}
@Article{Bellegarde:1986:RSF,
author = "Fran{\c{c}}oise Bellegarde",
title = "Rewriting Systems on {FP} expressions to reduce the
number of sequences yielded",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "1",
pages = "11--34",
month = jan,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib",
acknowledgement = ack-nhfb,
affiliation = "CRIN, Vandoeuvre-les-Nancy, Fr",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "functional expressions; functional programming (fp);
intermediate sequences elimination; mathematical
programming; mathematical transformations; number of
sequences yielded reduction; rewriting systems",
}
@Article{Francez:1986:SCA,
author = "Nissim Francez and Brent Hailpern and Gadi
Taubenfeld",
title = "Script: a Communication Abstraction Mechanism and its
Verification",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "1",
pages = "35--88",
month = jan,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Technion, Haifa, Isr",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating sequential processes (CSP) language;
communication abstraction mechanism; computer
programming languages --- Ada; computers; proof rules;
script; shared-variable language",
}
@Article{Wiltink:1986:TMN,
author = "J. G. Wiltink",
title = "Two Most Nondeterministic Programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "1",
pages = "89--94",
month = jan,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; final state; initial states;
nondeterministic programs; termination",
}
@Article{Rem:1986:SPEa,
author = "M. Rem",
title = "Small Programming Exercise 9",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "1",
pages = "95--102",
month = jan,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming; Education",
}
@Article{Guttag:1986:RLS,
author = "J. V. Guttag and J. J. Horning",
title = "Report on the {Larch} Shared Language",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "2",
pages = "103--134",
month = mar,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "MIT, Lab for Computer Science, Cambridge, MA, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "Components; computer programming languages; formal
specification languages; language specifications; larch
shared language",
}
@Article{Guttag:1986:LSL,
author = "J. V. Guttag and J. J. Horning",
title = "A {Larch} Shared Language Handbook",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "2",
pages = "135--158 (or 135--157??)",
month = mar,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Misc/Ciancarini.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib",
acknowledgement = ack-nhfb,
affiliation = "MIT, Lab for Computer Science, Cambridge, MA, USA",
classification = "723",
journalabr = "Sci Comput Program",
keyword = "formal design",
keywords = "Components; computer programming languages; container
classes; container properties; larch shared language
handbook; smallest useful increments",
}
@Article{Bird:1986:TPP,
author = "R. S. Bird",
title = "Transformational programming and the paragraph
problem",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "2",
pages = "159--190 (or 159--189??)",
month = mar,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib",
acknowledgement = ack-nhfb,
affiliation = "Oxford Univ, Programming Research Group, Oxford,
Engl",
classification = "722; 921",
journalabr = "Sci Comput Program",
keywords = "algebraic properties of waste functions; breaking
paragraphs into lines; computer programming;
mathematical programming, dynamic; optimization;
transformational programming; two linear-time
algorithms",
}
@Article{Zielinski:1986:MEP,
author = "Krzysztof Zielinski",
title = "Model of Error Propagation in Systems of Communicating
Processes",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "2",
pages = "191--205",
month = mar,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
ftp://ftp.ira.uka.de/pub/bibliography/Theory/eureca.bib",
acknowledgement = ack-nhfb,
affiliation = "Stanislaw Staszic Univ of Mining \& Metallurgy, Inst
of Computer Science, Cracow, Pol",
affiliationaddress = "Science, Cracow, Pol",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating processes; computer networks ---
Protocols; computer systems, digital --- Distributed;
computers, microcomputer; error propagation model;
error recovery method; recovery function",
}
@Article{Rem:1986:SPEb,
author = "M. Rem",
title = "Small Programming Exercises $10$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "2",
pages = "207--211",
month = mar,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Dep of Mathematics \&
Computing Science, Eindhoven, Neth",
affiliationaddress = "Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "acyclic directed graph; mathematical programming,
linear; mathematical techniques --- Graph Theory;
Strahler number of a binary tree",
}
@Article{vanDiepen:1986:PDT,
author = "N. W. P. {van Diepen} and W. P. {de Roever}",
title = "Program Derivation Through Transformations: the
Evolution of List-Copying Algorithms",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "3",
pages = "213--272",
month = may,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Cent for Mathematics \& Computer Science, Amsterdam,
Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer metatheory --- Probabilistic Logics; computer
programming; correctness proofs; Hoare logic;
list-copying algorithms; mathematical techniques ---
Graph Theory; program transformation; small sequential
programs",
}
@Article{Fairbairn:1986:NTF,
author = "Jon Fairbairn",
title = "New Type-Checker for a Functional Language",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "3",
pages = "273--290",
month = may,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Cambridge Univ, Cambridge, Engl",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer programming --- Algorithms; computer
programming languages; functional language; polymorphic
type-checker; ponder programming language;
type-validity",
}
@Article{Stoye:1986:MFO,
author = "William Stoye",
title = "Message-Based Functional Operating Systems",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "3",
pages = "291--311",
month = may,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Cambridge, Cambridge, Engl",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer operating systems; computer programming
languages; functional language; message passing;
message-based functional operating systems",
}
@Article{Rem:1986:SPEc,
author = "M. Rem",
title = "Small Programming Exercises $11$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "6",
number = "3",
pages = "313--318",
month = may,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "723; 921; 922",
journalabr = "Sci Comput Program",
keywords = "computer programming; longest common subsequence of
two arrays; mathematical techniques --- Set Theory;
maximal length array segment; programming exercises;
topmost row determination",
}
@Article{Joseph:1986:SMA,
author = "Thomas A. Joseph and Thomas R{\"a}uchle and Sam
Toueg",
title = "State Machines and Assertions: an Integrated Approach
to Modeling and Verification of Distributed Systems",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "1",
pages = "1--22",
month = jul,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q10 (68Q60)",
MRnumber = "853 693",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Ithaca, NY, USA",
classification = "722; 723; 921",
journalabr = "Sci Comput Program",
keywords = "alternating bit protocol; asynchronous message
passing; computer networks --- Protocols; computer
systems, digital; mathematical models; protocol
verification; sliding window flow control protocol;
state machines",
}
@Article{vanderNat:1986:ACD,
author = "M. {van der Nat} and A. A. Verrijn-Stuart",
title = "Analysing a Class of Distributive Partitioning Sort
Algorithms",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "1",
pages = "23--33",
month = jul,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68P10",
MRnumber = "87h:68019",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
classification = "723",
journalabr = "Sci Comput Program",
keywords = "Algorithms; computer programming; distributive
partitioning sort algorithms; key range; linear time
complexity",
}
@Article{Broy:1986:AIP,
author = "Manfred Broy and Bernhard M{\"o}ller and Peter Pepper
and Martin Wirsing",
title = "Algebraic Implementations Preserve Program
Correctness",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "1",
pages = "35--53",
month = jul,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q65",
MRnumber = "88m:68040",
MRreviewer = "Autorreferat",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Univ Passau, Passau, West Ger",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "abstract data types; algebraic implementations;
computer programming; concrete data types; data
processing --- Data Structures; program correctness",
}
@Article{vandeSnepscheut:1986:DDI,
author = "Jan L. A. {van de Snepscheut}",
title = "A derivation of a distributed implementation of
{Warshall}'s algorithm",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "1",
pages = "55--60",
month = jul,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q20 (68R05)",
MRnumber = "853 696",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Groningen Univ, Groningen, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "boolean matrices; computer metatheory --- Boolean
Algebra; computer programming; distributed
implementation; mathematical techniques --- Matrix
Algebra; Warshall's algorithm",
}
@Article{Voisin:1986:CTI,
author = "Frederic Voisin",
title = "{CIGALE}: a tool for interactive grammar construction
and expression parsing",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "1",
pages = "61--86",
month = jul,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/SE/COMPASS.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ Paris-Sud, Orsay, Fr",
classification = "721",
journalabr = "Sci Comput Program",
keywords = "abstract data types; automata theory; expression
parsing; Grammars; incremental definition of languages;
interactive grammar construction",
}
@Article{Rem:1986:SPEd,
author = "M. Rem",
title = "Small Programming Exercises $12$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "1",
pages = "87--97",
month = jul,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "921",
journalabr = "Sci Comput Program",
keywords = "alphanumerica; balanced integer array; balanced
segment maximum length; flag; iterative versus
recursive printing; mathematical programming",
}
@Article{Partsch:1986:TPD,
author = "H. Partsch",
title = "Transformational Program Development in a Particular
Problem Domain",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "2",
pages = "99--241",
month = sep,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q99 (68N15 68T20)",
MRnumber = "88a:68083",
MRreviewer = "Laurent Kott",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ M{\"u}nchen, Munich, West Ger",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "automata theory --- Grammars; computer operating
systems --- Program Compilers; computer programming;
correctness-preserving transformation rules;
mathematical programming; problem domain;
transformational programming",
}
@Article{Rem:1986:SPEe,
author = "M. Rem",
title = "Small Programming Exercises $13$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "2",
pages = "243--248",
month = sep,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "digraph; directed graph; equidistance; mathematical
programming; mathematical techniques --- Graph Theory",
}
@Article{Burn:1986:SAH,
author = "Geoffrey L. Burn and Chris Hankin and Samson
Abramsky",
title = "Strictness Analysis for Higher-Order Functions",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "3",
pages = "249--278",
month = nov,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N05 (68Q55)",
MRnumber = "88b:68010",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "GEC, Wembley, Engl",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming; computer programming languages
--- Analysis; computer systems, digital --- Parallel
Processing; functional languages; higher-order
functions; lazy semantics; mathematical programming;
strictness analysis",
}
@Article{Josephs:1986:FPS,
author = "Mark B. Josephs",
title = "Functional Programming with Side-Effects",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "3",
pages = "279--296",
month = nov,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68N05 (68T25)",
MRnumber = "88a:68006",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Oxford Univ, Oxford, Engl",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer programming languages; extended language
syntax; functional and logic programming languages;
functional programming; mathematical programming;
mathematical techniques --- Trees",
}
@Article{Inoue:1986:COM,
author = "Katsuro Inoue and Hiroyuki Seki and Kenichi Taniguchi
and Tadao Kasami",
title = "Compiling and Optimizing Methods for the Functional
Language Asl/{F}",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "3",
pages = "297--312",
month = nov,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Univ of Hawaii, Honolulu, HI, USA",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer operating systems; computer programming ---
Algorithms; computer programming languages ---
Optimization; execution time reduction; functional
programming language asl/f; memory space requirements
reduction; object program translation",
}
@Article{Rem:1986:SPEf,
author = "M. Rem",
title = "Small Programming Exercises $14$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "7",
number = "3",
pages = "313--319",
month = nov,
year = "1986",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "finite sequence of symbols; mathematical programming,
linear; small programming exercises; trace theory",
}
@Article{Chisholm:1987:DPA,
author = "Paul Chisholm",
title = "Derivation of a parsing algorithm in
{Martin-L{\"o}f}'s theory of types",
journal = j-SCI-COMPUT-PROGRAM,
volume = "8",
number = "1",
pages = "1--42",
month = feb,
year = "1987",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q55 (03B15 03B70 03F50 68N05 68Q60)",
MRnumber = "89a:68146",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/ml.bib;
ftp://ftp.ira.uka.de/pub/bibliography/SE/obscure.bib;
MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Heriot-Watt Univ, Edinburgh, Scotl",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer metatheory --- Formal Logic; computer
programming; computer programming languages;
constructive mathematics formalization; correctness
proof; martin-lof's type theory language; mathematical
programming; parsing algorithm derivation",
}
@Article{Joseph:1987:PRF,
author = "Mathai Joseph and Abha Moitra and Neelam
Soundararajan",
title = "Proof Rules for Fault Tolerant Distributed Programs",
journal = j-SCI-COMPUT-PROGRAM,
volume = "8",
number = "1",
pages = "43--67",
month = feb,
year = "1987",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68Q60 (03B70 68M10 68Q10)",
MRnumber = "88b:68131",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database; MathSciNet database",
acknowledgement = ack-nhfb,
affiliation = "Tata Inst of Fundamental Research, Bombay, India",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "communicating sequential process (CSP); computer
programming; computer systems, digital --- Distributed;
computers --- Data Communication Systems; fault
tolerant distributed programs; Hoare's CSP; proof
rules",
}
@Article{Kirchner:1987:RIG,
author = "Claude Kirchner and H{\'e}l{\`e}ne Kirchner",
title = "{REVEUR-3}: The implementation of a general completion
procedure parameterized by built-in theories and
strategies",
journal = j-SCI-COMPUT-PROGRAM,
volume = "8",
number = "1",
pages = "69--86",
month = feb,
year = "1987",
CODEN = "SCPGD4",
ISSN = "0167-6423",
MRclass = "68T15 (03B35); 68Q42 68N05",
MRnumber = "88b:68171",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database;
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",
acknowledgement = ack-nhfb,
affiliation = "Cent de Recherche en Informatique de Nancy, Vandoeuvre
les Nancy, Fr",
classification = "723; 921",
journalabr = "Sci Comput Program",
keywords = "computer metatheory; computer software; equational
rewriting; general completion procedure; parameterized
general completion procedure; REVEUR-3 software",
}
@Article{Kolbl:1987:LFS,
author = "Stefan Kolbl and Mitchell Wand",
title = "Linear Future Semantics and its Implementation",
journal = j-SCI-COMPUT-PROGRAM,
volume = "8",
number = "1",
pages = "87--103",
month = feb,
year = "1987",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Indiana Univ, Bloomington, IN, USA",
classification = "723",
journalabr = "Sci Comput Program",
keywords = "computer metatheory --- Binary Sequences; computer
programming languages; computer systems, digital ---
Multiprocessing; linear future semantics
implementation; linear history semantics; standard
continuation semantics",
}
@Article{Rem:1987:SPEa,
author = "M. Rem",
title = "Small Programming Exercises $15$",
journal = j-SCI-COMPUT-PROGRAM,
volume = "8",
number = "1",
pages = "105--112",
month = feb,
year = "1987",
CODEN = "SCPGD4",
ISSN = "0167-6423",
bibdate = "Sun Oct 10 09:12:09 MDT 1999",
bibsource = "Compendex database",
acknowledgement = ack-nhfb,
affiliation = "Eindhoven Univ of Technology, Eindhoven, Neth",
classification = "721; 723; 921",
journalabr = "Sci Comput Program",
keywords = "acyclic xor-composition; electronic circuits, digital
--- Testing;