scientific article; zbMATH DE number 3924108

MaRDI QIDQ3698285zbMATH OpenFDO

Authors Nissim Francez, Orna Grumberg, Shmuel Katz, Amir Pnueli

Publication date 1985

zbMATH Keywords

completenessfairnessliveness propertiesparallel programsproof rules for the termination of PROLOG programssemanticssoundness

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Proving termination properties of prolog programs: A semantic approach
• Reasoning about termination of pure Prolog programs
• On modular termination proofs of general logic programs
• Proving termination of general Prolog programs
• scientific article; zbMATH DE number 879005

Cited in

(15)

• Inductive assertion method for logic pograms
• Reasoning about termination of pure Prolog programs
• Norms on terms and their use in proving universal termination of a logic program
• A declarative approach for first-order built-in's of Prolog
• Reasoning about prolog programs: From modes through types to assertions
• A logical semantics for depth-first Prolog with ground negation
• Inference of Termination Conditions for Numerical Loops in Prolog
• scientific article; zbMATH DE number 4176501 (Why is no real title available?)
• Proving properties of committed choice logic programs
• Proving termination properties of prolog programs: A semantic approach
• scientific article; zbMATH DE number 879005 (Why is no real title available?)
• Automated modular termination proofs for real Prolog programs
• Proving termination of general Prolog programs
• Localized operational termination in general logics
• Proof methods of declarative properties of definite programs

This page was built for publication:

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