A logical framework for software proof reuse

Authors:
Joshua E. Caplan;Mehdi T. Harandi
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign;Department of Computer Science, University of Illinois at Urbana-Champaign
Venue:
SSR '95 Proceedings of the 1995 Symposium on Software reusability
Year:
1995

Citing 7
Cited 2

Partial objects in type theory

Partial objects in type theory
Programming in Martin-Lo¨f's type theory: an introduction

Programming in Martin-Lo¨f's type theory: an introduction
Type theory and functional programming

Type theory and functional programming
A framework for defining logics

Journal of the ACM (JACM)
Using typed lambda calculus to implement formal systems on a machine

Journal of Automated Reasoning
Syntactic control of interference

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Syntactic Control of Inference, Part 2

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace

Autonomous Agents and Multi-Agent Systems
Tool Support for Proof Engineering

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a logical framework PR for verification of reusable software components. Within our system, developers can employ the advantages traditionally associated with software reuse to reduce the cost of software verification by reusing abstract proofs and specifications. One can construct an algorithm with parameters, a specification with parameters, and a proof that the algorithm satisfies the specification provided the parameters satisfy certain conditions. Proofs in PRwill themselves contain parameters for subproofs concerning those conditions. In this framework, typing, type checking, and proof checking are decidable.