Foundations of declarative testing in arbitrary logic programming

DOI10.1080/00207169008803872zbMATH Open0699.68023OpenAlexW2034308131MaRDI QIDQ3477937FDOQ3477937

Authors: Song Yuan Yan 

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803872

Recommendations

• Verification from Declarative Specifications Using Logic Programming
• scientific article; zbMATH DE number 1692897
• Declarative debugging of functional logic programs
• scientific article; zbMATH DE number 10085
• scientific article; zbMATH DE number 4157865

zbMATH Keywords

recursion theorylogic programmingDeclarative testing

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Artificial intelligence (68T99) Theory of software (68N99) Computability and recursion theory (03D99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Concolic testing in logic programming
• Declarative testing of logic databases
• Testing logic programs for local stratification
• A testing perspective on algebraic, denotational, and operational semantics

This page was built for publication: Foundations of declarative testing in arbitrary logic programming

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