Michael A. Harrison




































Michael A. Harrison
Born
Philadelphia, PA, U.S.A.
Alma mater
University of Michigan
Known for
formal language theory, Harrison-Ruzzo-Ullman model

Scientific career
Thesis
Combinatorial Problems in Boolean Algebras and Applications to the Theory of Switching (1963)
Doctoral advisor
Harvey Garner
Doctoral students
Jim Gray, Oscar Ibarra

Website
www.cs.berkeley.edu/~harrison

Michael A. Harrison is a computer scientist, in particular a pioneer in the area of formal languages.



Biography


Michael A. Harrison (born in Philadelphia, Pennsylvania, U.S.) studied electrical engineering and computing for BS and MS at the Case Institute of Technology, and then received a PhD from the University of Michigan in Communication Sciences. He was assistant professor from 1963 to 1966 at the University of Michigan, and then joined the faculty of the E.E. Dept at the University of California at Berkeley, where he was an associate professor from 1966 to 1971, and a full professor from 1971 to 1994.[1]


In the 1960s, he worked with Sheila Greibach, Gene Rose, Ed Spanier, and Joe Ullian in a research group formed and led by Seymour Ginsburg, dedicated to formal language theory and the foundations of Computer Science. The work that came out of this group distinguished Computer Science theory from other fields. It also brought the field of formal language theory to bear on programming language research.[2][3][4][5][6][7][8][9][10][11]


In 1975, he developed the HRU security model (named after its authors Harrison, Ruzzo, Ullman), an operating system level computer security model dealing with the integrity of access rights in the system.[12][13][14][15]
With his Ph.D. student Pehong Chen at Berkeley,[16][17][18][19] he founded the "Gain Technology" company (acquired by Sybase in 1992).[20]


Currently, he is professor emeritus and also professor in the graduate school at Berkeley.[1]



References





  1. ^ ab Long Vita at Harrison's Home page


  2. ^ Abiteboul, S.; Hull, R.; Vianu, V. (March 2005), "In memory of Seymour Ginsburg, 1928–2004", ACM SIGMOD Record, 34 (1): 5, doi:10.1145/1058150.1058152.mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}


  3. ^ Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (1967). "One-Way Stack Automata". J. ACM. 14 (2): 389–418. doi:10.1145/321386.321403.


  4. ^ Seymour Ginsburg; Sheila A. Greibach; Michael A. Harrison (1967). "Stack Automata and Compiling". J. ACM. 14 (1): 172–201. doi:10.1145/321371.321385.


  5. ^ Seymour Ginsburg; Michael A. Harrison (1967). "Bracketed Context-Free Languages". J. Comput. Syst. Sci. 1 (1): 1–23. doi:10.1016/s0022-0000(67)80003-5.


  6. ^ Jim Gray; Michael A. Harrison; Oscar H. Ibarra (1967). "Two-Way Pushdown Automata". Information and Control. 11 (1–2): 30–70. doi:10.1016/s0019-9958(67)90369-5.


  7. ^ Hervé Gallaire; Jim Gray; Michael A. Harrison; Gabor T. Herman (1968). "Infinite Linear Sequential Machines". J. Comput. Syst. Sci. 2 (4): 381–419. doi:10.1016/s0022-0000(68)80035-2.


  8. ^ Michael A. Harrison; Oscar H. Ibarra (1968). "Multi-Tape and Multi-Head Pushdown Automata". Information and Control. 13 (5): 433–470. doi:10.1016/s0019-9958(68)90901-7.


  9. ^ Seymour Ginsburg; Michael A. Harrison (1968). "One-Way Nondeterministic Real-Time List-Storage Languages". J. ACM. 15 (3): 428–446. doi:10.1145/321466.321475.


  10. ^ Seymour Ginsburg; Michael A. Harrison (1968). "On the Elimination of Endmarkers". Information and Control. 12 (2): 103–115. doi:10.1016/s0019-9958(68)90221-0.


  11. ^ Seymour Ginsburg; Michael A. Harrison (1970). "On the Closure of AFL under Reversal". Information and Control. 17 (4): 395–409. doi:10.1016/s0019-9958(70)80035-3.


  12. ^ Michael A. Harrison; Walter L. Ruzzo; Jeffrey D. Ullman (1975). "On Protection in Operating System". Proc. 5th Symp. on Operating System Principles (SOSP). pp. 14–24.


  13. ^ Michael A. Harrison (1975). "On Models of Protection in Operating Systems". In Jirí Becvár. 4th Symposium on Mathematical Foundations of Computer Science (MFCS). LNCS. 32. pp. 46–60.


  14. ^ Harrison, Michael A.; Ruzzo, Walter L.; Ullman, Jeffrey D. (August 1976). "Protection in Operating Systems". Communications of the ACM. 19 (8): 461–471. CiteSeerX 10.1.1.106.7226. doi:10.1145/360303.360333.


  15. ^ Michael A. Harrison (1985). "Theoretical Issues Concerning Protection in Operating Systems". Advances in Computers. 24: 61–100. doi:10.1016/s0065-2458(08)60365-4.


  16. ^ Pehong Chen; John Coker; Michael A. Harrison; Jeffrey W. McCarrell; Steve Procter (1986). "The VorTeX Document Preparation Environment". In Jacques Désarménien. 2nd Eur. Conf. on TeX for Scientific Documentation. pp. 45–54.


  17. ^ Pehong Chen; Michael A. Harrison; Jeffrey W. McCarrell; John Coker; Steve Procter (1986). "An Improved User Environment for TeX". In Jacques Désarménien. 2nd Eur. Conf. on TeX for Scientific Documentation. pp. 32–44.


  18. ^ Pehong Chen; Michael A. Harrison (1988). "Index Preparation and Processing". Softw., Pract. Exper. 18 (9): 897–915. doi:10.1002/spe.4380180907.


  19. ^ Pehong Chen; Michael A. Harrison (1988). "Multiple Representation Document Development". IEEE Computer. 21 (1): 15–31. doi:10.1109/2.222114.


  20. ^ Bloomberg Businessweek




External links




  • Michael A. Harrison at the Mathematics Genealogy Project

  • Publication list at acm.org

  • Publication list at dblp.de









-

Popular posts from this blog

Bressuire

Image
Subprefecture and commune in Nouvelle-Aquitaine, France Bressuire Subprefecture and commune Chateau de Bressuire and the Eglise Notre-Dame Coat of arms Location of Bressuire Bressuire Show map of France Bressuire Show map of Nouvelle-Aquitaine Coordinates: 46°50′27″N 0°29′14″W  /  46.8408°N 0.4872°W  / 46.8408; -0.4872 Coordinates: 46°50′27″N 0°29′14″W  /  46.8408°N 0.4872°W  / 46.8408; -0.4872 Country France Region Nouvelle-Aquitaine Department Deux-Sèvres Arrondissement Bressuire Canton Bressuire Government  • Mayor .mw-parser-output .nobold{font-weight:normal} (2014–20) Jean Michel Bernier Area 1 180.59 km 2 (69.73 sq mi) Population (2014) 2 19,300  • Density 110/km 2 (280/sq mi) Time zone UTC+01:00 (CET)  • Summer (DST) UTC+02:00 (CEST) INSEE/Postal code 79049 /79300 Elevation 98–236 m (322–774 ft) (avg. 173 m or 568 ft) 1 French Land Register data, which exclude...
Read more

Vorschmack

Image
Vorschmack Ukrainian Jewish-style vorschmack served on rye bread Course Hors d'oeuvre Region or state Eastern Europe Associated national cuisine Ashkenazi Jewish, Finnish, German, Ukrainian, Polish, Russian Main ingredients Ground meat and/or fish Cookbook: Vorschmack   Media: Vorschmack Vorschmack or forshmak (Yiddish: פֿאָרשמאַק ‎, from archaic German Vorschmack , "foretaste" [1] or "appetizer" [2] ) is an originally East European dish made of salty minced fish or meat. Different variants of this dish are especially common in Ashkenazi Jewish and Finnish cuisine. Some varieties are also known in Russian and Polish cuisine. Contents 1 In Jewish cuisine 2 In Russian cuisine 3 In Polish cuisine 4 In Finnish cuisine 5 See also 6 References In Jewish cuisine According to Gil Marks, the German name points to the possible Germanic origin of this dish. [1] William Pokhlyobkin descr...
Read more

Quarantine

Image
For other uses, see Quarantine (disambiguation). Signal flag "Lima" called the "Yellow Jack" which when flown in harbor means ship is under quarantine. A simple yellow flag (also called the "Yellow Jack") had historically been used to signal quarantine (it stands for Q among signal flags), but now indicates the opposite, as a signal of a ship free of disease that requests boarding and inspection. A quarantine is used to separate and restrict the movement of people; it is 'a restraint upon the activities or communication of persons or the transport of goods designed to prevent the spread of disease or pests', for a certain period of time. [1] This is often used in connection to disease and illness, such as those who may possibly have been exposed to a communicable disease. [2] The term is often erroneously used to mean medical isolation, which is "to separate ill persons who have a communicable disease from those who are healthy...
Read more