Inductive assertion method for logic pograms

DOI10.1016/0304-3975(88)90099-0zbMath0648.68019OpenAlexW2118483018MaRDI QIDQ1105352

Włodzimierz Drabent, Jan Małuszyń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

zbMATH Keywords

logic programsPrologbacktrackingpartial correctnessdeclarative semanticsinductive assertion methodOR-parallelism

Mathematics Subject Classification ID

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

Related Items

Correctness and Completeness of Logic Programs, Weakest preconditions for pure Prolog programs, Reasoning about prolog programs: From modes through types to assertions, The Prolog Debugger and Declarative Programming, On definite program answers and least Herbrand models, S-semantics -- an example, A simple correctness proof for magic transformation, Proving completeness of logic programs with the cut, On the verification of finite failure, Norms on terms and their use in proving universal termination of a logic program

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A language of specified programs
• Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
• Some global optimizations for a PROLOG compiler
• Relating logic programs and attribute grammars
• Derivation of Logic Programs
• Contributions to the Theory of Logic Programming
• An axiomatic basis for computer programming