Jump to content

Michael A. Harrison

From Wikipedia, the free encyclopedia
Michael A. Harrison
Born
Philadelphia, PA, U.S.A.
Alma materUniversity of Michigan
Known forformal language theory, Harrison-Ruzzo-Ullman model
Scientific career
Thesis Combinatorial Problems in Boolean Algebras and Applications to the Theory of Switching  (1963)
Doctoral advisorHarvey Garner
Doctoral studentsJim Gray, Oscar Ibarra
Websitewww.cs.berkeley.edu/~harrison

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

Biography

[edit]

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][excessive citations]

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]

Personal life

[edit]

Harrison is married to Susan L. Graham, the Pehong Chen Distinguished Professor Emerita in the Computer Science Division of the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley.[21]

References

[edit]
  1. ^ a b 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, S2CID 11825012
  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 (ed.). 4th Symposium on Mathematical Foundations of Computer Science (MFCS). LNCS. Vol. 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. Vol. 24. pp. 61–100. doi:10.1016/s0065-2458(08)60365-4. ISBN 9780120121243.
  16. ^ Pehong Chen; John Coker; Michael A. Harrison; Jeffrey W. McCarrell; Steve Procter (1986). "The VorTeX Document Preparation Environment". In Jacques Désarménien (ed.). 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 (ed.). 2nd Eur. Conf. on TeX for Scientific Documentation. pp. 32–44.
  18. ^ Pehong Chen; Michael A. Harrison (1988). "Index Preparation and Processing". Software: Practice and Experience. 18 (9): 897–915. CiteSeerX 10.1.1.169.9719. doi:10.1002/spe.4380180907. S2CID 14196169.
  19. ^ Pehong Chen; Michael A. Harrison (1988). "Multiple Representation Document Development". IEEE Computer. 21 (1): 15–31. doi:10.1109/2.222114. S2CID 8384587.
  20. ^ Bloomberg Businessweek
  21. ^ Susan L Graham and Helen Meyer Named Co-Chairs of Cal Performances at UC Berkeley
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Michael_A._Harrison&oldid=1222484932"