Haskell overloading is DEXPTIME-complete
Information Processing Letters
A calculus for cryptographic protocols
Information and Computation
Introduction to set constraint-based program analysis
Science of Computer Programming
Automated complexity analysis based on ordered resolution
Journal of the ACM (JACM)
Principles of Program Analysis
Principles of Program Analysis
Control-Flow Analysis in Cubic Time
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Set constraints with intersection
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Information Processing Letters
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
ACM Transactions on Computational Logic (TOCL)
Program Analysis through Finite Tree Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Information Processing Letters
Information Processing Letters
Polynomial constraints for sets with cardinality bounds
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Iterative specialisation of horn clauses
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Cryptographic protocol verification using tractable classes of horn clauses
Program analysis and compilation, theory and practice
Finite models for formal security proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Normalization of linear horn clauses
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Extending H1-clauses with disequalities
Information Processing Letters
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Cryptographic protocol analysis on real c code
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Tree automata with equality constraints modulo equational theories
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
On the complexity of equational horn clauses
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Regular protocols and attacks with regular knowledge
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Solving first order formulae of pseudo-regular theory
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Extending H1-clauses with path disequalities
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Crossing the syntactic barrier: hom-disequalities for H1-clauses
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Relational abstract interpretation for the verification of 2-hypersafety properties
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We exhibit a rich class of Horn clauses, which we call H1, whose least models, though possibly infinite, can be computed effectively. We show that the least model of an H1 clause consists of so-called strongly recognizable relations and present an exponential normalization procedure to compute it. In order to obtain a practical tool for program analysis, we identify a restriction of H1 clauses, which we call H2, where the least models can be computed in polynomial time. This fragment still allows to express, e.g., Cartesian product and transitive closure of relations. Inside H2, we exhibit a fragment H3 where normalization is even cubic. We demonstrate the usefulness of our approach by deriving a cubic control-flow analysis for the Spi calculus [1] as presented in [14].