Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi

This publication has 15 references indexed in Scilit:

• Logic programs as types for logic programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A decision procedure for a class of set constraints
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Set constraints with intersection
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A New Meta-Complexity Theorem for Bottom-Up Logic Programs
  Published by Springer Nature ,2001
• Automated complexity analysis based on ordered resolution
  Journal of the ACM, 2001
• Decidable First-Order Transition Logics for PA-Processes
  Published by Springer Nature ,2000
• Introduction to set constraint-based program analysis
  Science of Computer Programming, 1999
• On the Complexity Analysis of Static Analyses
  Published by Springer Nature ,1999
• Principles of Program Analysis
  Published by Springer Nature ,1999
• A Calculus for Cryptographic Protocols: The Spi Calculus
  Information and Computation, 1999