Automatic complexity analysis

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

Volumn 2305, Issue , 2002, Pages 243-261

  Nielson, Flemming ^a   Nielson, Hanne Riis ^a   Seidl, Helmut ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

Automatic complexity analysis; Horn clauses; Program analysis; Sparseness

Indexed keywords

CALCULATIONS;

ASYMPTOTIC COMPLEXITY; COMPLEXITY ANALYSIS; FIX-POINT ITERATIONS; HORN CLAUSE; PROGRAM ANALYSIS; RUN-TIME ANALYSIS; SPARSENESS;

LOGIC PROGRAMMING;

EID: 84957064904     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45927-8_18     Document Type: Conference Paper

References (14)

1. A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming (SCP), 35(2):79–111, 1999.
2. D.A. Basin and H. Ganzinger. Complexity Analysis Based on Ordered Resolution. In 11th IEEE Symposium on Logic in Computer Science (LICS), 456–465, 1996. Long version to appear in JACM.
3. L. Cardelli and A.D. Gordon. Mobile ambients. In Proceedings of FoSSaCS’98, volume 1378 of LNCS, 140–155. Springer-Verlag, 1998.
4. E. Dahlhaus. Skolem normal forms concerning the least fixpoint. In Computation Theory and Logic, 101–106. LNCS 270, Springer Verlag, 1987.
5. D. L. Dill. Timing assumptions and verification of finite state concurrent systems. In Automatic Verification Methods for Finite State Systems, 197–212. LNCS 407, Springer Verlag, 1989.
6. C. Fecht and H. Seidl. A faster solver for general systems of equations. Science of Computer Programming (SCP), 35(2-3):137–162, 1999.
7. H. Ganzinger and D.A. McAllester. A new meta-complexity theorem for bottom-up logic programs. In First Int. Joint Conference on Automated Reasoning (IJCAR), 514–528. LNCS 2083, Springer Verlag, 2001.
8. G. Gottlob, E. Gradel, and H. Veith. Datalog LITE: A deductive query language with linear time model checking. ACM Transactions on Computational Logic, 2001. To appear.
9. D. E. Knuth. On a generalization of Dijkstra’s algorithm. Information Processing Letters (IPL), 6(1):1–5, 1977.
10. P.G. Kolaitis. Implicit definability on finite structures and unambiguous computations (preliminary report). In 5th Annual IEEE Symposium on Logic in Computer Science (LICS), 168–180, 1990.
11. D. McAllester. On the complexity analysis of static analyses. In 6th Static Analysis Symposium (SAS), 312–329. LNCS 1694, Springer Verlag, 1999.
12. F. Nielson and H. Seidl. Control-flow analysis in cubic time. In European Symposium on Programming (ESOP), 252–268. LNCS 2028, Springer Verlag, 2001.
13. F. Nielson and H. Seidl. Succinct solvers. Technical Report 01-12, University of Trier, Germany, 2001.
14. R. Shaham, K. Kordner, and S. Sagiv. Automatic removal of array memory leaks in Java. In Compiler Construction (CC), 50–66. LNCS 1781, Springer Verlag, 2000.