James B. Saxe

发表

Retiming synchronous circuitry

Charles E. Leiserson, James B. Saxe, J. Saxe, 1988, Algorithmica.

High-speed switch scheduling for local-area networks

Thomas E. Anderson, Susan S. Owicki, Charles P. Thacker, 1993, TOCS.

A linear-time algorithm for computing the voronoi diagram of a convex polygon

Leonidas J. Guibas, Alok Aggarwal, Peter W. Shor, 1989, Discret. Comput. Geom..

Smooth Scheduling in a Cell-Based Switching Network

Thomas L. Rodeheffer, James B. Saxe, 1998 .

Simplify: a theorem prover for program checking

David Detlefs, Greg Nelson, James B. Saxe, 2005, JACM.

On the number of range queries in k-space

James B. Saxe, 1979, Discret. Appl. Math..

Generating error traces from verification-condition counterexamples

Todd D. Millstein, K. Rustan M. Leino, James B. Saxe, 2005, Sci. Comput. Program..

A Mixed-Integer Linear Programming Problem which is Efficiently Solvable

Charles E. Leiserson, James B. Saxe, J. Saxe, 1988, J. Algorithms.

Using transformations and verification in circuit design

Stephen J. Garland, John V. Guttag, James B. Saxe, 1992, Formal Methods Syst. Des..

Finding extrema with unary predicates

Leonidas J. Guibas, David G. Kirkpatrick, Feng Gao, 2005, Algorithmica.

Decomposable Searching Problems I: Static-to-Dynamic Transformation

Jon Louis Bentley, James B. Saxe, J. Saxe, 1980, J. Algorithms.

Transforming static data structures to dynamic structures

Jon Louis Bentley, James B. Saxe, 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time

James B. Saxe, J. Saxe, 1980, SIAM J. Algebraic Discret. Methods.

Avoiding exponential explosion: generating compact verification conditions

Cormac Flanagan, James B. Saxe, J. Saxe, 2001, POPL '01.

High speed switch scheduling for local area networks

Thomas E. Anderson, Susan S. Owicki, Charles P. Thacker, 1992, ASPLOS V.

Optimizing Synchronous Circuitry by Retiming (Preliminary Version)

Charles E. Leiserson, James B. Saxe, Flavio M. Rose, 1983 .

Algorithms on vector sets

Jon Louis Bentley, James B. Saxe, 1979, SIGA.

Extended static checking for Java

Mark Lillibridge, K. Rustan M. Leino, Raymie Stata, 2002, PLDI '02.

Checking Java Programs via Guarded Commands

K. Rustan M. Leino, Raymie Stata, James B. Saxe, 1999, ECOOP Workshops.

Parity, circuits, and the polynomial-time hierarchy

Michael Sipser, Merrick L. Furst, James B. Saxe, 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

Theorem Proving Using Lazy Proof Explication

Xinming Ou, Cormac Flanagan, Rajeev Joshi, 2003, CAV.

Generating Sorted Lists of Random Numbers

Jon Louis Bentley, James B. Saxe, 1980, TOMS.

PLDI 2002: Extended static checking for Java

Mark Lillibridge, K. Rustan M. Leino, Raymie Stata, 2013, SIGP.

Spelling correction in user interfaces

David Alex Lamb, James B. Saxe, Ivor Durham, 1983, CACM.

Optimizing synchronous systems

Charles E. Leiserson, James B. Saxe, J. Saxe, 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

ESC/Java User's Manual

K. Rustan M. Leino, Greg Nelson, James B. Saxe, 2000 .

Parity, circuits, and the polynomial-time hierarchy

Michael Sipser, Merrick L. Furst, James B. Saxe, 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

A linear-time algorithm for computing the voronoi diagram of a convex polygon

Leonidas J. Guibas, Alok Aggarwal, Peter W. Shor, 1987, Discret. Comput. Geom..

Induction in Compositional Model Checking

Kenneth L. McMillan, Shaz Qadeer, James B. Saxe, 2000, CAV.

A Genetic Algorithm based Scheduling of an Input Queued Switch

Mounir Hamdi, Thomas E. Anderson, Rong, 2016 .

From Quadrangular Sets to the Budget Matroids

Lyle Ramshaw, James B. Saxe, J. Saxe, 1995 .