Name
Abstract | ||
|---|---|---|
Trailing of bindings in the PARMA variable representation is expensive in time and space. Two schemes are presented that lower its cost: the first is a technique that halves the space cost of trailing in PARMA. It can be used with conditional and unconditional trailing. It is illustrated and evaluated in the context of dProlog and in the Mercury backend of HAL. The second scheme combines a variant of a previously developed trailing analysis with the first technique. Empirical evidence shows the usefulness of these schemes and that the combination is more effective than each scheme apart. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1145/571157.571167 | PPDP |
Keywords | Field | DocType |
space cost,parma variable representation,empirical evidence,mercury backend,program analysis | Computer science,Simulation,Spacetime,Algorithm,Theoretical computer science,Program analysis | Conference |
ISBN | Citations | PageRank |
1-58113-528-9 | 1 | 0.36 |
References | Authors | |
14 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| tom schrijvers | 1 | 652 | 63.35 |
| bart demoen | 2 | 956 | 77.58 |