James C. Pleasant
- 1.Dijkstra, E.W., "A Short Introduction to the Art of Programming," Technological Univ. Eindhoven, Rep. EWD316, Aug. 1971.Google Scholar
- 2._____, A _Discipline of Programming, Prentice Hall, Englewood Cliffs, NJ, 1976. Google ScholarDigital Library
- 3.Dromey, R.G., "Systematic Program Development," IEEE Trans. on Software Engineering, vol. 14, pp. 12-29, 1988. Google ScholarDigital Library
- 4.Gries, D., .The Science of Programming, Springer-Verlag, New York, 1981. Google ScholarDigital Library
- 5.Hoare, C.A.R., "An Axiomatic Basis for Computer Programming," Commun. ACM, vol. 12, pp. 576-580, 1969. Google ScholarDigital Library
- 6.Wirth, N., "Program Development by Stepwise Refinement," Commun. ACM, vol. 14, pp. 221- 227, 1971. Google ScholarDigital Library
Recommendations
Approximability and proof complexity
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithmsThis work is concerned with the proof-complexity of certifying that optimization problems do not have good solutions. Specifically we consider bounded-degree "Sum of Squares" (SOS) proofs, a powerful algebraic proof system introduced in 1999 by ...
Small Depth Proof Systems
A proof system for a language L is a function f such that Range(f) is exactly L. In this article, we look at proof systems from a circuit complexity point of view and study proof systems that are computationally very restricted. The restriction we study ...
Comments