Skip to main content
Conference ProceedingsOPEN ACCESS

Scalable specification and reasoning: Challenges for program logic

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

This article is free to access.

Abstract

If program verification tools are ever to be used widely, it is essential that they work in a modular fashion. Otherwise, verification will not scale. This paper discusses the scientific challenges that this poses for research in program logic. Some recent work on separation logic is described, and test problems that would be useful in measuring advances on modular reasoning are suggested. © IFIP International Federation for Information Processing 2008.

Cite

CITATION STYLE

APA

O’hearn, P. W. (2008). Scalable specification and reasoning: Challenges for program logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4171 LNCS, pp. 116–133). https://doi.org/10.1007/978-3-540-69149-5_14

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