James B. Saxe

According to our database1, James B. Saxe authored at least 25 papers between 1979 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
PLDI 2002: Extended static checking for Java.
ACM SIGPLAN Notices, 2013

2005
Generating error traces from verification-condition counterexamples.
Sci. Comput. Program., 2005

Simplify: a theorem prover for program checking.
J. ACM, 2005

2003
Theorem Proving Using Lazy Proof Explication.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
Extended Static Checking for Java.
Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2002

2001
Avoiding exponential explosion: generating compact verification conditions.
Proceedings of the Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2001

2000
Induction in Compositional Model Checking.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Checking Java Programs via Guarded Commands.
Proceedings of the Object-Oriented Technology, ECOOP'99 Workshop Reader, 1999

1993
High Speed Switch Scheduling for Local Area Networks.
ACM Trans. Comput. Syst., 1993

Using Transformations and Verification in Circuit Design.
Formal Methods Syst. Des., 1993

Finding Extrema with Unary Predicates.
Algorithmica, 1993

1992
Using Transformations and Verification in Ciruit Design.
Proceedings of the Designing Correct Circuits, 1992

1991
Retiming Synchronous Circuitry.
Algorithmica, 1991

1989
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
Discret. Comput. Geom., 1989

1988
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.
J. Algorithms, 1988

1984
Parity, Circuits, and the Polynomial-Time Hierarchy.
Math. Syst. Theory, 1984

1983
Spelling Correction in User Interfaces.
Commun. ACM, 1983

1981
Optimizing Synchronous Systems
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Generating Sorted Lists of Random Numbers.
ACM Trans. Math. Softw., 1980

A general method for solving divide-and-conquer recurrences.
SIGACT News, 1980

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time.
SIAM J. Algebraic Discret. Methods, 1980

Decomposable Searching Problems I: Static-to-Dynamic Transformation.
J. Algorithms, 1980

1979
Algorithms on vector sets.
SIGACT News, 1979

On the number of range queries in k-space.
Discret. Appl. Math., 1979

Transforming Static Data Structures to Dynamic Structures (Abridged Version)
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979


  Loading...