Aaron R. Bradley, Ph.D.
Affiliations: | 2007 | Stanford University, Palo Alto, CA |
Area:
Computer ScienceGoogle:
"Aaron Bradley"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Bradley AR, Manna Z. (2008) Property-directed incremental invariant generation Formal Aspects of Computing. 20: 379-405 |
| Bradley AR, Manna Z. (2007) Checking safety by inductive generalization of counterexamples to induction Proceedings - Formal Methods in Computer Aided Design, Fmcad 2007. 173-180 |
| Bradley AR, Manna Z. (2007) The calculus of computation: Decision procedures with applications to verification The Calculus of Computation: Decision Procedures With Applications to Verification. 1-366 |
| Bradley AR, Manna Z. (2006) Verification constraint problems with strengthening Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4281: 35-49 |
| Bradley AR, Manna Z, Sipma HB. (2006) What's decidable about arrays? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3855: 427-442 |
| Bradley AR, Manna Z, Sipma HB. (2005) Termination of polynomial programs Lecture Notes in Computer Science. 3385: 113-129 |
| Bradley AR, Manna Z, Sipma HB. (2005) The Polyranking Principle Lecture Notes in Computer Science. 3580: 1349-1361 |
| Bradley AR, Manna Z, Sipma HB. (2005) Linear ranking with reachability Lecture Notes in Computer Science. 3576: 491-504 |
| Bradley AR, Manna Z, Sipma HB. (2005) Termination analysis of integer linear loops Lecture Notes in Computer Science. 3653: 488-502 |