2005 |
24 | EE | David Detlefs,
Greg Nelson,
James B. Saxe:
Simplify: a theorem prover for program checking.
J. ACM 52(3): 365-473 (2005) |
23 | EE | K. Rustan M. Leino,
Todd D. Millstein,
James B. Saxe:
Generating error traces from verification-condition counterexamples.
Sci. Comput. Program. 55(1-3): 209-226 (2005) |
2003 |
22 | EE | Cormac Flanagan,
Rajeev Joshi,
Xinming Ou,
James B. Saxe:
Theorem Proving Using Lazy Proof Explication.
CAV 2003: 355-367 |
2002 |
21 | EE | Cormac Flanagan,
K. Rustan M. Leino,
Mark Lillibridge,
Greg Nelson,
James B. Saxe,
Raymie Stata:
Extended Static Checking for Java.
PLDI 2002: 234-245 |
2001 |
20 | EE | Cormac Flanagan,
James B. Saxe:
Avoiding exponential explosion: generating compact verification conditions.
POPL 2001: 193-205 |
2000 |
19 | | Kenneth L. McMillan,
Shaz Qadeer,
James B. Saxe:
Induction in Compositional Model Checking.
CAV 2000: 312-327 |
1999 |
18 | | K. Rustan M. Leino,
James B. Saxe,
Raymie Stata:
Checking Java Programs via Guarded Commands.
ECOOP Workshops 1999: 110-111 |
1993 |
17 | EE | Thomas E. Anderson,
Susan S. Owicki,
James B. Saxe,
Charles P. Thacker:
High Speed Switch Scheduling for Local Area Networks.
ACM Trans. Comput. Syst. 11(4): 319-352 (1993) |
16 | | Feng Gao,
Leonidas J. Guibas,
David G. Kirkpatrick,
William T. Laaser,
James B. Saxe:
Finding Extrema with Unary Predicates.
Algorithmica 9(6): 591-600 (1993) |
15 | | James B. Saxe,
James J. Horning,
John V. Guttag,
Stephen J. Garland:
Using Transformations and Verification in Circuit Design.
Formal Methods in System Design 3(3): 181-209 (1993) |
1992 |
14 | | Thomas E. Anderson,
Susan S. Owicki,
James B. Saxe,
Charles P. Thacker:
High Speed Switch Scheduling for Local Area Networks.
ASPLOS 1992: 98-110 |
13 | | James B. Saxe,
Stephen J. Garland,
John V. Guttag,
James J. Horning:
Using Transformations and Verification in Ciruit Design.
Designing Correct Circuits 1992: 1-25 |
12 | | James B. Saxe,
John V. Guttag,
James J. Horning,
Stephen J. Garland:
Using Transformations and Verification in Circuit Design.
Larch 1992: 201-226 |
1991 |
11 | | Charles E. Leiserson,
James B. Saxe:
Retiming Synchronous Circuitry.
Algorithmica 6(1): 5-35 (1991) |
1989 |
10 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Discrete & Computational Geometry 4: 591-604 (1989) |
1988 |
9 | | Charles E. Leiserson,
James B. Saxe:
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.
J. Algorithms 9(1): 114-128 (1988) |
1987 |
8 | | Alok Aggarwal,
Leonidas J. Guibas,
James B. Saxe,
Peter W. Shor:
A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon
STOC 1987: 39-45 |
1984 |
7 | | Merrick L. Furst,
James B. Saxe,
Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy.
Mathematical Systems Theory 17(1): 13-27 (1984) |
1983 |
6 | | Ivor Durham,
David Alex Lamb,
James B. Saxe:
Spelling Correction in User Interfaces.
Commun. ACM 26(10): 764-773 (1983) |
1981 |
5 | | Charles E. Leiserson,
James B. Saxe:
Optimizing Synchronous Systems
FOCS 1981: 23-36 |
4 | | Merrick L. Furst,
James B. Saxe,
Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy
FOCS 1981: 260-270 |
1980 |
3 | EE | Jon Louis Bentley,
James B. Saxe:
Generating Sorted Lists of Random Numbers.
ACM Trans. Math. Softw. 6(3): 359-364 (1980) |
2 | | Jon Louis Bentley,
James B. Saxe:
Decomposable Searching Problems I: Static-to-Dynamic Transformation.
J. Algorithms 1(4): 301-358 (1980) |
1979 |
1 | | James B. Saxe,
Jon Louis Bentley:
Transforming Static Data Structures to Dynamic Structures (Abridged Version)
FOCS 1979: 148-168 |