Automated verification of Prolog programs

DOI10.1016/S0743-1066(98)10032-8MaRDI QIDQ4700385zbMATH OpenFDO

Authors Baudouin Le Charlier, Christophe Leclère, Sabina Rossi, Agostino Cortesi

Publication date 1 November 1999

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(98)10032-8

zbMATH Keywords

Prolog

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 868104
• Reasoning about prolog programs: From modes through types to assertions
• Automated modular termination proofs for real Prolog programs
• Verification of logic programs
• Analysis of sequential PROLOG programs

Cited in

(8)

• Automated modular termination proofs for real Prolog programs
• Efficient verification of imperative programs using auto2
• Automatic inductive theorem proving using Prolog
• Analysis of sequential PROLOG programs
• A verified prolog compiler for the Warren Abstract Machine
• Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
• The WAM case study: Verifying compiler correctness for Prolog with KIV
• Reasoning about prolog programs: From modes through types to assertions

This page was built for publication: Automated verification of Prolog programs

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