Pair-sharing over rational trees
Publication type: Journal Article
Publication date: 2000-11-01
Logic
Abstract
Sharing information is useful in specialising, optimising and parallelising logic programs and thus sharing analysis is an important topic of both abstract interpretation and logic programming. Sharing analyses infer which pairs of program variables can never be bound to terms that contain a common variable. We generalise a classic pair-sharing analysis from Herbrand unification to trace sharing over rational tree constraints. This is useful for reasoning about programs written in SICStus and Prolog-III because these languages use rational tree unification as the default equation solver.
Found
Nothing found, try to update filter.
Found
Nothing found, try to update filter.
Top-30
Journals
|
1
2
3
4
5
6
|
|
|
Lecture Notes in Computer Science
6 publications, 50%
|
|
|
Theory and Practice of Logic Programming
4 publications, 33.33%
|
|
|
Information and Computation
1 publication, 8.33%
|
|
|
1
2
3
4
5
6
|
Publishers
|
1
2
3
4
5
6
|
|
|
Springer Nature
6 publications, 50%
|
|
|
Cambridge University Press
4 publications, 33.33%
|
|
|
Elsevier
1 publication, 8.33%
|
|
|
Association for Computing Machinery (ACM)
1 publication, 8.33%
|
|
|
1
2
3
4
5
6
|
- We do not take into account publications without a DOI.
- Statistics recalculated weekly.
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
12
Total citations:
12
Citations from 2024:
1
(8.33%)
Cite this
GOST |
RIS |
BibTex |
MLA
Cite this
RIS
Copy
TY - JOUR
DO - 10.1016/s0743-1066(00)00009-1
UR - https://doi.org/10.1016/s0743-1066(00)00009-1
TI - Pair-sharing over rational trees
T2 - The Journal of Logic Programming
AU - King, Andy
PY - 2000
DA - 2000/11/01
PB - Elsevier
SP - 139-155
IS - 1-2
VL - 46
SN - 0743-1066
ER -
Cite this
BibTex (up to 50 authors)
Copy
@article{2000_King,
author = {Andy King},
title = {Pair-sharing over rational trees},
journal = {The Journal of Logic Programming},
year = {2000},
volume = {46},
publisher = {Elsevier},
month = {nov},
url = {https://doi.org/10.1016/s0743-1066(00)00009-1},
number = {1-2},
pages = {139--155},
doi = {10.1016/s0743-1066(00)00009-1}
}
Cite this
MLA
Copy
King, Andy. “Pair-sharing over rational trees.” The Journal of Logic Programming, vol. 46, no. 1-2, Nov. 2000, pp. 139-155. https://doi.org/10.1016/s0743-1066(00)00009-1.