Correctness of logic programs using proof schemes

Marakakis, Emmanouil; Papadakis, Nikos

doi:10.3233/kes-2012-0242

Cited by 1 publication

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The users of this prover are interested in proving a theorem or updating the KB in order to be able to work with additional theorem proofs. So, they are expected to know very well the correctness method which is supported by this system [12,16].…”

Section: System Interface and Basic Tasksmentioning

confidence: 99%

“…For example, "progr_compl_ID ([progr1, progr2], [[1,2,3,4,5,6, 7], [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]…”

Section: Representation Of Programs and Specificationsmentioning

confidence: 99%

“…Each design schema is associated with a correctness proof scheme which can be followed for the correctness of the constructed program. These proof schemes and the correctness method are presented in [12,16]. In this paper, a simple introduction is made to them.…”

Section: Schemata-based Proof Schemesmentioning

confidence: 99%

“…The Proof schemes corresponding to the design schemas used in the program construction method [11,13] and the correctness method are presented in [12,16].…”

Section: Schemata-based Proof Schemesmentioning

confidence: 99%

See 3 more Smart Citations

A knowledge-based interactive verifier for logic programs

Marakakis

Kondylakis

Papadakis

2014

KES

Self Cite

View full text Add to dashboard Cite

This paper presents an interactive verifier for logic programs. These logic programs are constructed by a schema-based method. Each program is associated with proof schemes due to the program development method. The correctness proof of a program is guided by its associated proof schemes. The main components of the verifier are the prover which carries out the proof steps, the knowledge base (KB) which includes representations of all theories and transformation rules, the KB update which supports the update of KB and the graphical user interface (GUI). The emphasis in the design of this proof checker is on effective guidance of the proof based on the activated proof schemes and on performance by the verifier of tedious, trivial and time consuming tasks. The difficult proof decisions are taken by the user, then, the proof checker applies them. The design of the interface is based on providing the user the required support for the proof of a theorem and for the update of KB. This system is an effective and useful tool for the interactive verification of non-trivial logic programs.

show abstract

Section: System Interface and Basic Tasksmentioning

confidence: 99%

“…For example, "progr_compl_ID ([progr1, progr2], [[1,2,3,4,5,6, 7], [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]…”

Section: Representation Of Programs and Specificationsmentioning

confidence: 99%

Section: Schemata-based Proof Schemesmentioning

confidence: 99%

“…The Proof schemes corresponding to the design schemas used in the program construction method [11,13] and the correctness method are presented in [12,16].…”

Section: Schemata-based Proof Schemesmentioning

confidence: 99%

See 2 more Smart Citations