Skip to main content
Conference ProceedingsOPEN ACCESS

Verifying design with proof scores

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4171 LNCS 277-290
DOI: 10.1007/978-3-540-69149-5_30
23Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for verifying design, in that they achieve a balance in which the respective capabilities of humans and machines are utilized optimally. © IFIP International Federation for Information Processing 2008.

Cite

CITATION STYLE

APA

Futatsugi, K., Goguen, J. A., & Ogata, K. (2008). Verifying design with proof scores. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4171 LNCS, pp. 277–290). https://doi.org/10.1007/978-3-540-69149-5_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free