# strtab

key: ack-jc
filename: unix.bib
value:
Jim Cobb, Design Systems Division, Evans and Sutherland Corporation, 580 Arapeen Drive, P. O. Box 58700, Salt Lake City, UT 84158, USA, Tel: +1 801 582 5847, FAX: +1 801 582 0524, e-mail: path |jcobb@dsd.es.com|

entry:
@String{ack-jc =     "Jim Cobb,
                    Design Systems Division,
                    Evans and Sutherland Corporation,
                    580 Arapeen Drive,
                    P. O. Box 58700,
                    Salt Lake City, UT 84158,
                    USA,
                    Tel: +1 801 582 5847,
                    FAX: +1 801 582 0524,
                    e-mail: \path|jcobb@dsd.es.com|"}


key: ack-jsq
filename: unix.bib
value:
John S. Quarterman, Matrix Information and Directory Services, Inc. (MIDS), 1106 Clayton Lane, Suite 500W, Austin, TX 78723, USA, Tel: +1-512-451-7602, FAX: +1-512-450-1436, e-mail: path |jsq@tic.com|

entry:
@String{ack-jsq  = "John S. Quarterman,
                    Matrix Information and Directory Services, Inc. (MIDS),
                    1106 Clayton Lane, Suite 500W,
                    Austin, TX 78723,
                    USA,
                    Tel: +1-512-451-7602,
                    FAX: +1-512-450-1436,
                    e-mail: \path|jsq@tic.com|"}


key: ack-nhfb
filename: unix.bib
value:
Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: path |beebe@math.utah.edu|, path |beebe@acm.org|, path |beebe@computer.org| (Internet), URL: path |https://www.math.utah.edu/~beebe/|

entry:
@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|https://www.math.utah.edu/~beebe/|"}


key: ack-woh
filename: unix.bib
value:
Walt O. Haas, Department of Computer Science, University of Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581 5617, e-mail: path |haas@ski.utah.edu|

entry:
@String{ack-woh  = "Walt O. Haas,
                    Department of Computer Science,
                    University of Utah,
                    Salt Lake City, UT 84112, USA,
                    Tel: +1 801 581 5617,
                    e-mail: \path|haas@ski.utah.edu|"}


key: inst-ANL:adr
value: 9700 South Cass Avenue, Argonne, IL 60439-4801, USA
filename: unix.bib
entry:
@String{inst-ANL:adr            = "9700 South Cass Avenue, Argonne, IL
                                  60439-4801, USA"}


key: inst-ANL-MCS
value: Mathematics and Computer Science Division, Argonne National Laboratory
filename: unix.bib
entry:
@String{inst-ANL-MCS            = "Mathematics and Computer Science
                                  Division, Argonne National Laboratory"}


key: inst-ANL-MCS:adr
value: 9700 South Cass Avenue, Argonne, IL 60439-4801, USA
filename: unix.bib
entry:
@String{inst-ANL-MCS:adr        = "9700 South Cass Avenue, Argonne, IL
                                  60439-4801,
                                  USA"}


key: inst-CLSC
value: College of Science Computer, University of Utah
filename: unix.bib
entry:
@String{inst-CLSC               = "College of Science Computer, University of
                                  Utah"}


key: inst-CSC
value: Center for Scientific Computing, Department of Mathematics, University of Utah
filename: unix.bib
entry:
@String{inst-CSC                = "Center for Scientific Computing,
                                  Department of Mathematics, University of
                                  Utah"}


key: inst-MIT-AI
value: Massachusetts Institute of Technology, Artificial Intelligence Laboratory
filename: unix.bib
entry:
@String{inst-MIT-AI             = "Massachusetts Institute of Technology,
                                  Artificial Intelligence Laboratory"}


key: inst-SAS:adr
value: SAS Circle, Box 8000, Cary, NC 27512-8000, USA
filename: unix.bib
entry:
@String{inst-SAS:adr            = "SAS Circle, Box 8000, Cary, NC
                                  27512-8000, USA"}


key: inst-UCB-CS
value: Computing Services, University of California, Berkeley
filename: unix.bib
entry:
@String{inst-UCB-CS             = "Computing Services, University of California,
                                  Berkeley"}


key: inst-UIUC-CSRD
value: University of Illinois at Urbana-Champaign, Center for Supercomputing Research and Development
filename: unix.bib
entry:
@String{inst-UIUC-CSRD          = "University of Illinois at Urbana-Champaign,
                                  Center for Supercomputing Research and
                                  Development"}


key: inst-UT-CS
value: Department of Computer Science, University of Tennessee, Knoxville
filename: unix.bib
entry:
@String{inst-UT-CS              = "Department of Computer Science,
                                  University of Tennessee, Knoxville"}


key: j-CACM
value: Communications of the Association for Computing Machinery
filename: unix.bib
entry:
@String{j-CACM                  = "Communications of the Association for
                                  Computing Machinery"}


key: j-CCPE
value: Concurrency and Computation: Practice and Experience
filename: unix.bib
entry:
@String{j-CCPE                  = "Concurrency and Computation: Prac\-tice and
                                   Experience"}


key: j-CHANCE
value: Chance: a magazine for people interested in the analysis of data
filename: unix.bib
entry:
@String{j-CHANCE                = "Chance: a magazine for people interested in
                                  the analysis of data"}


key: j-COMP-NET
value: Computer Networks: The International Journal of Distributed Informatique
filename: unix.bib
entry:
@String{j-COMP-NET              = "Computer Networks: The International Journal
                                   of Distributed Informatique"}


key: j-COMP-NET-AMSTERDAM
value: Computer Networks (Amsterdam, Netherlands: 1999)
filename: unix.bib
entry:
@String{j-COMP-NET-AMSTERDAM    = "Computer Networks (Amsterdam, Netherlands:
                                  1999)"}


key: j-DEC-TECH-J
value: Digital Technical Journal of Digital Equipment Corporation
filename: unix.bib
entry:
@String{j-DEC-TECH-J            = "Digital Technical Journal of
                                  Digital Equipment Corporation"}


key: j-DIGEST-PAPERS-IEEE-SYMP-MASS-STOR-SYS
value: Digest of Papers --- IEEE Symposium on Mass Storage Systems
filename: unix.bib
entry:
@String{j-DIGEST-PAPERS-IEEE-SYMP-MASS-STOR-SYS = "Digest of Papers --- IEEE
                                  Symposium on Mass Storage Systems"}


key: j-IEEE-EXPERT
value: IEEE expert: intelligent systems and their applications
filename: unix.bib
entry:
@String{j-IEEE-EXPERT           = "IEEE expert: intelligent systems and their
                                  applications"}


key: j-IEEE-TRANS-CIRCUITS-SYST-1
value: IEEE Transactions on Circuits and Systems I: Regular Papers
filename: unix.bib
entry:
@String{j-IEEE-TRANS-CIRCUITS-SYST-1 = "IEEE Transactions on Circuits and
                                Systems I: Regular Papers"}


key: j-IEEE-TRANS-CIRCUITS-SYST-II-EXPRESS-BRIEFS
value: IEEE Transactions on Circuits and Systems II: Express Briefs
filename: unix.bib
entry:
@String{j-IEEE-TRANS-CIRCUITS-SYST-II-EXPRESS-BRIEFS = "IEEE Transactions on
                                  Circuits and Systems II: Express Briefs"}


key: j-IEEE-TRANS-PROF-COMMUN
value: IEEE Transactions on Professional Communication
filename: unix.bib
entry:
@String{j-IEEE-TRANS-PROF-COMMUN = "IEEE Transactions on Professional
                                  Communication"}


key: j-IEEE-TRANS-VLSI-SYST
value: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
filename: unix.bib
entry:
@String{j-IEEE-TRANS-VLSI-SYST  = "IEEE Transactions on Very Large Scale
                                  Integration (VLSI) Systems"}


key: j-IJHPCA
value: The International Journal of High Performance Computing Applications
filename: unix.bib
entry:
@String{j-IJHPCA                = "The International Journal of High Performance
                                  Computing Applications"}


key: j-INT-GEOSCIENCE-REMOTE-SENSING-SYMPOSIUM
value: International Geoscience and Remote Sensing Symposium (IGARSS)
filename: unix.bib
entry:
@String{j-INT-GEOSCIENCE-REMOTE-SENSING-SYMPOSIUM = "International Geoscience
                                  and Remote Sensing Symposium (IGARSS)"}


key: j-INT-TELEMETERING-CONFERENCE
value: International Telemetering Conference (Proceedings)
filename: unix.bib
entry:
@String{j-INT-TELEMETERING-CONFERENCE = "International Telemetering Conference
                                  (Proceedings)"}


key: j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER
value: International Journal on Software Tools for Technology Transfer (STTT)
filename: unix.bib
entry:
@String{j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER = "International Journal on
                                 Software Tools for Technology Transfer (STTT)"}


key: j-J-CRYPTOLOGY
value: Journal of Cryptology: the journal of the International Association for Cryptologic Research
filename: unix.bib
entry:
@String{j-J-CRYPTOLOGY          = "Journal of Cryptology: the journal of the
                                   International Association for Cryptologic
                                   Research"}


key: j-J-NETW-COMPUT-APPL
value: Journal of Network and Computer Applications
filename: unix.bib
entry:
@String{j-J-NETW-COMPUT-APPL    = "Journal of Network and Computer
                                  Applications"}


key: j-J-PAR-DIST-COMP
value: Journal of Parallel and Distributed Computing
filename: unix.bib
entry:
@String{j-J-PAR-DIST-COMP       = "Journal of Parallel and Distributed
                                  Computing"}


key: j-J-UCS
value: J.UCS: Journal of Universal Computer Science
filename: unix.bib
entry:
@String{j-J-UCS                 = "J.UCS: Journal of Universal Computer
                                  Science"}


key: j-JERIC
value: ACM Journal on Educational Resources in Computing (JERIC)
filename: unix.bib
entry:
@String{j-JERIC                 = "ACM Journal on Educational Resources in
                                  Computing (JERIC)"}


key: j-PACMPL
value: Proceedings of the ACM on Programming Languages (PACMPL)
filename: unix.bib
entry:
@String{j-PACMPL                = "Proceedings of the ACM on Programming
                                   Languages (PACMPL)"}


key: j-PROC-IEEE-INT-SOFTWARE-ENG-STAND-SYMP
value: Proceedings of the IEEE International Software Engineering Standards Symposium
filename: unix.bib
entry:
@String{j-PROC-IEEE-INT-SOFTWARE-ENG-STAND-SYMP = "Proceedings of the IEEE
                                  International Software Engineering Standards
                                  Symposium"}


key: j-PROC-INT-CONF-SOFTWARE-ENG
value: Proceedings --- International Conference on Software Engineering
filename: unix.bib
entry:
@String{j-PROC-INT-CONF-SOFTWARE-ENG = "Proceedings --- International
                                  Conference on Software Engineering"}


key: j-PROC-INT-TEST-CONF
value: Proceedings of the International Test Conference
filename: unix.bib
entry:
@String{j-PROC-INT-TEST-CONF    = "Proceedings of the International Test
                                  Conference"}


key: j-PROC-REAL-TIME-SYS-SYMP
value: Proceedings --- Real-Time Systems Symposium
filename: unix.bib
entry:
@String{j-PROC-REAL-TIME-SYS-SYMP = "Proceedings --- Real-Time Systems
                                  Symposium"}


key: j-PROG-COMP-SOFT
value: Programming and Computer Software; translation of Programmirovaniye (Moscow, USSR) Plenum
filename: unix.bib
entry:
@String{j-PROG-COMP-SOFT        = "Programming and Computer Software;
                                  translation of Programmirovaniye
                                  (Moscow, USSR) Plenum"}


key: j-SIAM-J-SCI-STAT-COMP
value: SIAM Journal on Scientific and Statistical Computing
filename: unix.bib
entry:
@String{j-SIAM-J-SCI-STAT-COMP  = "SIAM Journal on Scientific and Statistical
                                  Computing"}


key: j-SIGCSE
value: SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)
filename: unix.bib
entry:
@String{j-SIGCSE                = "SIGCSE Bulletin (ACM Special Interest Group
                                  on Computer Science Education)"}


key: j-SIGMETRICS
value: ACM SIGMETRICS Performance Evaluation Review
filename: unix.bib
entry:
@String{j-SIGMETRICS            = "ACM SIGMETRICS Performance Evaluation
                                  Review"}


key: j-SIGMOD
value: SIGMOD Record (ACM Special Interest Group on Management of Data)
filename: unix.bib
entry:
@String{j-SIGMOD                = "SIGMOD Record (ACM Special Interest
                                  Group on Management of Data)"}


key: j-SIGSAM
value: SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation)
filename: unix.bib
entry:
@String{j-SIGSAM                = "SIGSAM Bulletin (ACM Special Interest Group
                                  on Symbolic and Algebraic Manipulation)"}


key: j-SPE
value: Software --- Practice and Experience
filename: unix.bib
entry:
@String{j-SPE                   = "Soft{\-}ware\emdash Prac{\-}tice
                                  and Experience"}


key: j-SYS-ADMIN
value: Sys Admin: The Journal for UNIX Systems Administrators
filename: unix.bib
entry:
@String{j-SYS-ADMIN             = "Sys Admin: The Journal for UNIX Systems
                                   Administrators"}


key: j-TECS
value: ACM Transactions on Embedded Computing Systems
filename: unix.bib
entry:
@String{j-TECS                  = "ACM Transactions on Embedded Computing
                                  Systems"}


key: j-TISSEC
value: ACM Transactions on Information and System Security
filename: unix.bib
entry:
@String{j-TISSEC                = "ACM Transactions on Information and System
                                  Security"}


key: j-TOOIS
value: ACM Transactions on Office Information Systems
filename: unix.bib
entry:
@String{j-TOOIS                 = "ACM Transactions on Office Information
                                   Systems"}


key: j-TOPLAS
value: ACM Transactions on Programming Languages and Systems
filename: unix.bib
entry:
@String{j-TOPLAS                = "ACM Transactions on Programming Languages
                                  and Systems"}


key: j-TOSEM
value: ACM Transactions on Software Engineering and Methodology
filename: unix.bib
entry:
@String{j-TOSEM                 = "ACM Transactions on Software Engineering and
                                  Methodology"}


key: j-TRETS
value: ACM Transactions on Reconfigurable Technology and Systems (TRETS)
filename: unix.bib
entry:
@String{j-TRETS                 = "ACM Transactions on Reconfigurable Technology
                                  and Systems (TRETS)"}


key: org-SYMBOLICS-CAM:adr
value: 11 Cambridge Center, Cambridge MA 02142, USA
filename: unix.bib
entry:
@String{org-SYMBOLICS-CAM:adr   = "11 Cambridge Center, Cambridge MA 02142,
                                  USA"}


key: pub-ANSI
value: American National Standards Institute
filename: unix.bib
entry:
@String{pub-ANSI                = "American National Standards
                                  Institute"}


key: pub-ANSI:adr
value: 1430 Broadway, New York, NY 10018, USA
filename: unix.bib
entry:
@String{pub-ANSI:adr            = "1430 Broadway, New York, NY 10018,
                                  USA"}


key: pub-BOYD-FRASER:adr
value: One Corporate Place, Suite 205, Danvers, MA, USA 01923, USA
filename: unix.bib
entry:
@String{pub-BOYD-FRASER:adr     = "One Corporate Place, Suite 205, Danvers,
                                  MA, USA 01923, USA"}


key: pub-CBM:adr
value: A Division of Cardinal Business Media Inc., 101 Witmer Road, Horsham, PA 19044, USA
filename: unix.bib
entry:
@String{pub-CBM:adr             = "A Division of Cardinal Business
                                  Media Inc., 101 Witmer Road,
                                  Horsham, PA 19044, USA"}


key: pub-CRC:adr
value: 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA
filename: unix.bib
entry:
@String{pub-CRC:adr             = "2000 N.W. Corporate Blvd., Boca Raton,
                                  FL 33431-9868, USA"}


key: pub-CTRC:adr
value: 6 N. Atlantic Wharf, Charleston, SC 29401-2150, USA
filename: unix.bib
entry:
@String{pub-CTRC:adr            = "6 N. Atlantic Wharf, Charleston, SC
                                  29401-2150, USA"}


key: pub-DP:adr
value: 12 Crosby Drive, Bedford, MA 01730, USA
filename: unix.bib
entry:
@String{pub-DP:adr              = "12 Crosby Drive, Bedford, MA 01730,
                                  USA"}


key: pub-FSF:adr
value: 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA, Tel: (617) 876-3296
filename: unix.bib
entry:
@String{pub-FSF:adr             = "51 Franklin Street, Fifth Floor, Boston,
                                  MA 02110-1301, USA, Tel: (617) 876-3296"}


key: pub-HAYDEN:adr
value: 4300 West 62nd Street, Indianapolis, IN 46268, USA
filename: unix.bib
entry:
@String{pub-HAYDEN:adr          = "4300 West 62nd Street,
                                  Indianapolis, IN 46268, USA"}


key: pub-HEINZ-HEISE:adr
value: Helsdorfer Strass e 7, D-30625, Hannover, Germany
filename: unix.bib
entry:
@String{pub-HEINZ-HEISE:adr     = "Helsdorfer Stra{\ss}e 7, D-30625, Hannover,
                                  Germany"}


key: pub-IEEE:adr
value: 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA
filename: unix.bib
entry:
@String{pub-IEEE:adr            = "1109 Spring Street, Suite 300,
                                  Silver Spring, MD 20910, USA"}


key: pub-ISO
value: International Organization for Standardization
filename: unix.bib
entry:
@String{pub-ISO                 = "International Organization for
                                  Standardization"}


key: pub-ITCP:adr
value: 20 Park Plaza Suite 1001, Boston, MA 02116 USA
filename: unix.bib
entry:
@String{pub-ITCP:adr            = "20 Park Plaza Suite 1001, Boston,
                                  MA 02116 USA"}


key: pub-MATHWORKS:adr
value: Cochituate Place, 24 Prime Park Way, Natick, MA, USA
filename: unix.bib
entry:
@String{pub-MATHWORKS:adr       = "Cochituate Place, 24 Prime Park Way,
                                  Natick, MA, USA"}


key: pub-MIS:adr
value: P. O. Box 5277, Portland, OR 97208-5277, USA, Tel: (503) 282-5215
filename: unix.bib
entry:
@String{pub-MIS:adr             = "P. O. Box 5277, Portland, OR
                                  97208-5277, USA, Tel: (503) 282-5215"}


key: pub-MT:adr
value: M&T Publishing, Inc., 501 Galveston Drive, Redwood City, CA 94063, USA
filename: unix.bib
entry:
@String{pub-MT:adr              = "M\&T Publishing, Inc., 501
                                  Galveston Drive, Redwood City, CA
                                  94063, USA"}


key: pub-NIST
value: National Institute for Standards and Technology
filename: unix.bib
entry:
@String{pub-NIST                = "National Institute for Standards and
                                  Technology"}


key: pub-ORA:adr
value: 981 Chestnut Street, Newton, MA 02164, USA
filename: unix.bib
entry:
@String{pub-ORA:adr             = "981 Chestnut Street, Newton, MA
                                  02164, USA"}


key: pub-ORA-MEDIA:adr
value: 1005 Gravenstein Highway North, Sebastopol, CA 95472, USA
filename: unix.bib
entry:
@String{pub-ORA-MEDIA:adr       = "1005 Gravenstein Highway North,
                                   Sebastopol, CA 95472, USA"}


key: pub-PEACHPIT:adr
value: 1085 Keith Avenue, Berkeley, CA 94708, USA
filename: unix.bib
entry:
@String{pub-PEACHPIT:adr        = "1085 Keith Avenue, Berkeley, CA
                                  94708, USA"}


key: pub-PPB:adr
value: 101 Witmer Road, Horsham, PA 19044, USA
filename: unix.bib
entry:
@String{pub-PPB:adr             = "101 Witmer Road, Horsham, PA 19044,
                                  USA"}


key: pub-PRIME-TIME-FREEWARE:adr
value: 370 Altair Way, Suite 150, Sunnyvale, CA, USA
filename: unix.bib
entry:
@String{pub-PRIME-TIME-FREEWARE:adr = "370 Altair Way, Suite 150,
                                  Sunnyvale, CA, USA"}


key: pub-QED:adr
value: P. O. Box 82-181, Wellesley, MA 02181, USA
filename: unix.bib
entry:
@String{pub-QED:adr             = "P. O. Box 82-181, Wellesley, MA
                                  02181, USA"}


key: pub-SAS:adr
value: SAS Circle, Box 8000, Cary, NC 27512-8000, USA
filename: unix.bib
entry:
@String{pub-SAS:adr             = "SAS Circle, Box 8000, Cary, NC
                                  27512-8000, USA"}


key: pub-SILICON:adr
value: 25 Beverly Road, Summit, NJ 07901, USA
filename: unix.bib
entry:
@String{pub-SILICON:adr         = "25 Beverly Road, Summit, NJ 07901,
                                  USA"}


key: pub-SPSS:adr
value: Suite 3300, 444 N. Michigan Ave., Chicago, IL, USA
filename: unix.bib
entry:
@String{pub-SPSS:adr            = "Suite 3300, 444 N. Michigan Ave.,
                                  Chicago, IL, USA"}


key: pub-SUN:adr
value: 2550 Garcia Avenue, Mountain View, CA 94043, USA
filename: unix.bib
entry:
@String{pub-SUN:adr             = "2550 Garcia Avenue, Mountain View,
                                  CA 94043, USA"}


key: pub-SV:adr
value: Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/ etc.
filename: unix.bib
entry:
@String{pub-SV:adr              = "Berlin, Germany~/ Heidelberg,
                                  Germany~/ London, UK~/ etc."}


key: pub-SYBEX:adr
value: 2021 Challenger Driver, Suite 100, Alameda, CA 94501, USA
filename: unix.bib
entry:
@String{pub-SYBEX:adr           = "2021 Challenger Driver, Suite 100,
                                  Alameda, CA 94501, USA"}


key: pub-UNICODE-SAN-JOSE:adr
filename: unix.bib
value:
P.O. Box 700519, San Jose, CA 95170-0519, USA, Phone: +1-408-777-5870, Fax: +1-408-777-5082, E-mail: path =unicode-inc@unicode.org=

entry:
@String{pub-UNICODE-SAN-JOSE:adr = "P.O. Box 700519, San Jose, CA 95170-0519,
                                  USA, Phone: +1-408-777-5870,
                                  Fax: +1-408-777-5082, E-mail:
                                  \path=unicode-inc@unicode.org="}


key: pub-USENIX-EL-CERRITO:adr
value: P.O. Box 7, El Cerrito 94530, CA, USA
filename: unix.bib
entry:
@String{pub-USENIX-EL-CERRITO:adr = "P.O. Box 7, El Cerrito 94530, CA,
                                  USA"}


key: pub-VOGEL:adr
value: Postfach 67 40, D-8700 Wurzburg, Germany
filename: unix.bib
entry:
@String{pub-VOGEL:adr           = "Postfach 67 40, D-8700 W{\"u}rzburg,
                                  Germany"}


key: pub-WORLD-SCI
value: World Scientific Publishing Co. Pte. Ltd.
filename: unix.bib
entry:
@String{pub-WORLD-SCI           = "World Scientific Publishing
                                  Co. Pte. Ltd."}


key: pub-WORLD-SCI:adr
value: P. O. Box 128, Farrer Road, Singapore 9128
filename: unix.bib
entry:
@String{pub-WORLD-SCI:adr       = "P. O. Box 128, Farrer Road,
                                  Singapore 9128"}


# bibtab

bibtype: article
filename: unix.bib
label: McIlroy:1960:MIE
author: M. Douglas McIlroy
title: Macro Instruction Extensions of Compiler Languages
journal: j-CACM
volume: 3
number: 4
pages: 214--220
month: apr
monthnumber: 4
year: 1960
CODEN: CACMA2
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Fri Nov 25 18:19:26 MST 2005
bibtimestamp: 2005.11.25 18:19:26 MST
fjournal: Communications of the ACM
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
rawauthor: M. Douglas McIlroy
rawtitle: Macro Instruction Extensions of Compiler Languages
bibsource:
http://dblp.uni-trier.de/db/journals/cacm/cacm3.html#McIlroy60; http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{McIlroy:1960:MIE,
  author =       "M. Douglas McIlroy",
  title =        "Macro Instruction Extensions of Compiler Languages",
  journal =      j-CACM,
  volume =       "3",
  number =       "4",
  pages =        "214--220",
  month =        apr,
  year =         "1960",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:19:26 MST 2005",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm3.html#McIlroy60;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  oldlabel =     "McIlroy60",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/McIlroy60",
}


bibtype: article
filename: unix.bib
label: McIlroy:1963:VMF
author: M. D. McIlroy
title: A Variant Method of File Searching
journal: j-CACM
volume: 6
number: 3
pages: 101--101
month: mar
monthnumber: 3
year: 1963
CODEN: CACMA2
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Tue Dec 26 16:31:46 1995
bibtimestamp: 1995.12.26 16:31:46 ???
fjournal: Communications of the ACM
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
rawauthor: M. D. McIlroy
rawtitle: A Variant Method of File Searching
bibsource:
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{McIlroy:1963:VMF,
  author =       "M. D. McIlroy",
  title =        "A Variant Method of File Searching",
  journal =      j-CACM,
  volume =       "6",
  number =       "3",
  pages =        "101--101",
  month =        mar,
  year =         "1963",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Tue Dec 26 16:31:46 1995",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
}


bibtype: article
filename: unix.bib
label: Farber:1964:SSM
author: D. J. Farber and R. E. Griswold and I. P. Polonsky
title: SNOBOL, A String Manipulation Language
journal: j-J-ACM
volume: 11
number: 1
pages: 21--30
month: jan
monthnumber: 1
year: 1964
CODEN: JACOAH
DOI: https://doi.org/10.1145/321203.321207
ISSN: 0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)
ISSNL: 0004-5411 OR 00045411
bibdate: Sat Nov 19 21:44:13 1994
bibtimestamp: 1994.11.19 21:44:13 ???
fjournal: Journal of the Association for Computing Machinery
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/jacm
rawauthor: D. J. Farber and R. E. Griswold and I. P. Polonsky
rawtitle: {SNOBOL}, {A} String Manipulation Language
bibsource:
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{Farber:1964:SSM,
  author =       "D. J. Farber and R. E. Griswold and I. P. Polonsky",
  title =        "{SNOBOL}, {A} String Manipulation Language",
  journal =      j-J-ACM,
  volume =       "11",
  number =       "1",
  pages =        "21--30",
  month =        jan,
  year =         "1964",
  CODEN =        "JACOAH",
  DOI =          "https://doi.org/10.1145/321203.321207",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibdate =      "Sat Nov 19 21:44:13 1994",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/reynolds.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  checked =      "19 July 1993",
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}


bibtype: article
filename: unix.bib
label: Lin:1965:CST
author: Shen Lin
title: Computer Solutions of the Traveling Salesman Problem
journal: j-BELL-SYST-TECH-J
volume: 44
number: 10
pages: 2245--2269
month: dec
monthnumber: 12
year: 1965
CODEN: BSTJAN
ISSN: 0005-8580 (print), 2376-7154 (electronic) OR 00058580 (print), 23767154 (electronic)
ISSNL: 0005-8580 OR 00058580
MRclass: 65.30
MRnumber: 0189224 (32 \#6651)
MRreviewer: M. P. S. Madan
bibdate: Tue Nov 9 11:15:55 MST 2010
bibtimestamp: 2010.11.09 11:15:55 MST
fjournal: The Bell System Technical Journal
acknowledgement: ack-nhfb
journalURL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/
rawauthor: Shen Lin
rawtitle: Computer Solutions of the Traveling Salesman Problem
bibsource:
http://bstj.bell-labs.com/oldfiles/year.1965/BSTJ.1965.4410.html; http://www.alcatel-lucent.com/bstj/vol44-1965/bstj-vol44-issue10.html; https://www.math.utah.edu/pub/tex/bib/bstj1960.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

URL:
http://bstj.bell-labs.com/BSTJ/images/Vol44/bstj44-10-2245.pdf; http://www.alcatel-lucent.com/bstj/vol44-1965/articles/bstj44-10-2245.pdf

entry:
@Article{Lin:1965:CST,
  author =       "Shen Lin",
  title =        "Computer Solutions of the Traveling Salesman Problem",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "44",
  number =       "10",
  pages =        "2245--2269",
  month =        dec,
  year =         "1965",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580 (print), 2376-7154 (electronic)",
  ISSN-L =       "0005-8580",
  MRclass =      "65.30",
  MRnumber =     "0189224 (32 \#6651)",
  MRreviewer =   "M. P. S. Madan",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1965/BSTJ.1965.4410.html;
                 http://www.alcatel-lucent.com/bstj/vol44-1965/bstj-vol44-issue10.html;
                 https://www.math.utah.edu/pub/tex/bib/bstj1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol44/bstj44-10-2245.pdf;
                 http://www.alcatel-lucent.com/bstj/vol44-1965/articles/bstj44-10-2245.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}


bibtype: inproceedings
filename: unix.bib
label: Meyer:1967:CLP
author: Albert R. Meyer and Dennis M. Ritchie
editor: Solomon Rosenthal
booktitle: ACM '67: Proceedings of the 1967 22nd national conference
title: The complexity of loop programs
publisher: pub-ACM
address: pub-ACM:adr
pages: 465--569
month: jan
monthnumber: 1
year: 1967
DOI: https://doi.org/10.1145/800196.806014
ISBN: 1-4503-7494-8 OR 1450374948
ISBN13: 978-1-4503-7494-1 OR 9781450374941
bibdate: Fri Jun 19 17:19:39 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.06.19 17:19:39 ???
note: Cited in cite Brock:2020:DDR.
URL: https://dl.acm.org/doi/abs/10.1145/800196.806014
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
bookpages: 607
rawauthor: Albert R. Meyer and Dennis M. Ritchie
rawbooktitle: {ACM '67}: Proceedings of the 1967 22nd national conference
raweditor: Solomon Rosenthal
rawnote: Cited in \cite{Brock:2020:DDR}.
rawtitle: The complexity of loop programs
abstract:
Anyone familiar with the theory of computability will be aware that practical conclusions from the theory must be drawn with caution. If a problem can theoretically be solved by computation, this does not mean that it is practical to do so. Conversely, if a problem is formally undecidable, this does not mean that the subcases of primary interest are impervious to solution by algorithmic methods.par In the next section we describe such a class of programs, called Loop programs. Each Loop program consists only of assignment statements and iteration (loop) statements, the latter resembling the DO statement of FORTRAN, and special cases of the FOR and THROUGH statements of ALGOL and MAD. The bound on the running time of a Loop program is determined essentially by the length of the program and the depth of nesting of its loop

remark:
No ``received date'' is recorded, and the article makes no mention of Dennis Ritchie's doctoral dissertation in this subject area.

rawabstract:
Anyone familiar with the theory of computability will be aware that practical conclusions from the theory must be drawn with caution. If a problem can theoretically be solved by computation, this does not mean that it is practical to do so. Conversely, if a problem is formally undecidable, this does not mean that the subcases of primary interest are impervious to solution by algorithmic methods.\par In the next section we describe such a class of programs, called Loop programs. Each Loop program consists only of assignment statements and iteration (loop) statements, the latter resembling the DO statement of FORTRAN, and special cases of the FOR and THROUGH statements of ALGOL and MAD. The bound on the running time of a Loop program is determined essentially by the length of the program and the depth of nesting of its loop

entry:
@InProceedings{Meyer:1967:CLP,
  author =       "Albert R. Meyer and Dennis M. Ritchie",
  editor =       "Solomon Rosenthal",
  booktitle =    "{ACM '67}: Proceedings of the 1967 22nd national
                 conference",
  title =        "The complexity of loop programs",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  bookpages =    "607",
  pages =        "465--569",
  month =        jan,
  year =         "1967",
  DOI =          "https://doi.org/10.1145/800196.806014",
  ISBN =         "1-4503-7494-8",
  ISBN-13 =      "978-1-4503-7494-1",
  bibdate =      "Fri Jun 19 17:19:39 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Cited in \cite{Brock:2020:DDR}.",
  URL =          "https://dl.acm.org/doi/abs/10.1145/800196.806014",
  abstract =     "Anyone familiar with the theory of computability will
                 be aware that practical conclusions from the theory
                 must be drawn with caution. If a problem can
                 theoretically be solved by computation, this does not
                 mean that it is practical to do so. Conversely, if a
                 problem is formally undecidable, this does not mean
                 that the subcases of primary interest are impervious to
                 solution by algorithmic methods.\par

                 In the next section we describe such a class of
                 programs, called Loop programs. Each Loop program
                 consists only of assignment statements and iteration
                 (loop) statements, the latter resembling the DO
                 statement of FORTRAN, and special cases of the FOR and
                 THROUGH statements of ALGOL and MAD. The bound on the
                 running time of a Loop program is determined
                 essentially by the length of the program and the depth
                 of nesting of its loop",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  remark =       "No ``received date'' is recorded, and the article
                 makes no mention of Dennis Ritchie's doctoral
                 dissertation in this subject area.",
}


bibtype: book
filename: unix.bib
label: Griswold:1968:SPL
author: Ralph E. Griswold and James F. Poage and Ivan P. Polonsky
title: SNOBOL4 programming language
publisher: pub-PH
address: pub-PH:adr
pages: x + 221
year: 1968
ISBN: 0-13-815357-4 OR 0138153574
ISBN13: 978-0-13-815357-1 OR 9780138153571
LCCN: QA76.73.S6 G75 1968
bibdate: Mon Sep 4 15:09:32 MDT 2023
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.04 15:09:32 MDT
remark: See also second edition cite Griswold:1971:SPL.
acknowledgement: ack-nhfb
rawauthor: Ralph E. Griswold and James F. Poage and Ivan P. Polonsky
rawtitle: {SNOBOL4} programming language
entry:
@Book{Griswold:1968:SPL,
  author =       "Ralph E. Griswold and James F. Poage and Ivan P.
                 Polonsky",
  title =        "{SNOBOL4} programming language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  pages =        "x + 221",
  year =         "1968",
  ISBN =         "0-13-815357-4",
  ISBN-13 =      "978-0-13-815357-1",
  LCCN =         "QA76.73.S6 G75 1968",
  bibdate =      "Mon Sep 4 15:09:32 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "See also second edition \cite{Griswold:1971:SPL}.",
}


bibtype: article
filename: unix.bib
label: Thompson:1968:PTR
author: Ken Thompson
title: Programming Techniques: Regular expression search algorithm
journal: j-CACM
volume: 11
number: 6
pages: 419--422
month: jun
monthnumber: 6
year: 1968
CODEN: CACMA2
DOI: https://doi.org/10.1145/363347.363387
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Fri Nov 25 18:20:20 MST 2005
bibtimestamp: 2005.11.25 18:20:20 MST
note: See also cite Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM
URL: http://patft.uspto.gov/
fjournal: Communications of the ACM
keywords: match; regular expression; search
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
rawauthor: Ken Thompson
rawnote: See also \cite{Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM}
rawtitle: Programming Techniques: {Regular} expression search algorithm
bibsource:
http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Thompson68; http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib

abstract:
A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.

remark:
The on-the-fly compilation of regular expressions to IBM 7094 machine code is part of US Patent #3568156, awarded 9 August 1967 to Kenneth L. Thompson. This may be the first instance of the use of regular-expression pattern matching in text-editor software.

rawabstract:
A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.

entry:
@Article{Thompson:1968:PTR,
  author =       "Ken Thompson",
  title =        "Programming Techniques: {Regular} expression search
                 algorithm",
  journal =      j-CACM,
  volume =       "11",
  number =       "6",
  pages =        "419--422",
  month =        jun,
  year =         "1968",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/363347.363387",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:20 MST 2005",
  bibsource =    "http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Thompson68;
                 http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/plan9.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  note =         "See also
                 \cite{Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM}",
  URL =          "http://patft.uspto.gov/",
  abstract =     "A method for locating specific character strings
                 embedded in character text is described and an
                 implementation of this method in the form of a compiler
                 is discussed. The compiler accepts a regular expression
                 as source language and produces an IBM 7094 program as
                 object language. The object program then accepts the
                 text to be searched as input and produces a signal
                 every time an embedded string in the text matches the
                 given regular expression. Examples, problems, and
                 solutions are also presented.",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "match; regular expression; search",
  oldlabel =     "Thompson68",
  remark =       "The on-the-fly compilation of regular expressions to
                 IBM 7094 machine code is part of US Patent \#3568156,
                 awarded 9 August 1967 to Kenneth L. Thompson. This may
                 be the first instance of the use of regular-expression
                 pattern matching in text-editor software.",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Thompson68",
}


bibtype: inproceedings
filename: unix.bib
label: Chambers:1969:SDL
author: J. M. Chambers
title: A Statistical Data Language
crossref: Milton:1969:SCP
pages: 179--199
year: 1969
bibdate: Mon Sep 04 14:28:14 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/s-plus.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.04 14:28:14 ???
acknowledgement: ack-nhfb
rawauthor: J. M. Chambers
rawtitle: A Statistical Data Language
remark:
This paper describes early work that led to the S programming language, which was first described in three books recorded in s-plus.bib (Becker:1984:IED, Becker:1985:ESS, Becker:1988:NPL).

entry:
@InProceedings{Chambers:1969:SDL,
  author =       "J. M. Chambers",
  title =        "A Statistical Data Language",
  crossref =     "Milton:1969:SCP",
  pages =        "179--199",
  year =         "1969",
  bibdate =      "Mon Sep 04 14:28:14 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/s-plus.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "This paper describes early work that led to the S
                 programming language, which was first described in
                 three books recorded in s-plus.bib (Becker:1984:IED,
                 Becker:1985:ESS, Becker:1988:NPL).",
}


bibtype: techreport
filename: unix.bib
label: Hall:1969:PFI
author: A. D. Hall, Jr.
title: A Portable FORTRAN IV Subset
type: Technical Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1969
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 5]Ryder:1974:PV.
acknowledgement: ack-nhfb
rawauthor: A. D. {Hall, Jr.}
rawtitle: A Portable {FORTRAN IV} Subset
entry:
@TechReport{Hall:1969:PFI,
  author =       "A. D. {Hall, Jr.}",
  title =        "A Portable {FORTRAN IV} Subset",
  type =         "Technical Report",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1969",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 5]{Ryder:1974:PV}.",
}


bibtype: article
filename: unix.bib
label: McIlroy:1969:AGS
author: M. Douglas McIlroy
title: Algorithm 354: Generator of Spanning Trees [H]
journal: j-CACM
volume: 12
number: 9
pages: 511--511
month: sep
monthnumber: 9
year: 1969
CODEN: CACMA2
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Fri Nov 25 18:20:28 MST 2005
bibtimestamp: 2005.11.25 18:20:28 MST
fjournal: Communications of the ACM
keywords: mathematics; subroutines; trees (mathematics)
acknowledgement: ack-nhfb
classcodes: C7300 (Natural sciences computing)
corpsource: Bell Telephone Lab., Murray Hill, NJ, USA
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
rawauthor: M. Douglas McIlroy
rawtitle: {Algorithm 354}: {Generator} of Spanning Trees [{H}]
bibsource:
http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{McIlroy:1969:AGS,
  author =       "M. Douglas McIlroy",
  title =        "{Algorithm 354}: {Generator} of Spanning Trees [{H}]",
  journal =      j-CACM,
  volume =       "12",
  number =       "9",
  pages =        "511--511",
  month =        sep,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:28 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  classcodes =   "C7300 (Natural sciences computing)",
  corpsource =   "Bell Telephone Lab., Murray Hill, NJ, USA",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "mathematics; subroutines; trees (mathematics)",
}


bibtype: article
filename: unix.bib
label: McIlroy:1969:LES
author: M. D. McIlroy
title: Letter to the Editor: A scheme for specifying running titles
journal: j-CACM
volume: 12
number: 7
pages: 413--413
month: jul
monthnumber: 7
year: 1969
CODEN: CACMA2
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Fri Nov 25 18:20:27 MST 2005
bibtimestamp: 2005.11.25 18:20:27 MST
fjournal: Communications of the ACM
keywords: document formatting; publication formatting; runoff
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
rawauthor: M. D. McIlroy
rawtitle: Letter to the {Editor}: {A} scheme for specifying running titles
bibsource:
http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{McIlroy:1969:LES,
  author =       "M. D. McIlroy",
  title =        "Letter to the {Editor}: {A} scheme for specifying
                 running titles",
  journal =      j-CACM,
  volume =       "12",
  number =       "7",
  pages =        "413--413",
  month =        jul,
  year =         "1969",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Fri Nov 25 18:20:27 MST 2005",
  bibsource =    "http://www.acm.org/pubs/contents/journals/cacm/;
                 https://www.math.utah.edu/pub/tex/bib/cacm1960.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  keywords =     "document formatting; publication formatting; runoff",
}


bibtype: techreport
filename: unix.bib
label: Thompson:1969:BUM
author: Kenneth L. Thompson
title: Bon User's Manual
type: Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 413--413
day: 1
month: feb
monthnumber: 2
year: 1969
bibdate: Sun Feb 14 14:49:34 2021
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2021.02.14 14:49:34 ???
remark: Document recovery announced by Tom Van Vleck on the Multicians mailing list on 14 February 2021.
acknowledgement: ack-nhfb
rawauthor: Kenneth L. Thompson
rawtitle: {Bon} User's Manual
note:
As told to M. D. McIlroy and R. Morris. Bon is a step between BCPL and B, after which came New B and then C.

abstract:
Bon is an interactive language. It uses concepts from several other languages, but it has a distinctive flavor of its own. Because elaborate computations can be performed with a small set of elementary constructs, Bon is a pleasant and quite interesting language to use. It is a new language, so comments will be welcomed.

rawabstract:
Bon is an interactive language. It uses concepts from several other languages, but it has a distinctive flavor of its own. Because elaborate computations can be performed with a small set of elementary constructs, Bon is a pleasant and quite interesting language to use. It is a new language, so comments will be welcomed.

rawnote:
As told to M. D. McIlroy and R. Morris. Bon is a step between BCPL and B, after which came New B and then C.

entry:
@TechReport{Thompson:1969:BUM,
  author =       "Kenneth L. Thompson",
  title =        "{Bon} User's Manual",
  type =         "Report",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  day =          "1",
  month =        feb,
  year =         "1969",
  bibdate =      "Sun Feb 14 14:49:34 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "As told to M. D. McIlroy and R. Morris. Bon is a step
                 between BCPL and B, after which came New B and then
                 C.",
  abstract =     "Bon is an interactive language. It uses concepts from
                 several other languages, but it has a distinctive
                 flavor of its own. Because elaborate computations can
                 be performed with a small set of elementary constructs,
                 Bon is a pleasant and quite interesting language to
                 use. It is a new language, so comments will be
                 welcomed.",
  acknowledgement = ack-nhfb,
  remark =       "Document recovery announced by Tom Van Vleck on the
                 Multicians mailing list on 14 February 2021.",
}


bibtype: article
filename: unix.bib
label: Kernighan:1970:EHP
author: B. W. Kernighan and S. Lin
title: An Efficient Heuristic Procedure for Partitioning Graphs
journal: j-BELL-SYST-TECH-J
volume: 49
number: 2
pages: 291--307
month: feb
monthnumber: 2
year: 1970
CODEN: BSTJAN
DOI: https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
ISSN: 0005-8580 (print), 2376-7154 (electronic) OR 00058580 (print), 23767154 (electronic)
ISSNL: 0005-8580 OR 00058580
bibdate: Tue Nov 9 11:15:55 MST 2010
bibtimestamp: 2010.11.09 11:15:55 MST
fjournal: The Bell System Technical Journal
acknowledgement: ack-nhfb
journalURL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/
rawauthor: B. W. Kernighan and S. Lin
rawtitle: An Efficient Heuristic Procedure for Partitioning Graphs
bibsource:
http://bstj.bell-labs.com/oldfiles/year.1970/BSTJ.1970.4902.html; http://www.alcatel-lucent.com/bstj/vol49-1970/bstj-vol49-issue02.html; https://www.math.utah.edu/pub/tex/bib/bstj1970.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

URL:
http://bstj.bell-labs.com/BSTJ/images/Vol49/bstj49-2-291.pdf; http://www.alcatel-lucent.com/bstj/vol49-1970/articles/bstj49-2-291.pdf; https://ieeexplore.ieee.org/document/6771089

abstract:
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations --- for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems.

rawabstract:
We consider the problem of partitioning the nodes of a graph with costs on its edges into subsets of given sizes so as to minimize the sum of the costs on all edges cut. This problem arises in several physical situations --- for example, in assigning the components of electronic circuits to circuit boards to minimize the number of connections between boards. This paper presents a heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems.

entry:
@Article{Kernighan:1970:EHP,
  author =       "B. W. Kernighan and S. Lin",
  title =        "An Efficient Heuristic Procedure for Partitioning
                 Graphs",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "49",
  number =       "2",
  pages =        "291--307",
  month =        feb,
  year =         "1970",
  CODEN =        "BSTJAN",
  DOI =          "https://doi.org/10.1002/j.1538-7305.1970.tb01770.x",
  ISSN =         "0005-8580 (print), 2376-7154 (electronic)",
  ISSN-L =       "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1970/BSTJ.1970.4902.html;
                 http://www.alcatel-lucent.com/bstj/vol49-1970/bstj-vol49-issue02.html;
                 https://www.math.utah.edu/pub/tex/bib/bstj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol49/bstj49-2-291.pdf;
                 http://www.alcatel-lucent.com/bstj/vol49-1970/articles/bstj49-2-291.pdf;
                 https://ieeexplore.ieee.org/document/6771089",
  abstract =     "We consider the problem of partitioning the nodes of a
                 graph with costs on its edges into subsets of given
                 sizes so as to minimize the sum of the costs on all
                 edges cut. This problem arises in several physical
                 situations --- for example, in assigning the components
                 of electronic circuits to circuit boards to minimize
                 the number of connections between boards. This paper
                 presents a heuristic method for partitioning arbitrary
                 graphs which is both effective in finding optimal
                 partitions, and fast enough to be practical in solving
                 large problems.",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}


bibtype: techreport
filename: unix.bib
label: Ritchie:1970:QTE
author: D. M. Ritchie and K. L. Thompson
title: QED Text Editor
type: Memorandum
number: TM-70-1373-3, TM-70-1371-2
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: i + 19 + 6
day: 22
month: jun
monthnumber: 6
year: 1970
bibdate: Fri Sep 01 14:13:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.01 14:13:45 ???
URL: https://web.archive.org/web/20230223030724/https://www.bell-labs.com/usr/dmr/www/qedman.pdf
keywords: string manipulation; text editing; text manipulation
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: D. M. Ritchie and K. L. Thompson
rawtitle: {QED} Text Editor
abstract:
QED is an interactive text editing program available under GE-TSS on the GE-635 computer. It is much more powerful than most previous editing systems.par QED deals with both GE-TSS ASCII and card image files. It offers the ability to rearrange arbitrary blocks of text, to execute user-specified and pre-existing macro command sequences, and a very general text location and replacement capability.par This memorandum provides a complete reference manual for QED.

rawabstract:
QED is an interactive text editing program available under GE-TSS on the GE-635 computer. It is much more powerful than most previous editing systems.\par QED deals with both GE-TSS ASCII and card image files. It offers the ability to rearrange arbitrary blocks of text, to execute user-specified and pre-existing macro command sequences, and a very general text location and replacement capability.\par This memorandum provides a complete reference manual for QED.

entry:
@TechReport{Ritchie:1970:QTE,
  author =       "D. M. Ritchie and K. L. Thompson",
  title =        "{QED} Text Editor",
  type =         "Memorandum",
  number =       "TM-70-1373-3, TM-70-1371-2",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "i + 19 + 6",
  day =          "22",
  month =        jun,
  year =         "1970",
  bibdate =      "Fri Sep 01 14:13:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://web.archive.org/web/20230223030724/https://www.bell-labs.com/usr/dmr/www/qedman.pdf",
  abstract =     "QED is an interactive text editing program available
                 under GE-TSS on the GE-635 computer. It is much more
                 powerful than most previous editing systems.\par

                 QED deals with both GE-TSS ASCII and card image files.
                 It offers the ability to rearrange arbitrary blocks of
                 text, to execute user-specified and pre-existing macro
                 command sequences, and a very general text location and
                 replacement capability.\par

                 This memorandum provides a complete reference manual
                 for QED.",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  keywords =     "string manipulation; text editing; text manipulation",
}


bibtype: article
filename: unix.bib
label: Sethi:1970:GOC
author: Ravi Sethi and J. D. Ullman
title: The Generation of Optimal Code for Arithmetic Expressions
journal: j-J-ACM
volume: 17
number: 4
pages: 715--728
month: oct
monthnumber: 10
year: 1970
CODEN: JACOAH
ISSN: 0004-5411 (print), 1557-735X (electronic) OR 00045411 (print), 1557735X (electronic)
ISSNL: 0004-5411 OR 00045411
fjournal: Journal of the Association for Computing Machinery
acknowledgement: ack-nhfb
journalURL: https://dl.acm.org/loi/jacm
rawauthor: Ravi Sethi and J. D. Ullman
rawtitle: The Generation of Optimal Code for Arithmetic Expressions
bibsource:
ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

note:
Reprinted as pp. 229--247 in em Compiler Techniques, B. W. Pollack, ed., Auerbach, Princeton NJ (1972).

rawnote:
Reprinted as pp. 229--247 in {\em Compiler Techniques}, B. W. Pollack, ed., Auerbach, Princeton NJ (1972).

entry:
@Article{Sethi:1970:GOC,
  author =       "Ravi Sethi and J. D. Ullman",
  title =        "The Generation of Optimal Code for Arithmetic
                 Expressions",
  journal =      j-J-ACM,
  volume =       "17",
  number =       "4",
  pages =        "715--728",
  month =        oct,
  year =         "1970",
  CODEN =        "JACOAH",
  ISSN =         "0004-5411 (print), 1557-735X (electronic)",
  ISSN-L =       "0004-5411",
  bibsource =    "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/semantics.bib;
                 https://www.math.utah.edu/pub/tex/bib/jacm.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Reprinted as pp. 229--247 in {\em Compiler
                 Techniques}, B. W. Pollack, ed., Auerbach, Princeton NJ
                 (1972).",
  acknowledgement = ack-nhfb,
  fjournal =     "Journal of the Association for Computing Machinery",
  journal-URL =  "https://dl.acm.org/loi/jacm",
}


bibtype: techreport
filename: unix.bib
label: Brown:1971:AUM
author: W. S. Brown
title: ALTRAN User's Manual
type: Technical Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1971
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 7]Ryder:1974:PV.
acknowledgement: ack-nhfb
rawauthor: W. S. Brown
rawtitle: {ALTRAN} User's Manual
entry:
@TechReport{Brown:1971:AUM,
  author =       "W. S. Brown",
  title =        "{ALTRAN} User's Manual",
  type =         "Technical Report",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1971",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 7]{Ryder:1974:PV}.",
}


bibtype: techreport
filename: unix.bib
label: Brown:1971:CCP
author: W. S. Brown and A. D. Hall
title: Computing Campbell's $ Y_2n $ Polynomials with ALTRAN
type: Computing Science Technical Report
number: 6
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1971
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: W. S. Brown and A. D. Hall
rawtitle: Computing {Campbell}'s {$ Y_{2n} $} Polynomials with {ALTRAN}
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Brown:1972:A.

entry:
@TechReport{Brown:1971:CCP,
  author =       "W. S. Brown and A. D. Hall",
  title =        "Computing {Campbell}'s {$ Y_{2n} $} Polynomials with
                 {ALTRAN}",
  type =         "Computing Science Technical Report",
  number =       "6",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1971 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Brown:1972:A}.",
}


bibtype: book
filename: unix.bib
label: Griswold:1971:SPL
author: R. E. Griswold and J. E. Poage and I. P. Polonsky
title: The SNOBOL4 programming language
publisher: pub-PH
address: pub-PH:adr
edition: Second
pages: xii + 256
year: 1971
ISBN: 0-13-815373-6 OR 0138153736
ISBN13: 978-0-13-815373-1 OR 9780138153731
LCCN: QA76.73.S6 G75 1971
bibdate: Mon Sep 4 15:09:32 MDT 2023
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.04 15:09:32 MDT
remark: See also first edition cite Griswold:1968:SPL.
acknowledgement: ack-nhfb
rawauthor: R. E. Griswold and J. E. Poage and I. P. Polonsky
rawtitle: The {SNOBOL4} programming language
entry:
@Book{Griswold:1971:SPL,
  author =       "R. E. Griswold and J. E. Poage and I. P. Polonsky",
  title =        "The {SNOBOL4} programming language",
  publisher =    pub-PH,
  address =      pub-PH:adr,
  edition =      "Second",
  pages =        "xii + 256",
  year =         "1971",
  ISBN =         "0-13-815373-6",
  ISBN-13 =      "978-0-13-815373-1",
  LCCN =         "QA76.73.S6 G75 1971",
  bibdate =      "Mon Sep 4 15:09:32 MDT 2023",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "See also first edition \cite{Griswold:1968:SPL}.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1971:PSM
author: Heinz Lycklama
type: Memorandum
number: MM71-1383-3
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 67
day: 20
month: jan
monthnumber: 1
year: 1971
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
title:
Performance Simulation and Measurement of a Virtual Memory Multi-programming System for a Small Computer

URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/MM-71-1383-3_Performance_Simulation_and_Measurement_of_a_Virtual_Memory_Multi-progamming_System_for_a_Small_Computer_19710120.pdf

abstract:
The performance of an operating system for a small computer in a virtual memory multi-programming environment is described in terms of through-put and response. Both direct measurements and simulation runs have been utilized to obtain quantitative results on the operating system performance. The findings were used as aids in the evaluation of and as guidelines in making refinements to the operating system. Memory management strategy and user file organization were found to be the two major factors affecting the through-put and response of the operating system. The simulation model has been extended to study the effects of increasing memory size, increasing disk speed and in increasing memory speed for a small computer system. The results were then incorporated into an economic model of the system pointing out the cost effectiveness of the improvements.

rawabstract:
The performance of an operating system for a small computer in a virtual memory multi-programming environment is described in terms of through-put and response. Both direct measurements and simulation runs have been utilized to obtain quantitative results on the operating system performance. The findings were used as aids in the evaluation of and as guidelines in making refinements to the operating system. Memory management strategy and user file organization were found to be the two major factors affecting the through-put and response of the operating system. The simulation model has been extended to study the effects of increasing memory size, increasing disk speed and in increasing memory speed for a small computer system. The results were then incorporated into an economic model of the system pointing out the cost effectiveness of the improvements.

rawtitle:
Performance Simulation and Measurement of a Virtual Memory Multi-programming System for a Small Computer

entry:
@TechReport{Lycklama:1971:PSM,
  author =       "Heinz Lycklama",
  title =        "Performance Simulation and Measurement of a Virtual
                 Memory Multi-programming System for a Small Computer",
  type =         "Memorandum",
  number =       "MM71-1383-3",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "67",
  day =          "20",
  month =        jan,
  year =         "1971",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/MM-71-1383-3_Performance_Simulation_and_Measurement_of_a_Virtual_Memory_Multi-progamming_System_for_a_Small_Computer_19710120.pdf",
  abstract =     "The performance of an operating system for a small
                 computer in a virtual memory multi-programming
                 environment is described in terms of through-put and
                 response. Both direct measurements and simulation runs
                 have been utilized to obtain quantitative results on
                 the operating system performance. The findings were
                 used as aids in the evaluation of and as guidelines in
                 making refinements to the operating system. Memory
                 management strategy and user file organization were
                 found to be the two major factors affecting the
                 through-put and response of the operating system. The
                 simulation model has been extended to study the effects
                 of increasing memory size, increasing disk speed and in
                 increasing memory speed for a small computer system.
                 The results were then incorporated into an economic
                 model of the system pointing out the cost effectiveness
                 of the improvements.",
  acknowledgement = ack-nhfb,
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: McIlroy:1971:AFC
author: M. D. McIlroy
title: ANS FORTRAN Charts
type: Computing Science Technical Report
number: 13
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1971
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 6]Ryder:1974:PV.
acknowledgement: ack-nhfb
rawauthor: M. D. McIlroy
rawtitle: {ANS FORTRAN} Charts
entry:
@TechReport{McIlroy:1971:AFC,
  author =       "M. D. McIlroy",
  title =        "{ANS FORTRAN} Charts",
  type =         "Computing Science Technical Report",
  number =       "13",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1971",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 6]{Ryder:1974:PV}.",
}


bibtype: misc
filename: unix.bib
label: Ritchie:1971:DUT
author: Dennis M. Ritchie
title: Draft: The UNIX Time-Sharing System
pages: 53
year: 1971
bibdate: Sat Sep 29 08:35:20 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.09.29 08:35:20 ???
URL: https://www.tuhs.org/Archive/Distributions/Research/McIlroy_v0/UnixEditionZero-Threshold_OCR.pdf
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
howpublished: Web document
rawauthor: Dennis M. Ritchie
rawtitle: Draft: The {UNIX} Time-Sharing System
note:
Undated typescript, but believed to have been written in mid-1971. Neither references, nor date mentions, are given.

abstract:
[From the Introduction:] UNIX is a general-purpose, multi-user time sharing system implemented on several Digital Equipment Corporation PDP series machines.par UNIX was written by K. L. Thompson, who also wrote many of the command programs. The author of this memorandum contributed several of the major commands, including the assembler and the debugger. The file system was originally designed by Thompson, the author, and R. H. Canaday.par There are two versions of UNIX. The first, which has been in existence about a year, runs on the PDP-7 and -9 computers; a more modern version, a few months old, uses the PDP-11. This document describes UNIX-11, since it is more modern and many of the differences between it and UNIX-7 result from redesign of features found to be deficient or lacking in the earlier system.

rawabstract:
[From the Introduction:] UNIX is a general-purpose, multi-user time sharing system implemented on several Digital Equipment Corporation PDP series machines.\par UNIX was written by K. L. Thompson, who also wrote many of the command programs. The author of this memorandum contributed several of the major commands, including the assembler and the debugger. The file system was originally designed by Thompson, the author, and R. H. Canaday.\par There are two versions of UNIX. The first, which has been in existence about a year, runs on the PDP-7 and -9 computers; a more modern version, a few months old, uses the PDP-11. This document describes UNIX-11, since it is more modern and many of the differences between it and UNIX-7 result from redesign of features found to be deficient or lacking in the earlier system.

rawnote:
Undated typescript, but believed to have been written in mid-1971. Neither references, nor date mentions, are given.

entry:
@Misc{Ritchie:1971:DUT,
  author =       "Dennis M. Ritchie",
  title =        "Draft: The {UNIX} Time-Sharing System",
  howpublished = "Web document",
  pages =        "53",
  year =         "1971",
  bibdate =      "Sat Sep 29 08:35:20 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Undated typescript, but believed to have been written
                 in mid-1971. Neither references, nor date mentions, are
                 given.",
  URL =          "https://www.tuhs.org/Archive/Distributions/Research/McIlroy_v0/UnixEditionZero-Threshold_OCR.pdf",
  abstract =     "[From the Introduction:] UNIX is a general-purpose,
                 multi-user time sharing system implemented on several
                 Digital Equipment Corporation PDP series
                 machines.\par

                 UNIX was written by K. L. Thompson, who also wrote many
                 of the command programs. The author of this memorandum
                 contributed several of the major commands, including
                 the assembler and the debugger. The file system was
                 originally designed by Thompson, the author, and R. H.
                 Canaday.\par

                 There are two versions of UNIX. The first, which has
                 been in existence about a year, runs on the PDP-7 and
                 -9 computers; a more modern version, a few months old,
                 uses the PDP-11. This document describes UNIX-11, since
                 it is more modern and many of the differences between
                 it and UNIX-7 result from redesign of features found to
                 be deficient or lacking in the earlier system.",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: misc
filename: unix.bib
label: Thompson:1971:UPM
author: Ken Thompson and Dennis M. Ritchie
title: Unix Programmer's Manual
pages: 53
day: 3
month: nov
monthnumber: 11
year: 1971
bibdate: Fri Feb 16 10:18:48 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.02.16 10:18:48 ???
URL: https://www.bell-labs.com/usr/dmr/www/1stEdman.html
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
howpublished: Web site
rawauthor: Ken Thompson and Dennis M. Ritchie
rawtitle: {Unix} Programmer's Manual
note:
This is the first of seven editions (see cite Thompson:2018:TRE). Lucent Technologies retains copyright on this material.

rawnote:
This is the first of seven editions (see \cite{Thompson:2018:TRE}). Lucent Technologies retains copyright on this material.

entry:
@Misc{Thompson:1971:UPM,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{Unix} Programmer's Manual",
  howpublished = "Web site",
  day =          "3",
  month =        nov,
  year =         "1971",
  bibdate =      "Fri Feb 16 10:18:48 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This is the first of seven editions (see
                 \cite{Thompson:2018:TRE}). Lucent Technologies retains
                 copyright on this material.",
  URL =          "https://www.bell-labs.com/usr/dmr/www/1stEdman.html",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: article
filename: unix.bib
label: Brown:1972:A
author: W. S. Brown and A. D. Hall
title: ALTRAN
journal: j-SIGSAM
number: 24
pages: 4--7
month: oct
monthnumber: 10
year: 1972
CODEN: SIGSBZ
DOI: https://doi.org/10.1145/1086793.1086794
ISSN: 0163-5824 (print), 1557-9492 (electronic) OR 01635824 (print), 15579492 (electronic)
ISSNL: 0163-5824 OR 01635824
bibdate: Tue Jun 17 19:14:51 MDT 2008
bibtimestamp: 2008.06.17 19:14:51 MDT
fjournal: SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation)
acknowledgement: ack-nhfb
ajournal: SIGSAM Bull.
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J1000
issue: 24
rawauthor: W. S. Brown and A. D. Hall
rawtitle: {ALTRAN}
bibsource:
https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/sigsam.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
J. A. Campbell [1] has proposed the computation of his $ Y_2n $ polynomials as a challenging problem for symbolic algebra systems. These polynomials are defined by a recurrence formula involving summations over two and four indices, and a special differentiation rule. Since the number of terms in $ Y_2n $ grows almost exponentially, large amounts of time and memory are required for large values of $n$.

rawabstract:
J. A. Campbell [1] has proposed the computation of his $ Y_{2n} $ polynomials as a challenging problem for symbolic algebra systems. These polynomials are defined by a recurrence formula involving summations over two and four indices, and a special differentiation rule. Since the number of terms in $ Y_{2n} $ grows almost exponentially, large amounts of time and memory are required for large values of $n$.

entry:
@Article{Brown:1972:A,
  author =       "W. S. Brown and A. D. Hall",
  title =        "{ALTRAN}",
  journal =      j-SIGSAM,
  volume =       "??",
  number =       "24",
  pages =        "4--7",
  month =        oct,
  year =         "1972",
  CODEN =        "SIGSBZ",
  DOI =          "https://doi.org/10.1145/1086793.1086794",
  ISSN =         "0163-5824 (print), 1557-9492 (electronic)",
  ISSN-L =       "0163-5824",
  bibdate =      "Tue Jun 17 19:14:51 MDT 2008",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "J. A. Campbell [1] has proposed the computation of his
                 $ Y_{2n} $ polynomials as a challenging problem for
                 symbolic algebra systems. These polynomials are defined
                 by a recurrence formula involving summations over two
                 and four indices, and a special differentiation rule.
                 Since the number of terms in $ Y_{2n} $ grows almost
                 exponentially, large amounts of time and memory are
                 required for large values of $n$.",
  acknowledgement = ack-nhfb,
  ajournal =     "SIGSAM Bull.",
  fjournal =     "SIGSAM Bulletin (ACM Special Interest Group on
                 Symbolic and Algebraic Manipulation)",
  issue =        "24",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}


bibtype: techreport
filename: unix.bib
label: Hall:1972:MMP
author: Andrew D. Hall
title: The M6 Macro Processor
type: Computing Science Technical Report
number: 2
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: ii + 13
day: 12
month: apr
monthnumber: 4
year: 1972
bibdate: Fri Aug 25 15:53:20 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.25 15:53:20 ???
remark: Cited in cite [ref. 9]Ryder:1974:PV.
acknowledgement: ack-nhfb
rawauthor: Andrew D. Hall
rawtitle: The {M6} Macro Processor
abstract:
M6 is a general purpose macro processor continuous which processes a stream of input text by copying it character-by-character to an output text unchanged except for selected portions known as macro calls.par The processor is coded entirely in FORTRAN IV in a way that is intended to be highly portable. Some details of the implementation are also described.

rawabstract:
M6 is a general purpose macro processor continuous which processes a stream of input text by copying it character-by-character to an output text unchanged except for selected portions known as macro calls.\par The processor is coded entirely in FORTRAN IV in a way that is intended to be highly portable. Some details of the implementation are also described.

entry:
@TechReport{Hall:1972:MMP,
  author =       "Andrew D. Hall",
  title =        "The {M6} Macro Processor",
  type =         "Computing Science Technical Report",
  number =       "2",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "ii + 13",
  day =          "12",
  month =        apr,
  year =         "1972",
  bibdate =      "Fri Aug 25 15:53:20 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "M6 is a general purpose macro processor continuous
                 which processes a stream of input text by copying it
                 character-by-character to an output text unchanged
                 except for selected portions known as macro calls.\par
                 The processor is coded entirely in FORTRAN IV in a way
                 that is intended to be highly portable. Some details of
                 the implementation are also described.",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 9]{Ryder:1974:PV}.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1972:BIS
author: Heinz Lycklama
title: Bus Interference in a Single Bus Multi-processor Environment
type: Report
number: MM72-1353-16
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 61
day: 20
month: sep
monthnumber: 9
year: 1972
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
rawtitle: Bus Interference in a Single Bus Multi-processor Environment
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/MM-72-1353-16_Bus_Interface_in_a_Single_Bus_Multi-processor_Environment_19720920.pdf

abstract:
In the past, several multi-processor configurations have been proposed to handle the demands of a telephone switching system. A different solution has been proposed by H. S. McDonald to perform the call-processing functions of a large ($ approx $100000 line) DWC (Digital Wire Centre). The particular architecture proposed offers the following attractive features: (1) high processing throughput capability; (2) modular growth; (3) reliability by means of redundancy. This study will attempt to determine the processing capabilities of the multi-processor and single-bus configuration proposed. Given a certain instruction mix, the factors which affect the throughput are: (1) size of local processor memory; (2) cycle time of local processor; (3) cycle time of bus; (4) number of processors on the bus. In the case where there are a small number of processors on the bus, throughput is limited strictly by the cycle time of the local processors; whereas, in the case of many processors on the bus, throughput is limited by bus interference and hence bus cycle time. Throughput of the multi-processor configuration will be determined for various combinations of the parameters listed above. A comparison with No. 1 ESS will give us an estimate of the actual throughput in terms of calls per hour.

rawabstract:
In the past, several multi-processor configurations have been proposed to handle the demands of a telephone switching system. A different solution has been proposed by H. S. McDonald to perform the call-processing functions of a large ($ \approx $100000 line) DWC (Digital Wire Centre). The particular architecture proposed offers the following attractive features: (1) high processing throughput capability; (2) modular growth; (3) reliability by means of redundancy. This study will attempt to determine the processing capabilities of the multi-processor and single-bus configuration proposed. Given a certain instruction mix, the factors which affect the throughput are: (1) size of local processor memory; (2) cycle time of local processor; (3) cycle time of bus; (4) number of processors on the bus. In the case where there are a small number of processors on the bus, throughput is limited strictly by the cycle time of the local processors; whereas, in the case of many processors on the bus, throughput is limited by bus interference and hence bus cycle time. Throughput of the multi-processor configuration will be determined for various combinations of the parameters listed above. A comparison with No. 1 ESS will give us an estimate of the actual throughput in terms of calls per hour.

entry:
@TechReport{Lycklama:1972:BIS,
  author =       "Heinz Lycklama",
  title =        "Bus Interference in a Single Bus Multi-processor
                 Environment",
  type =         "Report",
  number =       "MM72-1353-16",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "61",
  day =          "20",
  month =        sep,
  year =         "1972",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/MM-72-1353-16_Bus_Interface_in_a_Single_Bus_Multi-processor_Environment_19720920.pdf",
  abstract =     "In the past, several multi-processor configurations
                 have been proposed to handle the demands of a telephone
                 switching system. A different solution has been
                 proposed by H. S. McDonald to perform the
                 call-processing functions of a large ($ \approx $100000
                 line) DWC (Digital Wire Centre). The particular
                 architecture proposed offers the following attractive
                 features: (1) high processing throughput capability;
                 (2) modular growth; (3) reliability by means of
                 redundancy. This study will attempt to determine the
                 processing capabilities of the multi-processor and
                 single-bus configuration proposed. Given a certain
                 instruction mix, the factors which affect the
                 throughput are: (1) size of local processor memory; (2)
                 cycle time of local processor; (3) cycle time of bus;
                 (4) number of processors on the bus. In the case where
                 there are a small number of processors on the bus,
                 throughput is limited strictly by the cycle time of the
                 local processors; whereas, in the case of many
                 processors on the bus, throughput is limited by bus
                 interference and hence bus cycle time. Throughput of
                 the multi-processor configuration will be determined
                 for various combinations of the parameters listed
                 above. A comparison with No. 1 ESS will give us an
                 estimate of the actual throughput in terms of calls per
                 hour.",
  acknowledgement = ack-nhfb,
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: McIlroy:1972:MTC
author: M. Douglas McIlroy
title: A Manual For the TMG Compiler-Writing Language
type: Technical Memorandum
number: 1009 (MM 72-1271-8)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 13
month: sep
monthnumber: 9
year: 1972
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: M. Douglas McIlroy
rawtitle: A Manual For the {TMG} Compiler-Writing Language
entry:
@TechReport{McIlroy:1972:MTC,
  author =       "M. Douglas McIlroy",
  title =        "A Manual For the {TMG} Compiler-Writing Language",
  type =         "Technical Memorandum",
  number =       "1009 (MM 72-1271-8)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "13",
  month =        sep,
  year =         "1972",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Ritchie:1972:UAR
author: Dennis M. Ritchie
title: UNIX Assembler Reference Manual
type: Technical Memorandum
number: 1012
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1972
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: Dennis M. Ritchie
rawtitle: {UNIX} Assembler Reference Manual
entry:
@TechReport{Ritchie:1972:UAR,
  author =       "Dennis M. Ritchie",
  title =        "{UNIX} Assembler Reference Manual",
  type =         "Technical Memorandum",
  number =       "1012",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1972 (??)",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Ryder:1972:FVM
author: B. G. Ryder
title: The FORTRAN Verifier: Motivation and Implementation
type: Technical Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1972
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 8]Ryder:1974:PV.
acknowledgement: ack-nhfb
rawauthor: B. G. Ryder
rawtitle: The {FORTRAN Verifier}: Motivation and Implementation
entry:
@TechReport{Ryder:1972:FVM,
  author =       "B. G. Ryder",
  title =        "The {FORTRAN Verifier}: Motivation and
                 Implementation",
  type =         "Technical Report",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1972",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 8]{Ryder:1974:PV}.",
}


bibtype: inproceedings
filename: unix.bib
label: Schweikert:1972:PMP
author: D. G. Schweikert and B. W. Kernighan
editor: IEEE
booktitle: Proceedings of the ACM-IEEE Design Automation Workshop
title: A Proper Model for Partitioning of Electrical Circuits
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 57--62
year: 1972
bibdate: Sat Sep 02 10:53:28 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 10:53:28 ???
remark: Cited in cite [ref. 11]Goldstein:1976:CFT. Not found in IEEE Xplore database.
acknowledgement: ack-nhfb
rawauthor: D. G. Schweikert and B. W. Kernighan
rawbooktitle: Proceedings of the {ACM-IEEE} Design Automation Workshop
raweditor: {IEEE}
rawtitle: A Proper Model for Partitioning of Electrical Circuits
entry:
@InProceedings{Schweikert:1972:PMP,
  author =       "D. G. Schweikert and B. W. Kernighan",
  editor =       "{IEEE}",
  booktitle =    "Proceedings of the {ACM-IEEE} Design Automation
                 Workshop",
  title =        "A Proper Model for Partitioning of Electrical
                 Circuits",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "57--62",
  year =         "1972",
  bibdate =      "Sat Sep 02 10:53:28 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 11]{Goldstein:1976:CFT}. Not found
                 in IEEE Xplore database.",
}


bibtype: misc
filename: unix.bib
label: Thompson:1972:UPM
author: Ken Thompson and Dennis M. Ritchie
title: Unix Programmer's Manual
edition: Second
pages: 57--62
day: 12
month: jun
monthnumber: 6
year: 1972
bibdate: Fri Feb 16 10:36:45 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.02.16 10:36:45 ???
note: This is the second of seven editions (see cite Thompson:2018:TRE).
URL: http://www.tuhs.org/Archive/Distributions/Research/Dennis_v2/v2man.pdf
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
howpublished: Web site
rawauthor: Ken Thompson and Dennis M. Ritchie
rawnote: This is the second of seven editions (see \cite{Thompson:2018:TRE}).
rawtitle: {Unix} Programmer's Manual
entry:
@Misc{Thompson:1972:UPM,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{Unix} Programmer's Manual",
  howpublished = "Web site",
  edition =      "Second",
  day =          "12",
  month =        jun,
  year =         "1972",
  bibdate =      "Fri Feb 16 10:36:45 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This is the second of seven editions (see
                 \cite{Thompson:2018:TRE}).",
  URL =          "http://www.tuhs.org/Archive/Distributions/Research/Dennis_v2/v2man.pdf",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Thompson:1972:URB
author: Ken Thompson
title: Users' Reference to B
type: Technical Memorandum
number: MM-72-1271-1
institution: Bell Laboratories
address: Murray Hill, NJ, USA
pages: iv + 27
day: 7
month: jan
monthnumber: 1
year: 1972
bibdate: Sat Dec 17 19:01:05 2016
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2016.12.17 19:01:05 ???
URL: http://www.bell-labs.com/usr/dmr/www/kbman.pdf
remark: B is the ancestor of the C programming language, and B was used to write portions of early Unix.
acknowledgement: ack-nhfb
rawauthor: Ken Thompson
rawtitle: Users' Reference to {B}
abstract:
B is a computer language intended for recursive, primarily nonnumeric applications typified by system programming. B has a small, unrestrictive syntax that is easy to compile. Because of the unusual freedom of expression and a rich set of operators, B programs are often quite compact.par This manual contains a concise definition of the language, sample programs, and instructions for using the PDP-11 version of B.

rawabstract:
B is a computer language intended for recursive, primarily nonnumeric applications typified by system programming. B has a small, unrestrictive syntax that is easy to compile. Because of the unusual freedom of expression and a rich set of operators, B programs are often quite compact.\par This manual contains a concise definition of the language, sample programs, and instructions for using the PDP-11 version of B.

entry:
@TechReport{Thompson:1972:URB,
  author =       "Ken Thompson",
  title =        "Users' Reference to {B}",
  type =         "Technical Memorandum",
  number =       "MM-72-1271-1",
  institution =  "Bell Laboratories",
  address =      "Murray Hill, NJ, USA",
  pages =        "iv + 27",
  day =          "7",
  month =        jan,
  year =         "1972",
  bibdate =      "Sat Dec 17 19:01:05 2016",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.bell-labs.com/usr/dmr/www/kbman.pdf",
  abstract =     "B is a computer language intended for recursive,
                 primarily nonnumeric applications typified by system
                 programming. B has a small, unrestrictive syntax that
                 is easy to compile. Because of the unusual freedom of
                 expression and a rich set of operators, B programs are
                 often quite compact.\par

                 This manual contains a concise definition of the
                 language, sample programs, and instructions for using
                 the PDP-11 version of B.",
  acknowledgement = ack-nhfb,
  remark =       "B is the ancestor of the C programming language, and B
                 was used to write portions of early Unix.",
}


bibtype: techreport
filename: unix.bib
label: Aho:1973:DMR
author: A. V. Aho and J. D. Ullman
title: Dynamic Memories with Rapid Random and Sequential Access
type: Computing Science Technical Report
number: 7
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: A. V. Aho and J. D. Ullman
rawtitle: Dynamic Memories with Rapid Random and Sequential Access
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Aho:1974:DMR.

entry:
@TechReport{Aho:1973:DMR,
  author =       "A. V. Aho and J. D. Ullman",
  title =        "Dynamic Memories with Rapid Random and Sequential
                 Access",
  type =         "Computing Science Technical Report",
  number =       "7",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1973 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Aho:1974:DMR}.",
}


bibtype: techreport
filename: unix.bib
label: Brown:1973:AUM
author: W. S. Brown
title: ALTRAN User's Manual
type: Technical Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
edition: Third
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 1]Feldman:1975:ASC. First edition cite Brown:1971:AUM. When was second edition?
acknowledgement: ack-nhfb
rawauthor: W. S. Brown
rawtitle: {ALTRAN} User's Manual
entry:
@TechReport{Brown:1973:AUM,
  author =       "W. S. Brown",
  title =        "{ALTRAN} User's Manual",
  type =         "Technical Report",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  edition =      "Third",
  pages =        "??",
  year =         "1973",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 1]{Feldman:1975:ASC}. First
                 edition \cite{Brown:1971:AUM}. When was second
                 edition?",
}


bibtype: techreport
filename: unix.bib
label: Brown:1973:CFR
author: W. S. Brown
title: On computing with factored rational expressions
type: Computing Science Technical Report
number: 22
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Report year uncertain. Published in cite Brown:1974:CFR.
acknowledgement: ack-nhfb
rawauthor: W. S. Brown
rawtitle: On computing with factored rational expressions
entry:
@TechReport{Brown:1973:CFR,
  author =       "W. S. Brown",
  title =        "On computing with factored rational expressions",
  type =         "Computing Science Technical Report",
  number =       "22",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1973 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Report year uncertain. Published in
                 \cite{Brown:1974:CFR}.",
}


bibtype: techreport
filename: unix.bib
label: Hall:1973:IFV
author: A. D. Hall, Jr. and B. G. Ryder
title: Installation of the FORTRAN Verifier
type: Technical Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 4]Ryder:1974:PV.
acknowledgement: ack-nhfb
rawauthor: A. D. {Hall, Jr.} and B. G. Ryder
rawtitle: Installation of the {FORTRAN} Verifier
entry:
@TechReport{Hall:1973:IFV,
  author =       "A. D. {Hall, Jr.} and B. G. Ryder",
  title =        "Installation of the {FORTRAN} Verifier",
  type =         "Technical Report",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1973",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 4]{Ryder:1974:PV}.",
}


bibtype: inproceedings
filename: unix.bib
label: Hecht:1973:ASA
author: Matthew S. Hecht and Jeffrey D. Ullman
title: Analysis of a simple algorithm global data flow problems
crossref: Fischer:1973:PAA
year: 1973
DOI: https://doi.org/10.1145/512927.512946
bibdate: Mon Sep 4 14:20:41 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.04 14:20:41 ???
acknowledgement: ack-nhfb
rawauthor: Matthew S. Hecht and Jeffrey D. Ullman
rawtitle: Analysis of a simple algorithm global data flow problems
entry:
@InProceedings{Hecht:1973:ASA,
  author =       "Matthew S. Hecht and Jeffrey D. Ullman",
  title =        "Analysis of a simple algorithm global data flow
                 problems",
  crossref =     "Fischer:1973:PAA",
  year =         "1973",
  DOI =          "https://doi.org/10.1145/512927.512946",
  bibdate =      "Mon Sep 4 14:20:41 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Johnson:1973:PLB
author: Steven C. Johnson and Brian W. Kernighan
title: The Programming Language B
type: Technical Report
number: 8
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: jan
monthnumber: 1
year: 1973
bibdate: Fri Sep 01 14:13:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.01 14:13:45 ???
remark: Undated, but report number suggests about 1970--1972.
acknowledgement: ack-nhfb
rawauthor: Steven C. Johnson and Brian W. Kernighan
rawtitle: The Programming Language {B}
URL:
https://web.archive.org/web/20230328114209/https://www.bell-labs.com/usr/dmr/www/bintro.html; https://www.bell-labs.com/usr/dmr/www/bintro.html

abstract:
B is a computer language designed by D. M. Ritchie and K. L. Thompson, for primarily non-numeric applications such as system programming. These typically involve complex logical decision-making, and processing of integers, characters, and bit strings. On the H6070 TSS system, B programs are usually much easier to write and understand than assembly language programs, and object code efficiency is almost as good. Implementation of simple TSS subsystems is an especially appropriate use for B. This technical report contains a description of the MH-TSS (Honeywell 6070) version of B (by S. C. Johnson), and a tutorial introduction to most of the features of the language (by B. W. Kernighan).

rawabstract:
B is a computer language designed by D. M. Ritchie and K. L. Thompson, for primarily non-numeric applications such as system programming. These typically involve complex logical decision-making, and processing of integers, characters, and bit strings. On the H6070 TSS system, B programs are usually much easier to write and understand than assembly language programs, and object code efficiency is almost as good. Implementation of simple TSS subsystems is an especially appropriate use for B. This technical report contains a description of the MH-TSS (Honeywell 6070) version of B (by S. C. Johnson), and a tutorial introduction to most of the features of the language (by B. W. Kernighan).

entry:
@TechReport{Johnson:1973:PLB,
  author =       "Steven C. Johnson and Brian W. Kernighan",
  title =        "The Programming Language {B}",
  type =         "Technical Report",
  number =       "8",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        jan,
  year =         "1973",
  bibdate =      "Fri Sep 01 14:13:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://web.archive.org/web/20230328114209/https://www.bell-labs.com/usr/dmr/www/bintro.html;
                 https://www.bell-labs.com/usr/dmr/www/bintro.html",
  abstract =     "B is a computer language designed by D. M. Ritchie and
                 K. L. Thompson, for primarily non-numeric applications
                 such as system programming. These typically involve
                 complex logical decision-making, and processing of
                 integers, characters, and bit strings. On the H6070 TSS
                 system, B programs are usually much easier to write and
                 understand than assembly language programs, and object
                 code efficiency is almost as good. Implementation of
                 simple TSS subsystems is an especially appropriate use
                 for B. This technical report contains a description of
                 the MH-TSS (Honeywell 6070) version of B (by S. C.
                 Johnson), and a tutorial introduction to most of the
                 features of the language (by B. W. Kernighan).",
  acknowledgement = ack-nhfb,
  remark =       "Undated, but report number suggests about
                 1970--1972.",
}


bibtype: article
filename: unix.bib
label: Kernighan:1973:HSS
author: B. W. Kernighan and S. Lin
title: Heuristic Solution of a Signal Design Optimization
journal: j-BELL-SYST-TECH-J
volume: 52
number: 7
pages: 1145--1159
month: sep
monthnumber: 9
year: 1973
CODEN: BSTJAN
ISSN: 0005-8580 (print), 2376-7154 (electronic) OR 00058580 (print), 23767154 (electronic)
ISSNL: 0005-8580 OR 00058580
bibdate: Tue Nov 9 11:15:55 MST 2010
bibtimestamp: 2010.11.09 11:15:55 MST
fjournal: The Bell System Technical Journal
acknowledgement: ack-nhfb
journalURL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/
rawauthor: B. W. Kernighan and S. Lin
rawtitle: Heuristic Solution of a Signal Design Optimization
bibsource:
http://bstj.bell-labs.com/oldfiles/year.1973/BSTJ.1973.5207.html; http://www.alcatel-lucent.com/bstj/vol52-1973/bstj-vol52-issue07.html; https://www.math.utah.edu/pub/tex/bib/bstj1970.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

URL:
http://bstj.bell-labs.com/BSTJ/images/Vol52/bstj52-7-1145.pdf; http://www.alcatel-lucent.com/bstj/vol52-1973/articles/bstj52-7-1145.pdf

entry:
@Article{Kernighan:1973:HSS,
  author =       "B. W. Kernighan and S. Lin",
  title =        "Heuristic Solution of a Signal Design Optimization",
  journal =      j-BELL-SYST-TECH-J,
  volume =       "52",
  number =       "7",
  pages =        "1145--1159",
  month =        sep,
  year =         "1973",
  CODEN =        "BSTJAN",
  ISSN =         "0005-8580 (print), 2376-7154 (electronic)",
  ISSN-L =       "0005-8580",
  bibdate =      "Tue Nov 9 11:15:55 MST 2010",
  bibsource =    "http://bstj.bell-labs.com/oldfiles/year.1973/BSTJ.1973.5207.html;
                 http://www.alcatel-lucent.com/bstj/vol52-1973/bstj-vol52-issue07.html;
                 https://www.math.utah.edu/pub/tex/bib/bstj1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://bstj.bell-labs.com/BSTJ/images/Vol52/bstj52-7-1145.pdf;
                 http://www.alcatel-lucent.com/bstj/vol52-1973/articles/bstj52-7-1145.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "The Bell System Technical Journal",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/",
}


bibtype: techreport
filename: unix.bib
label: Lin:1973:EHAa
author: S. Lin and B. W. Kernighan
title: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
type: Computing Science Technical Report
number: 1
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: S. Lin and B. W. Kernighan
rawtitle: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
remark:
This is believed to be the first of the CSTR series, but no electronic copy has yet been located, and the year could be earlier than 1973. There is no reference to this report in cite Lin:1973:EHAb.

entry:
@TechReport{Lin:1973:EHAa,
  author =       "S. Lin and B. W. Kernighan",
  title =        "An Effective Heuristic Algorithm for the
                 Traveling-Salesman Problem",
  type =         "Computing Science Technical Report",
  number =       "1",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1973",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "This is believed to be the first of the CSTR series,
                 but no electronic copy has yet been located, and the
                 year could be earlier than 1973. There is no reference
                 to this report in \cite{Lin:1973:EHAb}.",
}


bibtype: article
filename: unix.bib
label: Lin:1973:EHAb
author: S. Lin and B. W. Kernighan
title: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
journal: j-OPER-RES
volume: 21
number: 2
pages: 498--516
month: apr
monthnumber: 4
year: 1973
CODEN: OPREAI
DOI: https://doi.org/10.1287/opre.21.2.498
ISSN: 0030-364X (print), 1526-5463 (electronic) OR 0030364X (print), 15265463 (electronic)
ISSNL: 0030-364X OR 0030364X
bibdate: Mon Aug 28 10:29:23 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.28 10:29:23 ???
URL: https://www.cs.princeton.edu/~bwk/btl.mirror/tsp.pdf
fjournal: Operations Research
acknowledgement: ack-nhfb
journalURL: http://pubsonline.informs.org/loi/opre
rawauthor: S. Lin and B. W. Kernighan
rawtitle: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
entry:
@Article{Lin:1973:EHAb,
  author =       "S. Lin and B. W. Kernighan",
  title =        "An Effective Heuristic Algorithm for the
                 Traveling-Salesman Problem",
  journal =      j-OPER-RES,
  volume =       "21",
  number =       "2",
  pages =        "498--516",
  month =        apr,
  year =         "1973",
  CODEN =        "OPREAI",
  DOI =          "https://doi.org/10.1287/opre.21.2.498",
  ISSN =         "0030-364X (print), 1526-5463 (electronic)",
  ISSN-L =       "0030-364X",
  bibdate =      "Mon Aug 28 10:29:23 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.cs.princeton.edu/~bwk/btl.mirror/tsp.pdf",
  acknowledgement = ack-nhfb,
  fjournal =     "Operations Research",
  journal-URL =  "http://pubsonline.informs.org/loi/opre",
  received =     "15 October 1971",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1973:EUP
author: Heinz Lycklama and C. Christensen
title: Emulation of UNIX on Peripheral Processors
type: Technical Memorandum
number: TM-75-l352-2
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 23
day: 9
month: jan
monthnumber: 1
year: 1973
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
keywords: Minicomputer Support; Multiprocessing
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama and C. Christensen
rawtitle: Emulation of {UNIX} on Peripheral Processors
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-2_Emulation_of_UNIX_on_Peripheral_Processors_19750109.pdf

abstract:
The UNIX operating system has been emulated on a peripheral PDP-11 computer which has a communication link to a central PDP-11/45 computer running UNIX. Emulation is achieved by passing all traps that cannot be handled by the peripheral processor (PP) to the central processor (CP). This technique enables one to run object code produced by the C, LIL and Fortran compilers, as well as the standard assembler, on the peripheral processor, providing a powerful way of developing software for the PP and of running programs on the PP. The PP has complete access to the file system on the CP, yet the PP does not require a resident UNIX operating system.par This UNIX emulation technique also provides the capability to support a stand-alone PDP-11 minicomputer by connecting it to a CP running UNIX. When the program for the PP is developed and debugged, the link to the CP may be severed, producing a stand-alone system.par Besides providing programming support for a PDP-11 minicomputer, the emulation package also provides the ability to configure a cost-effective multi-processor UNIX system. For example, a minimally configured PDP-11/45 PP may be linked to a central PDP-11/45 processor to run compute-bound programs.par The minimum configuration for any PP is a 4K PDP-11 machine with a communication link to the CP. The entire communication package and trap handler in the PP require only 400 words of code.

rawabstract:
The UNIX operating system has been emulated on a peripheral PDP-11 computer which has a communication link to a central PDP-11/45 computer running UNIX. Emulation is achieved by passing all traps that cannot be handled by the peripheral processor (PP) to the central processor (CP). This technique enables one to run object code produced by the C, LIL and Fortran compilers, as well as the standard assembler, on the peripheral processor, providing a powerful way of developing software for the PP and of running programs on the PP. The PP has complete access to the file system on the CP, yet the PP does not require a resident UNIX operating system.\par This UNIX emulation technique also provides the capability to support a stand-alone PDP-11 minicomputer by connecting it to a CP running UNIX. When the program for the PP is developed and debugged, the link to the CP may be severed, producing a stand-alone system.\par Besides providing programming support for a PDP-11 minicomputer, the emulation package also provides the ability to configure a cost-effective multi-processor UNIX system. For example, a minimally configured PDP-11/45 PP may be linked to a central PDP-11/45 processor to run compute-bound programs.\par The minimum configuration for any PP is a 4K PDP-11 machine with a communication link to the CP. The entire communication package and trap handler in the PP require only 400 words of code.

entry:
@TechReport{Lycklama:1973:EUP,
  author =       "Heinz Lycklama and C. Christensen",
  title =        "Emulation of {UNIX} on Peripheral Processors",
  type =         "Technical Memorandum",
  number =       "TM-75-l352-2",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "23",
  day =          "9",
  month =        jan,
  year =         "1973",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-2_Emulation_of_UNIX_on_Peripheral_Processors_19750109.pdf",
  abstract =     "The UNIX operating system has been emulated on a
                 peripheral PDP-11 computer which has a communication
                 link to a central PDP-11/45 computer running UNIX.
                 Emulation is achieved by passing all traps that cannot
                 be handled by the peripheral processor (PP) to the
                 central processor (CP). This technique enables one to
                 run object code produced by the C, LIL and Fortran
                 compilers, as well as the standard assembler, on the
                 peripheral processor, providing a powerful way of
                 developing software for the PP and of running programs
                 on the PP. The PP has complete access to the file
                 system on the CP, yet the PP does not require a
                 resident UNIX operating system.\par

                 This UNIX emulation technique also provides the
                 capability to support a stand-alone PDP-11 minicomputer
                 by connecting it to a CP running UNIX. When the program
                 for the PP is developed and debugged, the link to the
                 CP may be severed, producing a stand-alone
                 system.\par

                 Besides providing programming support for a PDP-11
                 minicomputer, the emulation package also provides the
                 ability to configure a cost-effective multi-processor
                 UNIX system. For example, a minimally configured
                 PDP-11/45 PP may be linked to a central PDP-11/45
                 processor to run compute-bound programs.\par

                 The minimum configuration for any PP is a 4K PDP-11
                 machine with a communication link to the CP. The entire
                 communication package and trap handler in the PP
                 require only 400 words of code.",
  acknowledgement = ack-nhfb,
  keywords =     "Minicomputer Support; Multiprocessing",
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1973:VMM
author: Heinz Lycklama
title: A Virtual Memory Mini-Computer System
type: Report
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 2
day: 22
month: mar
monthnumber: 3
year: 1973
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
rawtitle: A Virtual Memory Mini-Computer System
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/A_Virtual_Memory_Mini-Computer_System_516-TSS.pdf

abstract:
This is an abstract of a talk which will be presented at the 10th Annual Symposium On System Theory (South-Eastern Conference) sponsored by IEEE and North Carolina State and Duke Universities on March 22 and 23 of 1973.

rawabstract:
This is an abstract of a talk which will be presented at the 10th Annual Symposium On System Theory (South-Eastern Conference) sponsored by IEEE and North Carolina State and Duke Universities on March 22 and 23 of 1973.

entry:
@TechReport{Lycklama:1973:VMM,
  author =       "Heinz Lycklama",
  title =        "A Virtual Memory Mini-Computer System",
  type =         "Report",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "2",
  day =          "22",
  month =        mar,
  year =         "1973",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/A_Virtual_Memory_Mini-Computer_System_516-TSS.pdf",
  abstract =     "This is an abstract of a talk which will be presented
                 at the 10th Annual Symposium On System Theory
                 (South-Eastern Conference) sponsored by IEEE and North
                 Carolina State and Duke Universities on March 22 and 23
                 of 1973.",
  acknowledgement = ack-nhfb,
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: McIlroy:1973:RTF
author: M. D. McIlroy
title: Roff text formatter
type: Technical Report
number: MHCC-005 (revision 1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 4]Aho:1988:MCR and cite [p. 13, ref. 11]Aho:1988:MCR.
acknowledgement: ack-nhfb
rawauthor: M. D. McIlroy
rawtitle: {Roff} text formatter
entry:
@TechReport{McIlroy:1973:RTF,
  author =       "M. D. McIlroy",
  title =        "{Roff} text formatter",
  type =         "Technical Report",
  number =       "MHCC-005 (revision 1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1973",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 4]{Aho:1988:MCR} and \cite[p. 13,
                 ref. 11]{Aho:1988:MCR}.",
}


bibtype: techreport
filename: unix.bib
label: McIlroy:1973:SES
author: M. Douglas McIlroy
title: Synthetic English Speech by Rule
type: Technical Memorandum
number: 1025 (TM 73-1271-7)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 7
month: dec
monthnumber: 12
year: 1973
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: M. Douglas McIlroy
rawtitle: Synthetic {English} Speech by Rule
entry:
@TechReport{McIlroy:1973:SES,
  author =       "M. Douglas McIlroy",
  title =        "Synthetic {English} Speech by Rule",
  type =         "Technical Memorandum",
  number =       "1025 (TM 73-1271-7)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "7",
  month =        dec,
  year =         "1973",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Olsson:1973:GCC
author: S. B. Olsson
title: Guidelines for C Compiler Distribution
type: Technical Memorandum
number: 1229 (TM 78-8234-2)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 3
month: jan
monthnumber: 1
year: 1973
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: S. B. Olsson
rawtitle: Guidelines for {C} Compiler Distribution
abstract:
This memorandum outlines a set of procedures for C compiler distribution that has been developed ldots in order to minimize distribution, installation and transition problems.

rawabstract:
This memorandum outlines a set of procedures for C compiler distribution that has been developed \ldots{} in order to minimize distribution, installation and transition problems.

entry:
@TechReport{Olsson:1973:GCC,
  author =       "S. B. Olsson",
  title =        "Guidelines for {C} Compiler Distribution",
  type =         "Technical Memorandum",
  number =       "1229 (TM 78-8234-2)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "3",
  month =        jan,
  year =         "1973",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum outlines a set of procedures for C
                 compiler distribution that has been developed \ldots{}
                 in order to minimize distribution, installation and
                 transition problems.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Remde:1973:CCS
author: J. R. Remde
title: A C Compiler for the SEL Computer
type: Technical Memorandum
number: 1237 (TM 78-1228-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 13
month: jan
monthnumber: 1
year: 1973
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: J. R. Remde
rawtitle: A {C} Compiler for the {SEL} Computer
abstract:
This memorandum describes the implementation process including the changes made to the portable ldots compilers and the construction of the SEL C library. It also includes a user's' guide, explaining the ldots usage and features of the compiler.

rawabstract:
This memorandum describes the implementation process including the changes made to the portable \ldots{} compilers and the construction of the SEL C library. It also includes a user's' guide, explaining the \ldots{} usage and features of the compiler.

entry:
@TechReport{Remde:1973:CCS,
  author =       "J. R. Remde",
  title =        "A {C} Compiler for the {SEL} Computer",
  type =         "Technical Memorandum",
  number =       "1237 (TM 78-1228-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "13",
  month =        jan,
  year =         "1973",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the implementation process
                 including the changes made to the portable \ldots{}
                 compilers and the construction of the SEL C library. It
                 also includes a user's' guide, explaining the \ldots{}
                 usage and features of the compiler.",
  acknowledgement = ack-nhfb,
}


bibtype: inproceedings
filename: unix.bib
label: Ritchie:1973:UTSa
author: Dennis M. Ritchie and Ken Thompson
editor: ACM
title: The UNIX time-sharing system
publisher: pub-ACM
address: pub-ACM:adr
pages: 27--27
year: 1973
DOI: https://doi.org/10.1145/800009.808045
bibdate: Thu Feb 23 07:01:17 2017
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2017.02.23 07:01:17 ???
note: Abstract only.
URL: https://www.bell-labs.com/usr/dmr/www/cacm.html
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: Dennis M. Ritchie and Ken Thompson
raweditor: {ACM}
rawnote: Abstract only.
rawtitle: The {UNIX} time-sharing system
booktitle:
Fourth ACM Symposium on Operating Systems Principles, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, October 15--17, 1973

abstract:
UNIX is a general-purpose, multi-user, interactive operating system for the Digital Equipment Corporation PDP-11/40 and 11/45 computers. It offers a number of features seldom found even in larger operating systems, including 1. A hierarchical file system incorporating demountable volumes, 2. Compatible file, device, and inter-process I/O, 3. The ability to initiate asynchronous processes, 4. System command language selectable on a per-user basis, 5. Over 100 subsystems including a dozen languages. This paper discusses the usage and implementation of the file system and of the user command interface.

remark:
This electronic edition of this paper is a reprint of the version appearing in The Bell System Technical Journal 57 no. 6, part 2, pages 1905--1929 (July--August 1978). In turn, that was a revised version of an article that appeared in Communications of the ACM, 17, No. 7 (July 1974), pp. 365--375 (cite Ritchie:1974:UTS). That article was a revised version of a paper presented at the Fourth ACM Symposium on Operating Systems Principles, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, October 15--17, 1973. Most of the differences between versions occur between the Comm. ACM version and the BSTJ printing; we incorporated updated numbers and material on portability.

rawabstract:
UNIX is a general-purpose, multi-user, interactive operating system for the Digital Equipment Corporation PDP-11/40 and 11/45 computers. It offers a number of features seldom found even in larger operating systems, including \\ 1. A hierarchical file system incorporating demountable volumes, \\ 2. Compatible file, device, and inter-process I/O, \\ 3. The ability to initiate asynchronous processes, \\ 4. System command language selectable on a per-user basis, \\ 5. Over 100 subsystems including a dozen languages. \\ This paper discusses the usage and implementation of the file system and of the user command interface.

rawbooktitle:
Fourth {ACM} Symposium on Operating Systems Principles, {IBM} Thomas J. Watson Research Center, Yorktown Heights, New York, October 15--17, 1973

entry:
@InProceedings{Ritchie:1973:UTSa,
  author =       "Dennis M. Ritchie and Ken Thompson",
  editor =       "{ACM}",
  booktitle =    "Fourth {ACM} Symposium on Operating Systems
                 Principles, {IBM} Thomas J. Watson Research Center,
                 Yorktown Heights, New York, October 15--17, 1973",
  title =        "The {UNIX} time-sharing system",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "27--27",
  year =         "1973",
  DOI =          "https://doi.org/10.1145/800009.808045",
  bibdate =      "Thu Feb 23 07:01:17 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Abstract only.",
  URL =          "https://www.bell-labs.com/usr/dmr/www/cacm.html",
  abstract =     "UNIX is a general-purpose, multi-user, interactive
                 operating system for the Digital Equipment Corporation
                 PDP-11/40 and 11/45 computers. It offers a number of
                 features seldom found even in larger operating systems,
                 including \\
                 1. A hierarchical file system incorporating demountable
                 volumes, \\
                 2. Compatible file, device, and inter-process I/O, \\
                 3. The ability to initiate asynchronous processes, \\
                 4. System command language selectable on a per-user
                 basis, \\
                 5. Over 100 subsystems including a dozen languages. \\
                 This paper discusses the usage and implementation of
                 the file system and of the user command interface.",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  remark =       "This electronic edition of this paper is a reprint of
                 the version appearing in The Bell System Technical
                 Journal 57 no. 6, part 2, pages 1905--1929
                 (July--August 1978). In turn, that was a revised
                 version of an article that appeared in Communications
                 of the ACM, 17, No. 7 (July 1974), pp. 365--375
                 (\cite{Ritchie:1974:UTS}). That article was a revised
                 version of a paper presented at the Fourth ACM
                 Symposium on Operating Systems Principles, IBM Thomas
                 J. Watson Research Center, Yorktown Heights, New York,
                 October 15--17, 1973. Most of the differences between
                 versions occur between the Comm. ACM version and the
                 BSTJ printing; we incorporated updated numbers and
                 material on portability.",
}


bibtype: article
filename: unix.bib
label: Ritchie:1973:UTSb
author: Dennis M. Ritchie and Ken Thompson
title: The UNIX time-sharing system
journal: j-OPER-SYS-REV
volume: 7
number: 4
pages: 27--27
month: oct
monthnumber: 10
year: 1973
CODEN: OSRED8
DOI: https://doi.org/10.1145/957195.808045
ISSN: 0163-5980 (print), 1943-586X (electronic) OR 01635980 (print), 1943586X (electronic)
ISSNL: 0163-5980 OR 01635980
bibdate: Sat Aug 26 08:55:49 MDT 2006
bibtimestamp: 2006.08.26 08:55:49 MDT
URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7314
fjournal: ACM SIGOPS Operating Systems Review
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J597
rawauthor: Dennis M. Ritchie and Ken Thompson
rawtitle: The {UNIX} time-sharing system
bibsource:
http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/opersysrev.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{Ritchie:1973:UTSb,
  author =       "Dennis M. Ritchie and Ken Thompson",
  title =        "The {UNIX} time-sharing system",
  journal =      j-OPER-SYS-REV,
  volume =       "7",
  number =       "4",
  pages =        "27--27",
  month =        oct,
  year =         "1973",
  CODEN =        "OSRED8",
  DOI =          "https://doi.org/10.1145/957195.808045",
  ISSN =         "0163-5980 (print), 1943-586X (electronic)",
  ISSN-L =       "0163-5980",
  bibdate =      "Sat Aug 26 08:55:49 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/opersysrev.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.7314",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  fjournal =     "ACM SIGOPS Operating Systems Review",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J597",
}


bibtype: techreport
filename: unix.bib
label: Ryder:1973:FVU
author: B. G. Ryder
title: The FORTRAN Verifier: User's Guide
type: Computing Science Technical Report
number: 12
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1973
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 10]Ryder:1974:PV, but without a year.
acknowledgement: ack-nhfb
rawauthor: B. G. Ryder
rawtitle: The {FORTRAN Verifier}: User's Guide
entry:
@TechReport{Ryder:1973:FVU,
  author =       "B. G. Ryder",
  title =        "The {FORTRAN Verifier}: User's Guide",
  type =         "Computing Science Technical Report",
  number =       "12",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "??",
  month =        "????",
  year =         "1973 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 10]{Ryder:1974:PV}, but without a
                 year.",
}


bibtype: manual
filename: unix.bib
label: Thompson:1973:UPMa
author: Ken Thompson and Dennis M. Ritchie
title: Unix Programmer's Manual
organization: Bell Telephone Laboratories, Inc.
address: Murray Hill, NJ, USA
edition: Third
pages: xxxii + 260
month: feb
monthnumber: 2
year: 1973
bibdate: Fri Feb 16 10:36:45 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.02.16 10:36:45 ???
URL: https://dspinellis.github.io/unix-v3man/v3man.pdf
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: Ken Thompson and Dennis M. Ritchie
rawtitle: {Unix} Programmer's Manual
note:
This is the third of seven editions (see cite Thompson:2018:TRE). The document is formatted in a monospaced typewriter font.

rawnote:
This is the third of seven editions (see \cite{Thompson:2018:TRE}). The document is formatted in a monospaced typewriter font.

entry:
@Manual{Thompson:1973:UPMa,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{Unix} Programmer's Manual",
  organization = "Bell Telephone Laboratories, Inc.",
  address =      "Murray Hill, NJ, USA",
  edition =      "Third",
  pages =        "xxxii + 260",
  month =        feb,
  year =         "1973",
  bibdate =      "Fri Feb 16 10:36:45 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This is the third of seven editions (see
                 \cite{Thompson:2018:TRE}). The document is formatted in
                 a monospaced typewriter font.",
  URL =          "https://dspinellis.github.io/unix-v3man/v3man.pdf",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: manual
filename: unix.bib
label: Thompson:1973:UPMb
author: Ken Thompson and Dennis M. Ritchie
title: Unix Programmer's Manual
organization: Bell Telephone Laboratories, Inc.
address: Murray Hill, NJ, USA
edition: Fourth
pages: 27 + 255
month: nov
monthnumber: 11
year: 1973
bibdate: Fri Feb 16 10:36:45 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.02.16 10:36:45 ???
note: This is the fourth of seven editions (see cite Thompson:2018:TRE). The document is typeset.
URL: https://dspinellis.github.io/unix-v4man/v4man.pdf
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: Ken Thompson and Dennis M. Ritchie
rawnote: This is the fourth of seven editions (see \cite{Thompson:2018:TRE}). The document is typeset.
rawtitle: {Unix} Programmer's Manual
remark:
From the inside cover: ``This manual was set by a Graphic Systems photo- typesetter driven by the troff formatting program operating under the UNIX system. The text of the manual was prepared using the ed text editor.''

entry:
@Manual{Thompson:1973:UPMb,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{Unix} Programmer's Manual",
  organization = "Bell Telephone Laboratories, Inc.",
  address =      "Murray Hill, NJ, USA",
  edition =      "Fourth",
  pages =        "27 + 255",
  month =        nov,
  year =         "1973",
  bibdate =      "Fri Feb 16 10:36:45 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This is the fourth of seven editions (see
                 \cite{Thompson:2018:TRE}). The document is typeset.",
  URL =          "https://dspinellis.github.io/unix-v4man/v4man.pdf",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  remark =       "From the inside cover: ``This manual was set by a
                 Graphic Systems photo- typesetter driven by the troff
                 formatting program operating under the UNIX system. The
                 text of the manual was prepared using the ed text
                 editor.''",
}


bibtype: article
filename: unix.bib
label: Aho:1974:DMR
author: Alfred V. Aho and Jeffrey D. Ullman
title: Dynamic Memories with Rapid Random and Sequential Access
journal: j-IEEE-TRANS-COMPUT
volume: C-23
number: 3
pages: 272--276
month: mar
monthnumber: 3
year: 1974
CODEN: ITCOB4
DOI: https://doi.org/10.1109/T-C.1974.223922
ISSN: 0018-9340 (print), 1557-9956 (electronic) OR 00189340 (print), 15579956 (electronic)
ISSNL: 0018-9340 OR 00189340
bibdate: Tue Jul 12 11:27:31 MDT 2011
bibtimestamp: 2011.07.12 11:27:31 MDT
fjournal: IEEE Transactions on Computers
acknowledgement: ack-nhfb
journalURL: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12
rawauthor: Alfred V. Aho and Jeffrey D. Ullman
rawtitle: Dynamic Memories with Rapid Random and Sequential Access
bibsource:
https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

URL:
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672515; https://ieeexplore.ieee.org/abstract/document/1672515

entry:
@Article{Aho:1974:DMR,
  author =       "Alfred V. Aho and Jeffrey D. Ullman",
  title =        "Dynamic Memories with Rapid Random and Sequential
                 Access",
  journal =      j-IEEE-TRANS-COMPUT,
  volume =       "C-23",
  number =       "3",
  pages =        "272--276",
  month =        mar,
  year =         "1974",
  CODEN =        "ITCOB4",
  DOI =          "https://doi.org/10.1109/T-C.1974.223922",
  ISSN =         "0018-9340 (print), 1557-9956 (electronic)",
  ISSN-L =       "0018-9340",
  bibdate =      "Tue Jul 12 11:27:31 MDT 2011",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1672515;
                 https://ieeexplore.ieee.org/abstract/document/1672515",
  acknowledgement = ack-nhfb,
  fjournal =     "IEEE Transactions on Computers",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12",
  received =     "1 December 1972",
  revised =      "24 April 1973",
}


bibtype: article
filename: unix.bib
label: Aho:1974:LP
author: A. V. Aho and S. C. Johnson
title: LR Parsing
journal: j-COMP-SURV
volume: 6
number: 2
pages: 99--124
month: jun
monthnumber: 6
year: 1974
CODEN: CMSVAN
DOI: https://doi.org/10.1145/356628.356629
ISSN: 0010-4892 OR 00104892
bibdate: Thu Jun 19 09:17:55 MDT 2008
bibtimestamp: 2008.06.19 09:17:55 MDT
fjournal: ACM Computing Surveys
keywords: ambiguous grammars; compilers; context-free languages; grammars; LR grammars; parsers
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J204
rawauthor: A. V. Aho and S. C. Johnson
rawtitle: {LR} Parsing
bibsource:
http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
The LR syntax analysis method is a useful and versatile technique for parsing deterministic context-free languages in compiling applications. This paper provides an informal exposition of LR parsing techniques emphasizing the mechanical generation of efficient LR parsers for context-free grammars. Particular attention is given to extending the parser generation techniques to apply to ambiguous grammars.

rawabstract:
The LR syntax analysis method is a useful and versatile technique for parsing deterministic context-free languages in compiling applications. This paper provides an informal exposition of LR parsing techniques emphasizing the mechanical generation of efficient LR parsers for context-free grammars. Particular attention is given to extending the parser generation techniques to apply to ambiguous grammars.

entry:
@Article{Aho:1974:LP,
  author =       "A. V. Aho and S. C. Johnson",
  title =        "{LR} Parsing",
  journal =      j-COMP-SURV,
  volume =       "6",
  number =       "2",
  pages =        "99--124",
  month =        jun,
  year =         "1974",
  CODEN =        "CMSVAN",
  DOI =          "https://doi.org/10.1145/356628.356629",
  ISSN =         "0010-4892",
  bibdate =      "Thu Jun 19 09:17:55 MDT 2008",
  bibsource =    "http://www.acm.org/pubs/contents/journals/surveys/;
                 https://www.math.utah.edu/pub/tex/bib/compsurv.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "The LR syntax analysis method is a useful and
                 versatile technique for parsing deterministic
                 context-free languages in compiling applications. This
                 paper provides an informal exposition of LR parsing
                 techniques emphasizing the mechanical generation of
                 efficient LR parsers for context-free grammars.
                 Particular attention is given to extending the parser
                 generation techniques to apply to ambiguous grammars.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Computing Surveys",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J204",
  keywords =     "ambiguous grammars; compilers; context-free languages;
                 grammars; LR grammars; parsers",
}


bibtype: article
filename: unix.bib
label: Brown:1974:CFR
author: W. S. Brown
title: On computing with factored rational expressions
journal: j-SIGSAM
volume: 8
number: 3
pages: 26--34
month: aug
monthnumber: 8
year: 1974
CODEN: SIGSBZ
DOI: https://doi.org/10.1145/1086837.1086842
ISSN: 0163-5824 (print), 1557-9492 (electronic) OR 01635824 (print), 15579492 (electronic)
ISSNL: 0163-5824 OR 01635824
bibdate: Wed Oct 5 08:31:54 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/sigsam.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2005.10.05 08:31:54 MDT
URL: https://dl.acm.org/doi/abs/10.1145/1086837.1086842
fjournal: SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation)
acknowledgement: ack-nhfb
ajournal: SIGSAM Bull.
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J1000
rawauthor: W. S. Brown
rawtitle: On computing with factored rational expressions
entry:
@Article{Brown:1974:CFR,
  author =       "W. S. Brown",
  title =        "On computing with factored rational expressions",
  journal =      j-SIGSAM,
  volume =       "8",
  number =       "3",
  pages =        "26--34",
  month =        aug,
  year =         "1974",
  CODEN =        "SIGSBZ",
  DOI =          "https://doi.org/10.1145/1086837.1086842",
  ISSN =         "0163-5824 (print), 1557-9492 (electronic)",
  ISSN-L =       "0163-5824",
  bibdate =      "Wed Oct 5 08:31:54 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://dl.acm.org/doi/abs/10.1145/1086837.1086842",
  acknowledgement = ack-nhfb,
  ajournal =     "SIGSAM Bull.",
  fjournal =     "SIGSAM Bulletin (ACM Special Interest Group on
                 Symbolic and Algebraic Manipulation)",
  issue =        "??",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}


bibtype: techreport
filename: unix.bib
label: Feldman:1974:ASC
author: Stuart I. Feldman
title: An application of symbolic computation to crystal physics
type: Computing Science Technical Report
number: 15
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Report year uncertain. Published in cite Feldman:1975:ASC.
acknowledgement: ack-nhfb
rawauthor: Stuart I. Feldman
rawtitle: An application of symbolic computation to crystal physics
entry:
@TechReport{Feldman:1974:ASC,
  author =       "Stuart I. Feldman",
  title =        "An application of symbolic computation to crystal
                 physics",
  type =         "Computing Science Technical Report",
  number =       "15",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1974 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Report year uncertain. Published in
                 \cite{Feldman:1975:ASC}.",
}


bibtype: techreport
filename: unix.bib
label: Fraser:1974:SEDa
author: A. G. Fraser
title: Spider --- an Experimental Data Communications System
type: Computing Science Technical Report
number: 23
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: dec
monthnumber: 12
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
authordates: Alexander G. (Sandy) Fraser (8 June 1937--13 June 2022)
rawauthor: A. G. Fraser
rawtitle: {Spider} --- an Experimental Data Communications System
URL:
https://www.cst.cam.ac.uk/news/death-computer-science-pioneer-sandy-fraser; https://www.fraserresearch.org/images/report_2004.pdf

remark:
TO DO: No electronic form of this report has yet been located. Published in cite Fraser:1974:SEDb. Cite in cite [p. 39, ref. 49]Holbrook:1982:HCR.

entry:
@TechReport{Fraser:1974:SEDa,
  author =       "A. G. Fraser",
  title =        "{Spider} --- an Experimental Data Communications
                 System",
  type =         "Computing Science Technical Report",
  number =       "23",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        dec,
  year =         "1974",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.cst.cam.ac.uk/news/death-computer-science-pioneer-sandy-fraser;
                 https://www.fraserresearch.org/images/report_2004.pdf",
  acknowledgement = ack-nhfb,
  author-dates = "Alexander G. (Sandy) Fraser (8 June 1937--13 June
                 2022)",
  remark =       "TO DO: No electronic form of this report has yet been
                 located. Published in \cite{Fraser:1974:SEDb}. Cite in
                 \cite[p. 39, ref. 49]{Holbrook:1982:HCR}.",
}


bibtype: inproceedings
filename: unix.bib
label: Fraser:1974:SEDb
author: A. G. Fraser
editor: IEEE
title: Spider --- an Experimental Data Communications System
publisher: pub-IEEE
address: pub-IEEE:adr
pages: 21F-1--21F-10
year: 1974
bibdate: Sat Sep 02 10:30:43 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 10:30:43 ???
note: IEEE Catalog Number 74CH0859-9-CSCB
remark: Not found in IEEE Xplore database.
acknowledgement: ack-nhfb
authordates: Alexander G. (Sandy) Fraser (8 June 1937--13 June 2022)
rawauthor: A. G. Fraser
raweditor: {IEEE}
rawnote: IEEE Catalog Number 74CH0859-9-CSCB
rawtitle: Spider --- an Experimental Data Communications System
booktitle:
Proceedings of the IEEE International Conference on Communications (ICC'74), Minneapolis (June 17--9, 1974)

rawbooktitle:
Proceedings of the {IEEE} International Conference on Communications {(ICC'74)}, Minneapolis (June 17--9, 1974)

entry:
@InProceedings{Fraser:1974:SEDb,
  author =       "A. G. Fraser",
  editor =       "{IEEE}",
  booktitle =    "Proceedings of the {IEEE} International Conference on
                 Communications {(ICC'74)}, Minneapolis (June 17--9,
                 1974)",
  title =        "Spider --- an Experimental Data Communications
                 System",
  publisher =    pub-IEEE,
  address =      pub-IEEE:adr,
  pages =        "21F-1--21F-10",
  year =         "1974",
  bibdate =      "Sat Sep 02 10:30:43 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "IEEE Catalog Number 74CH0859-9-CSCB",
  acknowledgement = ack-nhfb,
  author-dates = "Alexander G. (Sandy) Fraser (8 June 1937--13 June
                 2022)",
  remark =       "Not found in IEEE Xplore database.",
}


bibtype: techreport
filename: unix.bib
label: Hall:1974:SPEa
author: Andrew D. Hall, Jr.
title: Solving a problem in eigenvalue approximation with a symbolic algebra system
type: Computing Science Technical Report
number: 30a
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: Andrew D. {Hall, Jr.}
rawtitle: Solving a problem in eigenvalue approximation with a symbolic algebra system
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Hall:1975:SPE. Two reports numbered 30 have been found referenced: the other in cite Goldstein:1974:SPP.

entry:
@TechReport{Hall:1974:SPEa,
  author =       "Andrew D. {Hall, Jr.}",
  title =        "Solving a problem in eigenvalue approximation with a
                 symbolic algebra system",
  type =         "Computing Science Technical Report",
  number =       "30a",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1974 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Hall:1975:SPE}. Two reports numbered 30 have been
                 found referenced: the other in
                 \cite{Goldstein:1974:SPP}.",
}


bibtype: techreport
filename: unix.bib
label: Hall:1974:SPEb
author: A. J. Goldstein and A. D. Hall
title: Solutions to a Problem in Power Series Reversion
type: Computing Science Technical Report
number: 30b
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: A. J. Goldstein and A. D. Hall
rawtitle: Solutions to a Problem in Power Series Reversion
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Goldstein:1975:SPP. Two reports numbered 30 have been found referenced: the other in cite Hall:1974:SPEa.

entry:
@TechReport{Hall:1974:SPEb,
  author =       "A. J. Goldstein and A. D. Hall",
  title =        "Solutions to a Problem in Power Series Reversion",
  type =         "Computing Science Technical Report",
  number =       "30b",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1974 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Goldstein:1975:SPP}. Two reports numbered 30 have
                 been found referenced: the other in
                 \cite{Hall:1974:SPEa}.",
}


bibtype: techreport
filename: unix.bib
label: Kernighan:1974:PCT
author: Brian W. Kernighan
title: Programming in C --- A Tutorial (B.9)
type: Technical Memorandum
number: 1001 (TM 74-1273-12)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 27
day: 5
month: may
monthnumber: 5
year: 1974
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: See also UNPL(1002). Available in PDF file of cite [pp. 141--167]Dolotta:1977:DPU.
acknowledgement: ack-nhfb
rawauthor: Brian W. Kernighan
rawtitle: Programming in {C} --- A Tutorial ({B.9})
entry:
@TechReport{Kernighan:1974:PCT,
  author =       "Brian W. Kernighan",
  title =        "Programming in {C} --- A Tutorial ({B.9})",
  type =         "Technical Memorandum",
  number =       "1001 (TM 74-1273-12)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "27",
  day =          "5",
  month =        may,
  year =         "1974",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "See also UNPL(1002). Available in PDF file of
                 \cite[pp. 141--167]{Dolotta:1977:DPU}.",
}


bibtype: techreport
filename: unix.bib
label: Kernighan:1974:RPR
author: Brian W. Kernighan
title: RATFOR --- a Preprocessor for a Rational Fortran
type: Computing Science Technical Report
number: 55
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: Brian W. Kernighan
rawtitle: {RATFOR} --- a Preprocessor for a Rational {Fortran}
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Kernighan:1975:RPR. A later version is in cite Kernighan:1979:RPR.

entry:
@TechReport{Kernighan:1974:RPR,
  author =       "Brian W. Kernighan",
  title =        "{RATFOR} --- a Preprocessor for a Rational {Fortran}",
  type =         "Computing Science Technical Report",
  number =       "55",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1974 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Kernighan:1975:RPR}. A later version is in
                 \cite{Kernighan:1979:RPR}.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1974:ILC
author: Heinz Lycklama
title: Implementation of Large Contiguous Files and Asynchronous I/0 in UNIX
type: Technical Memorandum
number: 1003 (TM 74-1352-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 16
day: 4
month: jan
monthnumber: 1
year: 1974
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This document describes physical I/O for the UNIX --- A (assembler ) based System.
remark: Typewritten document.
acknowledgement: ack-nhfb
rawabstract: This document describes physical I/O for the UNIX --- A (assembler ) based System.
rawauthor: Heinz Lycklama
rawtitle: Implementation of Large Contiguous Files and Asynchronous {I/0} in {UNIX}
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-74-1352-1_Implementstion_of_Large_Contiguous_Files_and_Asynchronous_IO_in_UNIX_19740104.pdf

entry:
@TechReport{Lycklama:1974:ILC,
  author =       "Heinz Lycklama",
  title =        "Implementation of Large Contiguous Files and
                 Asynchronous {I/0} in {UNIX}",
  type =         "Technical Memorandum",
  number =       "1003 (TM 74-1352-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "16",
  day =          "4",
  month =        jan,
  year =         "1974",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-74-1352-1_Implementstion_of_Large_Contiguous_Files_and_Asynchronous_IO_in_UNIX_19740104.pdf",
  abstract =     "This document describes physical I/O for the UNIX ---
                 A (assembler ) based System.",
  abstract-2 =   "Large contiguous files and asynchronous I/0 have been
                 implemented in the UNIX time-sharing system on a
                 Digital Equipment Corporation PDP-11/45 computer. These
                 features were implemented to aid in handling the large
                 volumes of data required for picture processing
                 research in Center 135. It is now possible to transfer
                 large amounts of data ($>$512 bytes) directly to or
                 from a user's address space.",
  acknowledgement = ack-nhfb,
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1974:PFM
author: Heinz Lycklama
title: Plotting Facilities for Mini-Computer Systems
type: Technical Memorandum
number: TM-74-1352-7
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 32
day: 14
month: jun
monthnumber: 6
year: 1974
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
keywords: GLANCE; Mini-Computers; Plotting; STARE; Time-Sharing; TPLOT
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
rawtitle: Plotting Facilities for Mini-Computer Systems
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-74-1352-7_Plotting_Facilities_for_Mini-Computer_Systems_19740614.pdf

abstract:
Users of the Murray Hill HIS-6000 series computer frequently avail themselves of the TPLOT subroutine package (1) to obtain graphical data plots. These plots are usually converted to hard copy by the STARE or microfilm output facilities, but they may also be displayed on those few GLANCE CRT terminals which have been connected to the HIS computer in DAC (direct access) mode. These facilities can also be made available to the growing number of mini-computer time-sharing users by making use of the GERTS (remote terminal) communications software and hardware to send remote-entry jobs to the HIS-6000 computer. We describe a mini-computer time-sharing system, 516 TSS (2), which makes use of these facilities. Furthermore this time-sharing system has some second generation GLANCE terminals connected to it which makes it possible to generate TPLOT-like pictures locally, typically in less than a minute of computer time. These GLANCE pictures may be sent as a sequence of binary card images to the HIS-6000 computer to be plotted on STARE.

rawabstract:
Users of the Murray Hill HIS-6000 series computer frequently avail themselves of the TPLOT subroutine package (1) to obtain graphical data plots. These plots are usually converted to hard copy by the STARE or microfilm output facilities, but they may also be displayed on those few GLANCE CRT terminals which have been connected to the HIS computer in DAC (direct access) mode. These facilities can also be made available to the growing number of mini-computer time-sharing users by making use of the GERTS (remote terminal) communications software and hardware to send remote-entry jobs to the HIS-6000 computer. We describe a mini-computer time-sharing system, 516 TSS (2), which makes use of these facilities. Furthermore this time-sharing system has some second generation GLANCE terminals connected to it which makes it possible to generate TPLOT-like pictures locally, typically in less than a minute of computer time. These GLANCE pictures may be sent as a sequence of binary card images to the HIS-6000 computer to be plotted on STARE.

entry:
@TechReport{Lycklama:1974:PFM,
  author =       "Heinz Lycklama",
  title =        "Plotting Facilities for Mini-Computer Systems",
  type =         "Technical Memorandum",
  number =       "TM-74-1352-7",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "32",
  day =          "14",
  month =        jun,
  year =         "1974",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-74-1352-7_Plotting_Facilities_for_Mini-Computer_Systems_19740614.pdf",
  abstract =     "Users of the Murray Hill HIS-6000 series computer
                 frequently avail themselves of the TPLOT subroutine
                 package (1) to obtain graphical data plots. These plots
                 are usually converted to hard copy by the STARE or
                 microfilm output facilities, but they may also be
                 displayed on those few GLANCE CRT terminals which have
                 been connected to the HIS computer in DAC (direct
                 access) mode. These facilities can also be made
                 available to the growing number of mini-computer
                 time-sharing users by making use of the GERTS (remote
                 terminal) communications software and hardware to send
                 remote-entry jobs to the HIS-6000 computer. We describe
                 a mini-computer time-sharing system, 516 TSS (2), which
                 makes use of these facilities. Furthermore this
                 time-sharing system has some second generation GLANCE
                 terminals connected to it which makes it possible to
                 generate TPLOT-like pictures locally, typically in less
                 than a minute of computer time. These GLANCE pictures
                 may be sent as a sequence of binary card images to the
                 HIS-6000 computer to be plotted on STARE.",
  acknowledgement = ack-nhfb,
  keywords =     "GLANCE; Mini-Computers; Plotting; STARE; Time-Sharing;
                 TPLOT",
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: McIlroy:1974:SES
author: M. Douglas McIlroy
title: Synthetic English speech by rule
type: Computing Science Technical Report
number: 14
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: ii + 38
month: mar
monthnumber: 3
year: 1974
bibdate: Fri Sep 01 14:13:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.01 14:13:45 ???
URL: https://www.cs.dartmouth.edu/~doug/speak.tar
remark: Addenda and errata, 11 April 1974.
acknowledgement: ack-nhfb
rawauthor: M. Douglas McIlroy
rawtitle: Synthetic {English} speech by rule
abstract:
A compact program produces synthetic speech from English text via an inexpensive commercial synthesizer. The speech is not inflected, but within that constraint is deemed adequate (that is, about as intelligible as can be obtained using the device) on at least 97% of running text. The program works almost entirely by rule, most of which have a stereotyped form. Since no large dictionary is needed, secondary storage is not used. The entire body of synthesis rules is given, together with examples of their behavior.par Neither the program nor the output device pretend to produce natural speech, but it is intelligible to everybody who has heard much of it. Besides its modest cost and size, the prime virtues of the program are its accessibility and its readiness to speak anything, albeit far-fetchedly on occasion. The scheme should also prove useful as a method of last resort in concert with more sophisticated synthesis procedures

rawabstract:
A compact program produces synthetic speech from English text via an inexpensive commercial synthesizer. The speech is not inflected, but within that constraint is deemed adequate (that is, about as intelligible as can be obtained using the device) on at least 97\% of running text. The program works almost entirely by rule, most of which have a stereotyped form. Since no large dictionary is needed, secondary storage is not used. The entire body of synthesis rules is given, together with examples of their behavior.\par Neither the program nor the output device pretend to produce natural speech, but it is intelligible to everybody who has heard much of it. Besides its modest cost and size, the prime virtues of the program are its accessibility and its readiness to speak anything, albeit far-fetchedly on occasion. The scheme should also prove useful as a method of last resort in concert with more sophisticated synthesis procedures

entry:
@TechReport{McIlroy:1974:SES,
  author =       "M. Douglas McIlroy",
  title =        "Synthetic {English} speech by rule",
  type =         "Computing Science Technical Report",
  number =       "14",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "ii + 38",
  month =        mar,
  year =         "1974",
  bibdate =      "Fri Sep 01 14:13:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.cs.dartmouth.edu/~doug/speak.tar",
  abstract =     "A compact program produces synthetic speech from
                 English text via an inexpensive commercial synthesizer.
                 The speech is not inflected, but within that constraint
                 is deemed adequate (that is, about as intelligible as
                 can be obtained using the device) on at least 97\% of
                 running text. The program works almost entirely by
                 rule, most of which have a stereotyped form. Since no
                 large dictionary is needed, secondary storage is not
                 used. The entire body of synthesis rules is given,
                 together with examples of their behavior.\par

                 Neither the program nor the output device pretend to
                 produce natural speech, but it is intelligible to
                 everybody who has heard much of it. Besides its modest
                 cost and size, the prime virtues of the program are its
                 accessibility and its readiness to speak anything,
                 albeit far-fetchedly on occasion. The scheme should
                 also prove useful as a method of last resort in concert
                 with more sophisticated synthesis procedures",
  acknowledgement = ack-nhfb,
  remark =       "Addenda and errata, 11 April 1974.",
}


bibtype: techreport
filename: unix.bib
label: Morris:1974:CDT
author: Robert Morris and Lorinda L. Cherry
title: Computer Detection of Typographical Errors
type: Technical Memorandum
number: 1019 (TM 73-1271-4)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 3
month: apr
monthnumber: 4
year: 1974
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022); Robert Morris (25 July 1932--26 June 2011)
rawauthor: Robert Morris and Lorinda L. Cherry
rawtitle: Computer Detection of Typographical Errors
entry:
@TechReport{Morris:1974:CDT,
  author =       "Robert Morris and Lorinda L. Cherry",
  title =        "Computer Detection of Typographical Errors",
  type =         "Technical Memorandum",
  number =       "1019 (TM 73-1271-4)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "3",
  month =        apr,
  year =         "1974",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022);
                 Robert Morris (25 July 1932--26 June 2011)",
}


bibtype: techreport
filename: unix.bib
label: Morris:1974:WSH
author: Robert Morris and Ken Thompson
title: Webster's Second on the Head of a Pin
type: Technical Memorandum
number: 1082 (TM 74-1271-13)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 15
month: jul
monthnumber: 7
year: 1974
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
authordates: Robert Morris (25 July 1932--26 June 2011)
rawauthor: Robert Morris and Ken Thompson
rawtitle: {Webster}'s Second on the Head of a Pin
abstract:
This memo describes a list of words from Webster's booktitle Second Unabridged Dictionary definitions as a test case for special purpose text compression techniques.

rawabstract:
This memo describes a list of words from Webster's \booktitle{Second Unabridged Dictionary} definitions as a test case for special purpose text compression techniques.

entry:
@TechReport{Morris:1974:WSH,
  author =       "Robert Morris and Ken Thompson",
  title =        "{Webster}'s Second on the Head of a Pin",
  type =         "Technical Memorandum",
  number =       "1082 (TM 74-1271-13)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "15",
  month =        jul,
  year =         "1974",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memo describes a list of words from Webster's
                 \booktitle{Second Unabridged Dictionary} definitions as
                 a test case for special purpose text compression
                 techniques.",
  acknowledgement = ack-nhfb,
  author-dates = "Robert Morris (25 July 1932--26 June 2011)",
}


bibtype: techreport
filename: unix.bib
label: Ossanna:1974:TUM
author: J. F. Ossanna
title: TROFF User's Manual
type: Internal memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 4]Kernighan:1975:STM.
acknowledgement: ack-nhfb
authordates: Joseph Frank Ossanna, Jr. (10 December 1928--28 November 1977)
rawauthor: J. F. Ossanna
rawtitle: {TROFF} User's Manual
entry:
@TechReport{Ossanna:1974:TUM,
  author =       "J. F. Ossanna",
  title =        "{TROFF} User's Manual",
  type =         "Internal memorandum",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1974",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Joseph Frank Ossanna, Jr. (10 December 1928--28
                 November 1977)",
  remark =       "Cited in \cite[ref. 4]{Kernighan:1975:STM}.",
}


bibtype: techreport
filename: unix.bib
label: Ritchie:1974:CRM
author: D. M. Ritchie
title: C Reference Manual
type: Internal memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1974
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 7]Kernighan:1975:STM.
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: D. M. Ritchie
rawtitle: {C} Reference Manual
entry:
@TechReport{Ritchie:1974:CRM,
  author =       "D. M. Ritchie",
  title =        "{C} Reference Manual",
  type =         "Internal memorandum",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1974",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  remark =       "Cited in \cite[ref. 4]{}.",
  remark =       "Cited in \cite[ref. 7]{Kernighan:1975:STM}.",
}


bibtype: article
filename: unix.bib
label: Ritchie:1974:UTS
author: Dennis W. Ritchie and Ken Thompson
title: The UNIX Time-Sharing System
journal: j-CACM
volume: 17
number: 7
pages: 365--375
month: jul
monthnumber: 7
year: 1974
CODEN: CACMA2
DOI: https://doi.org/10.1145/361011.361061
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Mon Oct 4 11:57:23 1993
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1993.10.04 11:57:23 ???
fjournal: Communications of the ACM
remark: This paper received the ACM award for best paper in programming languages and systems in 1974.
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
rawauthor: Dennis W. Ritchie and Ken Thompson
rawtitle: The {UNIX} Time-Sharing System
URL:
http://www.labouseur.com/courses/os/UNIX-Time-Sharing-System-by-Ritchie-and-Thompson.pdf; https://www2.cs.duke.edu/courses/cps210/spring16/resources/papers/p365-ritchie.pdf

entry:
@Article{Ritchie:1974:UTS,
  author =       "Dennis W. Ritchie and Ken Thompson",
  title =        "The {UNIX} Time-Sharing System",
  journal =      j-CACM,
  volume =       "17",
  number =       "7",
  pages =        "365--375",
  month =        jul,
  year =         "1974",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/361011.361061",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Oct 4 11:57:23 1993",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.labouseur.com/courses/os/UNIX-Time-Sharing-System-by-Ritchie-and-Thompson.pdf;
                 https://www2.cs.duke.edu/courses/cps210/spring16/resources/papers/p365-ritchie.pdf",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  remark =       "This paper received the ACM award for best paper in
                 programming languages and systems in 1974.",
}


bibtype: article
filename: unix.bib
label: Ryder:1974:PV
author: Barbara G. Ryder
title: The PFORT Verifier
journal: j-SPE
volume: 4
number: 4
pages: 359--377
month: oct
monthnumber: 10
year: 1974
CODEN: SPEXBL
DOI: https://doi.org/10.1002/spe.4380040405
ISSN: 0038-0644 (print), 1097-024X (electronic) OR 00380644 (print), 1097024X (electronic)
ISSNL: 0038-0644 OR 00380644
bibdate: Sat May 31 13:36:16 MDT 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1997.05.31 13:36:16 MDT
fjournal: Software --- Practice and Experience
acknowledgement: ack-nhfb
ajournal: Softw. Pract. Exp.
journalURL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X
onlinedate: 27 Oct 2006
rawauthor: Barbara G. Ryder
rawtitle: The {PFORT} Verifier
entry:
@Article{Ryder:1974:PV,
  author =       "Barbara G. Ryder",
  title =        "The {PFORT} Verifier",
  journal =      j-SPE,
  volume =       "4",
  number =       "4",
  pages =        "359--377",
  month =        oct # "\slash " # dec,
  year =         "1974",
  CODEN =        "SPEXBL",
  DOI =          "https://doi.org/10.1002/spe.4380040405",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/spe.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. Pract. Exp.",
  fjournal =     "Software --- Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "27 Oct 2006",
  received =     "8 April 1974",
}


bibtype: techreport
filename: unix.bib
label: Swanson:1974:GFC
author: G. K. Swanson
title: GRAFPAC / FR80 --- A C Version Of Deferred GRAFPAC Under the UNIX Time-Sharing System
type: Technical Memorandum
number: 1018 (TM 74-1353-6)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 23
month: sep
monthnumber: 9
year: 1974
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: G. K. Swanson
rawtitle: {GRAFPAC\slash FR80} --- A {C} Version Of Deferred {GRAFPAC} Under the {UNIX} Time-Sharing System
entry:
@TechReport{Swanson:1974:GFC,
  author =       "G. K. Swanson",
  title =        "{GRAFPAC\slash FR80} --- A {C} Version Of Deferred
                 {GRAFPAC} Under the {UNIX} Time-Sharing System",
  type =         "Technical Memorandum",
  number =       "1018 (TM 74-1353-6)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "23",
  month =        sep,
  year =         "1974",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "",
  acknowledgement = ack-nhfb,
}


bibtype: misc
filename: unix.bib
label: Thompson:1974:UPM
author: Ken Thompson and Dennis M. Ritchie
title: Unix Programmer's Manual
edition: Fifth
month: jun
monthnumber: 6
year: 1974
bibdate: Fri Feb 16 10:36:45 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.02.16 10:36:45 ???
note: This is the fifth of seven editions (see cite Thompson:2018:TRE).
URL: http://www.tuhs.org/Archive/Distributions/Research/Dennis_v5/v5man.pdf
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
howpublished: Web site
rawauthor: Ken Thompson and Dennis M. Ritchie
rawnote: This is the fifth of seven editions (see \cite{Thompson:2018:TRE}).
rawtitle: {Unix} Programmer's Manual
entry:
@Misc{Thompson:1974:UPM,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{Unix} Programmer's Manual",
  howpublished = "Web site",
  edition =      "Fifth",
  month =        jun,
  year =         "1974",
  bibdate =      "Fri Feb 16 10:36:45 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This is the fifth of seven editions (see
                 \cite{Thompson:2018:TRE}).",
  URL =          "http://www.tuhs.org/Archive/Distributions/Research/Dennis_v5/v5man.pdf",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Vogel:1974:RSU
author: G. C. Vogel
title: Referencing Standard UNIX Documentation
type: Technical Memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 23
month: aug
monthnumber: 8
year: 1974
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
note: Memorandum For File.
acknowledgement: ack-nhfb
rawauthor: G. C. Vogel
rawnote: Memorandum For File.
rawtitle: Referencing Standard {UNIX} Documentation
entry:
@TechReport{Vogel:1974:RSU,
  author =       "G. C. Vogel",
  title =        "Referencing Standard {UNIX} Documentation",
  type =         "Technical Memorandum",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "23",
  month =        aug,
  year =         "1974",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Memorandum For File.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: unix.bib
label: Aho:1975:DPA
author: Alfred V. Aho and Stephen C. Johnson and Jeffrey D. Ullman
title: Deterministic Parsing of Ambiguous Grammars
journal: j-CACM
volume: 18
number: 8
pages: 441--452
month: aug
monthnumber: 8
year: 1975
CODEN: CACMA2
DOI: https://doi.org/10.1145/360933.360969
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
MRclass: 68A25
MRnumber: 51 12033
MRreviewer: S. Ginsburg
bibdate: Mon Jan 22 06:20:50 MST 2001
bibtimestamp: 2001.01.22 06:20:50 MST
acknowledgement: ack-nhfb
classcodes: C4210 (Formal logic)
corpsource: Bell Labs., Murray Hill, NJ, USA
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
journalabr: Commun ACM
treatment: T Theoretical or Mathematical
rawauthor: Alfred V. Aho and Stephen C. Johnson and Jeffrey D. Ullman
rawtitle: Deterministic Parsing of Ambiguous Grammars
bibsource:
Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#AhoJU75; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve syntactic ambiguities. It is shown how efficient LR and LL parsers can be constructed directly from certain classes of these specifications.

keywords:
ambiguities; ambiguous grammars; computer programming languages; context free grammars; context-free grammars; LL parsers; LR parsing; parser generation; programming languages; syntactic; translator writing systems

rawabstract:
Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve syntactic ambiguities. It is shown how efficient LR and LL parsers can be constructed directly from certain classes of these specifications.

entry:
@Article{Aho:1975:DPA,
  author =       "Alfred V. Aho and Stephen C. Johnson and Jeffrey D.
                 Ullman",
  title =        "Deterministic Parsing of Ambiguous Grammars",
  journal =      j-CACM,
  volume =       "18",
  number =       "8",
  pages =        "441--452",
  month =        aug,
  year =         "1975",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/360933.360969",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68A25",
  MRnumber =     "51 12033",
  MRreviewer =   "S. Ginsburg",
  bibdate =      "Mon Jan 22 06:20:50 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#AhoJU75;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Methods of describing the syntax of programming
                 languages in ways that are more flexible and natural
                 than conventional BNF descriptions are considered.
                 These methods involve the use of ambiguous context-free
                 grammars together with rules to resolve syntactic
                 ambiguities. It is shown how efficient LR and LL
                 parsers can be constructed directly from certain
                 classes of these specifications.",
  acknowledgement = ack-nhfb,
  classcodes =   "C4210 (Formal logic)",
  classification = "723",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  journalabr =   "Commun ACM",
  keywords =     "ambiguities; ambiguous grammars; computer programming
                 languages; context free grammars; context-free
                 grammars; LL parsers; LR parsing; parser generation;
                 programming languages; syntactic; translator writing
                 systems",
  oldlabel =     "AhoJU75",
  treatment =    "T Theoretical or Mathematical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AhoJU75",
}


bibtype: article
filename: unix.bib
label: Aho:1975:ESM
author: Alfred V. Aho and Margaret J. Corasick
title: Efficient String Matching: an Aid to Bibliographic Search
journal: j-CACM
volume: 18
number: 6
pages: 333--340
month: jun
monthnumber: 6
year: 1975
CODEN: CACMA2
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
MRclass: 68A50
MRnumber: 51 7393
MRreviewer: K. H. V. Booth
bibdate: Mon Jan 22 06:20:48 MST 2001
bibtimestamp: 2001.01.22 06:20:48 MST
acknowledgement: ack-nhfb
classcodes: C6120 (File organisation); C7250 (Information storage and retrieval)
corpsource: Bell Labs., Murray Hill, NJ, USA
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
journalabr: Commun ACM
treatment: P Practical
rawauthor: Alfred V. Aho and Margaret J. Corasick
rawtitle: Efficient String Matching: an Aid to Bibliographic Search
bibsource:
Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#AhoC75; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching machine in processing the text string is independent of the number of keywords. The algorithm has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.

keywords:
algorithm; automata theory --- Finite Automata; bibliographic search; computational complexity.; efficient; finite state machines; finite state pattern matching; information retrieval; information retrieval systems; keywords; keywords and phrases; patterns UNIX searching; string matching; string pattern matching; text; text editing; text-editing

rawabstract:
This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching machine in processing the text string is independent of the number of keywords. The algorithm has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.

entry:
@Article{Aho:1975:ESM,
  author =       "Alfred V. Aho and Margaret J. Corasick",
  title =        "Efficient String Matching: an Aid to Bibliographic
                 Search",
  journal =      j-CACM,
  volume =       "18",
  number =       "6",
  pages =        "333--340",
  month =        jun,
  year =         "1975",
  CODEN =        "CACMA2",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  MRclass =      "68A50",
  MRnumber =     "51 7393",
  MRreviewer =   "K. H. V. Booth",
  bibdate =      "Mon Jan 22 06:20:48 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib;
                 ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#AhoC75;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes a simple, efficient algorithm to
                 locate all occurrences of any of a finite number of
                 keywords in a string of text. The algorithm consists of
                 constructing a finite state pattern matching machine
                 from the keywords and then using the pattern matching
                 machine to process the text string in a single pass.
                 Construction of the pattern matching machine takes time
                 proportional to the sum of the lengths of the keywords.
                 The number of state transitions made by the pattern
                 matching machine in processing the text string is
                 independent of the number of keywords. The algorithm
                 has been used to improve the speed of a library
                 bibliographic search program by a factor of 5 to 10.",
  acknowledgement = ack-nhfb,
  classcodes =   "C6120 (File organisation); C7250 (Information storage
                 and retrieval)",
  classification = "721; 723",
  corpsource =   "Bell Labs., Murray Hill, NJ, USA",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  journalabr =   "Commun ACM",
  keywords =     "algorithm; automata theory --- Finite Automata;
                 bibliographic search; computational complexity.;
                 efficient; finite state machines; finite state pattern
                 matching; information retrieval; information retrieval
                 systems; keywords; keywords and phrases; patterns UNIX
                 searching; string matching; string pattern matching;
                 text; text editing; text-editing",
  oldlabel =     "AhoC75",
  treatment =    "P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AhoC75",
}


bibtype: inproceedings
filename: unix.bib
label: Aho:1975:OCG
author: A. V. Aho and S. C. Johnson
title: Optimal code generation for expression trees
crossref: ACM:1975:CRS
pages: 207--217
year: 1975
bibdate: Wed Feb 20 18:33:29 MST 2002
bibtimestamp: 2002.02.20 18:33:29 MST
acknowledgement: ack-nhfb
rawauthor: A. V. Aho and S. C. Johnson
rawtitle: Optimal code generation for expression trees
bibsource:
http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/stoc1970.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@InProceedings{Aho:1975:OCG,
  author =       "A. V. Aho and S. C. Johnson",
  title =        "Optimal code generation for expression trees",
  crossref =     "ACM:1975:CRS",
  pages =        "207--217",
  year =         "1975",
  bibdate =      "Wed Feb 20 18:33:29 MST 2002",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/stoc1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Baker:1975:SPW
author: Brenda S. Baker
title: Struct --- A Program Which Structures Fortran
type: Technical Memorandum
number: 1084 (TM 75-1271-12)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 22
month: dec
monthnumber: 12
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
note: See also cite Baker:1977:ASF.
remark: See also UNPL(1103).
acknowledgement: ack-nhfb
rawauthor: Brenda S. Baker
rawnote: See also \cite{Baker:1977:ASF}.
rawtitle: {Struct} --- A Program Which Structures {Fortran}
abstract:
Fortran programs are often difficult to read because Fortran lacks good constructs for describing flow of control. Programs with many goto statements are sometimes incomprehensible. Struct is a program which rewrites Fortran programs using Ratfor control constructs, such as while and if else statements. These constructs are used by Struct to make loops and branching apparent. The resulting programs appear natural to the reader because Struct follows structuring principles based on normal programming practices. Consequently, the structured programs generated by Struct are dramatically easier to understand than their Fortran counterparts.par Since the structured programs are easier to understand, they are easier to modify and debug. Therefore, Struct is a useful tool for the maintenance of existing Fortran programs. New programs can be written in Ratfor, while old programs can be translated into Ratfor. Thus, all programs can be maintained in the same structured language.par Struct is written in C and currently runs on the PDP-11/45 under UNIX.

rawabstract:
Fortran programs are often difficult to read because Fortran lacks good constructs for describing flow of control. Programs with many goto statements are sometimes incomprehensible. Struct is a program which rewrites Fortran programs using Ratfor control constructs, such as while and if else statements. These constructs are used by Struct to make loops and branching apparent. The resulting programs appear natural to the reader because Struct follows structuring principles based on normal programming practices. Consequently, the structured programs generated by Struct are dramatically easier to understand than their Fortran counterparts.\par Since the structured programs are easier to understand, they are easier to modify and debug. Therefore, Struct is a useful tool for the maintenance of existing Fortran programs. New programs can be written in Ratfor, while old programs can be translated into Ratfor. Thus, all programs can be maintained in the same structured language.\par Struct is written in C and currently runs on the PDP-11/45 under UNIX.

entry:
@TechReport{Baker:1975:SPW,
  author =       "Brenda S. Baker",
  title =        "{Struct} --- A Program Which Structures {Fortran}",
  type =         "Technical Memorandum",
  number =       "1084 (TM 75-1271-12)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "22",
  month =        dec,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "See also \cite{Baker:1977:ASF}.",
  abstract =     "Fortran programs are often difficult to read because
                 Fortran lacks good constructs for describing flow of
                 control. Programs with many goto statements are
                 sometimes incomprehensible. Struct is a program which
                 rewrites Fortran programs using Ratfor control
                 constructs, such as while and if else statements. These
                 constructs are used by Struct to make loops and
                 branching apparent. The resulting programs appear
                 natural to the reader because Struct follows
                 structuring principles based on normal programming
                 practices. Consequently, the structured programs
                 generated by Struct are dramatically easier to
                 understand than their Fortran counterparts.\par

                 Since the structured programs are easier to understand,
                 they are easier to modify and debug. Therefore, Struct
                 is a useful tool for the maintenance of existing
                 Fortran programs. New programs can be written in
                 Ratfor, while old programs can be translated into
                 Ratfor. Thus, all programs can be maintained in the
                 same structured language.\par

                 Struct is written in C and currently runs on the
                 PDP-11/45 under UNIX.",
  abstract-2 =   "Struct is a program which rewrites Fortran programs
                 using Ratfor control constructs, such as WHILE and IF
                 ELSE statements. These constructs are used by Struct to
                 make loops and branching apparent.",
  acknowledgement = ack-nhfb,
  remark =       "See also UNPL(1103).",
}


bibtype: techreport
filename: unix.bib
label: Bayer:1975:MME
author: D. L. Bayer and Heinz Lycklama
title: MERT --- a Multi-Environment Real-Time Operating System
type: Technical Memorandum
number: 1062 (TM-75-1352-7)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 36
day: 18
month: jul
monthnumber: 7
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: D. L. Bayer and Heinz Lycklama
rawtitle: {MERT} --- a Multi-Environment Real-Time Operating System
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-7_MERT_A_Multi-Environment_Real-Time_Operating_System_19751118.pdf

abstract:
MERT is a multi-environment real-time operating system for the Digital Equipment Corporation PDP-11/45 and 11/70 computers. It is a structured operating system built on top of a kernel which provides the basic services such as memory management, process scheduling and trap handling needed to build various operating system environments. Real-time response to processes is achieved by means of preemptive priority scheduling. The file system structure is optimized for real-time response. Processes are built as modular entities with data structures that are independent of all other processes. Interprocess communication is achieved by means of messages, event flags, shared segments and shared files. Process ports are used for communication between unrelated processes. This memorandum was submitted as a paper to be presented at SIGOPS Conference, November 17, 1975.

rawabstract:
MERT is a multi-environment real-time operating system for the Digital Equipment Corporation PDP-11/45 and 11/70 computers. It is a structured operating system built on top of a kernel which provides the basic services such as memory management, process scheduling and trap handling needed to build various operating system environments. Real-time response to processes is achieved by means of preemptive priority scheduling. The file system structure is optimized for real-time response. Processes are built as modular entities with data structures that are independent of all other processes. Interprocess communication is achieved by means of messages, event flags, shared segments and shared files. Process ports are used for communication between unrelated processes. This memorandum was submitted as a paper to be presented at SIGOPS Conference, November 17, 1975.

entry:
@TechReport{Bayer:1975:MME,
  author =       "D. L. Bayer and Heinz Lycklama",
  title =        "{MERT} --- a Multi-Environment Real-Time Operating
                 System",
  type =         "Technical Memorandum",
  number =       "1062 (TM-75-1352-7)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "36",
  day =          "18",
  month =        jul,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-7_MERT_A_Multi-Environment_Real-Time_Operating_System_19751118.pdf",
  abstract =     "MERT is a multi-environment real-time operating system
                 for the Digital Equipment Corporation PDP-11/45 and
                 11/70 computers. It is a structured operating system
                 built on top of a kernel which provides the basic
                 services such as memory management, process scheduling
                 and trap handling needed to build various operating
                 system environments. Real-time response to processes is
                 achieved by means of preemptive priority scheduling.
                 The file system structure is optimized for real-time
                 response. Processes are built as modular entities with
                 data structures that are independent of all other
                 processes. Interprocess communication is achieved by
                 means of messages, event flags, shared segments and
                 shared files. Process ports are used for communication
                 between unrelated processes. This memorandum was
                 submitted as a paper to be presented at SIGOPS
                 Conference, November 17, 1975.",
  abstract-2 =   "Memorandum for File.",
  acknowledgement = ack-nhfb,
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: Bayer:1975:SOS
author: Heinz Lycklama and D. L. Bayer
title: A Structured Operating System for a PDP-11 / 45
type: Technical Memorandum
number: 1052 (TM 75-1352-4)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 6
month: may
monthnumber: 5
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This paper provides an overview of the MERT System on which UNIX Time-Sharing has been implemented.
acknowledgement: ack-nhfb
rawabstract: This paper provides an overview of the MERT System on which UNIX Time-Sharing has been implemented.
rawauthor: Heinz Lycklama and D. L. Bayer
rawtitle: A Structured Operating System for a {PDP-11\slash 45}
entry:
@TechReport{Bayer:1975:SOS,
  author =       "Heinz Lycklama and D. L. Bayer",
  title =        "A Structured Operating System for a {PDP-11\slash
                 45}",
  type =         "Technical Memorandum",
  number =       "1052 (TM 75-1352-4)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "6",
  month =        may,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper provides an overview of the MERT System on
                 which UNIX Time-Sharing has been implemented.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Blue:1975:ANQ
author: James L. Blue
title: Automatic Numerical Quadrature --- DQUAD
type: Computing Science Technical Report
number: 25
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1975
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: James L. Blue
rawtitle: Automatic Numerical Quadrature --- {DQUAD}
remark:
TO DO: No electronic form of this report has yet been located. Published in cite Blue:1977:ANQ. Referenced in cite [p. 209, ref. 14]Gatto:1981:NEM in elefunt.bib.

entry:
@TechReport{Blue:1975:ANQ,
  author =       "James L. Blue",
  title =        "Automatic Numerical Quadrature --- {DQUAD}",
  type =         "Computing Science Technical Report",
  number =       "25",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1975",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located. Published in \cite{Blue:1977:ANQ}. Referenced
                 in \cite[p. 209, ref. 14]{Gatto:1981:NEM} in
                 elefunt.bib.",
}


bibtype: article
filename: unix.bib
label: Chen:1975:SUA
author: Stephen Chen
title: On the Sethi--Ullman algorithm
journal: j-INT-J-COMPUT-MATH
volume: 5
number: 1--4
pages: 37--55
month: jan
monthnumber: 1
year: 1975
CODEN: IJCMAT
DOI: https://doi.org/10.1080/00207167508803101
ISSN: 0020-7160 OR 00207160
ISSNL: 0020-7160 OR 00207160
bibdate: Fri Sep 1 09:55:15 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.01 09:55:15 ???
fjournal: International Journal of Computer Mathematics
acknowledgement: ack-nhfb
journalURL: http://www.tandfonline.com/loi/gcom20
rawauthor: Stephen Chen
rawtitle: On the {Sethi--Ullman} algorithm
entry:
@Article{Chen:1975:SUA,
  author =       "Stephen Chen",
  title =        "On the {Sethi--Ullman} algorithm",
  journal =      j-INT-J-COMPUT-MATH,
  volume =       "5",
  number =       "1--4",
  pages =        "37--55",
  month =        jan,
  year =         "1975",
  CODEN =        "IJCMAT",
  DOI =          "https://doi.org/10.1080/00207167508803101",
  ISSN =         "0020-7160",
  ISSN-L =       "0020-7160",
  bibdate =      "Fri Sep 1 09:55:15 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "International Journal of Computer Mathematics",
  journal-URL =  "http://www.tandfonline.com/loi/gcom20",
}


bibtype: article
filename: unix.bib
label: Chesson:1975:NUS
author: Gregory L. Chesson
title: The network Unix system
journal: j-OPER-SYS-REV
volume: 9
number: 5
pages: 60--66
month: nov
monthnumber: 11
year: 1975
CODEN: OSRED8
ISSN: 0163-5980 (print), 1943-586X (electronic) OR 01635980 (print), 1943586X (electronic)
ISSNL: 0163-5980 OR 01635980
bibdate: Sat Aug 26 08:55:57 MDT 2006
bibsource: http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2006.08.26 08:55:57 MDT
fjournal: ACM SIGOPS Operating Systems Review
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J597
rawauthor: Gregory L. Chesson
rawtitle: The network {Unix} system
entry:
@Article{Chesson:1975:NUS,
  author =       "Gregory L. Chesson",
  title =        "The network {Unix} system",
  journal =      j-OPER-SYS-REV,
  volume =       "9",
  number =       "5",
  pages =        "60--66",
  month =        nov,
  year =         "1975",
  CODEN =        "OSRED8",
  ISSN =         "0163-5980 (print), 1943-586X (electronic)",
  ISSN-L =       "0163-5980",
  bibdate =      "Sat Aug 26 08:55:57 MDT 2006",
  bibsource =    "http://portal.acm.org/;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM SIGOPS Operating Systems Review",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J597",
}


bibtype: techreport
filename: unix.bib
label: Elliott:1975:TBS
author: R. J. Elliott
title: A Tape Back-Up System For The Network File Store
type: Technical Memorandum
number: 1081 (TM 75-1273-12)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 24
month: nov
monthnumber: 11
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: R. J. Elliott
rawtitle: A Tape Back-Up System For The Network File Store
abstract:
This paper describes a system which maintains a complete copy on tape of all files on the file store of the Spider Network.

rawabstract:
This paper describes a system which maintains a complete copy on tape of all files on the file store of the Spider Network.

entry:
@TechReport{Elliott:1975:TBS,
  author =       "R. J. Elliott",
  title =        "A Tape Back-Up System For The Network File Store",
  type =         "Technical Memorandum",
  number =       "1081 (TM 75-1273-12)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "24",
  month =        nov,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes a system which maintains a
                 complete copy on tape of all files on the file store of
                 the Spider Network.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: unix.bib
label: Feldman:1975:ASC
author: Stuart I. Feldman
title: An application of symbolic computation to crystal physics
journal: j-SIGSAM
volume: 9
number: 2
pages: 19--24
month: may
monthnumber: 5
year: 1975
CODEN: SIGSBZ
DOI: https://doi.org/10.1145/1088301.1088307
ISSN: 0163-5824 (print), 1557-9492 (electronic) OR 01635824 (print), 15579492 (electronic)
ISSNL: 0163-5824 OR 01635824
bibdate: Wed Oct 5 08:31:54 MDT 2005
bibsource: https://www.math.utah.edu/pub/tex/bib/sigsam.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2005.10.05 08:31:54 MDT
URL: https://dl.acm.org/doi/10.1145/1088301.1088307
fjournal: SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation)
acknowledgement: ack-nhfb
ajournal: SIGSAM Bull.
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J1000
rawauthor: Stuart I. Feldman
rawtitle: An application of symbolic computation to crystal physics
entry:
@Article{Feldman:1975:ASC,
  author =       "Stuart I. Feldman",
  title =        "An application of symbolic computation to crystal
                 physics",
  journal =      j-SIGSAM,
  volume =       "9",
  number =       "2",
  pages =        "19--24",
  month =        may,
  year =         "1975",
  CODEN =        "SIGSBZ",
  DOI =          "https://doi.org/10.1145/1088301.1088307",
  ISSN =         "0163-5824 (print), 1557-9492 (electronic)",
  ISSN-L =       "0163-5824",
  bibdate =      "Wed Oct 5 08:31:54 MDT 2005",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/sigsam.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://dl.acm.org/doi/10.1145/1088301.1088307",
  acknowledgement = ack-nhfb,
  ajournal =     "SIGSAM Bull.",
  cstr-number =  "15",
  fjournal =     "SIGSAM Bulletin (ACM Special Interest Group on
                 Symbolic and Algebraic Manipulation)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J1000",
}


bibtype: techreport
filename: unix.bib
label: Fraser:1975:COM
author: A. G. Fraser and Dennis M. Ritchie
title: C-Language Oriented Microprogram for the HP-21 MX
type: Technical Memorandum
number: 1058 (TM 75-1273-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 25
month: feb
monthnumber: 2
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: A. G. Fraser and Dennis M. Ritchie
rawtitle: {C}-Language Oriented Microprogram for the {HP-21 MX}
abstract:
This paper proposes an instruction-set architecture designed for implementation on the Hewlett-Packard 21 MX micro-programmed processor.

authordates:
Alexander G. (Sandy) Fraser (8 June 1937--13 June 2022); Dennis M. Ritchie (9 September 1941--12 October 2011)

rawabstract:
This paper proposes an instruction-set architecture designed for implementation on the Hewlett-Packard 21 MX micro-programmed processor.

entry:
@TechReport{Fraser:1975:COM,
  author =       "A. G. Fraser and Dennis M. Ritchie",
  title =        "{C}-Language Oriented Microprogram for the {HP-21
                 MX}",
  type =         "Technical Memorandum",
  number =       "1058 (TM 75-1273-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "25",
  month =        feb,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper proposes an instruction-set architecture
                 designed for implementation on the Hewlett-Packard 21
                 MX micro-programmed processor.",
  acknowledgement = ack-nhfb,
  author-dates = "Alexander G. (Sandy) Fraser (8 June 1937--13 June
                 2022); Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Fraser:1975:PSF
author: A. G. Fraser
title: The present status and future trends in computer / communication technology
type: Computing Science Technical Report
number: 40
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1975
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
authordates: Alexander G. (Sandy) Fraser (8 June 1937--13 June 2022)
rawauthor: A. G. Fraser
rawtitle: The present status and future trends in computer\slash communication technology
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Fraser:1976:PSF.

entry:
@TechReport{Fraser:1975:PSF,
  author =       "A. G. Fraser",
  title =        "The present status and future trends in computer\slash
                 communication technology",
  type =         "Computing Science Technical Report",
  number =       "40",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1975 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Alexander G. (Sandy) Fraser (8 June 1937--13 June
                 2022)",
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Fraser:1976:PSF}.",
}


bibtype: techreport
filename: unix.bib
label: Gajewska:1975:SSU
author: H. Gajewska and Steven C. Johnson
title: Some Statistics On The Usage Of The C Language
type: Technical Memorandum
number: 1102 (TM 75-1273-13)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 24
month: nov
monthnumber: 11
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This paper describes a program that analyses programs written in the C language.
acknowledgement: ack-nhfb
rawabstract: This paper describes a program that analyses programs written in the C language.
rawauthor: H. Gajewska and Steven C. Johnson
rawtitle: Some Statistics On The Usage Of The {C} Language
entry:
@TechReport{Gajewska:1975:SSU,
  author =       "H. Gajewska and Steven C. Johnson",
  title =        "Some Statistics On The Usage Of The {C} Language",
  type =         "Technical Memorandum",
  number =       "1102 (TM 75-1273-13)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "24",
  month =        nov,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes a program that analyses programs
                 written in the C language.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Goldstein:1975:CFT
author: A. J. Goldstein and A. B. Lesk
title: Common feature techniques for discrete optimization
type: Computing Science Technical Report
number: 27
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: mar
monthnumber: 3
year: 1975
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: A. J. Goldstein and A. B. Lesk
rawtitle: Common feature techniques for discrete optimization
remark:
TO DO: No electronic form of this report has yet been located. Published in cite Goldstein:1976:CFT.

entry:
@TechReport{Goldstein:1975:CFT,
  author =       "A. J. Goldstein and A. B. Lesk",
  title =        "Common feature techniques for discrete optimization",
  type =         "Computing Science Technical Report",
  number =       "27",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        mar,
  year =         "1975",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located. Published in \cite{Goldstein:1976:CFT}.",
}


bibtype: article
filename: unix.bib
label: Goldstein:1975:SPP
author: A. J. Goldstein and A. D. Hall
title: Solutions to a Problem in Power Series Reversion
journal: j-SIAM-J-MATH-ANA
volume: 6
number: 1
pages: 192--198
month: feb
monthnumber: 2
year: 1975
CODEN: SJMAAH
DOI: https://doi.org/10.1137/0506019
ISSN: 0036-1410 (print), 1095-7154 (electronic) OR 00361410 (print), 10957154 (electronic)
ISSNL: 0036-1410 OR 00361410
MRclass: 40B05
MRnumber: MR0361512 (50 \#13957)
MRreviewer: M. Stieglitz
bibdate: Sun Nov 28 19:27:53 MST 2010
bibtimestamp: 2010.11.28 19:27:53 MST
URL: https://dl.acm.org/doi/10.1137/0506019
fjournal: SIAM Journal on Mathematical Analysis
acknowledgement: ack-nhfb
journalURL: http://epubs.siam.org/sima
rawauthor: A. J. Goldstein and A. D. Hall
rawtitle: Solutions to a Problem in Power Series Reversion
bibsource:
http://epubs.siam.org/sam-bin/dbq/toc/SIMA/6/1; https://www.math.utah.edu/pub/tex/bib/siamjmathana.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{Goldstein:1975:SPP,
  author =       "A. J. Goldstein and A. D. Hall",
  title =        "Solutions to a Problem in Power Series Reversion",
  journal =      j-SIAM-J-MATH-ANA,
  volume =       "6",
  number =       "1",
  pages =        "192--198",
  month =        feb,
  year =         "1975",
  CODEN =        "SJMAAH",
  DOI =          "https://doi.org/10.1137/0506019",
  ISSN =         "0036-1410 (print), 1095-7154 (electronic)",
  ISSN-L =       "0036-1410",
  MRclass =      "40B05",
  MRnumber =     "MR0361512 (50 \#13957)",
  MRreviewer =   "M. Stieglitz",
  bibdate =      "Sun Nov 28 19:27:53 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toc/SIMA/6/1;
                 https://www.math.utah.edu/pub/tex/bib/siamjmathana.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://dl.acm.org/doi/10.1137/0506019",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Mathematical Analysis",
  journal-URL =  "http://epubs.siam.org/sima",
}


bibtype: article
filename: unix.bib
label: Hall:1975:SPE
author: Andrew D. Hall, Jr.
title: Solving a problem in eigenvalue approximation with a symbolic algebra system
journal: j-SIAM-J-COMPUT
volume: 4
number: 2
pages: 163--174
year: 1975
CODEN: SMJCAT
ISSN: 0097-5397 (print), 1095-7111 (electronic) OR 00975397 (print), 10957111 (electronic)
ISSNL: 0097-5397 OR 00975397
MRclass: 68A15 (65L15)
MRnumber: MR0378468 (51 \#14636)
MRreviewer: Bernard H. Rosman
bibdate: Mon Nov 29 10:58:08 MST 2010
bibtimestamp: 2010.11.29 10:58:08 MST
fjournal: SIAM Journal on Computing
acknowledgement: ack-nhfb
journalURL: http://epubs.siam.org/sicomp
rawauthor: Andrew D. {Hall, Jr.}
rawtitle: Solving a problem in eigenvalue approximation with a symbolic algebra system
bibsource:
http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/4/2; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{Hall:1975:SPE,
  author =       "Andrew D. {Hall, Jr.}",
  title =        "Solving a problem in eigenvalue approximation with a
                 symbolic algebra system",
  journal =      j-SIAM-J-COMPUT,
  volume =       "4",
  number =       "2",
  pages =        "163--174",
  month =        "????",
  year =         "1975",
  CODEN =        "SMJCAT",
  ISSN =         "0097-5397 (print), 1095-7111 (electronic)",
  ISSN-L =       "0097-5397",
  MRclass =      "68A15 (65L15)",
  MRnumber =     "MR0378468 (51 \#14636)",
  MRreviewer =   "Bernard H. Rosman",
  bibdate =      "Mon Nov 29 10:58:08 MST 2010",
  bibsource =    "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/4/2;
                 https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "SIAM Journal on Computing",
  journal-URL =  "http://epubs.siam.org/sicomp",
}


bibtype: mastersthesis
filename: unix.bib
label: Hawley:1975:MMV
author: John Alfred Hawley III and Walter de Briton Meyer
title: MUNIX, a multiprocessing version of UNIX
type: Master's thesis
school: Department of Computer Science, Naval Postgraduate School
address: Monterey, CA, USA
pages: 58
month: jun
monthnumber: 6
year: 1975
bibdate: Thu Jan 16 06:27:41 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.01.16 06:27:41 ???
URL: http://hdl.handle.net/10945/20959; https://calhoun.nps.edu/handle/10945/20959
acknowledgement: ack-nhfb
advisor: B. E. Allen
rawauthor: John Alfred {Hawley III} and Walter de Briton Meyer
rawtitle: {MUNIX}, a multiprocessing version of {UNIX}
abstract:
Reported herein is the modification of a monoprocessing operating system, UNIX, designed to support an interactive multiprogramming environment on the PDP 11/40, 11/45 and 11/50 computers,' to a multiprocessing operating system utilizing two PDP 11/50 processors and an expanded set of peripheral devices. The evolution of change from UNIX to the more responsive and efficient modified version called MUNIX is documented here to provide a basis for continuing work on the system and as a guide that might prove helpful to others engaged in similar projects. MUNIX, while retaining all the qualities of UNIX, provides increased system efficiency and improved response to users. Although the project is considered a success the full potential of MUNIX is far from being realized. Towards this end several suggestions for improvement are made in the closing chapter.

rawabstract:
Reported herein is the modification of a monoprocessing operating system, UNIX, designed to support an interactive multiprogramming environment on the PDP 11/40, 11/45 and 11/50 computers,' to a multiprocessing operating system utilizing two PDP 11/50 processors and an expanded set of peripheral devices. The evolution of change from UNIX to the more responsive and efficient modified version called MUNIX is documented here to provide a basis for continuing work on the system and as a guide that might prove helpful to others engaged in similar projects. MUNIX, while retaining all the qualities of UNIX, provides increased system efficiency and improved response to users. Although the project is considered a success the full potential of MUNIX is far from being realized. Towards this end several suggestions for improvement are made in the closing chapter.

entry:
@MastersThesis{Hawley:1975:MMV,
  author =       "John Alfred {Hawley III} and Walter de Briton Meyer",
  title =        "{MUNIX}, a multiprocessing version of {UNIX}",
  type =         "{Master}'s thesis",
  school =       "Department of Computer Science, Naval Postgraduate
                 School",
  address =      "Monterey, CA, USA",
  pages =        "58",
  month =        jun,
  year =         "1975",
  bibdate =      "Thu Jan 16 06:27:41 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://hdl.handle.net/10945/20959;
                 https://calhoun.nps.edu/handle/10945/20959",
  abstract =     "Reported herein is the modification of a
                 monoprocessing operating system, UNIX, designed to
                 support an interactive multiprogramming environment on
                 the PDP 11/40, 11/45 and 11/50 computers,' to a
                 multiprocessing operating system utilizing two PDP
                 11/50 processors and an expanded set of peripheral
                 devices. The evolution of change from UNIX to the more
                 responsive and efficient modified version called MUNIX
                 is documented here to provide a basis for continuing
                 work on the system and as a guide that might prove
                 helpful to others engaged in similar projects. MUNIX,
                 while retaining all the qualities of UNIX, provides
                 increased system efficiency and improved response to
                 users. Although the project is considered a success the
                 full potential of MUNIX is far from being realized.
                 Towards this end several suggestions for improvement
                 are made in the closing chapter.",
  acknowledgement = ack-nhfb,
  advisor =      "B. E. Allen",
}


bibtype: misc
filename: unix.bib
label: Holmgren:1975:RNU
author: S. Holmgren
title: RFC 681: Network UNIX
pages: 58
day: 18
month: mar
monthnumber: 3
year: 1975
bibdate: Thu Oct 16 09:34:09 MDT 1997
bibsource: https://www.math.utah.edu/pub/tex/bib/rfc.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1997.10.16 09:34:09 MDT
note: Status: UNKNOWN. Not online.
URL: ftp://ftp.internic.net/rfc/rfc681.txt; ftp://ftp.math.utah.edu/pub/rfc/rfc681.txt
acknowledgement: ack-nhfb
rawauthor: S. Holmgren
rawnote: Status: UNKNOWN. Not online.
rawtitle: {RFC 681}: Network {UNIX}
entry:
@Misc{Holmgren:1975:RNU,
  author =       "S. Holmgren",
  title =        "{RFC 681}: Network {UNIX}",
  day =          "18",
  month =        mar,
  year =         "1975",
  bibdate =      "Thu Oct 16 09:34:09 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/rfc.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Status: UNKNOWN. Not online.",
  URL =          "ftp://ftp.internic.net/rfc/rfc681.txt;
                 ftp://ftp.math.utah.edu/pub/rfc/rfc681.txt",
  acknowledgement = ack-nhfb,
  online =       "no",
  status =       "UNKNOWN",
}


bibtype: techreport
filename: unix.bib
label: Hunt:1975:ADF
author: J. W. Hunt and M. Douglas McIlroy
title: An Algorithm For Differential File Comparison
type: Technical Memorandum
number: 1083 (TM 75-1271-11)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 1
month: oct
monthnumber: 10
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: J. W. Hunt and M. Douglas McIlroy
rawtitle: An Algorithm For Differential File Comparison
abstract:
The program pgm diff reports differences between two files expressed as a minimal list of ldots to bring either file into agreement with the other.

rawabstract:
The program \pgm{diff} reports differences between two files expressed as a minimal list of \ldots{} to bring either file into agreement with the other.

entry:
@TechReport{Hunt:1975:ADF,
  author =       "J. W. Hunt and M. Douglas McIlroy",
  title =        "An Algorithm For Differential File Comparison",
  type =         "Technical Memorandum",
  number =       "1083 (TM 75-1271-11)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "1",
  month =        oct,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "The program \pgm{diff} reports differences between two
                 files expressed as a minimal list of \ldots{} to bring
                 either file into agreement with the other.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Jensen:1975:UFD
author: P. D. Jensen
title: UNIX Facilities For The Development Of Programs Written In Macro-11
type: Technical Memorandum
number: 1080 (TM 75-8234-14)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 5
month: dec
monthnumber: 12
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: P. D. Jensen
rawtitle: {UNIX} Facilities For The Development Of Programs Written In {Macro-11}
abstract:
This memo describes the initial set of facilities available under UNIX for use in developing programs written in DOS Macro-11, and BOS & BOS application programs in particular.

rawabstract:
This memo describes the initial set of facilities available under UNIX for use in developing programs written in DOS Macro-11, and BOS \& BOS application programs in particular.

entry:
@TechReport{Jensen:1975:UFD,
  author =       "P. D. Jensen",
  title =        "{UNIX} Facilities For The Development Of Programs
                 Written In {Macro-11}",
  type =         "Technical Memorandum",
  number =       "1080 (TM 75-8234-14)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "5",
  month =        dec,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memo describes the initial set of facilities
                 available under UNIX for use in developing programs
                 written in DOS Macro-11, and BOS \& BOS application
                 programs in particular.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Johnson:1975:YYA
author: Steven C. Johnson
title: Yacc --- yet another compiler compiler
type: Computing Science Technical Report
number: 32
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: jul
monthnumber: 7
year: 1975
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: Steven C. Johnson
rawtitle: {Yacc} --- yet another compiler compiler
remark:
TO DO: No electronic form of this report has yet been located. Cited in cite [p. 594, ref. 24]Sethi:1983:CFA and cite [p. 40, ref. 69]Holbrook:1982:HCR.

entry:
@TechReport{Johnson:1975:YYA,
  author =       "Steven C. Johnson",
  title =        "{Yacc} --- yet another compiler compiler",
  type =         "Computing Science Technical Report",
  number =       "32",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        jul,
  year =         "1975",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located. Cited in \cite[p. 594,
                 ref. 24]{Sethi:1983:CFA} and \cite[p. 40,
                 ref. 69]{Holbrook:1982:HCR}.",
}


bibtype: article
filename: unix.bib
label: Kernighan:1975:RPR
author: Brian W. Kernighan
title: RATFOR --- a Preprocessor for a Rational Fortran
journal: j-SPE
volume: 5
number: 4
pages: 395--406
month: oct
monthnumber: 10
year: 1975
CODEN: SPEXBL
DOI: https://doi.org/10.1002/spe.4380050408
ISSN: 0038-0644 (print), 1097-024X (electronic) OR 00380644 (print), 1097024X (electronic)
ISSNL: 0038-0644 OR 00380644
bibdate: Sat May 31 13:36:16 MDT 1997
bibtimestamp: 1997.05.31 13:36:16 MDT
URL: https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.4380050408
fjournal: Software --- Practice and Experience
acknowledgement: ack-nhfb
ajournal: Softw. Pract. Exp.
journalURL: http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X
onlinedate: 27 Oct 2006
rawauthor: Brian W. Kernighan
rawtitle: {RATFOR} --- a Preprocessor for a Rational {Fortran}
bibsource:
https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

entry:
@Article{Kernighan:1975:RPR,
  author =       "Brian W. Kernighan",
  title =        "{RATFOR} --- a Preprocessor for a Rational {Fortran}",
  journal =      j-SPE,
  volume =       "5",
  number =       "4",
  pages =        "395--406",
  month =        oct # "\slash " # dec,
  year =         "1975",
  CODEN =        "SPEXBL",
  DOI =          "https://doi.org/10.1002/spe.4380050408",
  ISSN =         "0038-0644 (print), 1097-024X (electronic)",
  ISSN-L =       "0038-0644",
  bibdate =      "Sat May 31 13:36:16 MDT 1997",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/spe.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://onlinelibrary.wiley.com/doi/abs/10.1002/spe.4380050408",
  acknowledgement = ack-nhfb,
  ajournal =     "Softw. Pract. Exp.",
  fjournal =     "Software --- Practice and Experience",
  journal-URL =  "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X",
  onlinedate =   "27 Oct 2006",
}


bibtype: article
filename: unix.bib
label: Kernighan:1975:STM
author: Brian W. Kernighan and Lorinda L. Cherry
title: A System for Typesetting Mathematics
journal: j-CACM
volume: 18
number: 3
pages: 151--157
month: mar
monthnumber: 3
year: 1975
CODEN: CACMA2
DOI: https://doi.org/10.1145/360680.360684
ISSN: 0001-0782 (print), 1557-7317 (electronic) OR 00010782 (print), 15577317 (electronic)
ISSNL: 0001-0782 OR 00010782
bibdate: Mon Jan 22 06:54:33 MST 2001
bibtimestamp: 2001.01.22 06:54:33 MST
fjournal: Communications of the ACM
language: English
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022)
corpsource: Bell Labs., Holmdel, NJ, USA
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J79
journalabr: Commun ACM
treatment: A Application; P Practical
rawauthor: Brian W. Kernighan and Lorinda L. Cherry
rawtitle: A System for Typesetting Mathematics
bibsource:
Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#KernighanC75; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
This paper describes the design and implementation of a system for typesetting mathematics.par The language has been designed to be easy to learn and to use by people (for example, secretaries and mathematical typists) who know neither mathematics nor typesetting. Experience indicates that the language can be learned in an hour or so, for it has few rules and fewer exceptions. For typical expressions, the size and font changes, positioning, line drawing, and the like necessary to print according to mathematical conventions are all done automatically. For example, the input tt sum from i = 0 to infinity x sub i = pi over 2 produces $ sum _i = 0^infty x_i = pi / 2 $. The syntax of the language is specified by a small context-free grammar; a compiler-compiler is used to make a compiler that translates this language into typesetting commands. Output maybe produced on either a phototypesetter or on a terminal with forward and reverse half-line motions. The system interfaces directly with text formatting programs, so mixtures of text and mathematics may be handled simply. This paper was typeset by the authors using the system described.

keywords:
compiler-compiler; computer controlled typesetting; computer graphics; computer programming languages; graphics; mathematics; oriented languages; photocomposition; phototypesetter; printing; problem; syntax; terminal; text formatting programs; text processing.; typesetting; typesetting mathematics

classcodes:
C6130 (Data handling techniques); C6140D (High level languages); C7230 (Publishing and reproduction); C7310 (Mathematics computing)

rawabstract:
This paper describes the design and implementation of a system for typesetting mathematics.\par The language has been designed to be easy to learn and to use by people (for example, secretaries and mathematical typists) who know neither mathematics nor typesetting. Experience indicates that the language can be learned in an hour or so, for it has few rules and fewer exceptions. For typical expressions, the size and font changes, positioning, line drawing, and the like necessary to print according to mathematical conventions are all done automatically. For example, the input {\tt sum from i = 0 to infinity x sub i = pi over 2} produces $ \sum_{i = 0}^\infty x_i = \pi / 2 $. The syntax of the language is specified by a small context-free grammar; a compiler-compiler is used to make a compiler that translates this language into typesetting commands. Output maybe produced on either a phototypesetter or on a terminal with forward and reverse half-line motions. The system interfaces directly with text formatting programs, so mixtures of text and mathematics may be handled simply. This paper was typeset by the authors using the system described.

entry:
@Article{Kernighan:1975:STM,
  author =       "Brian W. Kernighan and Lorinda L. Cherry",
  title =        "A System for Typesetting Mathematics",
  journal =      j-CACM,
  volume =       "18",
  number =       "3",
  pages =        "151--157",
  month =        mar,
  year =         "1975",
  CODEN =        "CACMA2",
  DOI =          "https://doi.org/10.1145/360680.360684",
  ISSN =         "0001-0782 (print), 1557-7317 (electronic)",
  ISSN-L =       "0001-0782",
  bibdate =      "Mon Jan 22 06:54:33 MST 2001",
  bibsource =    "Compendex database;
                 ftp://ftp.ira.uka.de/pub/bibliography/Distributed/QLD/1975.bib;
                 http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#KernighanC75;
                 https://www.math.utah.edu/pub/tex/bib/cacm1970.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes the design and implementation of
                 a system for typesetting mathematics.\par

                 The language has been designed to be easy to learn and
                 to use by people (for example, secretaries and
                 mathematical typists) who know neither mathematics nor
                 typesetting. Experience indicates that the language can
                 be learned in an hour or so, for it has few rules and
                 fewer exceptions. For typical expressions, the size and
                 font changes, positioning, line drawing, and the like
                 necessary to print according to mathematical
                 conventions are all done automatically. For example,
                 the input {\tt sum from i = 0 to infinity x sub i = pi
                 over 2} produces $ \sum_{i = 0}^\infty x_i = \pi / 2 $.
                 The syntax of the language is specified by a small
                 context-free grammar; a compiler-compiler is used to
                 make a compiler that translates this language into
                 typesetting commands. Output maybe produced on either a
                 phototypesetter or on a terminal with forward and
                 reverse half-line motions. The system interfaces
                 directly with text formatting programs, so mixtures of
                 text and mathematics may be handled simply. This paper
                 was typeset by the authors using the system
                 described.",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022)",
  classcodes =   "C6130 (Data handling techniques); C6140D (High level
                 languages); C7230 (Publishing and reproduction); C7310
                 (Mathematics computing)",
  classification = "723; 745",
  corpsource =   "Bell Labs., Holmdel, NJ, USA",
  country =      "USA",
  date =         "15/05/84",
  descriptors =  "Design; realization; command language; graphics
                 language; text processing; graphics; interactive mode",
  enum =         "1645",
  fjournal =     "Communications of the ACM",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J79",
  journalabr =   "Commun ACM",
  keywords =     "compiler-compiler; computer controlled typesetting;
                 computer graphics; computer programming languages;
                 graphics; mathematics; oriented languages;
                 photocomposition; phototypesetter; printing; problem;
                 syntax; terminal; text formatting programs; text
                 processing.; typesetting; typesetting mathematics",
  language =     "English",
  oldlabel =     "KernighanC75",
  references =   "7",
  treatment =    "A Application; P Practical",
  XMLdata =      "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/KernighanC75",
  xxpages =      "151--157",
}


bibtype: techreport
filename: unix.bib
label: Lesk:1975:AAM
author: Michael E. Lesk
title: AGEN --- An Associated Memory Generator
type: Technical Memorandum
number: 1064 (TM 75-1274-18)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 2
month: sep
monthnumber: 9
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: Michael E. Lesk
rawtitle: {AGEN} --- An Associated Memory Generator
abstract:
Agen is a program generator for table searches. It also writes programs to store and retrieve information.

rawabstract:
Agen is a program generator for table searches. It also writes programs to store and retrieve information.

entry:
@TechReport{Lesk:1975:AAM,
  author =       "Michael E. Lesk",
  title =        "{AGEN} --- An Associated Memory Generator",
  type =         "Technical Memorandum",
  number =       "1064 (TM 75-1274-18)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "2",
  month =        sep,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Agen is a program generator for table searches. It
                 also writes programs to store and retrieve
                 information.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lesk:1975:LLA
author: M. E. Lesk
title: Lex --- a lexical analyzer generator
type: Computing Science Technical Report
number: 39
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: oct
monthnumber: 10
year: 1975
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: M. E. Lesk
rawtitle: {Lex} --- a lexical analyzer generator
remark:
TO DO: No electronic form of this report has yet been located. Referenced in cite [p. 595, ref. 30]Sethi:1983:CFA

entry:
@TechReport{Lesk:1975:LLA,
  author =       "M. E. Lesk",
  title =        "{Lex} --- a lexical analyzer generator",
  type =         "Computing Science Technical Report",
  number =       "39",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        oct,
  year =         "1975",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located. Referenced in \cite[p. 595, ref.
                 30]{Sethi:1983:CFA}",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1975:EUP
author: Heinz Lycklama and C. Christensen
title: Emulation of UNIX on Peripheral Processors
type: Technical Memorandum
number: 1045 (TM 75-1352-2)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 9
month: jan
monthnumber: 1
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This document describes UNIX Operating System emulation on a peripheral PDP-11 computer.
acknowledgement: ack-nhfb
rawabstract: This document describes UNIX Operating System emulation on a peripheral PDP-11 computer.
rawauthor: Heinz Lycklama and C. Christensen
rawtitle: Emulation of {UNIX} on Peripheral Processors
entry:
@TechReport{Lycklama:1975:EUP,
  author =       "Heinz Lycklama and C. Christensen",
  title =        "Emulation of {UNIX} on Peripheral Processors",
  type =         "Technical Memorandum",
  number =       "1045 (TM 75-1352-2)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "9",
  month =        jan,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This document describes UNIX Operating System
                 emulation on a peripheral PDP-11 computer.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1975:GTU
author: Heinz Lycklama
title: GLANCE Terminals on UNIX Time-Sharing
type: Technical Memorandum
number: TM-75-1352-3
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 30
day: 3
month: mar
monthnumber: 3
year: 1975
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
keywords: Document Preparation; Editing; Graphics; Plotting
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
rawtitle: {GLANCE} Terminals on {UNIX} Time-Sharing
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-3_GLANCE_Terminals_on_UNIX_Time-Sharing_19750303.pdf

abstract:
GLANCE terminals (1) have been interfaced to the PDP-11/45 computer (2) and programmed to run under the UNIX time-sharing system both as ``login'' terminals and as general-purpose graphic devices. Each terminal has two local display memories consisting of 2K 16-bit words each. One memory is a character memory, which may be loaded with any character set which the user wishes to use; the other is a display list memory which controls the display sequence. The display list may contain vectors as well as characters. The terminals are currently being used for the following purposes: (1) editing of text files using a simple line-editor; (2) display of ``TPLOT-like'' plots (hard copies may be obtained by a connection to STARE on the HIS-6070 computer); (3) scanning of ASCII file contents (backward and forward); (4) preparation of documents using ``NROFF'' and a paginating GLANCE ``filter'' program; (5) display of user-definable character sets. This document describes the characteristics of the GLANCE terminal in enough detail to enable users to write their own application programs. Currently available application programs are described to serve both as a user's guide for the GLANCE terminal and as a guide for writing further programs. Enhancements to some of the application software described here are currently being programmed.

rawabstract:
GLANCE terminals (1) have been interfaced to the PDP-11/45 computer (2) and programmed to run under the UNIX time-sharing system both as ``login'' terminals and as general-purpose graphic devices. Each terminal has two local display memories consisting of 2K 16-bit words each. One memory is a character memory, which may be loaded with any character set which the user wishes to use; the other is a display list memory which controls the display sequence. The display list may contain vectors as well as characters. The terminals are currently being used for the following purposes: (1) editing of text files using a simple line-editor; (2) display of ``TPLOT-like'' plots (hard copies may be obtained by a connection to STARE on the HIS-6070 computer); (3) scanning of ASCII file contents (backward and forward); (4) preparation of documents using ``NROFF'' and a paginating GLANCE ``filter'' program; (5) display of user-definable character sets. This document describes the characteristics of the GLANCE terminal in enough detail to enable users to write their own application programs. Currently available application programs are described to serve both as a user's guide for the GLANCE terminal and as a guide for writing further programs. Enhancements to some of the application software described here are currently being programmed.

entry:
@TechReport{Lycklama:1975:GTU,
  author =       "Heinz Lycklama",
  title =        "{GLANCE} Terminals on {UNIX} Time-Sharing",
  type =         "Technical Memorandum",
  number =       "TM-75-1352-3",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "30",
  day =          "3",
  month =        mar,
  year =         "1975",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-3_GLANCE_Terminals_on_UNIX_Time-Sharing_19750303.pdf",
  abstract =     "GLANCE terminals (1) have been interfaced to the
                 PDP-11/45 computer (2) and programmed to run under the
                 UNIX time-sharing system both as ``login'' terminals
                 and as general-purpose graphic devices. Each terminal
                 has two local display memories consisting of 2K 16-bit
                 words each. One memory is a character memory, which may
                 be loaded with any character set which the user wishes
                 to use; the other is a display list memory which
                 controls the display sequence. The display list may
                 contain vectors as well as characters. The terminals
                 are currently being used for the following purposes:
                 (1) editing of text files using a simple line-editor;
                 (2) display of ``TPLOT-like'' plots (hard copies may be
                 obtained by a connection to STARE on the HIS-6070
                 computer); (3) scanning of ASCII file contents
                 (backward and forward); (4) preparation of documents
                 using ``NROFF'' and a paginating GLANCE ``filter''
                 program; (5) display of user-definable character sets.
                 This document describes the characteristics of the
                 GLANCE terminal in enough detail to enable users to
                 write their own application programs. Currently
                 available application programs are described to serve
                 both as a user's guide for the GLANCE terminal and as a
                 guide for writing further programs. Enhancements to
                 some of the application software described here are
                 currently being programmed.",
  acknowledgement = ack-nhfb,
  keywords =     "Document Preparation; Editing; Graphics; Plotting",
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1975:SOS
author: Heinz Lycklama and D. L. Bayer
title: A Structured Operating System for a PDP-11/45
type: Technical Memorandum
number: TM-75-1352-4
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 18
day: 6
month: mar
monthnumber: 3
year: 1975
bibdate: Sat Feb 22 17:04:15 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.02.22 17:04:15 ???
keywords: Multi-Environment; Real-Time; UNIX
remark: Typewritten document.
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama and D. L. Bayer
rawtitle: A Structured Operating System for a {PDP-11/45}
URL:
https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-4_A_Structured_Operating_System_for_a_PDP-11.45_19750506.pdf

abstract:
A structured operating system, MERT, consisting of a set of autonomous processes has been designed and implemented on a PDP-11/45 computer in Department 1352. The MERT system is a multi-environment, real-time operating system consisting of a set of basic kernel procedures providing services for the independent processes which support the different operating system environments. A well-developed set of inter-process communication primitives have been implemented, including event flags, message buffers, shared memory and shared files. We believe this provides a good base for providing support for various operating system environments and for providing real-time response for processes. The UNIX time-sharing system has been implemented as one environment on the MERT system. (*) This paper provides an overview of the MERT system.

rawabstract:
A structured operating system, MERT, consisting of a set of autonomous processes has been designed and implemented on a PDP-11/45 computer in Department 1352. The MERT system is a multi-environment, real-time operating system consisting of a set of basic kernel procedures providing services for the independent processes which support the different operating system environments. A well-developed set of inter-process communication primitives have been implemented, including event flags, message buffers, shared memory and shared files. We believe this provides a good base for providing support for various operating system environments and for providing real-time response for processes. The UNIX time-sharing system has been implemented as one environment on the MERT system. (*) This paper provides an overview of the MERT system.

entry:
@TechReport{Lycklama:1975:SOS,
  author =       "Heinz Lycklama and D. L. Bayer",
  title =        "A Structured Operating System for a {PDP-11/45}",
  type =         "Technical Memorandum",
  number =       "TM-75-1352-4",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "18",
  day =          "6",
  month =        mar,
  year =         "1975",
  bibdate =      "Sat Feb 22 17:04:15 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.tuhs.org/Archive/Documentation/TechReports/Heinz_Tech_Memos/TM-75-1352-4_A_Structured_Operating_System_for_a_PDP-11.45_19750506.pdf",
  abstract =     "A structured operating system, MERT, consisting of a
                 set of autonomous processes has been designed and
                 implemented on a PDP-11/45 computer in Department 1352.
                 The MERT system is a multi-environment, real-time
                 operating system consisting of a set of basic kernel
                 procedures providing services for the independent
                 processes which support the different operating system
                 environments. A well-developed set of inter-process
                 communication primitives have been implemented,
                 including event flags, message buffers, shared memory
                 and shared files. We believe this provides a good base
                 for providing support for various operating system
                 environments and for providing real-time response for
                 processes. The UNIX time-sharing system has been
                 implemented as one environment on the MERT system. (*)
                 This paper provides an overview of the MERT system.",
  acknowledgement = ack-nhfb,
  keywords =     "Multi-Environment; Real-Time; UNIX",
  remark =       "Typewritten document.",
}


bibtype: techreport
filename: unix.bib
label: Maranzano:1975:DUF
author: J. F. Maranzano
title: A Description of the UNIX File System
type: Technical Memorandum
number: 1065 (MF 75-8234-32)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 16
month: sep
monthnumber: 9
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: J. F. Maranzano
rawtitle: A Description of the {UNIX} File System
abstract:
This memorandum describes the structure of the file system as well as the applicable control blocks.

rawabstract:
This memorandum describes the structure of the file system as well as the applicable control blocks.

entry:
@TechReport{Maranzano:1975:DUF,
  author =       "J. F. Maranzano",
  title =        "A Description of the {UNIX} File System",
  type =         "Technical Memorandum",
  number =       "1065 (MF 75-8234-32)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "16",
  month =        sep,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the structure of the file
                 system as well as the applicable control blocks.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: McIlroy:1975:US
author: M. Douglas McIlroy
title: UNIX Summary
type: Technical Memorandum
number: 1043
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: M. Douglas McIlroy
rawtitle: {UNIX} Summary
entry:
@TechReport{McIlroy:1975:US,
  author =       "M. Douglas McIlroy",
  title =        "{UNIX} Summary",
  type =         "Technical Memorandum",
  number =       "1043",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1975 (??)",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: unix.bib
label: Morris:1975:ACT
author: Robert Morris and Lorinda L. Cherry
title: Appendix A. Common technical English words, and Appendix B. Possible typo's and spelling errors
journal: j-IEEE-TRANS-PROF-COMMUN
volume: PC-18
number: 1
pages: 57--64
month: mar
monthnumber: 3
year: 1975
CODEN: IEPCBU
DOI: https://doi.org/10.1109/TPC.1975.6593965
ISSN: 0361-1434 (print), 1558-1500 (electronic) OR 03611434 (print), 15581500 (electronic)
ISSNL: 0361-1434 OR 03611434
bibdate: Sat Dec 18 11:57:01 2021
bibtimestamp: 2021.12.18 11:57:01 ???
note: See cite Morris:1975:CDT.
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022); Robert Morris (25 July 1932--26 June 2011)
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=47
rawauthor: Robert Morris and Lorinda L. Cherry
rawnote: See \cite{Morris:1975:CDT}.
bibsource:
https://www.math.utah.edu/pub/tex/bib/ieeetransprofcommun.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

rawtitle:
{Appendix A}. {Common} technical {English} words, and {Appendix B}. {Possible} typo's and spelling errors

entry:
@Article{Morris:1975:ACT,
  author =       "Robert Morris and Lorinda L. Cherry",
  title =        "{Appendix A}. {Common} technical {English} words, and
                 {Appendix B}. {Possible} typo's and spelling errors",
  journal =      j-IEEE-TRANS-PROF-COMMUN,
  volume =       "PC-18",
  number =       "1",
  pages =        "57--64",
  month =        mar,
  year =         "1975",
  CODEN =        "IEPCBU",
  DOI =          "https://doi.org/10.1109/TPC.1975.6593965",
  ISSN =         "0361-1434 (print), 1558-1500 (electronic)",
  ISSN-L =       "0361-1434",
  bibdate =      "Sat Dec 18 11:57:01 2021",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetransprofcommun.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "See \cite{Morris:1975:CDT}.",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022);
                 Robert Morris (25 July 1932--26 June 2011)",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=47",
}


bibtype: article
filename: unix.bib
label: Morris:1975:CDT
author: Robert Morris and Lorinda L. Cherry
title: Computer Detection of Typographical Errors
journal: j-IEEE-TRANS-PROF-COMMUN
volume: PC-18
number: 1
pages: 54--56
month: mar
monthnumber: 3
year: 1975
CODEN: IEPCBU
DOI: https://doi.org/10.1109/TPC.1975.6593963
ISSN: 0361-1434 (print), 1558-1500 (electronic) OR 03611434 (print), 15581500 (electronic)
ISSNL: 0361-1434 OR 03611434
bibdate: Mon Dec 16 08:30:04 MST 1996
bibtimestamp: 1996.12.16 08:30:04 MST
note: See supplemental word list cite Morris:1975:ACT.
URL: https://ieeexplore.ieee.org/abstract/document/6593963
fjournal: IEEE Transactions on Professional Communication
keywords: information dissemination --- Publishing; typesetting
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022); Robert Morris (25 July 1932--26 June 2011)
journalURL: https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=47
journalabr: IEEE Trans Prof Commun
rawauthor: Robert Morris and Lorinda L. Cherry
rawnote: See supplemental word list \cite{Morris:1975:ACT}.
rawtitle: Computer Detection of Typographical Errors
bibsource:
https://www.math.utah.edu/pub/tex/bib/ieeetransprofcommun.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
A program written for the UNIX time-sharing system reduces by several orders of magnitude the task of finding words in a document which contain typographical errors. The program is adaptive in the sense that it uses statistics from the document itself for its analysis. In a first pass through the document, a table of digram and trigram frequencies is prepared. The second pass through the document breaks out individual words and compares the digrams and trigrams in each word with the frequencies from the table. An index is given to each world which reflects the hypothesis that the trigrams in the given word were produced from the same source that produced the trigram table. The words are sorted in decreasing order of their indices and printed. Appendices containing 2,726 common technical English words, possible typo's and spelling errors are included.

rawabstract:
A program written for the UNIX time-sharing system reduces by several orders of magnitude the task of finding words in a document which contain typographical errors. The program is adaptive in the sense that it uses statistics from the document itself for its analysis. In a first pass through the document, a table of digram and trigram frequencies is prepared. The second pass through the document breaks out individual words and compares the digrams and trigrams in each word with the frequencies from the table. An index is given to each world which reflects the hypothesis that the trigrams in the given word were produced from the same source that produced the trigram table. The words are sorted in decreasing order of their indices and printed. Appendices containing 2,726 common technical English words, possible typo's and spelling errors are included.

entry:
@Article{Morris:1975:CDT,
  author =       "Robert Morris and Lorinda L. Cherry",
  title =        "Computer Detection of Typographical Errors",
  journal =      j-IEEE-TRANS-PROF-COMMUN,
  volume =       "PC-18",
  number =       "1",
  pages =        "54--56",
  month =        mar,
  year =         "1975",
  CODEN =        "IEPCBU",
  DOI =          "https://doi.org/10.1109/TPC.1975.6593963",
  ISSN =         "0361-1434 (print), 1558-1500 (electronic)",
  ISSN-L =       "0361-1434",
  bibdate =      "Mon Dec 16 08:30:04 MST 1996",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/ieeetransprofcommun.bib;
                 https://www.math.utah.edu/pub/tex/bib/spell.bib;
                 https://www.math.utah.edu/pub/tex/bib/typeset.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "See supplemental word list \cite{Morris:1975:ACT}.",
  URL =          "https://ieeexplore.ieee.org/abstract/document/6593963",
  abstract =     "A program written for the UNIX time-sharing system
                 reduces by several orders of magnitude the task of
                 finding words in a document which contain typographical
                 errors. The program is adaptive in the sense that it
                 uses statistics from the document itself for its
                 analysis. In a first pass through the document, a table
                 of digram and trigram frequencies is prepared. The
                 second pass through the document breaks out individual
                 words and compares the digrams and trigrams in each
                 word with the frequencies from the table. An index is
                 given to each world which reflects the hypothesis that
                 the trigrams in the given word were produced from the
                 same source that produced the trigram table. The words
                 are sorted in decreasing order of their indices and
                 printed. Appendices containing 2,726 common technical
                 English words, possible typo's and spelling errors are
                 included.",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022);
                 Robert Morris (25 July 1932--26 June 2011)",
  classification = "723; 745; 901",
  fjournal =     "IEEE Transactions on Professional Communication",
  journal-URL =  "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=47",
  journalabr =   "IEEE Trans Prof Commun",
  keywords =     "information dissemination --- Publishing;
                 typesetting",
}


bibtype: techreport
filename: unix.bib
label: Morris:1975:LRS
author: Robert Morris
title: A Library of Reference Standard Mathematical Subroutines
type: Technical Memorandum
number: 1074 (TM 75-1271-6)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 1
month: may
monthnumber: 5
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/elefunt.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
authordates: Robert Morris (25 July 1932--26 June 2011)
rawauthor: Robert Morris
rawtitle: A Library of Reference Standard Mathematical Subroutines
abstract:
This memo describes a set of mathematical library functions to use arbitrary accuracy. Relevant error analysis and subroutines listings are given.

rawabstract:
This memo describes a set of mathematical library functions to use arbitrary accuracy. Relevant error analysis and subroutines listings are given.

entry:
@TechReport{Morris:1975:LRS,
  author =       "Robert Morris",
  title =        "A Library of Reference Standard Mathematical
                 Subroutines",
  type =         "Technical Memorandum",
  number =       "1074 (TM 75-1271-6)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "1",
  month =        may,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/elefunt.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memo describes a set of mathematical library
                 functions to use arbitrary accuracy. Relevant error
                 analysis and subroutines listings are given.",
  acknowledgement = ack-nhfb,
  author-dates = "Robert Morris (25 July 1932--26 June 2011)",
}


bibtype: techreport
filename: unix.bib
label: Raleigh:1975:EAC
author: T. M. Raleigh
title: Explanation Of Abnormal Conditions Within The UNIX Operating System
type: Technical Memorandum
number: 1047 (MF 75-8234-28)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 17
month: mar
monthnumber: 3
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: T. M. Raleigh
rawtitle: Explanation Of Abnormal Conditions Within The {UNIX} Operating System
abstract:
Error messages printed by the UNIX operating system on the system console are discussed with their causes, implications and remedies.

rawabstract:
Error messages printed by the UNIX operating system on the system console are discussed with their causes, implications and remedies.

entry:
@TechReport{Raleigh:1975:EAC,
  author =       "T. M. Raleigh",
  title =        "Explanation Of Abnormal Conditions Within The {UNIX}
                 Operating System",
  type =         "Technical Memorandum",
  number =       "1047 (MF 75-8234-28)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "17",
  month =        mar,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Error messages printed by the UNIX operating system on
                 the system console are discussed with their causes,
                 implications and remedies.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Raleigh:1975:ISS
author: T. M. Raleigh
title: Introduction to Scheduling and Switching under UNIX
type: Technical Memorandum
number: 1069 (TM 75-8234-7)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 20
month: oct
monthnumber: 10
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: T. M. Raleigh
rawtitle: Introduction to Scheduling and Switching under {UNIX}
abstract:
This memorandum discusses process switching and scheduling under UNIX using queuing models as an aid to visualization of the system's operation.

rawabstract:
This memorandum discusses process switching and scheduling under UNIX using queuing models as an aid to visualization of the system's operation.

entry:
@TechReport{Raleigh:1975:ISS,
  author =       "T. M. Raleigh",
  title =        "Introduction to Scheduling and Switching under
                 {UNIX}",
  type =         "Technical Memorandum",
  number =       "1069 (TM 75-8234-7)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "20",
  month =        oct,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum discusses process switching and
                 scheduling under UNIX using queuing models as an aid to
                 visualization of the system's operation.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Ritchie:1975:US
author: Dennis M. Ritchie
title: The UNIX I/O System
type: Technical Memorandum
number: 1005
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawauthor: Dennis M. Ritchie
rawtitle: The {UNIX I/O} System
abstract:
This document describes how to write drivers for the UNIX system. It is an important manual for those contemplating driver writing.

rawabstract:
This document describes how to write drivers for the UNIX system. It is an important manual for those contemplating driver writing.

entry:
@TechReport{Ritchie:1975:US,
  author =       "Dennis M. Ritchie",
  title =        "The {UNIX I/O} System",
  type =         "Technical Memorandum",
  number =       "1005",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1975 (??)",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This document describes how to write drivers for the
                 UNIX system. It is an important manual for those
                 contemplating driver writing.",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Roberts:1975:UIU
author: C. S. Roberts
title: UNIXLIST --- An IBM / 370 Utility Program to List a UNIX File Stored on a 9-Track Magnetic Tape.
type: Technical Memorandum
number: 1068
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 29
month: jan
monthnumber: 1
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: Memorandum For Record
acknowledgement: ack-nhfb
rawauthor: C. S. Roberts
rawtitle:
{UNIXLIST} --- An {IBM\slash 370} Utility Program to List a {UNIX} File Stored on a 9-Track Magnetic Tape.

entry:
@TechReport{Roberts:1975:UIU,
  author =       "C. S. Roberts",
  title =        "{UNIXLIST} --- An {IBM\slash 370} Utility Program to
                 List a {UNIX} File Stored on a 9-Track Magnetic Tape.",
  type =         "Technical Memorandum",
  number =       "1068",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "29",
  month =        jan,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "",
  acknowledgement = ack-nhfb,
  remark =       "Memorandum For Record",
}


bibtype: techreport
filename: unix.bib
label: Roylance:1975:BDT
author: G. Roylance and M. T. Dolan and J. F. Kaiser
title: BLOSIM --- A Discrete Time Block Simulator
type: Technical Memorandum
number: 1079 (TM 75-1352-6)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 15
month: jul
monthnumber: 7
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: G. Roylance and M. T. Dolan and J. F. Kaiser
rawtitle: {BLOSIM} --- A Discrete Time Block Simulator
abstract:
This memorandum describes the language, variable precision, implementation, and general use of BLOSIM.

rawabstract:
This memorandum describes the language, variable precision, implementation, and general use of BLOSIM.

entry:
@TechReport{Roylance:1975:BDT,
  author =       "G. Roylance and M. T. Dolan and J. F. Kaiser",
  title =        "{BLOSIM} --- A Discrete Time Block Simulator",
  type =         "Technical Memorandum",
  number =       "1079 (TM 75-1352-6)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "15",
  month =        jul,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the language, variable
                 precision, implementation, and general use of BLOSIM.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Schryer:1975:UGD
author: Norman L. Schryer
title: A User's Guide to DODES, a Double Precision Ordinary Differential Equation Solver
type: Computing Science Technical Report
number: 33
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: ii + 18
month: aug
monthnumber: 8
year: 1975
bibdate: Fri Aug 25 15:53:20 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.25 15:53:20 ???
acknowledgement: ack-nhfb
authordates: Norman Loren Schryer (1943--30 December 2016)
rawauthor: Norman L. Schryer
rawtitle: A User's Guide to {DODES}, a Double Precision Ordinary Differential Equation Solver
URL:
https://www.legacy.com/funeral-homes/obituaries/name/norman-schryer-obituary?pid=183271335&v=batesville

abstract:
DODES ( Double precision Ordinary Differential Equation Solver ) is a package of portable FORTRAN subprograms for integrating first order initial value problems of the form $$ d x / d t = f(t, x), x(t_1) = x_1 quad (1) $$ where $ x(t) $ is a vector valued function of time $t$, $f$ is a vector valued function of $t$ and $x$, and $x$ is a vector of initial conditions. These subprograms allow easy user control over both the accuracy and the output of the integration process.par The algorithm used is a variable order, variable step-size extrapolation scheme augmented by several mechanisms for dealing with discontinuities in the derivatives of the solution. Previous extrapolation based differential equation solvers lack one or more of these features of DODES. Thus, DODES is a more robust, efficient and reliable method for solving (1).

rawabstract:
DODES ( Double precision Ordinary Differential Equation Solver ) is a package of portable FORTRAN subprograms for integrating first order initial value problems of the form $$ d x / d t = f(t, x), x(t_1) = x_1 \quad (1) $$ where $ x(t) $ is a vector valued function of time $t$, $f$ is a vector valued function of $t$ and $x$, and $x$ is a vector of initial conditions. These subprograms allow easy user control over both the accuracy and the output of the integration process.\par The algorithm used is a variable order, variable step-size extrapolation scheme augmented by several mechanisms for dealing with discontinuities in the derivatives of the solution. Previous extrapolation based differential equation solvers lack one or more of these features of DODES. Thus, DODES is a more robust, efficient and reliable method for solving (1).

entry:
@TechReport{Schryer:1975:UGD,
  author =       "Norman L. Schryer",
  title =        "A User's Guide to {DODES}, a Double Precision Ordinary
                 Differential Equation Solver",
  type =         "Computing Science Technical Report",
  number =       "33",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "ii + 18",
  month =        aug,
  year =         "1975",
  bibdate =      "Fri Aug 25 15:53:20 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.legacy.com/funeral-homes/obituaries/name/norman-schryer-obituary?pid=183271335&v=batesville",
  abstract =     "DODES ( Double precision Ordinary Differential
                 Equation Solver ) is a package of portable FORTRAN
                 subprograms for integrating first order initial value
                 problems of the form $$ d x / d t = f(t, x), x(t_1) =
                 x_1 \quad (1) $$ where $ x(t) $ is a vector valued
                 function of time $t$, $f$ is a vector valued function
                 of $t$ and $x$, and $x$ is a vector of initial
                 conditions. These subprograms allow easy user control
                 over both the accuracy and the output of the
                 integration process.\par

                 The algorithm used is a variable order, variable
                 step-size extrapolation scheme augmented by several
                 mechanisms for dealing with discontinuities in the
                 derivatives of the solution. Previous extrapolation
                 based differential equation solvers lack one or more of
                 these features of DODES. Thus, DODES is a more robust,
                 efficient and reliable method for solving (1).",
  acknowledgement = ack-nhfb,
  author-dates = "Norman Loren Schryer (1943--30 December 2016)",
}


bibtype: mastersthesis
filename: unix.bib
label: Snyder:1975:PCL
author: Alan Snyder
title: A Portable Compiler for the Language C
type: M.S. thesis
number: MIT-LCS-TR-149
school: Project MAC, Massachusetts Institute of Technology
address: Cambridge, MA 02139, USA
pages: 74
month: may
monthnumber: 5
year: 1975
bibdate: Tue Sep 19 06:29:43 2017
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2017.09.19 06:29:43 ???
URL: http://publications.csail.mit.edu/lcs/specpub.php?id=717
keywords: Digital Equipment Corporation (DEC) PDP-10; Honeywell HIS-6000
acknowledgement: ack-nhfb
rawauthor: Alan Snyder
rawtitle: A Portable Compiler for the Language {C}
note:
Based on a thesis submitted to the Department of Electrical Engineering at MIT on 10 May 1974 in partial fulfillment of the requirements for the degree of Bachelor of Science and Master of Science.

remark:
From page 28: ``The portability of the compiler has been tested by the construction of a version of the compiler for the DEC PDP-10. The initial machine description and macro definitions for the PDP-10 implementation were written and debugged by the author in a period of two days.''

rawnote:
Based on a thesis submitted to the Department of Electrical Engineering at MIT on 10 May 1974 in partial fulfillment of the requirements for the degree of Bachelor of Science and Master of Science.

entry:
@MastersThesis{Snyder:1975:PCL,
  author =       "Alan Snyder",
  title =        "A Portable Compiler for the Language {C}",
  type =         "{M.S.} thesis",
  number =       "MIT-LCS-TR-149",
  school =       "Project MAC, Massachusetts Institute of Technology",
  address =      "Cambridge, MA 02139, USA",
  pages =        "74",
  month =        may,
  year =         "1975",
  bibdate =      "Tue Sep 19 06:29:43 2017",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "Based on a thesis submitted to the Department of
                 Electrical Engineering at MIT on 10 May 1974 in partial
                 fulfillment of the requirements for the degree of
                 Bachelor of Science and Master of Science.",
  URL =          "http://publications.csail.mit.edu/lcs/specpub.php?id=717",
  acknowledgement = ack-nhfb,
  keywords =     "Digital Equipment Corporation (DEC) PDP-10; Honeywell
                 HIS-6000",
  remark =       "From page 28: ``The portability of the compiler has
                 been tested by the construction of a version of the
                 compiler for the DEC PDP-10. The initial machine
                 description and macro definitions for the PDP-10
                 implementation were written and debugged by the author
                 in a period of two days.''",
}


bibtype: misc
filename: unix.bib
label: Thompson:1975:UPMa
author: Ken Thompson and Dennis M. Ritchie
title: Unix Programmer's Manual
edition: Sixth
pages: 495
month: may
monthnumber: 5
year: 1975
bibdate: Fri Feb 16 10:36:45 2018
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2018.02.16 10:36:45 ???
note: This is the sixth of seven editions (see cite Thompson:2018:TRE).
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
howpublished: Web site
rawauthor: Ken Thompson and Dennis M. Ritchie
rawnote: This is the sixth of seven editions (see \cite{Thompson:2018:TRE}).
rawtitle: {Unix} Programmer's Manual
URL:
https://ia800600.us.archive.org/19/items/v6-manual/v6-manual.pdf; https://minnie.tuhs.org//cgi-bin/utree.pl?file=V6/usr/doc/unix

entry:
@Misc{Thompson:1975:UPMa,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{Unix} Programmer's Manual",
  howpublished = "Web site",
  edition =      "Sixth",
  pages =        "495",
  month =        may,
  year =         "1975",
  bibdate =      "Fri Feb 16 10:36:45 2018",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  note =         "This is the sixth of seven editions (see
                 \cite{Thompson:2018:TRE}).",
  URL =          "https://ia800600.us.archive.org/19/items/v6-manual/v6-manual.pdf;
                 https://minnie.tuhs.org//cgi-bin/utree.pl?file=V6/usr/doc/unix",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Thompson:1975:UPMb
author: Ken Thompson and Dennis M. Ritchie
title: UNIX Programmer's Manual
type: Technical Memorandum
number: 1014
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
edition: Sixth
month: may
monthnumber: 5
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: Contains descriptions of the use of all commands and calls on the ``Research'' version of UNIX.
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawabstract: Contains descriptions of the use of all commands and calls on the ``Research'' version of UNIX.
rawauthor: Ken Thompson and Dennis M. Ritchie
rawtitle: {UNIX} Programmer's Manual
entry:
@TechReport{Thompson:1975:UPMb,
  author =       "Ken Thompson and Dennis M. Ritchie",
  title =        "{UNIX} Programmer's Manual",
  type =         "Technical Memorandum",
  number =       "1014",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  edition =      "Sixth",
  pages =        "??",
  month =        may,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Contains descriptions of the use of all commands and
                 calls on the ``Research'' version of UNIX.",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Thompson:1975:UTS
author: Dennis M. Ritchie and Ken Thompson
title: The UNIX Time-Sharing System
type: Technical Memorandum
number: 1008
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: Overview of the UNIX time-sharing system.
acknowledgement: ack-nhfb
authordates: Dennis M. Ritchie (9 September 1941--12 October 2011)
rawabstract: Overview of the UNIX time-sharing system.
rawauthor: Dennis M. Ritchie and Ken Thompson
rawtitle: The {UNIX} Time-Sharing System
entry:
@TechReport{Thompson:1975:UTS,
  author =       "Dennis M. Ritchie and Ken Thompson",
  title =        "The {UNIX} Time-Sharing System",
  type =         "Technical Memorandum",
  number =       "1008",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1975 (??)",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Overview of the UNIX time-sharing system.",
  acknowledgement = ack-nhfb,
  author-dates = "Dennis M. Ritchie (9 September 1941--12 October
                 2011)",
}


bibtype: techreport
filename: unix.bib
label: Vollaro:1975:CSR
author: J. R. Vollaro
title: A Continuous Service Real Time Clock for Digital Computers
type: Technical Memorandum
number: 1048 (TM 75-1273-4)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 13
month: mar
monthnumber: 3
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: J. R. Vollaro
rawtitle: A Continuous Service Real Time Clock for Digital Computers
abstract:
This paper describes continuous service; meaning the clock continues to function during power blackouts, system failures and shutdowns and can be read whenever the computer is operable.

rawabstract:
This paper describes continuous service; meaning the clock continues to function during power blackouts, system failures and shutdowns and can be read whenever the computer is operable.

entry:
@TechReport{Vollaro:1975:CSR,
  author =       "J. R. Vollaro",
  title =        "A Continuous Service Real Time Clock for Digital
                 Computers",
  type =         "Technical Memorandum",
  number =       "1048 (TM 75-1273-4)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "13",
  month =        mar,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes continuous service; meaning the
                 clock continues to function during power blackouts,
                 system failures and shutdowns and can be read whenever
                 the computer is operable.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: White:1975:LNU
author: R. C. White, Jr.
title: LKOUT --- a New UNIX System Call To Suspend and Resume Input From ldots
type: Technical Memorandum
number: 1076 (TM 75-4145-2)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 17
month: dec
monthnumber: 12
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: R. C. {White, Jr.}
rawtitle: {LKOUT} --- a New {UNIX} System Call To Suspend and Resume Input From \ldots{}
entry:
@TechReport{White:1975:LNU,
  author =       "R. C. {White, Jr.}",
  title =        "{LKOUT} --- a New {UNIX} System Call To Suspend and
                 Resume Input From \ldots{}",
  type =         "Technical Memorandum",
  number =       "1076 (TM 75-4145-2)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "17",
  month =        dec,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: White:1975:UDD
author: R. C. White, Jr.
title: UNIX DH-11 Driver To Support Both Teletypewriter And DATASPEED 40 Terminals ldots
type: Technical Memorandum
number: 1077 (TM 75-4145-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 17
month: dec
monthnumber: 12
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: R. C. {White, Jr.}
rawtitle: {UNIX DH-11} Driver To Support Both Teletypewriter And {DATASPEED 40} Terminals \ldots{}
entry:
@TechReport{White:1975:UDD,
  author =       "R. C. {White, Jr.}",
  title =        "{UNIX DH-11} Driver To Support Both Teletypewriter And
                 {DATASPEED 40} Terminals \ldots{}",
  type =         "Technical Memorandum",
  number =       "1077 (TM 75-4145-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "17",
  month =        dec,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Winheim:1975:DHU
author: I. A. Winheim
title: A Description of How UNIX Fortran Works
type: Technical Memorandum
number: 1063 (TM 75-8234.3)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 10
month: apr
monthnumber: 4
year: 1975
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: I. A. Winheim
rawtitle: A Description of How {UNIX Fortran} Works
abstract:
This memorandum describes the main differences between C and Fortran and how to ldots Fortran with the operating system.

rawabstract:
This memorandum describes the main differences between C and Fortran and how to \ldots{} Fortran with the operating system.

entry:
@TechReport{Winheim:1975:DHU,
  author =       "I. A. Winheim",
  title =        "A Description of How {UNIX Fortran} Works",
  type =         "Technical Memorandum",
  number =       "1063 (TM 75-8234.3)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "10",
  month =        apr,
  year =         "1975",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the main differences between
                 C and Fortran and how to \ldots{} Fortran with the
                 operating system.",
  acknowledgement = ack-nhfb,
}


bibtype: book
filename: unix.bib
label: Wulf:1975:DOC
title: The Design of an Optimizing Compiler
volume: 2
publisher: Elsevier Publishing Company
address: New York, NY, USA
pages: x + 165
year: 1975
LCCN: QA76.6 .D47
MRclass: 68N20
bibdate: Fri Jul 2 07:58:25 MDT 2021
bibsource: fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2021.07.02 07:58:25 MDT
series: Programming languages series
acknowledgement: ack-nhfb
authordates: Charles M. Geschke (1939--2021)
rawtitle: The Design of an Optimizing Compiler
author:
William Allan Wulf and Richard K. Johnsson and Charles B. Weinstock and Steven O. Hobbs and Charles M. Geschke

ISBN:
0-444-00158-1 (paperback), 0-444-00164-6 (hardcover) OR 0444001581 (paperback), 0444001646 (hardcover)

ISBN13:
978-0-444-00158-0 (paperback), 978-0-444-00164-1 (hardcover) OR 9780444001580 (paperback), 9780444001641 (hardcover)

URL:
https://en.wikipedia.org/wiki/The_Design_of_an_Optimizing_Compiler; https://kilthub.cmu.edu/articles/journal_contribution/The_design_of_an_optimizing_compiler/6610535

abstract:
here are important classes of programs which must be highly efficient on a particular computer, independent of how fast that computer may be; systems programs are one such class. In order to be able to write these programs in a higher-level language and accrue the benefits associated with the use of such languages, we must have compilers which will produce highly efficient representations of these programs. This paper describes the design and implementation of a highly optimizing compiler for the Bliss language [Wul71].par A notational scheme is described in terms of which an overview of the compiler is presented. The logical phases of the compiler are then described in some detail.

subject:
Compilers (Computer programs); PDP-11 (Computer); Neoplasms; Popular Works; Compilation (Ordinateurs); Ciencia Da Computacao Ou Informatica; Software Basico

TOC:
I. Introduction / 1 II. A Descriptive Notation / 3 III. An Overview of the Bliss/11 compiler / 5 IV: Compiler Specifics / 8 IV.1. LEXSYNFLO / 8 IV.2 DELAY / 33 IV.3 TNBIND / 50 IV.4 CODE / 63 IV.5 FINAL / 75 V. Conclusion / 80 A. Primer on the PDP-11 / 83 B. A Short Primer on Bliss / 89 C. A Complete Example / 92 Bibliography / 103

rawabstract:
here are important classes of programs which must be highly efficient on a particular computer, independent of how fast that computer may be; systems programs are one such class. In order to be able to write these programs in a higher-level language and accrue the benefits associated with the use of such languages, we must have compilers which will produce highly efficient representations of these programs. This paper describes the design and implementation of a highly optimizing compiler for the Bliss language [Wul71].\par A notational scheme is described in terms of which an overview of the compiler is presented. The logical phases of the compiler are then described in some detail.

rawauthor:
William Allan Wulf and Richard K. Johnsson and Charles B. Weinstock and Steven O. Hobbs and Charles M. Geschke

rawTOC:
I. Introduction / 1 \\ II. A Descriptive Notation / 3 \\ III. An Overview of the Bliss/11 compiler / 5 \\ IV: Compiler Specifics / 8 \\ IV.1. LEXSYNFLO / 8 \\ IV.2 DELAY / 33 \\ IV.3 TNBIND / 50 \\ IV.4 CODE / 63 \\ IV.5 FINAL / 75 \\ V. Conclusion / 80 \\ A. Primer on the PDP-11 / 83 \\ B. A Short Primer on Bliss / 89 \\ C. A Complete Example / 92 \\ Bibliography / 103

entry:
@Book{Wulf:1975:DOC,
  author =       "William Allan Wulf and Richard K. Johnsson and Charles
                 B. Weinstock and Steven O. Hobbs and Charles M.
                 Geschke",
  title =        "The Design of an Optimizing Compiler",
  volume =       "2",
  publisher =    "Elsevier Publishing Company",
  address =      "New York, NY, USA",
  pages =        "x + 165",
  year =         "1975",
  ISBN =         "0-444-00158-1 (paperback), 0-444-00164-6 (hardcover)",
  ISBN-13 =      "978-0-444-00158-0 (paperback), 978-0-444-00164-1
                 (hardcover)",
  LCCN =         "QA76.6 .D47",
  MRclass =      "68N20",
  bibdate =      "Fri Jul 2 07:58:25 MDT 2021",
  bibsource =    "fsz3950.oclc.org:210/WorldCat;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  series =       "Programming languages series",
  URL =          "https://en.wikipedia.org/wiki/The_Design_of_an_Optimizing_Compiler;
                 https://kilthub.cmu.edu/articles/journal_contribution/The_design_of_an_optimizing_compiler/6610535",
  abstract =     "here are important classes of programs which must be
                 highly efficient on a particular computer, independent
                 of how fast that computer may be; systems programs are
                 one such class. In order to be able to write these
                 programs in a higher-level language and accrue the
                 benefits associated with the use of such languages, we
                 must have compilers which will produce highly efficient
                 representations of these programs. This paper describes
                 the design and implementation of a highly optimizing
                 compiler for the Bliss language [Wul71].\par

                 A notational scheme is described in terms of which an
                 overview of the compiler is presented. The logical
                 phases of the compiler are then described in some
                 detail.",
  acknowledgement = ack-nhfb,
  author-dates = "Charles M. Geschke (1939--2021)",
  remark-1 =     "This compiler was targeted mainly at DEC operating
                 systems on the PDP-11, not at Unix. However, July 2021
                 correspondence on the TUHS mailing list suggests that
                 there was some contact between the CMU compiler team
                 and the Bell Labs compiler team, and thus, possible
                 mutual influence.",
  remark-2 =     "It describes the BLISS optimizing compiler for the
                 PDP-11, written at Carnegie Mellon University in the
                 early 1970s.",
  remark-3 =     "From the conclusion on pp. 81--82: ``We would like to
                 conclude by presenting our view on the importance of
                 efficiency. It is fashionable in some circles,
                 especially some academic ones, to depreciate the
                 importance of efficiency. The argument goes: `It is
                 programming time, not execution time, that matters.
                 What difference does it make if the program runs one
                 minute or two?' This argument is often used, for
                 example, to encourage the use of some of the newer,
                 often less efficient, programming languages.\par

                 It is difficult to argue with this. In fact we don't
                 for our own programs. Our time is much more important
                 than the machine's. However, the other fellow's program
                 (yours) is an entirely different matter! Every second
                 that his program executes ours can't. If his program is
                 inefficient, we are the ones who suffer, not him. The
                 problem of efficiency is not one of how long it takes
                 to run a program, but rather one of obtaining the
                 maximum benefit from a finite resource.''",
  subject =      "Compilers (Computer programs); PDP-11 (Computer);
                 Neoplasms; Popular Works; Compilation (Ordinateurs);
                 Ciencia Da Computa{\c{c}}{\~a}o Ou Informatica;
                 Software Basico",
  tableofcontents = "I. Introduction / 1 \\
                 II. A Descriptive Notation / 3 \\
                 III. An Overview of the Bliss/11 compiler / 5 \\
                 IV: Compiler Specifics / 8 \\
                 IV.1. LEXSYNFLO / 8 \\
                 IV.2 DELAY / 33 \\
                 IV.3 TNBIND / 50 \\
                 IV.4 CODE / 63 \\
                 IV.5 FINAL / 75 \\
                 V. Conclusion / 80 \\
                 A. Primer on the PDP-11 / 83 \\
                 B. A Short Primer on Bliss / 89 \\
                 C. A Complete Example / 92 \\
                 Bibliography / 103",
}


bibtype: techreport
filename: unix.bib
label: Albrecht:1976:BUC
author: E. H. Albrecht
title: DOS-BATCH To UNIX Conversion
type: Technical Memorandum
number: 1120
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 1
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: E. H. Albrecht
rawtitle: {DOS-BATCH} To {UNIX} Conversion
abstract:
This memo describes notes and an attachment for the knowledgeable DOS-BATCH programmer with sufficient background to develop programs in a ``stand-alone'' PDP-11 processor using the UNIX operating system.

rawabstract:
This memo describes notes and an attachment for the knowledgeable DOS-BATCH programmer with sufficient background to develop programs in a ``stand-alone'' PDP-11 processor using the UNIX operating system.

entry:
@TechReport{Albrecht:1976:BUC,
  author =       "E. H. Albrecht",
  title =        "{DOS-BATCH} To {UNIX} Conversion",
  type =         "Technical Memorandum",
  number =       "1120",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "1",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memo describes notes and an attachment for the
                 knowledgeable DOS-BATCH programmer with sufficient
                 background to develop programs in a ``stand-alone''
                 PDP-11 processor using the UNIX operating system.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Baker:1976:ASF
author: Brenda S. Baker
title: An Algorithm For Structuring Flowgraphs
type: Technical Memorandum
number: 1103 (TM 76-1271-3)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 14
month: may
monthnumber: 5
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: See also UNPL(1084).
acknowledgement: ack-nhfb
rawauthor: Brenda S. Baker
rawtitle: An Algorithm For Structuring Flowgraphs
abstract:
This paper describes an algorithm which transforms a flowgraph into a program containing IF THEN ELSE and REPEAT (DO FOREVER) statements. The algorithm has been implemented in a program called Struct.

rawabstract:
This paper describes an algorithm which transforms a flowgraph into a program containing IF THEN ELSE and REPEAT (DO FOREVER) statements. The algorithm has been implemented in a program called Struct.

entry:
@TechReport{Baker:1976:ASF,
  author =       "Brenda S. Baker",
  title =        "An Algorithm For Structuring Flowgraphs",
  type =         "Technical Memorandum",
  number =       "1103 (TM 76-1271-3)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "14",
  month =        may,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes an algorithm which transforms a
                 flowgraph into a program containing IF THEN ELSE and
                 REPEAT (DO FOREVER) statements. The algorithm has been
                 implemented in a program called Struct.",
  acknowledgement = ack-nhfb,
  remark =       "See also UNPL(1084).",
}


bibtype: techreport
filename: unix.bib
label: Bernstein:1976:SPU
author: D. R. Bernstein
title: Synthetic Process For UNIX
type: Technical Memorandum
number: 1114 (TM 76-8234-17, TM 76-9156-2)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 20
day: 24
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: D. R. Bernstein
rawtitle: Synthetic Process For {UNIX}
abstract:
A synthetic job performs a parameter-specified amount of processor cycles and disk I/O operations. Such jobs have been used successfully in measurement experiments. Patterned after widely publicized versions written in Fortran and PL/1, a UNTX version has been implemented in the C language. Input/output options for this version comprise tt read, tt write, tt getc, tt putc, tt getw, tt putw, as well as messages and pipes. The synthetic job concept nas been extended further by providing facilities for issuing an arbitrary sequence of system calls such as tt fork, pgm exec, pgm kill, pgm nice, pgm sleep and pgm wait. With these facilities, networks of cooperating synthetic processes can be constructed as models of applications. The synthetic process writes self-timing information into a report file. Some measurements of system calls comparing different hardware (PDP-11/45 and /70) and software (UNIX and MERT) are presented for illustration.

rawabstract:
A synthetic job performs a parameter-specified amount of processor cycles and disk I/O operations. Such jobs have been used successfully in measurement experiments. Patterned after widely publicized versions written in Fortran and PL/1, a UNTX version has been implemented in the C language. Input/output options for this version comprise {\tt read}, {\tt write}, {\tt getc}, {\tt putc}, {\tt getw}, {\tt putw}, as well as messages and pipes. The synthetic job concept nas been extended further by providing facilities for issuing an arbitrary sequence of system calls such as {\tt fork}, \pgm{exec}, \pgm{kill}, \pgm{nice}, \pgm{sleep} and \pgm{wait}. With these facilities, networks of cooperating synthetic processes can be constructed as models of applications. The synthetic process writes self-timing information into a report file. Some measurements of system calls comparing different hardware (PDP-11/45 and /70) and software (UNIX and MERT) are presented for illustration.

entry:
@TechReport{Bernstein:1976:SPU,
  author =       "D. R. Bernstein",
  title =        "Synthetic Process For {UNIX}",
  type =         "Technical Memorandum",
  number =       "1114 (TM 76-8234-17, TM 76-9156-2)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "20",
  day =          "24",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "A synthetic job performs a parameter-specified amount
                 of processor cycles and disk I/O operations. Such jobs
                 have been used successfully in measurement experiments.
                 Patterned after widely publicized versions written in
                 Fortran and PL/1, a UNTX version has been implemented
                 in the C language. Input/output options for this
                 version comprise {\tt read}, {\tt write}, {\tt getc},
                 {\tt putc}, {\tt getw}, {\tt putw}, as well as messages
                 and pipes. The synthetic job concept nas been extended
                 further by providing facilities for issuing an
                 arbitrary sequence of system calls such as {\tt fork},
                 \pgm{exec}, \pgm{kill}, \pgm{nice}, \pgm{sleep} and
                 \pgm{wait}. With these facilities, networks of
                 cooperating synthetic processes can be constructed as
                 models of applications. The synthetic process writes
                 self-timing information into a report file. Some
                 measurements of system calls comparing different
                 hardware (PDP-11/45 and /70) and software (UNIX and
                 MERT) are presented for illustration.",
  abstract-2 =   "This memorandum describes the monitor and resource
                 parts of synthetic \ldots{} measurements of system
                 calls comparing different hardware and software
                 \ldots{} illustration.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Brandt:1976:ISM
author: R. B. Brandt
title: Implementation of Semaphores and Messages in UNIX
type: Technical Memorandum
number: 1136 (MF 76-8234-76)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 7
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: The design specification for a collection of UNIX interprocess communication ldots .
acknowledgement: ack-nhfb
rawabstract: The design specification for a collection of UNIX interprocess communication \ldots{}.
rawauthor: R. B. Brandt
rawtitle: Implementation of Semaphores and Messages in {UNIX}
entry:
@TechReport{Brandt:1976:ISM,
  author =       "R. B. Brandt",
  title =        "Implementation of Semaphores and Messages in {UNIX}",
  type =         "Technical Memorandum",
  number =       "1136 (MF 76-8234-76)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "7",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "The design specification for a collection of UNIX
                 interprocess communication \ldots{}.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Brandt:1976:PUI
author: R. B. Brandt
title: Proposal For UNIX Interprocess Communication
type: Technical Memorandum
number: 1090 (TM 76-8234-4)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 17
month: mar
monthnumber: 3
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: R. B. Brandt
rawtitle: Proposal For {UNIX} Interprocess Communication
abstract:
This memorandum provides functional design specifications fo communications enhancements to UNIX OS.

rawabstract:
This memorandum provides functional design specifications fo communications enhancements to UNIX OS.

entry:
@TechReport{Brandt:1976:PUI,
  author =       "R. B. Brandt",
  title =        "Proposal For {UNIX} Interprocess Communication",
  type =         "Technical Memorandum",
  number =       "1090 (TM 76-8234-4)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "17",
  month =        mar,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum provides functional design
                 specifications fo communications enhancements to UNIX
                 OS.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Brown:1976:RMF
author: W. S. Brown
title: A realistic model of floating-point computation
type: Computing Science Technical Report
number: 58
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1976
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
acknowledgement: ack-nhfb
rawauthor: W. S. Brown
rawtitle: A realistic model of floating-point computation
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Brown:1977:RMF.

entry:
@TechReport{Brown:1976:RMF,
  author =       "W. S. Brown",
  title =        "A realistic model of floating-point computation",
  type =         "Computing Science Technical Report",
  number =       "58",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1976 (??)",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Brown:1977:RMF}.",
}


bibtype: article
filename: unix.bib
label: Bunt:1976:STO
author: Rick B. Bunt
title: Scheduling techniques for operating systems
journal: j-COMPUTER
volume: 9
number: 10
pages: 10--18
month: oct
monthnumber: 10
year: 1976
CODEN: CPTRB4
ISSN: 0018-9162 (print), 1558-0814 (electronic) OR 00189162 (print), 15580814 (electronic)
ISSNL: 0018-9162 OR 00189162
bibdate: Thu Dec 12 07:20:54 MST 1996
bibsource: Compendex database; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 1996.12.12 07:20:54 MST
fjournal: Computer
keywords: computer operating systems
acknowledgement: ack-nhfb
journalURL: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2
journalabr: Computer
rawauthor: Rick B. Bunt
rawtitle: Scheduling techniques for operating systems
abstract:
In an attempt to provide a common framework for the description of diverse schedulers, a general model is proposed. A number of classical scheduling techniques are described using this model and their characteristics are assessed. The scheduling methods of a number of popular operating systems are described. The IBM systems' described (OS / MFT, OS / MVT, OS / VS2) are all primarily oriented to an environment of batch submissions. The MULTICS system and the UNIX system, offering different types of service, have different performance objectives and hence employ a different scheduling approach to meet these objectives.

rawabstract:
In an attempt to provide a common framework for the description of diverse schedulers, a general model is proposed. A number of classical scheduling techniques are described using this model and their characteristics are assessed. The scheduling methods of a number of popular operating systems are described. The IBM systems' described (OS\slash MFT, OS\slash MVT, OS\slash VS2) are all primarily oriented to an environment of batch submissions. The MULTICS system and the UNIX system, offering different types of service, have different performance objectives and hence employ a different scheduling approach to meet these objectives.

entry:
@Article{Bunt:1976:STO,
  author =       "Rick B. Bunt",
  title =        "Scheduling techniques for operating systems",
  journal =      j-COMPUTER,
  volume =       "9",
  number =       "10",
  pages =        "10--18",
  month =        oct,
  year =         "1976",
  CODEN =        "CPTRB4",
  ISSN =         "0018-9162 (print), 1558-0814 (electronic)",
  ISSN-L =       "0018-9162",
  bibdate =      "Thu Dec 12 07:20:54 MST 1996",
  bibsource =    "Compendex database;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "In an attempt to provide a common framework for the
                 description of diverse schedulers, a general model is
                 proposed. A number of classical scheduling techniques
                 are described using this model and their
                 characteristics are assessed. The scheduling methods of
                 a number of popular operating systems are described.
                 The IBM systems' described (OS\slash MFT, OS\slash MVT,
                 OS\slash VS2) are all primarily oriented to an
                 environment of batch submissions. The MULTICS system
                 and the UNIX system, offering different types of
                 service, have different performance objectives and
                 hence employ a different scheduling approach to meet
                 these objectives.",
  acknowledgement = ack-nhfb,
  classification = "723",
  fjournal =     "Computer",
  journal-URL =  "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2",
  journalabr =   "Computer",
  keywords =     "computer operating systems",
}


bibtype: techreport
filename: unix.bib
label: Burnette:1976:RTT
author: W. A. Burnette
title: A Real-Time Time-Shared Operating System For An SEL / 86--PDP-11 Configuration
type: Technical Memorandum
number: 1122 (TM 76-8231-9, TM 76-1228-11)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 29
month: oct
monthnumber: 10
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: W. A. Burnette
rawtitle: A Real-Time Time-Shared Operating System For An {SEL\slash 86--PDP-11} Configuration
abstract:
The primary purpose of the SEL/86--PDP-11 system is to provide real-time interactive computing for research in speech and graphics.

rawabstract:
The primary purpose of the SEL/86--PDP-11 system is to provide real-time interactive computing for research in speech and graphics.

entry:
@TechReport{Burnette:1976:RTT,
  author =       "W. A. Burnette",
  title =        "A Real-Time Time-Shared Operating System For An
                 {SEL\slash 86--PDP-11} Configuration",
  type =         "Technical Memorandum",
  number =       "1122 (TM 76-8231-9, TM 76-1228-11)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "29",
  month =        oct,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "The primary purpose of the SEL/86--PDP-11 system is to
                 provide real-time interactive computing for research in
                 speech and graphics.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Cherry:1976:ICL
author: Lorinda L. Cherry
title: An Interactive Control Language For SIM
type: Technical Memorandum
number: 1105 (TM 76-1271-8)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 28
month: jun
monthnumber: 6
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This paper is intended to be a reference manual and assumes familiarity with STM.
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022)
rawabstract: This paper is intended to be a reference manual and assumes familiarity with STM.
rawauthor: Lorinda L. Cherry
rawtitle: An Interactive Control Language For {SIM}
entry:
@TechReport{Cherry:1976:ICL,
  author =       "Lorinda L. Cherry",
  title =        "An Interactive Control Language For {SIM}",
  type =         "Technical Memorandum",
  number =       "1105 (TM 76-1271-8)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "28",
  month =        jun,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper is intended to be a reference manual and
                 assumes familiarity with STM.",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022)",
}


bibtype: techreport
filename: unix.bib
label: Cherry:1976:SLS
author: Lorinda L. Cherry
title: SIM --- A Language For Simulating Computers
type: Technical Memorandum
number: 1097 (TM 76-1271-2)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 5
month: may
monthnumber: 5
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022)
rawauthor: Lorinda L. Cherry
rawtitle: {SIM} --- A Language For Simulating Computers
abstract:
SIM is a language and compiler for writing computer and microprocessor simulators. SIM currently runs under UNIX and will soon be available under GCOS.

rawabstract:
SIM is a language and compiler for writing computer and microprocessor simulators. SIM currently runs under UNIX and will soon be available under GCOS.

entry:
@TechReport{Cherry:1976:SLS,
  author =       "Lorinda L. Cherry",
  title =        "{SIM} --- A Language For Simulating Computers",
  type =         "Technical Memorandum",
  number =       "1097 (TM 76-1271-2)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "5",
  month =        may,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "SIM is a language and compiler for writing computer
                 and microprocessor simulators. SIM currently runs under
                 UNIX and will soon be available under GCOS.",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022)",
}


bibtype: techreport
filename: unix.bib
label: DeJager:1976:SMU
author: D. S. De Jager
title: Shared Memory In UNIX
type: Technical Memorandum
number: 1127 (TM 76-5223-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 19
month: nov
monthnumber: 11
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: D. S. {De Jager}
rawtitle: Shared Memory In {UNIX}
abstract:
This memorandum presents a proposal for a general set of primitives to be used for the set up and administration of shared memory in the UNIX environment.

rawabstract:
This memorandum presents a proposal for a general set of primitives to be used for the set up and administration of shared memory in the UNIX environment.

entry:
@TechReport{DeJager:1976:SMU,
  author =       "D. S. {De Jager}",
  title =        "Shared Memory In {UNIX}",
  type =         "Technical Memorandum",
  number =       "1127 (TM 76-5223-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "19",
  month =        nov,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum presents a proposal for a general set
                 of primitives to be used for the set up and
                 administration of shared memory in the UNIX
                 environment.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Dolotta:1976:PWP
author: T. A. Dolotta and others
type: Technical Memorandum
number: 1107 (TM 76-9141-6, TM 76-9144-3, TM 76-9411-1, TM 76-9421-2)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 30
month: jul
monthnumber: 7
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: For complete information, see UNED (G.4).
acknowledgement: ack-nhfb
rawauthor: T. A. Dolotta and others
title:
Programmer's Workbench Papers From The Second International Conference on Software Engineering. (G.4)

abstract:
Four papers and included in this memo. They consist of four specific PWB facilities and a ldots of one user group's experience with PWB.

rawabstract:
Four papers and included in this memo. They consist of four specific PWB facilities and a \ldots{} of one user group's experience with PWB.

rawtitle:
{Programmer's Workbench} Papers From {The Second International Conference on Software Engineering. (G.4)}

entry:
@TechReport{Dolotta:1976:PWP,
  author =       "T. A. Dolotta and others",
  title =        "{Programmer's Workbench} Papers From {The Second
                 International Conference on Software Engineering.
                 (G.4)}",
  type =         "Technical Memorandum",
  number =       "1107 (TM 76-9141-6, TM 76-9144-3, TM 76-9411-1, TM
                 76-9421-2)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "30",
  month =        jul,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Four papers and included in this memo. They consist of
                 four specific PWB facilities and a \ldots{} of one user
                 group's experience with PWB.",
  acknowledgement = ack-nhfb,
  remark =       "For complete information, see UNED (G.4).",
}


bibtype: techreport
filename: unix.bib
label: Engelbert:1976:STS
author: E. F. Engelbert
title: A Secretarial Typing System Using UNIX
type: Technical Memorandum
number: 1091
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 27
month: feb
monthnumber: 2
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: E. F. Engelbert
rawtitle: A Secretarial Typing System Using {UNIX}
entry:
@TechReport{Engelbert:1976:STS,
  author =       "E. F. Engelbert",
  title =        "A Secretarial Typing System Using {UNIX}",
  type =         "Technical Memorandum",
  number =       "1091",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "27",
  month =        feb,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: unix.bib
label: Fraser:1976:PSF
author: A. G. Fraser
title: The present status and future trends in computer / communication technology
journal: Communications Society
volume: 14
number: 5
pages: 10--19
month: sep
monthnumber: 9
year: 1976
DOI: https://doi.org/10.1109/mcomd.1976.1089243
ISSN: 0094-5579 OR 00945579
bibdate: Mon Aug 28 10:51:05 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.28 10:51:05 ???
URL: https://ieeexplore.ieee.org/abstract/document/1089243
acknowledgement: ack-nhfb
authordates: Alexander G. (Sandy) Fraser (8 June 1937--13 June 2022)
journalURL: http://ieeexplore.ieee.org/servlet/opac?punumber=8158
rawauthor: A. G. Fraser
rawtitle: The present status and future trends in computer\slash communication technology
entry:
@Article{Fraser:1976:PSF,
  author =       "A. G. Fraser",
  title =        "The present status and future trends in computer\slash
                 communication technology",
  journal =      "Communications Society",
  volume =       "14",
  number =       "5",
  pages =        "10--19",
  month =        sep,
  year =         "1976",
  DOI =          "https://doi.org/10.1109/mcomd.1976.1089243",
  ISSN =         "0094-5579",
  bibdate =      "Mon Aug 28 10:51:05 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://ieeexplore.ieee.org/abstract/document/1089243",
  acknowledgement = ack-nhfb,
  author-dates = "Alexander G. (Sandy) Fraser (8 June 1937--13 June
                 2022)",
  journal-URL =  "http://ieeexplore.ieee.org/servlet/opac?punumber=8158",
}


bibtype: inproceedings
filename: unix.bib
label: Goldstein:1976:CFT
author: A. J. Goldstein and A. B. Lesk
title: Common feature techniques for discrete optimization
publisher: pub-ACM
address: pub-ACM:adr
pages: 232--244
year: 1976
DOI: https://doi.org/10.1145/800146.804819
bibdate: Fri Sep 1 09:56:24 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.01 09:56:24 ???
acknowledgement: ack-nhfb
rawauthor: A. J. Goldstein and A. B. Lesk
rawtitle: Common feature techniques for discrete optimization
booktitle:
The proceedings of the thirteenth design automation conference on Design automation --- DAC '76, No. 13

abstract:
We present a general approach to finding optimal arrangements of objects, given a cost function for evaluating an arrangement. The method is based on the assumption that features which are common to many weak local optima of a problem should be present in the global optimum. The algorithm identifies such common features and uses them to create `blocks' of objects which are treated as indivisible units. We have used general-purpose algorithms which do not exploit the peculiarities of any one problem, thus, the method described here may not be as good as an heuristic which has been tailored to a particular problem. However. it is easily adaptable to different problems, and produces many near-optimal solutions.par Two examples are discussed: an electrical-net wiring problem and the traveling salesman problem.

rawabstract:
We present a general approach to finding optimal arrangements of objects, given a cost function for evaluating an arrangement. The method is based on the assumption that features which are common to many weak local optima of a problem should be present in the global optimum. The algorithm identifies such common features and uses them to create `blocks' of objects which are treated as indivisible units. We have used general-purpose algorithms which do not exploit the peculiarities of any one problem, thus, the method described here may not be as good as an heuristic which has been tailored to a particular problem. However. it is easily adaptable to different problems, and produces many near-optimal solutions.\par Two examples are discussed: an electrical-net wiring problem and the traveling salesman problem.

rawbooktitle:
The proceedings of the thirteenth design automation conference on Design automation --- {DAC '76}, No. 13

entry:
@InProceedings{Goldstein:1976:CFT,
  author =       "A. J. Goldstein and A. B. Lesk",
  booktitle =    "The proceedings of the thirteenth design automation
                 conference on Design automation --- {DAC '76}, No. 13",
  title =        "Common feature techniques for discrete optimization",
  publisher =    pub-ACM,
  address =      pub-ACM:adr,
  pages =        "232--244",
  year =         "1976",
  DOI =          "https://doi.org/10.1145/800146.804819",
  bibdate =      "Fri Sep 1 09:56:24 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "We present a general approach to finding optimal
                 arrangements of objects, given a cost function for
                 evaluating an arrangement. The method is based on the
                 assumption that features which are common to many weak
                 local optima of a problem should be present in the
                 global optimum. The algorithm identifies such common
                 features and uses them to create `blocks' of objects
                 which are treated as indivisible units. We have used
                 general-purpose algorithms which do not exploit the
                 peculiarities of any one problem, thus, the method
                 described here may not be as good as an heuristic which
                 has been tailored to a particular problem. However. it
                 is easily adaptable to different problems, and produces
                 many near-optimal solutions.\par

                 Two examples are discussed: an electrical-net wiring
                 problem and the traveling salesman problem.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Greenberg:1976:NPR
author: M. E. Greenberg and C. S. Roberts
title: Numeric Pattern Recognition Data Base for UNIX Systems
type: Technical Memorandum
number: 1085 (TM 76-1353-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 5
month: jan
monthnumber: 1
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This memorandum describes the data base contents and format.
acknowledgement: ack-nhfb
rawabstract: This memorandum describes the data base contents and format.
rawauthor: M. E. Greenberg and C. S. Roberts
rawtitle: Numeric Pattern Recognition Data Base for {UNIX} Systems
entry:
@TechReport{Greenberg:1976:NPR,
  author =       "M. E. Greenberg and C. S. Roberts",
  title =        "Numeric Pattern Recognition Data Base for {UNIX}
                 Systems",
  type =         "Technical Memorandum",
  number =       "1085 (TM 76-1353-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "5",
  month =        jan,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the data base contents and
                 format.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Hunt:1976:ADF
author: J. W. Hunt and M. D. McIlroy
title: An Algorithm for Differential File Comparison
type: Computing Science Technical Report
number: 41
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 6 + 3
year: 1976
bibdate: Fri Sep 01 14:13:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.01 14:13:45 ???
URL: https://www.cs.dartmouth.edu/~doug/diff.pdf
acknowledgement: ack-nhfb
rawauthor: J. W. Hunt and M. D. McIlroy
rawtitle: An Algorithm for Differential File Comparison
abstract:
The program diff reports differences between two files, expressed as a minimal list of line changes to bring either file into agreement with the other. Diff has been engineered to make efficient use of time and space on typical inputs that arise in vetting version-to-version changes in computer-maintained or computer-generated documents. Time and space usage are observed to vary about as the sum of the file lengths on real data, although they are known to vary as the product of the file lengths in the worst case.par The central algorithm of diff solves the longest common subsequence problem to find the lines that do not change between files. Practical efficiency is gained by attending only to certain critical candidate matches between the files, the breaking of which would shorten the longest subsequence common to some pair of initial segments of the two files. Various techniques of hashing, presorting into equivalence classes, merging by binary search, and dynamic storage allocation are used to obtain good performance. par [This document was scanned from Bell Laboratories Computing Science Technical Report #41, dated July 1976. Text was converted by OCR and hand-corrected (last changed June, 2012). Figures were reconstructed. Some OCR errors may remain, especially in tables and equations. Please report them to doug@cs.dartmouth.edu.]

rawabstract:
The program diff reports differences between two files, expressed as a minimal list of line changes to bring either file into agreement with the other. Diff has been engineered to make efficient use of time and space on typical inputs that arise in vetting version-to-version changes in computer-maintained or computer-generated documents. Time and space usage are observed to vary about as the sum of the file lengths on real data, although they are known to vary as the product of the file lengths in the worst case.\par The central algorithm of diff solves the longest common subsequence problem to find the lines that do not change between files. Practical efficiency is gained by attending only to certain critical candidate matches between the files, the breaking of which would shorten the longest subsequence common to some pair of initial segments of the two files. Various techniques of hashing, presorting into equivalence classes, merging by binary search, and dynamic storage allocation are used to obtain good performance. \par [This document was scanned from Bell Laboratories Computing Science Technical Report #41, dated July 1976. Text was converted by OCR and hand-corrected (last changed June, 2012). Figures were reconstructed. Some OCR errors may remain, especially in tables and equations. Please report them to doug@cs.dartmouth.edu.]

entry:
@TechReport{Hunt:1976:ADF,
  author =       "J. W. Hunt and M. D. McIlroy",
  title =        "An Algorithm for Differential File Comparison",
  type =         "Computing Science Technical Report",
  number =       "41",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "6 + 3",
  year =         "1976",
  bibdate =      "Fri Sep 01 14:13:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "https://www.cs.dartmouth.edu/~doug/diff.pdf",
  abstract =     "The program diff reports differences between two
                 files, expressed as a minimal list of line changes to
                 bring either file into agreement with the other. Diff
                 has been engineered to make efficient use of time and
                 space on typical inputs that arise in vetting
                 version-to-version changes in computer-maintained or
                 computer-generated documents. Time and space usage are
                 observed to vary about as the sum of the file lengths
                 on real data, although they are known to vary as the
                 product of the file lengths in the worst case.\par

                 The central algorithm of diff solves the longest common
                 subsequence problem to find the lines that do not
                 change between files. Practical efficiency is gained by
                 attending only to certain critical candidate matches
                 between the files, the breaking of which would shorten
                 the longest subsequence common to some pair of initial
                 segments of the two files. Various techniques of
                 hashing, presorting into equivalence classes, merging
                 by binary search, and dynamic storage allocation are
                 used to obtain good performance. \par

                 [This document was scanned from Bell Laboratories
                 Computing Science Technical Report #41, dated July
                 1976. Text was converted by OCR and hand-corrected
                 (last changed June, 2012). Figures were reconstructed.
                 Some OCR errors may remain, especially in tables and
                 equations. Please report them to
                 doug@cs.dartmouth.edu.]",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Imagna:1976:UIP
author: C. P. Imagna
title: UNIX Initialization and Process Control
type: Technical Memorandum
number: 1128 (TM 76-3412-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 23
month: jul
monthnumber: 7
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This memorandum describes the UNIX initialization program (INIT).
acknowledgement: ack-nhfb
rawabstract: This memorandum describes the UNIX initialization program (INIT).
rawauthor: C. P. Imagna
rawtitle: {UNIX} Initialization and Process Control
entry:
@TechReport{Imagna:1976:UIP,
  author =       "C. P. Imagna",
  title =        "{UNIX} Initialization and Process Control",
  type =         "Technical Memorandum",
  number =       "1128 (TM 76-3412-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "23",
  month =        jul,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the UNIX initialization
                 program (INIT).",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Kernighan:1976:TMU
author: Brian W. Kernighan and Lorinda L. Cherry
title: Typesetting Mathematics --- User's Guide
type: Technical Memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1976
bibdate: Mon Aug 28 09:04:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.28 09:04:45 ???
remark: See also revised edition cite Kernighan:1978:TMU
acknowledgement: ack-nhfb
authordates: Lorinda L. Cherry (18 November 1944--February 2022)
rawauthor: Brian W. Kernighan and Lorinda L. Cherry
rawtitle: Typesetting Mathematics --- User's Guide
entry:
@TechReport{Kernighan:1976:TMU,
  author =       "Brian W. Kernighan and Lorinda L. Cherry",
  title =        "Typesetting Mathematics --- User's Guide",
  type =         "Technical Memorandum",
  number =       "??",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "??",
  month =        "????",
  year =         "1976",
  bibdate =      "Mon Aug 28 09:04:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Lorinda L. Cherry (18 November 1944--February 2022)",
  remark =       "See also revised edition \cite{Kernighan:1978:TMU}",
}


bibtype: techreport
filename: unix.bib
label: Lencoski:1976:UIM
author: Joseph E. Lencoski and Stuart A. Tartarone
title: UNIX--INTELLEC MDS Interface
type: Technical Memorandum
number: 1118 (TM 76-3141-1, TM 76-3142-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 1
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: Joseph E. Lencoski and Stuart A. Tartarone
rawtitle: {UNIX--INTELLEC MDS} Interface
abstract:
This memorandum describes the interface including a synopsis of the new UNIX commands to access these features and provides a program listing of the new software developed.

rawabstract:
This memorandum describes the interface including a synopsis of the new UNIX commands to access these features and provides a program listing of the new software developed.

entry:
@TechReport{Lencoski:1976:UIM,
  author =       "Joseph E. Lencoski and Stuart A. Tartarone",
  title =        "{UNIX--INTELLEC MDS} Interface",
  type =         "Technical Memorandum",
  number =       "1118 (TM 76-3141-1, TM 76-3142-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "1",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes the interface including a
                 synopsis of the new UNIX commands to access these
                 features and provides a program listing of the new
                 software developed.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lesk:1976:CTTa
author: Michael E. Lesk and Brian W. Kernighan
title: Computer Typesetting of Technical Journals on UNIX
type: Technical Memorandum
number: 1089 (TM 76-1274-2, TM 76-1273-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 29
month: mar
monthnumber: 3
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: Michael E. Lesk and Brian W. Kernighan
rawtitle: Computer Typesetting of Technical Journals on {UNIX}
entry:
@TechReport{Lesk:1976:CTTa,
  author =       "Michael E. Lesk and Brian W. Kernighan",
  title =        "Computer Typesetting of Technical Journals on {UNIX}",
  type =         "Technical Memorandum",
  number =       "1089 (TM 76-1274-2, TM 76-1273-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "29",
  month =        mar,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lesk:1976:CTTb
author: Michael E. Lesk and Brian W. Kernighan
title: Computer Typesetting of Technical Journals on Unix
type: Computing Science Technical Report
number: 44
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: jul
monthnumber: 7
year: 1976
bibdate: Wed Aug 20 18:05:59 2003
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2003.08.20 18:05:59 ???
acknowledgement: ack-nhfb
rawauthor: Michael E. Lesk and Brian W. Kernighan
rawtitle: Computer Typesetting of Technical Journals on {Unix}
remark:
TO DO: No electronic form of this report has yet been located, so the year is uncertain. Published in cite Lesk:1977:CTT.

entry:
@TechReport{Lesk:1976:CTTb,
  author =       "Michael E. Lesk and Brian W. Kernighan",
  title =        "Computer Typesetting of Technical Journals on {Unix}",
  type =         "Computing Science Technical Report",
  number =       "44",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        jul,
  year =         "1976",
  bibdate =      "Wed Aug 20 18:05:59 2003",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "TO DO: No electronic form of this report has yet been
                 located, so the year is uncertain. Published in
                 \cite{Lesk:1977:CTT}.",
}


bibtype: techreport
filename: unix.bib
label: Lesk:1976:TDU
author: Michael E. Lesk
title: Typing documents on the UNIX System: using the tt -ms macros with pgm nroff and pgm troff
type: Computing Science Technical Report
number: 49
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
year: 1976
bibdate: Sat Sep 02 07:46:26 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.09.02 07:46:26 ???
remark: Cited in cite [ref. 3]Aho:1988:MCR.
acknowledgement: ack-nhfb
rawauthor: Michael E. Lesk
rawtitle: Typing documents on the {UNIX} System: using the {\tt -ms} macros with \pgm{nroff} and \pgm{troff}
entry:
@TechReport{Lesk:1976:TDU,
  author =       "Michael E. Lesk",
  title =        "Typing documents on the {UNIX} System: using the {\tt
                 -ms} macros with \pgm{nroff} and \pgm{troff}",
  type =         "Computing Science Technical Report",
  number =       "49",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  year =         "1976",
  bibdate =      "Sat Sep 02 07:46:26 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Cited in \cite[ref. 3]{Aho:1988:MCR}.",
}


bibtype: techreport
filename: unix.bib
label: Lesk:1976:TPF
author: Michael E. Lesk
title: Tbl --- A Program to Format Tables
type: Technical Memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 18
day: 11
month: jun
monthnumber: 6
year: 1976
bibdate: Mon Aug 28 08:43:05 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.28 08:43:05 ???
URL: http://www.kohala.com/start/troff/v7man/tbl/tbl.ps
remark: Available in PDF file of cite [pp. 321--339]Dolotta:1977:DPU.
acknowledgement: ack-nhfb
rawauthor: Michael E. Lesk
rawtitle: {Tbl} --- A Program to Format Tables
abstract:
Tbl is a document formatting preprocessor for pgm troff or pgm nroff which makes even fairly complex tables easy to specify and enter. It is available on the PDP-11 UNIX system and on Honeywell 6000 GCOS. Tables are made up of columns which may be independently centered, right-adjusted, left-adjusted, or aligned by decimal points. Headings may be placed over single columns or groups of columns. A table entry may contain equations, or may consist of several rows of text. Horizontal or vertical lines may be drawn as desired in the table, and any table or element may be enclosed in a box. For example: [followed by 11-row sample table]

rawabstract:
Tbl is a document formatting preprocessor for \pgm{troff} or \pgm{nroff} which makes even fairly complex tables easy to specify and enter. It is available on the PDP-11 UNIX system and on Honeywell 6000 GCOS. Tables are made up of columns which may be independently centered, right-adjusted, left-adjusted, or aligned by decimal points. Headings may be placed over single columns or groups of columns. A table entry may contain equations, or may consist of several rows of text. Horizontal or vertical lines may be drawn as desired in the table, and any table or element may be enclosed in a box. For example: [followed by 11-row sample table]

entry:
@TechReport{Lesk:1976:TPF,
  author =       "Michael E. Lesk",
  title =        "{Tbl} --- A Program to Format Tables",
  type =         "Technical Memorandum",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "18",
  day =          "11",
  month =        jun,
  year =         "1976",
  bibdate =      "Mon Aug 28 08:43:05 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  URL =          "http://www.kohala.com/start/troff/v7man/tbl/tbl.ps",
  abstract =     "Tbl is a document formatting preprocessor for
                 \pgm{troff} or \pgm{nroff} which makes even fairly
                 complex tables easy to specify and enter. It is
                 available on the PDP-11 UNIX system and on Honeywell
                 6000 GCOS. Tables are made up of columns which may be
                 independently centered, right-adjusted, left-adjusted,
                 or aligned by decimal points. Headings may be placed
                 over single columns or groups of columns. A table entry
                 may contain equations, or may consist of several rows
                 of text. Horizontal or vertical lines may be drawn as
                 desired in the table, and any table or element may be
                 enclosed in a box. For example: [followed by 11-row
                 sample table]",
  acknowledgement = ack-nhfb,
  remark =       "Available in PDF file of \cite[pp.
                 321--339]{Dolotta:1977:DPU}.",
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1976:LUS
author: Heinz Lycklama
title: LSI-UNIX System
type: Technical Memorandum
number: 1116 (TM 76-1352-4)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 10
day: 6
month: oct
monthnumber: 10
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
rawtitle: {LSI-UNIX} System
abstract:
A modified version of the UNIX operating system has been written to run on the LSI-11 microcomputer with 20K words of primary memory and floppy discs for secondary storage. This configuration permits most of the UNIX user programs to run on the LSI-11 microcomputer. The main programming language used is the structured higher-level language C. A background process as well as foreground processes may be run. A set of subroutines have been written to interface to the file system on the floppy diskettes. Asynchronous read / write routines are also available to the user.par The LSI-UNIX System (LSX) has appeal as a standalone system for dedicated applications. It also has many potential uses as an intelligent terminal system. The decreasing costs of hardware make such a system a potential candidate for a very powerful and inexpensive personal computer system.

rawabstract:
A modified version of the UNIX operating system has been written to run on the LSI-11 microcomputer with 20K words of primary memory and floppy discs for secondary storage. This configuration permits most of the UNIX user programs to run on the LSI-11 microcomputer. The main programming language used is the structured higher-level language C. A background process as well as foreground processes may be run. A set of subroutines have been written to interface to the file system on the floppy diskettes. Asynchronous read\slash write routines are also available to the user.\par The LSI-UNIX System (LSX) has appeal as a standalone system for dedicated applications. It also has many potential uses as an intelligent terminal system. The decreasing costs of hardware make such a system a potential candidate for a very powerful and inexpensive personal computer system.

entry:
@TechReport{Lycklama:1976:LUS,
  author =       "Heinz Lycklama",
  title =        "{LSI-UNIX} System",
  type =         "Technical Memorandum",
  number =       "1116 (TM 76-1352-4)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "10",
  day =          "6",
  month =        oct,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "A modified version of the UNIX operating system has
                 been written to run on the LSI-11 microcomputer with
                 20K words of primary memory and floppy discs for
                 secondary storage. This configuration permits most of
                 the UNIX user programs to run on the LSI-11
                 microcomputer. The main programming language used is
                 the structured higher-level language C. A background
                 process as well as foreground processes may be run. A
                 set of subroutines have been written to interface to
                 the file system on the floppy diskettes. Asynchronous
                 read\slash write routines are also available to the
                 user.\par

                 The LSI-UNIX System (LSX) has appeal as a standalone
                 system for dedicated applications. It also has many
                 potential uses as an intelligent terminal system. The
                 decreasing costs of hardware make such a system a
                 potential candidate for a very powerful and inexpensive
                 personal computer system.",
  abstract-2 =   "A modified version of the UNIX operating system has
                 been written to run on the LSI-11 microcomputer. The
                 main programming language is the structured high level
                 language C.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1976:MUR
author: Heinz Lycklama
title: MINI-UNIX Regenerating System Software
type: Technical Memorandum
number: 1125
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: nov
monthnumber: 11
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This document discusses how to assemble or compile various parts of the MINI-UNIX system software.
acknowledgement: ack-nhfb
rawabstract: This document discusses how to assemble or compile various parts of the MINI-UNIX system software.
rawauthor: Heinz Lycklama
rawtitle: {MINI-UNIX} Regenerating System Software
entry:
@TechReport{Lycklama:1976:MUR,
  author =       "Heinz Lycklama",
  title =        "{MINI-UNIX} Regenerating System Software",
  type =         "Technical Memorandum",
  number =       "1125",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        nov,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This document discusses how to assemble or compile
                 various parts of the MINI-UNIX system software.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1976:MUS
author: Heinz Lycklama
title: MINI-UNIX Summary
type: Technical Memorandum
number: 1123
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
month: nov
monthnumber: 11
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: Heinz Lycklama
rawtitle: {MINI-UNIX} Summary
entry:
@TechReport{Lycklama:1976:MUS,
  author =       "Heinz Lycklama",
  title =        "{MINI-UNIX} Summary",
  type =         "Technical Memorandum",
  number =       "1123",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  month =        nov,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lycklama:1976:SMU
author: Heinz Lycklama
title: Setting-Up MINI-UNIX
type: Technical Memorandum
number: 1124
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
edition: Sixth
month: nov
monthnumber: 11
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This paper describes the procedure for setting up MINI-UNIX on the PDP-11/10, -11/20 or -11/40.
acknowledgement: ack-nhfb
rawabstract: This paper describes the procedure for setting up MINI-UNIX on the PDP-11/10, -11/20 or -11/40.
rawauthor: Heinz Lycklama
rawtitle: Setting-Up {MINI-UNIX}
entry:
@TechReport{Lycklama:1976:SMU,
  author =       "Heinz Lycklama",
  title =        "Setting-Up {MINI-UNIX}",
  type =         "Technical Memorandum",
  number =       "1124",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  edition =      "Sixth",
  pages =        "??",
  month =        nov,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This paper describes the procedure for setting up
                 MINI-UNIX on the PDP-11/10, -11/20 or -11/40.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lyons:1976:CUA
author: T. G. Lyons
title: Cautions On The Use Of The Alarm Signal
type: Technical Memorandum
number: 1094
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 26
month: apr
monthnumber: 4
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: T. G. Lyons
rawtitle: Cautions On The Use Of The Alarm Signal
abstract:
Programmer's Notes: Two System calls Alarm (n) and Pause () have been installed on the PWB ldots Dept. 9144. They were coded at MH and are likely to filter down to standard ldots 

rawabstract:
Programmer's Notes: Two System calls Alarm (n) and Pause () have been installed on the PWB \ldots{} Dept. 9144. They were coded at MH and are likely to filter down to standard \ldots{}

entry:
@TechReport{Lyons:1976:CUA,
  author =       "T. G. Lyons",
  title =        "Cautions On The Use Of The Alarm Signal",
  type =         "Technical Memorandum",
  number =       "1094",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "26",
  month =        apr,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "Programmer's Notes: Two System calls Alarm (n) and
                 Pause () have been installed on the PWB \ldots{} Dept.
                 9144. They were coded at MH and are likely to filter
                 down to standard \ldots{}",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Lyons:1976:GUR
author: T. G. Lyons
title: Guide to UNIVAC Remote Job Entry for Programmer's Workbench Users
type: Technical Memorandum
number: 1217
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 16
month: feb
monthnumber: 2
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: T. G. Lyons
rawtitle: Guide to {UNIVAC Remote Job Entry} for {Programmer's Workbench} Users
abstract:
This document describes the RJE services provided between Programmer's Workbench Machines and the UNIVAC Computer Center at Raritan River.

rawabstract:
This document describes the RJE services provided between Programmer's Workbench Machines and the UNIVAC Computer Center at Raritan River.

entry:
@TechReport{Lyons:1976:GUR,
  author =       "T. G. Lyons",
  title =        "Guide to {UNIVAC Remote Job Entry} for {Programmer's
                 Workbench} Users",
  type =         "Technical Memorandum",
  number =       "1217",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "16",
  month =        feb,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This document describes the RJE services provided
                 between Programmer's Workbench Machines and the UNIVAC
                 Computer Center at Raritan River.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: unix.bib
label: Manning:1976:UBL
author: E. G. Manning and R. Howard and C. G. O'Donnell and K. Pammett and E. Chang
title: A Unix-based local processor and network access machines
journal: j-COMP-NET
volume: 1
number: 2
pages: 139--142
month: sep
monthnumber: 9
year: 1976
CODEN: CNETDP
ISSN: 0376-5075 (print), 1878-3120 (electronic) OR 03765075 (print), 18783120 (electronic)
ISSNL: 0376-5075 OR 03765075
bibdate: Wed Apr 15 07:43:18 2020
bibsource: https://www.math.utah.edu/pub/tex/bib/compnet.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2020.04.15 07:43:18 ???
fjournal: Computer Networks
acknowledgement: ack-nhfb
rawauthor: E. G. Manning and R. Howard and C. G. O'Donnell and K. Pammett and E. Chang
rawtitle: A {Unix}-based local processor and network access machines
entry:
@Article{Manning:1976:UBL,
  author =       "E. G. Manning and R. Howard and C. G. O'Donnell and K.
                 Pammett and E. Chang",
  title =        "A {Unix}-based local processor and network access
                 machines",
  journal =      j-COMP-NET,
  volume =       "1",
  number =       "2",
  pages =        "139--142",
  month =        sep,
  year =         "1976",
  CODEN =        "CNETDP",
  ISSN =         "0376-5075 (print), 1878-3120 (electronic)",
  ISSN-L =       "0376-5075",
  bibdate =      "Wed Apr 15 07:43:18 2020",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/compnet.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  fjournal =     "Computer Networks",
}


bibtype: techreport
filename: unix.bib
label: Ossanna:1976:NTU
author: Joseph F. Ossanna
title: NROFF / TROFF User's Manual
type: Technical Memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 34
month: oct
monthnumber: 10
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: Available in PDF file of cite [pp. 217--250]Dolotta:1977:DPU.
acknowledgement: ack-nhfb
authordates: Joseph Frank Ossanna, Jr. (10 December 1928--28 November 1977)
rawauthor: Joseph F. Ossanna
rawtitle: {NROFF\slash TROFF} User's Manual
entry:
@TechReport{Ossanna:1976:NTU,
  author =       "Joseph F. Ossanna",
  title =        "{NROFF\slash TROFF} User's Manual",
  type =         "Technical Memorandum",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "34",
  month =        oct,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  author-dates = "Joseph Frank Ossanna, Jr. (10 December 1928--28
                 November 1977)",
  remark =       "Available in PDF file of \cite[pp.
                 217--250]{Dolotta:1977:DPU}.",
}


bibtype: techreport
filename: unix.bib
label: Perez:1976:USC
author: C. D. Perez and T. M. Raleigh
title: UNIX System Call Measurements
type: Technical Memorandum
number: 1113 (MF 76-8234-79)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 16
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: C. D. Perez and T. M. Raleigh
rawtitle: {UNIX} System Call Measurements
abstract:
This memorandum is the first of a series which will deal with fundamental measurements of the UNIX operating system on the PDP-11 line of computers.par A description is given of system calls and some of their basic measurements.

rawabstract:
This memorandum is the first of a series which will deal with fundamental measurements of the UNIX operating system on the PDP-11 line of computers.\par A description is given of system calls and some of their basic measurements.

entry:
@TechReport{Perez:1976:USC,
  author =       "C. D. Perez and T. M. Raleigh",
  title =        "{UNIX} System Call Measurements",
  type =         "Technical Memorandum",
  number =       "1113 (MF 76-8234-79)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "16",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum is the first of a series which will
                 deal with fundamental measurements of the UNIX
                 operating system on the PDP-11 line of computers.\par

                 A description is given of system calls and some of
                 their basic measurements.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Raleigh:1976:DPA
author: T. M. Raleigh
title: DEAD --- a Program For Analyzing UNIX System Crashes
type: Technical Memorandum
number: 1093 (MF 76-8234-30)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 30
month: apr
monthnumber: 4
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: DEAD is a program for quickly summarizing the state of a crashed UNIX System ldots
acknowledgement: ack-nhfb
rawabstract: DEAD is a program for quickly summarizing the state of a crashed UNIX System \ldots{}
rawauthor: T. M. Raleigh
rawtitle: {DEAD} --- a Program For Analyzing {UNIX} System Crashes
entry:
@TechReport{Raleigh:1976:DPA,
  author =       "T. M. Raleigh",
  title =        "{DEAD} --- a Program For Analyzing {UNIX} System
                 Crashes",
  type =         "Technical Memorandum",
  number =       "1093 (MF 76-8234-30)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "30",
  month =        apr,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "DEAD is a program for quickly summarizing the state of
                 a crashed UNIX System \ldots{}",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Raleigh:1976:SSU
author: T. M. Raleigh
title: Scheduling and Switching Under UNIX Algorithms and Implementation
type: Technical Memorandum
number: 1126 (TM 76-8234-18)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 1
month: oct
monthnumber: 10
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: T. M. Raleigh
rawtitle: Scheduling and Switching Under {UNIX} Algorithms and Implementation
abstract:
This memorandum is the second of two intended to provide documentation for the Scheduler and Switcher under UNIX OS (USG). A number of changes made by UNIX Research are discussed as a guide to what improvements may be made to the standard system.

rawabstract:
This memorandum is the second of two intended to provide documentation for the Scheduler and Switcher under UNIX OS (USG). A number of changes made by UNIX Research are discussed as a guide to what improvements may be made to the standard system.

entry:
@TechReport{Raleigh:1976:SSU,
  author =       "T. M. Raleigh",
  title =        "Scheduling and Switching Under {UNIX} Algorithms and
                 Implementation",
  type =         "Technical Memorandum",
  number =       "1126 (TM 76-8234-18)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "1",
  month =        oct,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum is the second of two intended to
                 provide documentation for the Scheduler and Switcher
                 under UNIX OS (USG). A number of changes made by UNIX
                 Research are discussed as a guide to what improvements
                 may be made to the standard system.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Raleigh:1976:TPC
author: T. M. Raleigh
title: TCMP --- a Program For Comparing Program Text After A System Crash
type: Technical Memorandum
number: 1092 (MF 76-8234-29)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 27
month: apr
monthnumber: 4
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: T. M. Raleigh
rawtitle: {TCMP} --- a Program For Comparing Program Text After A System Crash
abstract:
TCMP is a program which compares the original text (instructions) of a ldots program in a system crash dump.

rawabstract:
TCMP is a program which compares the original text (instructions) of a \ldots{} program in a system crash dump.

entry:
@TechReport{Raleigh:1976:TPC,
  author =       "T. M. Raleigh",
  title =        "{TCMP} --- a Program For Comparing Program Text After
                 A System Crash",
  type =         "Technical Memorandum",
  number =       "1092 (MF 76-8234-29)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "27",
  month =        apr,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "TCMP is a program which compares the original text
                 (instructions) of a \ldots{} program in a system crash
                 dump.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Sabsevitz:1976:GIR
author: A. L. Sabsevitz
title: Guide to IBM Remote Job Entry for PWB / UNIX Users
type: Technical Memorandum
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 7 + 2
year: 1976
bibdate: Sat Jun 10 15:44:58 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.10 15:44:58 ???
remark: Available in PDF file of cite [pp. 183--192]Dolotta:1977:DPU.
acknowledgement: ack-nhfb
rawauthor: A. L. Sabsevitz
rawtitle: Guide to {IBM Remote Job Entry} for {PWB\slash UNIX} Users
entry:
@TechReport{Sabsevitz:1976:GIR,
  author =       "A. L. Sabsevitz",
  title =        "Guide to {IBM Remote Job Entry} for {PWB\slash UNIX}
                 Users",
  type =         "Technical Memorandum",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "7 + 2",
  year =         "1976",
  bibdate =      "Sat Jun 10 15:44:58 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  acknowledgement = ack-nhfb,
  remark =       "Available in PDF file of \cite[pp.
                 183--192]{Dolotta:1977:DPU}.",
}


bibtype: techreport
filename: unix.bib
label: Sabsevitz:1976:REM
author: A. L. Sabsevitz
title: A Regular Expression Matcher For The C Language
type: Technical Memorandum
number: 1101 (TM 76-9141-5)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 2
month: jun
monthnumber: 6
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibtimestamp: 2023.06.06 08:07:45 ???
acknowledgement: ack-nhfb
rawauthor: A. L. Sabsevitz
rawtitle: A Regular Expression Matcher For The {C} Language
bibsource:
https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib

abstract:
This memorandum describes a primitive regular expression matching facility written for language C. Routines have been provided to compile regular expressions and to apply such compiled expressions to string subjects.

rawabstract:
This memorandum describes a primitive regular expression matching facility written for language C. Routines have been provided to compile regular expressions and to apply such compiled expressions to string subjects.

entry:
@TechReport{Sabsevitz:1976:REM,
  author =       "A. L. Sabsevitz",
  title =        "A Regular Expression Matcher For The {C} Language",
  type =         "Technical Memorandum",
  number =       "1101 (TM 76-9141-5)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "2",
  month =        jun,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/string-matching.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memorandum describes a primitive regular
                 expression matching facility written for language C.
                 Routines have been provided to compile regular
                 expressions and to apply such compiled expressions to
                 string subjects.",
  acknowledgement = ack-nhfb,
}


bibtype: techreport
filename: unix.bib
label: Schryer:1976:NST
author: Norman L. Schryer
title: Numerical Solution of Time-Varying Partial Differential Equations in One Space Variable
type: Computing Science Technical Report
number: 53
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: ii + 44
day: 19
month: sep
monthnumber: 9
year: 1976
bibdate: Fri Aug 25 15:53:20 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/fortran1.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.25 15:53:20 ???
acknowledgement: ack-nhfb
authordates: Norman Loren Schryer (1943--30 December 2016)
rawauthor: Norman L. Schryer
rawtitle: Numerical Solution of Time-Varying Partial Differential Equations in One Space Variable
abstract:
An algorithm is presented for the numerical solution of time-varying partial differential equations in one space dimension. The technique used is a combination of par Spatial discretization by Galerkin's method, using B-splines, and par Solution in time by a variable order, variable time-step extrapolation procedure.par The algorithm is capable of dealing with coupled systems of partial differential equations, those depending on both time and space, and ordinary differential equations, those depending only on time. Also, non-local conditions may be imposed on the solution, such as making it periodic in space, or specifying its spatial integral as a known function of time.par A preliminary implementation of the algorithm in portable FORTRAN, called POST (Partial and Ordinary differential equations in Space and Time), is described. The package is especially easy to use since only the spatial mesh, and the accuracy desired in the solution of the equations in time, need to be specified. The time evolution is then automatically carried out to achieve the desired accuracy at the least possible cost. A user's guide to POST is given along with several examples.

rawabstract:
An algorithm is presented for the numerical solution of time-varying partial differential equations in one space dimension. The technique used is a combination of \par Spatial discretization by Galerkin's method, using B-splines, and \par Solution in time by a variable order, variable time-step extrapolation procedure.\par The algorithm is capable of dealing with coupled systems of partial differential equations, those depending on both time and space, and ordinary differential equations, those depending only on time. Also, non-local conditions may be imposed on the solution, such as making it periodic in space, or specifying its spatial integral as a known function of time.\par A preliminary implementation of the algorithm in portable FORTRAN, called POST (Partial and Ordinary differential equations in Space and Time), is described. The package is especially easy to use since only the spatial mesh, and the accuracy desired in the solution of the equations in time, need to be specified. The time evolution is then automatically carried out to achieve the desired accuracy at the least possible cost. A user's guide to POST is given along with several examples.

entry:
@TechReport{Schryer:1976:NST,
  author =       "Norman L. Schryer",
  title =        "Numerical Solution of Time-Varying Partial
                 Differential Equations in One Space Variable",
  type =         "Computing Science Technical Report",
  number =       "53",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "ii + 44",
  day =          "19",
  month =        sep,
  year =         "1976",
  bibdate =      "Fri Aug 25 15:53:20 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/fortran1.bib;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "An algorithm is presented for the numerical solution
                 of time-varying partial differential equations in one
                 space dimension. The technique used is a combination of
                 \par

                 Spatial discretization by Galerkin's method, using
                 B-splines, and \par

                 Solution in time by a variable order, variable
                 time-step extrapolation procedure.\par

                 The algorithm is capable of dealing with coupled
                 systems of partial differential equations, those
                 depending on both time and space, and ordinary
                 differential equations, those depending only on time.
                 Also, non-local conditions may be imposed on the
                 solution, such as making it periodic in space, or
                 specifying its spatial integral as a known function of
                 time.\par

                 A preliminary implementation of the algorithm in
                 portable FORTRAN, called POST (Partial and Ordinary
                 differential equations in Space and Time), is
                 described. The package is especially easy to use since
                 only the spatial mesh, and the accuracy desired in the
                 solution of the equations in time, need to be
                 specified. The time evolution is then automatically
                 carried out to achieve the desired accuracy at the
                 least possible cost. A user's guide to POST is given
                 along with several examples.",
  acknowledgement = ack-nhfb,
  author-dates = "Norman Loren Schryer (1943--30 December 2016)",
}


bibtype: techreport
filename: unix.bib
label: Schryer:1976:TGM
author: Norman L. Schryer
title: A Tutorial on Galerkin's Method, using on B-splines, for Solving Differential Equations
type: Computing Science Technical Report
number: 52
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: ii + 36
day: 17
month: sep
monthnumber: 9
year: 1976
bibdate: Fri Aug 25 15:53:20 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.08.25 15:53:20 ???
acknowledgement: ack-nhfb
authordates: Norman Loren Schryer (1943--30 December 2016)
rawauthor: Norman L. Schryer
rawtitle: A Tutorial on {Galerkin}'s Method, using on {B}-splines, for Solving Differential Equations
abstract:
This note is a tutorial description of Galerkin's method, and its implementation using B-splines, for solving linear one-dimensional self-adjoint boundary value problems. The emphasis is on motivating and making clear what Galerkin's method is, what it does, what it is useful for and what must be done to produce a practical program for implementing it. The generalization of Galerkin's method to other equations, including nonlinear and non-self-adjoint equations, is discussed and motivated.par Galerkin's method with B-splines allows approximation of the solution of the equation to within $ O(h^k) $, where $h$ is the mesh spacing used and $ k geq 2$, the order of the B-spline, is any integer the user desires. For most problems, the `optimal' order $k$ is between 4 and 6. This higher order rate of convergence makes Galerkin's method faster and much cheaper to use than finite differences.par An automatic and reliable error estimation scheme is presented for use with Galerkin's method using B-splines. Several sample problems are then solved and the numerical results discussed.

rawabstract:
This note is a tutorial description of Galerkin's method, and its implementation using B-splines, for solving linear one-dimensional self-adjoint boundary value problems. The emphasis is on motivating and making clear what Galerkin's method is, what it does, what it is useful for and what must be done to produce a practical program for implementing it. The generalization of Galerkin's method to other equations, including nonlinear and non-self-adjoint equations, is discussed and motivated.\par Galerkin's method with B-splines allows approximation of the solution of the equation to within $ O(h^k) $, where $h$ is the mesh spacing used and $ k \geq 2$, the order of the B-spline, is any integer the user desires. For most problems, the `optimal' order $k$ is between 4 and 6. This higher order rate of convergence makes Galerkin's method faster and much cheaper to use than finite differences.\par An automatic and reliable error estimation scheme is presented for use with Galerkin's method using B-splines. Several sample problems are then solved and the numerical results discussed.

entry:
@TechReport{Schryer:1976:TGM,
  author =       "Norman L. Schryer",
  title =        "A Tutorial on {Galerkin}'s Method, using on
                 {B}-splines, for Solving Differential Equations",
  type =         "Computing Science Technical Report",
  number =       "52",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "ii + 36",
  day =          "17",
  month =        sep,
  year =         "1976",
  bibdate =      "Fri Aug 25 15:53:20 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This note is a tutorial description of Galerkin's
                 method, and its implementation using B-splines, for
                 solving linear one-dimensional self-adjoint boundary
                 value problems. The emphasis is on motivating and
                 making clear what Galerkin's method is, what it does,
                 what it is useful for and what must be done to produce
                 a practical program for implementing it. The
                 generalization of Galerkin's method to other equations,
                 including nonlinear and non-self-adjoint equations, is
                 discussed and motivated.\par

                 Galerkin's method with B-splines allows approximation
                 of the solution of the equation to within $ O(h^k) $,
                 where $h$ is the mesh spacing used and $ k \geq 2$, the
                 order of the B-spline, is any integer the user desires.
                 For most problems, the `optimal' order $k$ is between 4
                 and 6. This higher order rate of convergence makes
                 Galerkin's method faster and much cheaper to use than
                 finite differences.\par

                 An automatic and reliable error estimation scheme is
                 presented for use with Galerkin's method using
                 B-splines. Several sample problems are then solved and
                 the numerical results discussed.",
  acknowledgement = ack-nhfb,
  author-dates = "Norman Loren Schryer (1943--30 December 2016)",
}


bibtype: techreport
filename: unix.bib
label: Scrocca:1976:NGS
author: Carmela Scrocca
title: New Graphic Symbols For EQN And NEQN (T.8)
type: Technical Memorandum
number: 1112 (TM 76-7133-1)
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
pages: 2 + 8
day: 15
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
remark: Available in PDF file of cite [pp. 371--380]Dolotta:1977:DPU.
acknowledgement: ack-nhfb
rawauthor: Carmela Scrocca
rawtitle: New Graphic Symbols For {EQN} And {NEQN} ({T.8})
abstract:
There is now available on UNIX and GCOS a set of special characters frequently used in technical typing. In the past, authors have sometimes written out these symbols in English; others just assumed their secretary or typist had these symbols ready and waiting. These characters, however, are not part of the standard terminal or typesetter character sets, but are built-up of those already available. They can presently be produced for phototypesetter output by using EQN/TROFF; NEQN/NROFF can be used for computer terminal output.par This document displays these characters, shows how to use them, and discusses what is involved in making a special character.

rawabstract:
There is now available on UNIX and GCOS a set of special characters frequently used in technical typing. In the past, authors have sometimes written out these symbols in English; others just assumed their secretary or typist had these symbols ready and waiting. These characters, however, are not part of the standard terminal or typesetter character sets, but are built-up of those already available. They can presently be produced for phototypesetter output by using EQN/TROFF; NEQN/NROFF can be used for computer terminal output.\par This document displays these characters, shows how to use them, and discusses what is involved in making a special character.

entry:
@TechReport{Scrocca:1976:NGS,
  author =       "Carmela Scrocca",
  title =        "New Graphic Symbols For {EQN} And {NEQN} ({T.8})",
  type =         "Technical Memorandum",
  number =       "1112 (TM 76-7133-1)",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "2 + 8",
  day =          "15",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "There is now available on UNIX and GCOS a set of
                 special characters frequently used in technical typing.
                 In the past, authors have sometimes written out these
                 symbols in English; others just assumed their secretary
                 or typist had these symbols ready and waiting. These
                 characters, however, are not part of the standard
                 terminal or typesetter character sets, but are built-up
                 of those already available. They can presently be
                 produced for phototypesetter output by using EQN/TROFF;
                 NEQN/NROFF can be used for computer terminal
                 output.\par

                 This document displays these characters, shows how to
                 use them, and discusses what is involved in making a
                 special character.",
  abstract-2 =   "This document displays a set of special characters
                 frequently used in technical typing. It shows how to
                 use them and discusses what is involved in making a
                 special character.",
  acknowledgement = ack-nhfb,
  remark =       "Available in PDF file of \cite[pp.
                 371--380]{Dolotta:1977:DPU}.",
}


bibtype: techreport
filename: unix.bib
label: Smith:1976:NTF
author: D. W. Smith
title: NROFF / TROFF Formatting Codes For Departmental Organization Directories On PWB / UNIX
type: Technical Memorandum
number: 1115
institution: inst-ATT-BELL
address: inst-ATT-BELL:adr
day: 1
month: sep
monthnumber: 9
year: 1976
bibdate: Tue Jun 06 08:07:45 2023
bibsource: https://www.math.utah.edu/pub/tex/bib/unix.bib
bibtimestamp: 2023.06.06 08:07:45 ???
abstract: This memo describes a PWB/UNIX documentation facility for departmental directories.
acknowledgement: ack-nhfb
rawabstract: This memo describes a PWB/UNIX documentation facility for departmental directories.
rawauthor: D. W. Smith
rawtitle: {NROFF\slash TROFF} Formatting Codes For Departmental Organization Directories On {PWB\slash UNIX}
entry:
@TechReport{Smith:1976:NTF,
  author =       "D. W. Smith",
  title =        "{NROFF\slash TROFF} Formatting Codes For Departmental
                 Organization Directories On {PWB\slash UNIX}",
  type =         "Technical Memorandum",
  number =       "1115",
  institution =  inst-ATT-BELL,
  address =      inst-ATT-BELL:adr,
  pages =        "??",
  day =          "1",
  month =        sep,
  year =         "1976",
  bibdate =      "Tue Jun 06 08:07:45 2023",
  bibsource =    "https://www.math.utah.edu/pub/tex/bib/unix.bib",
  abstract =     "This memo describes a PWB/UNIX documentation facility
                 for departmental directories.",
  acknowledgement = ack-nhfb,
}


bibtype: article
filename: unix.bib
label: Stonebraker:1976:DII
author: Michael Stonebraker and Eugene Wong and Peter Kreps and Gerald Held
title: The Design and Implementation of INGRES
journal: j-TODS
volume: 1
number: 3
pages: 189--222
month: sep
monthnumber: 9
year: 1976
CODEN: ATDSD3
ISSN: 0362-5915 (print), 1557-4644 (electronic) OR 03625915 (print), 15574644 (electronic)
ISSNL: 0362-5915 OR 03625915
bibdate: Sat Apr 14 10:34:48 MDT 2001
bibtimestamp: 2001.04.14 10:34:48 MDT
fjournal: ACM Transactions on Database Systems
acknowledgement: ack-nhfb
journalURL: http://portal.acm.org/browse_dl.cfm?idx=J777
rawauthor: Michael Stonebraker and Eugene Wong and Peter Kreps and Gerald Held
rawtitle: The Design and Implementation of {INGRES}
bibsource:
Database/Graefe.bib; Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/unix.bib; Parallel/Multi.bib

note:
Reprinted in cite Stonebraker:1988:RDS. Also published in/as: UCB, Elec. Res. Lab, Memo No. ERL-M577, Jan. 1976.

URL:
http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p189-stonebraker/p189-stonebraker.pdf; http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p189-stonebraker/

abstract:
The currently operational (March 1976) version of the INGRES database management system is described. This multiuser system gives a relational view of data, supports two high level nonprocedural data sublanguages, and runs as a collection of user processes on top of the UNIX operating system for Digital Equipment Corporation PDP 11/40, 11/45, and 11/70 computers. Emphasis is on the design decisions and tradeoffs related to (1) structuring the system into processes, (2) embedding one command language in a general purpose programming language, (3) the algorithms implemented to process interactions, (4) the access methods implemented, (5) the concurrency and recovery control currently provided, and (6) the data structures used for system catalogs and the role of the database administrator.par Also discussed are (1) support for integrity constraints (which is only partly operational), (2) the not yet supported features concerning views and protection, and (3) future plans concerning the system.

keywords:
concurrency; data integrity; data organization; data sublanguage; database optimization; nonprocedural language; protection; QUEL EQUEL query modification process structure Halloween problem TODS; query decomposition; query language; relational database

subject:
Information Systems --- Database Management --- Systems (H.2.4): bf Relational databases; Information Systems --- Database Management --- Languages (H.2.3); Information Systems --- Database Management --- General (H.2.0): bf Security, integrity, and protection**

annote:
Describes implementation of INGRES, a non-distributed relational database system. This paper is useful for understanding the distributed INGRES paper.

rawabstract:
The currently operational (March 1976) version of the INGRES database management system is described. This multiuser system gives a relational view of data, supports two high level nonprocedural data sublanguages, and runs as a collection of user processes on top of the UNIX operating system for Digital Equipment Corporation PDP 11/40, 11/45, and 11/70 computers. Emphasis is on the design decisions and tradeoffs related to (1) structuring the system into processes, (2) embedding one command language in a general purpose programming language, (3) the algorithms implemented to process interactions, (4) the access methods implemented, (5) the concurrency and recovery control currently provided, and (6) the data structures used for system catalogs and the role of the database administrator.\par Also discussed are (1) support for integrity constraints (which is only partly operational), (2) the not yet supported features concerning views and protection, and (3) future plans concerning the system.

rawnote:
Reprinted in \cite{Stonebraker:1988:RDS}. Also published in/as: UCB, Elec. Res. Lab, Memo No. ERL-M577, Jan. 1976.

entry:
@Article{Stonebraker:1976:DII,
  author =       "Michael Stonebraker and Eugene Wong and Peter Kreps
                 and Gerald Held",
  title =        "The Design and Implementation of {INGRES}",
  journal =      j-TODS,
  volume =       "1",
  number =       "3",
  pages =        "189--222",
  month =        sep,
  year =         "1976",
  CODEN =        "ATDSD3",
  ISSN =         "0362-5915 (print), 1557-4644 (electronic)",
  ISSN-L =       "0362-5915",
  bibdate =      "Sat Apr 14 10:34:48 MDT 2001",
  bibsource =    "Database/Graefe.bib; Database/Wiederhold.bib;
                 http://www.acm.org/pubs/toc/;
                 https://www.math.utah.edu/pub/tex/bib/unix.bib;
                 Parallel/Multi.bib",
  note =         "Reprinted in \cite{Stonebraker:1988:RDS}. Also
                 published in/as: UCB, Elec. Res. Lab, Memo No.
                 ERL-M577, Jan. 1976.",
  URL =          "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p189-stonebraker/p189-stonebraker.pdf;
                 http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p189-stonebraker/",
  abstract =     "The currently operational (March 1976) version of the
                 INGRES database management system is described. This
                 multiuser system gives a relational view of data,
                 supports two high level nonprocedural data
                 sublanguages, and runs as a collection of user
                 processes on top of the UNIX operating system for
                 Digital Equipment Corporation PDP 11/40, 11/45, and
                 11/70 computers. Emphasis is on the design decisions
                 and tradeoffs related to (1) structuring the system
                 into processes, (2) embedding one command language in a
                 general purpose programming language, (3) the
                 algorithms implemented to process interactions, (4) the
                 access methods implemented, (5) the concurrency and
                 recovery control currently provided, and (6) the data
                 structures used for system catalogs and the role of the
                 database administrator.\par

                 Also discussed are (1) support for integrity
                 constraints (which is only partly operational), (2) the
                 not yet supported features concerning views and
                 protection, and (3) future plans concerning the
                 system.",
  acknowledgement = ack-nhfb,
  annote =       "Describes implementation of INGRES, a non-distributed
                 relational database system. This paper is useful for
                 understanding the distributed INGRES paper.",
  fjournal =     "ACM Transactions on Database Systems",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J777",
  keywords =     "concurrency; data integrity; data organization; data
                 sublanguage; database optimization; nonprocedural
                 language; protection; QUEL EQUEL query modification
                 process structure Halloween problem TODS; query
                 decomposition; query language; relational database",
  subject =      "Information Systems --- Database Management ---
                 Systems (H.2.4): {\bf Relational databases};
                 Information Systems --- Database Management ---
                 Languages (H.2.3); Information Systems --- Database
                 Management --- General (H.2.0): {\bf Security,
                 integrity, and protection**}",
}


