Reasoning about Prolog programs: From modes through types to assertions-Reference-Cited by-同舟云学术

Reasoning about Prolog programs: From modes through types to assertions

Published:1994-11 Issue:Suppl 1 Volume:6 Page:743-765
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Apt Krzysztof R.¹,Marchiori Elena²

Affiliation:

1. Centrum voor Wiskunde and Computer Science (CWI) and Faculty of Mathematics and Computer Science, University of Amsterdam, The Netherlands

2. CWI, P.O. Box 94079, 1090, GB Amsterdam, The Netherlands

Abstract

Abstract We provide here a systematic comparative study of the relative strength and expressive power of a number of methods for program analysis of Prolog. Among others we show that these methods can be arranged in the following hierarchy: mode analysis ⇒ type analysis ⇒ monotonic properties ⇒ nonmonotonic run-time properties. We also discuss a method allowing us to prove global run-time properties.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01213601.pdf

Reference16 articles.

1. Apt K. R. and Pellegrini A.: On the occur-check free Prolog programs. ACM Toplas 1994. In press.

2. Apt K. R.: Logic programming. In J. van Leeuwen editor Handbook of Theoretical Computer Science pp. 493–574. Elsevier 1990. Vol. B.

3. Bossi A. and Cocco N.: Verifying correctness of logic programs. In Proceedings of Tapsoft '89 pp. 96–110 1989.

4. Bossi A. Cocco N. and Fabris M.: Proving termination of logic programs by exploiting term properties. In Proceedings of Tapsoft '91 pp. 153–180 1991.

Cited by 63 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Equivalence-based Security for Querying Encrypted Databases;Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security;2015-10-12

2. Temporal Mode-Checking for Runtime Monitoring of Privacy Policies;Computer Aided Verification;2014

3. Efficient generation of test data structures using constraint logic programming and program transformation;Journal of Logic and Computation;2013-11-28

4. GEM: A distributed goal evaluation algorithm for trust management;Theory and Practice of Logic Programming;2012-12-03

5. A simple correctness proof for magic transformation;Theory and Practice of Logic Programming;2011-03-04