Inductive assertion method for logic pograms

DOI10.1016/0304-3975(88)90099-0zbMATH Open0648.68019OpenAlexW2118483018MaRDI QIDQ1105352FDOQ1105352

Authors: Włodzimierz Drabent, Jan Maluszyński 

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90099-0

Recommendations

• scientific article; zbMATH DE number 4037276
• Logic programs as specifications in the inductive verification of logic programs
• Proof methods of declarative properties of definite programs
• scientific article; zbMATH DE number 2085284
• Assertion based inductive verification methods for logic programs

zbMATH Keywords

backtrackingpartial correctnessProloglogic programsdeclarative semanticsinductive assertion methodOR-parallelism

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• An axiomatic basis for computer programming
• Title not available (Why is that?)
• A language of specified programs
• Title not available (Why is that?)
• Contributions to the Theory of Logic Programming
• Relating logic programs and attribute grammars
• Derivation of Logic Programs
• Some global optimizations for a PROLOG compiler
• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Weakest preconditions for pure Prolog programs
• S-semantics -- an example
• Title not available (Why is that?)
• Norms on terms and their use in proving universal termination of a logic program
• Inductive assertions and operational semantics
• On definite program answers and least Herbrand models
• A simple correctness proof for magic transformation
• Reasoning about prolog programs: From modes through types to assertions
• Title not available (Why is that?)
• Proof method of partial correctness and weak completeness for normal logic programs
• Correctness and Completeness of Logic Programs
• Proving completeness of logic programs with the cut
• The Prolog Debugger and Declarative Programming
• On the verification of finite failure

This page was built for publication: Inductive assertion method for logic pograms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1105352)