| Books 1 - 10 of 43 | Previous | Next |


 |
 |  | The Calculus of Computation: Decision Procedures with Applications to Verification by Aaron R. Bradley, Zohar Manna Hardcover, 366 Pages, Published 2007 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Special relations in automated deduction (Report / Department of Computer Science, Stanford University) by Zohar Manna Unknown Binding, 63 Pages, Published 1985 by Dept. of Computer Science, Stanford University
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Verification of concurrent programs (Report) by Zohar Manna Unknown Binding, Published 1981 by Dept. of Computer Science, Stanford University
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Fundamentals of deductive program synthesis (Report) by Zohar Manna Unknown Binding, 62 Pages, Published 1992 by Dept. of Computer Science, Stanford University
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Verification of concurrent programs: Proving eventualities by well-founded ranking (Report / Stanford University, Dept. of Computer Science) by Zohar Manna Unknown Binding, 25 Pages, Published 1982 by Stanford University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | The origin of the binary-search paradigm (Report / Department of Computer Science, Stanford University) by Zohar Manna Unknown Binding, 23 Pages, Published 1985 by Department of Computer Science, Stanford University
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Verification of concurrent programs: A temporal proof system by Zohar Manna Unknown Binding, 92 Pages, Published 1983 by Stanford University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Structured programming with recursion (STAN-CS-77-640) by Zohar Manna Unknown Binding, 5 Pages, Published 1978 by Computer Science Dept., Stanford University
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Is " sometime " sometimes better than " always " ?: Intermittent assertions in proving program correctness (Computer Science Department Report no. STAN-CS-76-558) by Zohar Manna Unknown Binding, Published 1977 by Stanford University, Computer Science Department
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | How to clear a block: A theory of plans (Technical note. SRI International) by Zohar Manna Unknown Binding, 39 Pages, Published 1986 by SRI International
Compare Prices | Add to Wish List | Set Price Alert |


 |
| Books 1 - 10 of 43 | Previous | Next |