User:DavidGries/sandbox

From Wikipedia, the free encyclopedia

Keshav K Pingali
Alma mater
Known for
Awards
Scientific career
Institutions
Thesis Demand-driven Evaluation on Dataflow Machines  (1986)
Doctoral advisorArvind
Notes
Sri Sathya Sai International Organization (SSSIO)
Formation1965
TypeNon Profit
HeadquartersLos Angeles, USA
Location
Websitewww.sathyasai.org

Pingali Awards and Honors[edit]

Pingali Selected Publications[edit]

  • 2016. X. Sui, A. Lenharth, D. Fussell, and K. Pingali. Proactive control of approximate programs, APLOS '16[8]
  • 2012. D. Prountzos, R. Manevich, and K. Pingali. Elixir: A system for synthesizing parallel graph programs, OOPSLA ’12[9]
  • 2011. K. Pingali et al. The TAO of parallelism in programs, PLDI '11[10]
  • 2009. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Cascaval. How much parallelism is there in irregular applications? PPoPP '2009[11]
  • 2007. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and P. Chew. 2007. Optimistic parallelism requires abstractions. PLDI '07[12]

Caspersen[edit]

Try this: *Person of the ACM[13]

for all. [14]

Susan Rodger

Michael Caspersen

Bob Harper[edit]

infobox:

Robert Harper
Robert Harper in 2006
Born
Robert William Harper, Jr.
Other namesBob Harper
Education
Known for
Awards
  • ACM Fellow, 2005
  • ACM SIGPLAN Most Influential PLDI Paper, 2006
  • LICS Test of Time Award, 2007
  • ACM SIGPLAN Prog Lang Achievement Award, 2021
Scientific career
FieldsComputer science
Institutions
Doctoral students
Websitewww.cs.cmu.edu/~rwh/

Harper Awards[edit]

  • Herbert A. Simon Award for Teaching Excellence in Computer Science, CMU.[16]
  • Allen Newell Award for Research Excellence, CMU.[17] for research on type-directed compilation.[20] (2001)
  • ACM SIGPLAN Most Influential PLDI Paper Award,[21] for the paper TIL: a type-directed optimizing compiler for ML.[22] (2006)
  • LICS Test-of-Time Award Winner,[23] for the paper A Framework for defining logics.[24] (2007)
  • ACM SIGPLAN Programming Languages Achievement Award, for foundational contributions type theory and its use.[25] (2021)

External links[edit]

For Miscellaneouse[edit]

David Gries (born April 26, 1939 in Flushing, Queens, New York) is an American computer scientist at Cornell University, United States, known for his contributions to compiler construction, formal methods in programming methodology and related areas such as semantics and logic, CS education, and algorithms developed during research in these areas (e.g. Misra–Gries heavy hitters algorithm).

He was Associate Dean for Undergraduate Programs in the Cornell University College of Engineering from 2003–2011. His research interests include programming methodology and related areas such as programming languages, related semantics, and logic. His son, Paul Gries, has been a co-author of an introductory textbook to computer programming using the language Python and is a professor teaching Stream in the Department of Computer Science at the University of Toronto.


Gries' 1971 work Compiler Construction for Digital Computers[26] was the first textbook to be published on designing and implementing compilers. It was also one of the first texts to be written and produced using computers, in this case punched cards input to a text-formatting program that ran on an IBM System/360 Model 65;[27] the early technology used resulted in the book having a somewhat dated appearance.[27] The punched cards for the book and formatting program are now in the Stanford Computer History Exhibits.[28] The book sold well and went through more than twenty printings,[28] although over time it would be eclipsed in renown by Aho and Ullman's 1977 text Principles of Compiler Design.[29] Nonetheless, Dutch computer scientist Dick Grune has written of Compiler Construction for Digital Computers that "entire generations of compiler constructors have grown up with it and they have not regretted it."[27]



  • Gries, David (1981). The Science of Programming. Monographs in Computer Science (in English, Spanish, Japanese, Chinese, Italian, and Russian). New York: Springer Verlag. doi:10.1007/978-1-4612-5983-1. S2CID 37034126.


Fix this: https://www.computer.org/profiles/david-gries. Has David L. Gries Owicki-Gries Acta: |doi=10.1007/BF00268134 |s2cid=206773583

Owicki-gries ACM: |s2cid=9099351 |doi=10.1145/360051.360224

s2cid=849342

Algorithms: Heavy hitters, Prime number sieve, Misra & Gries edge coloring algorithm

  • Amity Booker Prize,[30] with Paul Gries (2015)

For Important Pubs in CS#Compilers[edit]

https://en.wikipedia.org/wiki/List_of_important_publications_in_computer_science#Compilers


The Concise Macquarie Dictionary [31] has this entry for boatrace : Colloq: A competition between teams of beer drinkers to see which team can drink its beer the fastest; a drinking competition.

He was named the "Father of Third-Party Software" by mainframezone.com.[32]

start and infobox constable[edit]

Robert L. Constable
Born
Robert Lee Constable

1942
CitizenshipUnited States
Alma mater
Known forNuprl
Scientific career
FieldsComputer Science
InstitutionsCornell University
Doctoral advisorStephen Kleene
Doctoral students

Robert Lee Constable (born 1942) is an American computer scientist. He is a professor of computer science and first and former dean of the Faculty of Computing and Information Science at Cornell University.[34] He is known for his work on connecting computer programs and mathematical proofs, especially the Nuprl system. Prior to Nuprl, he worked on the PL/CV formal system and verifier.[35] Alonzo Church supervised Constable's junior thesis while he was studying in Princeton.[36] Constable received his PhD in 1968 under Stephen Kleene and has supervised over 40 students.[37]

Constable has been a director of the Marktoberdorf Summer School.[38]

Constable Awards[edit]

  • Herbrand Award for Distinguished Contributions to Automated Reasoning, 2014.[39]

CIS at Cornell[edit]

In 1999, Cornell created the Faculty of Computing and Information Science, or FCIS, as a college-level entity with a dean but without the administrative structure of a college. Students and faculty had homes in other colleges; faculty would have joint appointments. For example, in 2002, Computer Science faculty were placed in both Engineering and FCIS.[40] The new FCIS became the umbrella organization for the Program of Computer Graphics and, later, a new Department of Statistical Science. FCIS grew to have more than 50 affiliated faculty, each with a joint appointment in another academic department.[41] In 2020, with a financial commitment made by Ann S Bowers, it became a real college: The Cornell Bowers CIS — College of Computing and Information Science.[42]

FCIS was the vision of Robert Constable. He felt that all parts of Cornell would need help using computing in research and teaching in this new computer age, and that required raising computing to the college level. He proposed this new, innovative way, a "faculty" that was structurally a college —but not a real college— headed by a dean. Constable worked over several years to bring this idea to fruition. He was the founding dean and served two five-year terms. In 2008, when he stepped down as chair, then Provost Biddy Martin attributed both the idea and its implementation to Constable.[43]

A second innovation was a Department of Information Science that would work hand-in-hand with, and not in opposition to, Computer Science —note that IS is in the title FCIS. Constable gave appropriate members of Computer Science the responsibility of developing the new department over the years. Today, in 2024, the IS Department offers majors and minors in all of Cornell's undergrad colleges. Several faculty members are joint with CS and IS.[46]

Jayadev Misra[edit]

Jayadev Misra
Born(1947-10-17)October 17, 1947
India
CitizenshipUS
Alma mater
Known forContributions in formal aspects of distributed and concurrent computing, in particular projects Unity and Orc.
Scientific career
Institutions
ThesisA Study of Strategies for Multistage Testing (1972)
Doctoral advisorHarlan Mills
Website"Jayadev Misra".
Notes


Randy Katz[edit]

For INFO box:

  • ACM Karlstrom Educator Award[55]


FOR AWARD SECTION AND ELSEWHERE


List of programming language people[edit]

A way to put in people with other Wikipedia pages. Work on this:

Manfred Paul


Caspersen Wiehle Chomsky Turing

Rudolph Bayer

Interference freedom[edit]

  • Deriving concurrent programs. 2005-2007. Feijen and van Gasteren[58] show how to use Owiki-Gries to design concurrent programs, but the lack of a theory of progress means that designs are driven only by safety requirements. Dongol, Goldson, Mooij, and Hayes have extended this work to include a "logic of progress" based on Chandy and Misra's language Unity, molded to fit a sequential programming model. Dongel and Goldson[59] describe their logic of progress. Goldson and Dongol[60] show how this logic is used to improve the process of designing programs, using Dekker's algorithm for two processes as an example. Dongol and Mooij[61] present more techniques for deriving programs, using Peterson's mutual exclusion algorithm as one example. Dongol and Mooij[62] show how to reduce the calculational overhead in formal proofs and derivations and derive Dekker's algorithm again, leading to some new and simpler variants of the algorithm. Mooij[63] studies calculational rules for Unity's leads-to relation. Finally, Dongol and Hayes[64] provide a theoretical basis and prove soundness of the process logic.

Andru Awards and honors[edit]

  • 2000. The George M. Sprowls Award for outstanding doctoral research contributions in computer science[65] for the 1999 thesis Mostly Static Decentralized Information Flow Control [66]
  • 2001. Best Paper Award, ACM SOSP'01,[67][69] for the paper Untrusted hosts and confidentiality: secure program partitioning [70]
  • 2007. Best Paper Award, ACM SOSP'07,[67][71] for the paper Secure web applications via automatic partitioning [72]
  • 2009. Most Influential POPL Paper Award,[73] for the 1999 paper JFlow: Practical mostly-static information flow control [74]
  • 2013. Best Paper Award, CIDR 2013[75] for the paper StatusQuo: making familiar abstractions perform using program analysis [76]
  • 2013. PLDI Distinguished Paper Award,[77] for the paper Reconciling exhaustive pattern matching with objects [78]
  • 2015. PLDI Distinguished Paper Award,[79] for the paper Diagnosing type errors with class [80]
  • 2021. Best Paper Award, 42nd IEEE Symp. on Security and Privacy,[81] for the paper Compositional security for reentrant applications [82]

References[edit]

  1. ^ "Keshav K Pingali: ACM-IEEE CS Ken Kennedy Award". ACM. 2023. Retrieved 6 October 2023.
  2. ^ "Keshav Pingali". Academia Europaea, The Academy of Europe. 2020. Retrieved 7 October 2023.
  3. ^ "Keshav K Pingali". IIT Kanpur. 2013. Retrieved 7 October 2023.
  4. ^ "Keshav K Pingali". ACM. 2012. Retrieved 7 October 2023.
  5. ^ "Keshav K Pingali". IEEE Computer Society. 2010. Retrieved 7 October 2023.
  6. ^ "Stephen Russell Family Teaching Awards". Cornell University College of Arts and Sciences. 1998. Archived from the original on 3 June 2023. Retrieved 7 October 2023.
  7. ^ a b c "Cornell Bowers CIS, Computer Science, Awards". Cornell Bowers CIS. 1997. Archived from the original on 2 February 2023. Retrieved 7 October 2023.
  8. ^ X. Sui; A. Lenharth; D. Fussell; K. Pingali. "Proactive control of approximate programs". ACM SIGPLAN Notices. ASPLOS. Vol. 51. Atlanta, Georgia, USA: ACM. pp. 607–621. doi:10.1145/2954679.2872402. Retrieved 11 October 2023.
  9. ^ D. Prountzos; R. Manevich; K. Pingali (19 October 2012). "Elixir: A system for synthesizing parallel graph programs". In Cristina Videira Lopes; Gary T. Leavens (eds.). ACM SIGPLAN Notices: Proc 2012 ACM Intl Conf OOPSLA'12. OOPSLA ’12. Vol. 47. Tucson, AZ, USA: ACM. pp. 375–394. doi:10.1145/2398857.2384644. ISBN 978-1-4503-1561-6. Retrieved 12 October 2023.
  10. ^ K. Pingali; D. Nguyen; M. Kulkarni; and 9 others (4 June 2011). "The TAO of parallelism in programs". ACM SIGPLAN Notices. PLDI '11. Vol. 46. San Jose, CA, USA: ACM. pp. 12–25. doi:10.1145/1993316.1993501. Retrieved 11 October 2023.{{cite conference}}: CS1 maint: numeric names: authors list (link)
  11. ^ M. Kulkarni; M. Burtscher; R. Inkulu; K. Pingali; C. Cascaval (14 February 2009). "How much parallelism is there in irregular applications?". ACM SIGPLAN Notices. PPoPP '2009. Vol. 44. Raleigh, NC, USA: ACM. pp. 3–14. doi:10.1145/1594835.1504181. Retrieved 11 October 2023.
  12. ^ M. Kulkarni; K. Pingali; B. Walter; G. Ramanarayanan; K. Bala; P. Chew (11 June 2007). "Optimistic parallelism requires abstractions". In Jeanne Ferrante (ed.). PLDI '07: Proc 28th ACM SIGPLAN Conf on Programming Language Design and Implementation. PLDI '07. San Diego, CA, USA: ACM. pp. 211–222. doi:10.1145/1250734.1250759. ISBN 978-1-59593-633-2. Retrieved 11 October 2023.
  13. ^ a b "People of ACM - Michael E. Caspersen". ACM. 25 July 2023. Retrieved 25 July 2023.
  14. ^ Michael has been named a "Person of the ACM", and this interview with him provides a wealth of information:[13]
  15. ^ a b c DavidGries/sandbox at the Mathematics Genealogy Project
  16. ^ "SCS Faculty Awards". www.cs.cmu.edu. Archived from the original on 4 April 2002. Retrieved 19 March 2024.
  17. ^ "The Allen Newell Award for Research Excellence - Previous Winners". www.cs.cmu.edu. Archived from the original on 5 February 2024. Retrieved 16 March 2024.
  18. ^ "Compiling with Types" (PDF). www.cs.cmu.edu. Retrieved 16 March 2024.
  19. ^ Harper, R.; Morrisett, G. (January 1995). "Compiling polymorphism with intensional type analysis". POPL '95: Proc 22nd ACM SIGPLAN-SIGACT Symp on Principles of Programming Languages. San Francisco, Cal, USA: ACM. pp. 130–141. doi:10.1145/199448.199475. ISBN 978-0-89791-692-9.
  20. ^ The research for which this award was given resulted in Greg Morrisett's Ph.D. thesis, with Harper as co-advisor,[18] a paper by Morrisett and Harper,[19] and a few other publications.
  21. ^ "Most Influential PLDI Paper Award". www.sigplan.org. Retrieved 16 March 2024.
  22. ^ Tarditi, D.; Morrisett, G.; Cheng, P.; Harper, R.; Lee, P. (May 1996). "TIL: a type-directed optimizing compiler for ML". ACM SIGPLAN Notices. 31 (5): 181–192. doi:10.1145/249069.231414.
  23. ^ "ACM/IEEE Symposium on Logic in Computer Science". Archived from the original on 13 March 2024. Retrieved 16 March 2024.
  24. ^ Harper, R.; Honsell, F.; Plotkin, G.D. (June 1987). "A Framework for defining logics". Proc Second Annual IEEE Symp on Logic in Computer Science (LICS 1987). Ithaca, New York: IEEE Computer Society Press. pp. 194–204.
  25. ^ "Programming Languages Achievement Award". www.sigplan.org. Archived from the original on 8 December 2023. Retrieved 16 March 2024.
  26. ^ Gries, D. (1971). Compiler Construction for Digital Computers (in English, Spanish, Japanese, Chinese, Italian, and Russian). New York: John Wiley and Sons. ISBN 0-471-32776-X.
  27. ^ a b c Grune, Dick (20 May 2010). "Compiler Construction before 1980". dickgrune.com.
  28. ^ a b "David Gries' Compiler book Source". Computer History Exhibits. Stanford University. Retrieved 4 October 2022.
  29. ^ "ACM Turing Award Honors Innovators Who Shaped the Foundations of Programming Language Compilers and Algorithms" (Press release). Association for Computing Machinery. 31 March 2021.
  30. ^ "Awards". Cornell Bowers CIS - Computer Science. Retrieved 8 September 2022.
  31. ^ Arthur Delbridge, ed. (1982). The Concise Macquarie Dictionary. Doubleday Australia Pty. Limited. p. 133. ISBN 0868240567.
  32. ^ Bob Thomas. "Mainframe Hall of Fame: 17 New Members Added". Mainframe Zone. Archived from the original on 27 February 2009.
  33. ^ DavidGries/sandbox at the Mathematics Genealogy Project
  34. ^ Steele, Bill (11 June 2008). "Robert Constable, founding dean of computing and information science, will step down in 2009". Cornell Chronicle. Cornell University.
  35. ^ Constable, Robert L.; Johnson, Scott D. (1979). "A PL/CV Precis". Proceedings of the 6th ACM SIGACT–SIGPLAN symposium on Principles of programming languages (POPL '79). Association for Computing Machinery. pp. 7–20. doi:10.1145/567752.567754.
  36. ^ Constable, Robert L.; Gries, David (21 July 2015). "A Conversation with Robert L. Constable". ecommons.cornell.edu. Retrieved 29 September 2019.
  37. ^ "Robert Lee Constable". Mathematics Genealogy Project. Retrieved 2 September 2015.
  38. ^ "Robert L. Constable". Cornell University. 1997. Retrieved 2 September 2015.
  39. ^ "Herbrand Award for Distinguished Contributions to Automated Reasoning, CADE Conference on Automated Deduction". cadeinc.org. Archived from the original on 20 December 2016. Retrieved 19 March 2024.
  40. ^ "Info Science Unveils New Form". cornell.edu. Archived from the original on 30 October 2020. Retrieved 20 March 2024.
  41. ^ The website for FCIS was archived on the wayback machine in 2004. The main page is [1]. Here is the Dean's page: [2]. Here are pages for Computational Biology [3], Computational Science and Engineering [4], information Science [5], and Joint Programs [6].
  42. ^ "Cornell Bowers CIS: College of Computing and Information Science". cornell.edu. Archived from the original on 19 March 2024. Retrieved 20 March 2024.
  43. ^ "Robert Constable, founding dean of computing and information science, will step down in 2009". cornell.edu. Archived from the original on 8 June 2013. Retrieved 20 March 2024.
  44. ^ "Faculty". cs.cornell.edu. Archived from the original on 7 December 2023. Retrieved 20 March 2024.
  45. ^ "Faculty". infosci.cornell.edu. Archived from the original on 25 December 2023. Retrieved 20 March 2024.
  46. ^ At least four faculty have had joint appointments in Computer Science and Information Science and had leading roles in both departments. In 2023, here is the list of Computer Science faculty[44] and the Information Science faculty.[45]
  47. ^ "IFIP Announces 2023 Awards". IFIP. Archived from the original on 3 November 2023. Retrieved 3 November 2023.
  48. ^ "NAE Website - Dr. Jayadev Misra". NAE. Retrieved 3 November 2023.
  49. ^ "Docteur Honoris Causa ENS-PARIS-SACLAY".
  50. ^ "Two UTCS Faculty Among the Most Highly Cited Researchers | Department of Computer Science". Computer Science Department, UT Austin. Archived from the original on 25 December 2015. Retrieved 3 November 2023.
  51. ^ "ACM Fellows". ACM. Retrieved 3 November 2023.
  52. ^ "IEEE Fellows Directory - Chronological Listing". IEEE. Retrieved 3 November 2023.
  53. ^ "Past Distinguished Alumnus Awardees (DAA)". IIT Kanpur. Retrieved 3 November 2023.
  54. ^ "Members - TAMEST (The Academy of Medicine, Engineering and Science of Texas)". TAMEST. Archived from the original on 18 October 2023. Retrieved 3 November 2023.
  55. ^ "ACM Karl V. Karlstrom Outstanding Educator Award". ACM. 1999. Retrieved 21 December 2022.
  56. ^ "AAA&S Members: Randy H. Katz". AAA&S. 2002. Retrieved 21 December 2022.
  57. ^ "Randy Katz: ACM Fellow". ACM. 1996. Retrieved 21 December 2022.
  58. ^ Cite error: The named reference GasterenFeijen was invoked but never defined (see the help page).
  59. ^ Dongol, Brijesh; Goldson, Doug (2006) [January 12, 2005]. "Extending the theory of Owicki and Gries with a logic of progress". Centre pour la Communication Scientifique Directe (CCSD). arXiv:cs/0512012v3. doi:10.2168/lmcs-2(1:6)2006.
  60. ^ Goldson, Doug; Dongol, Brijesh (January 2005). "Concurrent Program Design in the Extended Theory of Owicki and Gries". In Mike Atkinson; Frank Dehne (eds.). CATS '05: Proc 2005 Australasian Symp on Theory of Computing. Vol. 41. Australian Computer Society, Inc. pp. 41–50.
  61. ^ Dongol, Brijesh; Mooij, Arjan J (July 2006). "Progress in deriving concurrent programs: emphasizing the role of stable guards". In Tarmo Uustalu (ed.). MPC'06: Proc. 8th Int. Conf. on Mathematics of Program Construction. Vol. 41. Kuressaare, Estonia: Springer Verlag, Berlin, Heidelberg. pp. 14–161. doi:10.1007/11783596_11.
  62. ^ Dongol, Brijesh; Mooij, Arjan J (2008). "Streamlining progress-based derivations of concurrent program". Formal Aspects Computing. 20: 141–160. doi:10.1007/s00165-007-0037-4.
  63. ^ Mooij, Arjan J. (November 2007). "Calculating and composing progress properties in terms of the leads-to relation". In Michael Butler; Michael G. Hinchey; María M. Larrondo-Petrie (eds.). ICFEM'07: Proc. Formal Engineering Methods 9th Int. Conf. on Formal Methods and Software Engineering. Boca Raton, Florida: Springer Verlag, Berlin, Heidelberg. pp. 366–386. ISBN 3540766480.
  64. ^ Dongol, Brijesh; Hayes, Ian (April 2007). Trace semantics for the Owicki-Gries theory integrated with the progress logic from UNITY (PDF) (Technical report). University of Queensland. SSE-2007-02.
  65. ^ "Students, professor in EECS receive awards". Massachusetts Institute of Technology. 31 May 2000. Retrieved 12 November 2022.
  66. ^ "Mostly Static Decentralized Information Flow Control" (PDF). Massachusetts Institute of Technology. January 1999. Retrieved 12 November 2022.
  67. ^ a b "Computer Science Awards by recipient". Computer Science, Cornell University. Retrieved 11 November 2022.
  68. ^ "SOSP01: 18th Symposium on Operating System Principles". Banff, Alberta, Canada: ACM. doi:10.1145/502059.502036. Retrieved 11 November 2022.
  69. ^ The message from the program chair on page v of the front matter material of [68] says that Untrusted hosts and confidentiality: secure program partitioning was nominated as an award paper to ACM TOCS. The award is listed on this page
  70. ^ Zdancewic, Steve; Zheng, Lantian; Nystrom, Nathaniel; —. "Untrusted hosts and confidentiality: secure program partitioning" (PDF). SOSP01: 18th Symposium on Operating System Principles. Vol. 35. Banff, Alberta, Canada: ACM. doi:10.1145/502059.502036.
  71. ^ CS paper wins Best Paper Award at SOSP 07, archived from the original on 7 January 2017, retrieved 11 November 2022
  72. ^ Chong, Stephen; Liu, Jed; —; Qi, Xin; Vikram, K.; Zheng, Lantian; Zheng, Xin (December 2007). "Secure web applications via automatic partitioning". ACM SIGOPS Operating Systems Review. Vol. 41. Banff, Alberta, Canada: ACM. doi:10.1145/1323293.1294265. S2CID 665752.
  73. ^ "Most Influential POPL Paper Award". ACM SIGPLAN. Retrieved 11 November 2022.
  74. ^ — (January 1999). "JFlow: Practical mostly-static information flow control". POPL '99: Proc 26th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages. San Antonio, Texas, USA: ACM. pp. 228–241. doi:10.1145/292540.292561.
  75. ^ CIDR 2013, retrieved 11 November 2022
  76. ^ Cheung, Alvin; Arden, Owen; Madden, Sam; Solar-Lezama, Armando; — (6 January 2013). "StatusQuo: making familiar abstractions perform using program analysis" (PDF). CIDR 2013: 6th biennial Conference on Innovative Data Systems Research. Asilomar, California: CIDR. S2CID 736078.
  77. ^ PLDI 2013, ACM SIGPLAN, retrieved 11 November 2022
  78. ^ Isradisaikul, Chinawat; — (June 2013). Reconciling exhaustive pattern matching with objects. PLDI '13: Proc 34th ACM SIGPLAN Conf on Programming Language Design and Implementation. Seattle, Washington: ACM. pp. 343–354. doi:10.1145/2491956.2462194.
  79. ^ "PLDI '015 Distinguished Papers". SIGPLAN. Retrieved 11 November 2022.
  80. ^ Zhang, Danfeng; —; Vytiniotis, Dimitrios; Peyton-Jones, Simon (June 2015). "Diagnosing type errors with class". PLDI '15: Proc. 36th ACM SIGPLAN Conference on Programming Language Design and Implementation. Portland, OR, USA: ACM. pp. 12–21. doi:10.1145/2813885.2738009. ISBN 9781450334686. S2CID 7239786.
  81. ^ Awards, IEEE Computer Society Technical Committee on Security and Privacy, retrieved 11 November 2022
  82. ^ Cecchetti, Ethan; Yao, Siqiu; Ni, Haobin; — (24 May 2021). Compositional security for reentrant applications. Proceedings of the IEEE Symposium on Security and Privacy. San Francisco, Cal: IEEE. ISBN 978-1-7281-8935-2. S2CID 235489070.
Retrieved from "https://en.wikipedia.org/w/index.php?title=User:DavidGries/sandbox&oldid=1214820195"