Theoretical Computer Science
Proofs and types
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Set Constraints: Results, Applications, and Future Directions
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Higher-Order Quantification and Proof Search
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
| Hi-index | 0.00 |
We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to provide partial correctness properties of logic programs. For example, one might wish to specify than whenever the atom sort(t,s) is proved then the two lists t and s contain the same multiset of items (that is, s is a permutation of t). If sorting removes duplicates, then one would like to infer that the sets of items underlying t and s are the same. Such results could be useful to have if they can be determined statically and automatically. We present a scheme by which such collection analysis can be structured and automated. Central to this scheme is the use of linear logic as a computational logic underlying the logic of Horn clauses