English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Generic System Support for Deductive Program Development

MPS-Authors
/persons/resource/persons44047

Ayari,  Abdelwaheb
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44075

Basin,  David A.
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Ayari, A., & Basin, D. A. (1996). Generic System Support for Deductive Program Development. In T. Margaria, & B. Steffen (Eds.), Second International Workshop, TACAS'96: Tools and Algorithms for the Construction and Analysis of Systems (pp. 313-328). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABDC-E
Abstract
We report on a case study in using logical frameworks to support the formalization of programming calculi and their application to deduction-based program synthesis. Within a conservative extension of higher-order logic implemented in the Isabelle system, we derived rules for program development that can simulate those of the deductive tableau proposed by Manna and Waldinger. We have used the resulting theory to synthesize a library of verified programs, focusing on sorting algorithms. Our experience suggests that the methodology we propose is well suited both to implement and use programming calculi, extend them, partially automate them, and even formally reason about their correctness.