Normalizable horn clauses, strongly recognizable relations, and spi

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

Volumn 2477, Issue , 2002, Pages 35-2002

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

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

Program analysis; Spi calculus; Strongly recognizable relations; Uniform horn clauses

Indexed keywords

CALCULATIONS; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

CARTESIAN PRODUCTS; CONTROL FLOW ANALYSIS; HORN CLAUSE; POLYNOMIAL-TIME; PROGRAM ANALYSIS; SPI CALCULUS; STRONGLY RECOGNIZABLE RELATIONS; TRANSITIVE CLOSURE;

STATIC ANALYSIS;

EID: 84958766164     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45789-5_5     Document Type: Conference Paper

References (18)

1. M. Abadi and A.D. Gordon. A Calculus for Cryptographic Protocols - The Spi Calculus. Information and Computation, 148:1–70, January 1999.
2. A. Aiken. Introduction to Set Constraint-Based Program Analysis. Science of Computer Programming (SCP), 35(2):79–111, 1999.
3. D.A. Basin and H. Ganzinger. Complexity Analysis Based on Ordered Resolution. Journal of the ACM, 48(1):70–109, 2001.
4. W. Charatonik and A. Podelski. Set Constraints with Intersection. In 12th Ann. IEEE Symp. on Logic in Computer Science (LICS), 362–372, 1997.
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: http://www.grappa.univ-lille3.fr/tata,1999
6. T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic Programs as Types of Logic Programs. In 6th Symp. on Logic in Computer Science (LICS), 300–309, 1991.
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, 2001.
8. N. Heintze and J. Jaffar. A Decision Procedure for a Class of Set Constraints. In 5th Ann. IEEE Symp. on Logic in Computer Science (LICS), 42–51, 1990.
9. N.D. Jones and S.S. Muchnick. Complexity of Flow Analysis, Inductive Assertion Synthesis, and a Language due to Dijkstra. In Steven S. Muchnick and Neil D. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 12, 380–393. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1981.
10. D. Lugiez and P. Schnoebelen. Decidable First-Order Transition Logics for PAProcesses. In 27th Int. Coll. on Automata, Languages and Programming (ICALP), 342–353. LNCS 1853, 2000.
11. D. McAllester. On the Complexity Analysis of Static Analyses. In 6th Static Analysis Symposium (SAS), 312–329. LNCS 1694, 1999.
12. F. Nielson, H. Riis Nielson, and C. L. Hankin. Principles of Program Analysis. Springer, 1999.
13. F. Nielson, H. Riis Nielson, and H. Seidl. Automatic Complexity Analysis. In European Symposium on Programming (ESOP), 243–261. LNCS 2305, 2002.
14. F. Nielson, H. Riis Nielson, and H. Seidl. Cryptographic Analysis in Cubic Time. In Electronic Notes in Theoretical Computer Science (ENTCS), volume 62. Elsevier Science Publishers, 2002.
15. F. Nielson and H. Seidl. Control-Flow Analysis in Cubic Time. In European Symposium on Programming (ESOP), 252–268. LNCS 2028, 2001.
16. F. Nielson and H. Seidl. Succinct Solvers. Tech. Report 01-12, Trier, 2001.
17. L. Pacholski and A. Podelski. Set Constraints - a Pearl in Research on Constraints. In Gert Smolka, editor, 3rd Int. Conf. on Principles and Practice of Constraint Programming (CP), volume 1330 of Springer LNCS, 549–561. Springer-Verlag, 1997.
18. H. Seidl. Haskell Overloading is DEXPTIME Complete. Information Processing Letters (IPL), 54:57–60, 1994.