James Benjamin Saxe is an American computer scientist who has worked for many years at the DEC Systems Research Center[1] and its successors, the Compaq Systems Research Center and the Systems Research Center of HP Labs.
Saxe is known for his highly-cited publications on
automated theorem proving,[DNS]
circuit complexity,[FSS]
retiming in synchronous circuit design,[LS]
computer networks,[AOS]
and static program analysis.[FLL]
His work on program analysis from PLDI 2002 won the Most Influential PLDI Paper Award for 2012.[2]
In addition, he is one of the authors of the master theorem for divide-and-conquer recurrences.[BHS]
While a high school student, Saxe won the United States of America Mathematical Olympiad.[3]
In 1974, as a student at Union College, Saxe took part in the William Lowell Putnam Mathematical Competition; his place in the top five scores earned him a Putnam Fellowship.[4]
He graduated from Union College in 1976,[3],
and earned his Ph.D. in 1985 from Carnegie Mellon University, under the supervision of Jon Bentley.[5]
Selected publications
FSS. | Furst, Merrick; Saxe, James B.; Sipser, Michael (1984), "Parity, circuits, and the polynomial-time hierarchy", Mathematical Systems Theory, 17 (1): 13–27, doi:10.1007/BF01744431, MR 0738749
|
FLL. | Flanagan, Cormac; Leino, K. Rustan M.; Lillibridge, Mark; Nelson, Greg; Saxe, James B.; Stata, Raymie (May 2002), "Extended static checking for Java", Proceedings of PLDI 2002, SIGPLAN Notices, 37: 234–245, doi:10.1145/543552.512558
|