A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Set-sharing is redundant for pair-sharing
Theoretical Computer Science
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Logical optimality of groundness analysis
Theoretical Computer Science
How to Transform an Analyzer into a Verifier
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Measuring the Precision of Abstract Interpretations
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Decomposing Non-redundant Sharing by Complementation
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Abstract interpretation based verification of logic programs
Science of Computer Programming
An effective fixpoint semantics for linear logic programs
Theory and Practice of Logic Programming
Abstract interpretation of combinational asynchronous circuits
Science of Computer Programming
Higher-order abstract non-interference
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Hi-index | 0.00 |