J
James B. Saxe
Researcher at Carnegie Mellon University
Publications - 41
Citations - 9029
James B. Saxe is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Automated theorem proving & Retiming. The author has an hindex of 26, co-authored 41 publications receiving 8819 citations. Previous affiliations of James B. Saxe include University of California, Berkeley & Hewlett-Packard.
Papers
More filters
Proceedings ArticleDOI
Extended static checking for Java
TL;DR: The Extended Static Checker for Java (ESC/Java) is introduced, an experimental compile-time program checker that finds common programming errors and provides programmers with a simple annotation language with which programmer design decisions can be expressed formally.
Journal ArticleDOI
High-speed switch scheduling for local-area networks
TL;DR: Issues in the design of a prototype switch for an arbitrary topology point-to-point network with link speeds of up to 1 Gbit/s are described and a technique called statistical matching is described, which can be used to ensure fairness at the switch and to support applications with rapidly changing needs for guaranteed bandwidth.
Journal ArticleDOI
Retiming synchronous circuitry
TL;DR: This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved.
Journal ArticleDOI
Parity, circuits and the polynomial time hierarchy
TL;DR: A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy.
Journal ArticleDOI
Simplify: a theorem prover for program checking
TL;DR: The article describes two techniques, error context reporting and error localization, for helping the user to determine the reason that a false conjecture is false, and includes detailed performance figures on conjectures derived from realistic program-checking problems.