An incremental approach to abstraction-carrying code

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4246 LNAI, Issue , 2006, Pages 377-391

  Albert, Elvira ^a   Arenas, Puri ^a   Puebla, Germán ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING;

ABSTRACTION-CARRYING CODE (ACC); PROOF-CARRYING CODE (PCC);

CODES (SYMBOLS);

EID: 33845201774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_26     Document Type: Conference Paper

References (18)

1. E. Albert, P. Arenas, and G. Puebla. An Incremental Approach to Abstraction-Carrying Code. Technical Report CLIPS/2006, Technical University of Madrid (UPM), School of Computer Science, UPM, March 2006.
2. E. Albert, P. Arenas, and G. Puebla. Incremental Certificates and Checkers for Abstraction-Carrying Code. In Proc. of WITS 2006, March 2006.
3. E. Albert, P. Arenas, G. Puebla, and M. Hermenegildo. Reduced Certificates for Abstraction-Carrying Code. In Proc. of ICLP 2006, Springer LNCS. To appear.
4. E. Albert, G. Puebla, and M. Hermenegildo. Abstraction-Carrying Code. In Proc. of LPAR'04, Springer LNAI 3452, pp. 380-397, 2005.
5. M. Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. Journal of Logic Programming, 10:91-124, 1991.
6. P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. POPL 1977, ACM, pp.238-252, 1977.
7. M. Hermenegildo, G. Puebla, K. Marriott, and P. Stuckey. Incremental Analysis of Constraint Logic Programs. ACM Transactions on Programming Languages and Systems, 22(2):187-223, March 2000.
8. N.D. Jones, C.K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall, New York, 1993.
9. Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre. Incremental verification by abstraction. In Proc. 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer LNCS 2031, pp. 98-112, 2001.
10. J.W. Lloyd. Foundations of Logic Programming. Springer, second, extended edition, 1987.
11. Kim Marriot and Peter Stuckey. Programming with Constraints: An Introduction. The MIT Press, 1998.
12. K. Marriott and H. Søndergaard. Precise and efficient groundness analysis for logic programs. ACM Letters on Programming Languages and Systems, 2(4):181-196, 1993.
13. G. Necula. Proof-Carrying Code. In Proc. of POPL 1997, pp. 106-119. ACM Press, 1997.
14. G. Puebla and M. Hermenegildo. Optimized Algorithms for the Incremental Analysis of Logic Programs. In Proc. SAS'96, Springer LNCS 1145,pp. 270-284, 1996.
15. B. Ryder. Incremental data-flow analysis algorithms. ACM Transactions on Programming Languages and Systems, 10(1):1-50, 1988.
16. O.V. Sokolsky and S.A. Smolka. Incremental model checking in the modal μ-calculus. In Computer Aided Verification, Proc. 6th International Conference, Springer LNCS 818, pp. 351-363, 1994.
17. Tim A. Wagner and Susan L. Graham. Incremental analysis of real programming languages. In Proc. PLDI'97, pp. 31-43, 1997.
18. M. Wildmoser, A. Chaieb, and T. Nipkow. Bytecode Analysis for Proof Carrying Code. In Proc. Bytecode'05, ENTCS 141, pp. 19-34. Elsevier, 2005.