A Novel Derivation Framework For Definite Logic Program

Authors:
MengJun Li;ZhouJun Li;HuoWang Chen;Ti Zhou
Affiliations:
School of Computer Science, National University of Defence Technology, Changsha, China;School of Computer Science and Engineering, BeiHang University, Beijing, China;School of Computer Science, National University of Defence Technology, Changsha, China;School of Computer Science, National University of Defence Technology, Changsha, China
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 9
Cited 0

Abstract interpretation and application to logic programs

Journal of Logic Programming
Fast and precise regular approximations of logic programs

Proceedings of the eleventh international conference on Logic programming
Combinations of abstract domains for logic programming: open product and generic pattern construction

Science of Computer Programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
A dynamic approach to characterizing termination of general logic programs

ACM Transactions on Computational Logic (TOCL)
Sequence-based abstract interpretation of Prolog

Theory and Practice of Logic Programming
Reconstruction of Attacks against Cryptographic Protocols

CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
An abstraction and refinement framework for verifying security protocols based on logic programming

ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Is a closed atom derivable from a definite logic progam? This derivation problem is undecidable. Focused on this problem there exist two categories approaches: the accurate approach that does not guarantee termination, and the terminated abstract approaches. Both approaches have its advantages and disadvantages. We present a novel derivation framework for the definite logic program. A dynamic approach to characterizing termination of fixpoint is presented, then which is used to approximately predict termination of fixpoint in advance. If the fixpoint is predicted termination, we use the non-terminational approach to the derivation problem, otherwise,the terminated abstract approach is used. With this termination predicting approach, we combine the non-termination accurate approaches and the termination abstract approaches together for solving the derivation problem more efficiently. And the experiment results demonstrates the effectiveness of our approach.