English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Thesis

A Reinterpretation of the Deductive Tableaux System in Higher-Order Logic

MPS-Authors
/persons/resource/persons44047

Ayari,  Abdelwaheb
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. (1995). A Reinterpretation of the Deductive Tableaux System in Higher-Order Logic. Diploma Thesis, Universität des Saarlandes, Saarbrücken.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ACE9-A
Abstract
Our research investigates frameworks supporting the formalization of
programming calculi and their application to deduction-based progr am
synthesis. Here we report on a case study: within a conservative
extension of higher-order logic implemented in the Isabelle system, we
derived rules for program development which 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
in particular 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.