Twentieth Conference on the
FOUNDATIONS OF SOFTWARE TECHNOLOGY
AND THEORETICAL COMPUTER SCIENCE
December 13-15, 2000, New Delhi, India
| Peter Buneman | (U Penn) |
| Bernard Chazelle | (Princeton) |
| E Allen Emerson | (U Texas, Austin) |
| Martin Grötschel | (ZIB) |
| Jose Meseguer | (SRI) |
| Philip Wadler | (Avaya Labs) |
Peter Buneman is a Professor of Computer and Information Science at the University of Pennsylvania. His degrees are in mathematics from the Universities of Cambridge and Warwick. He has worked on the mathematics of phylogeny, databases and programming languages. His current research includes type systems for database programming languages, theories of partial information, query languages for complex types, and formalisms for semistructured data. He has served on numerous editorial boards and program committees and as program chair for ACM SIGMOD, ICDT and ACM PODS. He is a Fellow of the ACM.
Bernard Chazelle is Professor of Computer Science at Princeton University and a Fellow of the NEC Research Institute. He obtained his PhD from Yale University in 1980. He is an ACM Fellow and a former Guggenheim Fellow. He currently serves on the editorial boards of eight scientific journals. Founder of the Princeton-Area Center for Theory (PACT) and former co-Director of DIMACS, he is also President of the Scientific Council for Computer Science at Ecole Normale Superieure in Paris.
E. Allen Emerson introduced Model Checking --- an automatic method for verifying (finite state) concurrent systems against temporal logic specifications --- as part of his dissertation work at Harvard University in 1981. His present research interests include: limiting state explosion, temporal reasoning, and automata. He serves on the editorial boards of ACM Transactions on Computational Logic, Formal Aspects of Computing, and Formal Methods in Systems Design. Emerson is co-winner of the 1998 ACM Kanellakis Theory and Practice Award for the invention of Symbolic Model Checking. He is presently Bruton Centennial Professor of Computer Sciences at the University of Texas at Austin.
Martin Grötschel studied mathematics and economics in Bochum, obtaining his Ph.D. in 1977 and Habilitation in 1981 at Bonn. From 1982 to 1991, he was Professor at the University of Augsburg (Chair for Applied Mathematics), and since 1991, Professor at the Technical University of Berlin (Department of Mathematics) and Vice President of the Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB). He has won several awards including the Dissertationspreis of the University of Bonn (1978); the 1982 Fulkerson Prize of the American Mathematical Society and the Mathematical Programming Society; the IBM Prize (1984); the 1990 Karl Heinz Beckurts Prize; the George B. Dantzig Prize of the Mathematical Programming Society and the Society of Industrial and Applied Mathematics, in 1991; the Leibniz Prize of the Deutsche Forschungsgemeinschaft (DFG) in 1995; and the 1999 Wissenschaftspreis der Gesellschaft für Operations Research (GOR). In 1995 he became an elected Member of the Berlin-Brandenburgische Akademie der Wissenschaften, in 1998 Honorary Member of the Deutsche Mathematiker-Vereinigung (DMV), and in 1999 Foreign Associate of the National Academy of Engineering, USA. He served as the President of the Deutsche Mathematiker-Vereinigung (DMV) in 1993 - 1994, and is the associate editor of 9 scientific journals.
URL http://www.zib.de/groetschel
Jose Meseguer received the Licentiate and Ph.D. degrees in Mathematics from the University of Zaragoza, Spain, in 1972 and 1975, respectively. After holding teaching and research positions at the universities of Zaragoza and Santiago, Spain, UCLA, IBM T.J. Watson Research Center, and the University of California at Berkeley, he joined SRI International's Computer Science Laboratory in 1980, where he is currently a principal scientist leading the Logic and Specification Group. His current research interest include: formal executable specification and verification; software composition, reflection and meta-programming; object-oriented specification and software architecture; concurrent and distributed computing; logical frameworks and formal interoperability; and logical and semantics foundations of software.
Philip Wadler is a researcher at Avaya Labs. He helped turn monads from a concept in algebraic topology into a way to structure programs in Haskell, and his work on GJ may help turn quantifiers in second-order logic into a feature of the Java programming language. He currently sits on the W3C committee designing a query language for XML. In previous incarnations, he worked and/or studied at Bell Labs, Glasgow, Oxford, CMU, Xerox Parc, and Stanford. He edits the Journal of Functional Programming for Cambridge University Press, and writes a column for SIGPLAN Notices. He was an ACM distinguished lecturer 1989--1993, and has been an invited speaker in Amsterdam, Austin, Boulder, Brest, Gdansk, London, Montreal, New Delhi, New Haven, Portland, Santa Fe, Sydney, and Victoria.