Experiments with Non-Termination Analysis for Java Bytecode

Electronic Notes in Theoretical Computer Science - Tập 253 - Trang 83-96 - 2009
Étienne Payet1
1IREMIA, Université de La Réunion, France

Tài liệu tham khảo

Bol, 1991, An Analysis of Loop Checking Mechanisms for Logic Programs, Theoretical Computer Science, 86, 35, 10.1016/0304-3975(91)90004-L

Cousot, P. and R. Cousot, Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, in: Proc. of the 4th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'77), 1977, pp. 238–252

De Schreye, D., K. Verschaetse and M. Bruynooghe, A Practical Technique for Detecting non-Terminating Queries for a Restricted Class of Horn Clauses, using Directed, Weighted Graphs, in: Proc. of ICLP'90 (1990), pp. 649–663

Giesl, 2005, Proving and Disproving Termination of Higher-order Functions, vol. 3717, 216

Godefroid, 2005, DART: Directed Automated Random Testing, 213

Gupta, 2008, Proving non-Termination, 147

Lindholm, 1999

Payet, 2008, Loop Detection in Term Rewriting Using the Eliminating Unfoldings, Theoretical Computer Science, 403, 307, 10.1016/j.tcs.2008.05.013

Payet, E. and F. Mesnard, A non-Termination Criterion for Binary Constraint Logic Programs, Technical report, IREMIA, Université de La Réunion (2008), available at http://arxiv.org/abs/0807.3451

Payet, 2006, Non-Termination Inference of Logic Programs, ACM Transactions on Programming Languages and Systems, 28, 256, 10.1145/1119479.1119481

Rossignoli, 2006, Detecting Non-Cyclicity by Abstract Compilation into Boolean Functions, vol. 3855, 95

Secci, 2005, Pair-Sharing Analysis of Object-Oriented Programs, vol. 3672, 320

Sen, 2005, CUTE: a Concolic Unit Testing Engine for C, 263

Shen, 2003, A Dynamic Approach to Characterizing Termination of General Logic Programs, ACM Transactions on Computational Logic, 4, 417, 10.1145/937555.937556

Shen, 2001, Loops Checks for Logic Programs with Functions, Theoretical Computer Science, 266, 441, 10.1016/S0304-3975(00)00197-3

Spoto, F., P. M. Hill and E. Payet, Path-Length Analysis for Object-Oriented Programs, in: First International Workshop on Emerging Applications of Abstract Interpretation (EAAI'06), Vienna, Austria, 2006, available at the web address http://profs.sci.univr.it/spoto/papers.html

Spoto, F., L. Lu and F. Mesnard, Using CLP Simplifications to Improve Java Bytecode Termination Analysis, submitted for publication to Bytecode'09

Spoto, F., F. Mesnard and E. Payet, A Termination Analyser for Java Bytecode Based on Path-Length, submitted for publication in August 2007

Velroyen, 2008, Non-Termination Checking for Imperative Programs, vol. 4966, 154

Waldmann, 2004, Matchbox: A Tool for Match-bounded String Rewriting, vol. 3091, 85

Waldmann

Zankl, H. and A. Middeldorp, Nontermination of String Rewriting using SAT, in: Proc. of the 9th International Workshop on Termination (WST'07), 2007, pp. 52–55

Zantema, 2005, Termination of String Rewriting Proved Automatically, Journal of Automated Reasoning, 34, 105, 10.1007/s10817-005-6545-0

Thông tin
Thông tin xuất bản

Electronic Notes in Theoretical Computer Science

Tập 253

83-96

Thông tin tác giả