Hardi Hungar. Complexity of Proving Program Correctness. In Takayasu Ito, Albert R. Meyer, editors, Theoretical Aspects of Computer Software, International Conference TACS 91, Sendai, Japan, September 24-27, 1991, Proceedings. Volume 526 of Lecture Notes in Computer Science, pages 459-474, Springer, 1991.
@inproceedings{Hungar91:1,
title = {Complexity of Proving Program Correctness},
author = {Hardi Hungar},
year = {1991},
researchr = {https://researchr.org/publication/Hungar91%3A1},
cites = {0},
citedby = {0},
pages = {459-474},
booktitle = {Theoretical Aspects of Computer Software, International Conference TACS 91, Sendai, Japan, September 24-27, 1991, Proceedings},
editor = {Takayasu Ito and Albert R. Meyer},
volume = {526},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54415-1},
}