Name
Abstract | ||
|---|---|---|
There are many applications where precise mode analysis is required. However, within the framework of abstract interpretation, the precision of an analyser depends, in part, on the expressiveness of the abstract domain and its associated abstraction function. This paper considers abstract domains for polymorphically typed logic programs where each nonvariable symbol is explicitly typed. We show how to construct precise domains and their abstraction functions that reflect the declared structure... |
Year | Venue | Keywords |
|---|---|---|
1997 | ICLP | polymorphism |
Field | DocType | Citations |
Programming language,Axiomatic semantics,Computer science,Theoretical computer science | Conference | 1 |
PageRank | References | Authors |
0.36 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan-Georg Smaus | 1 | 177 | 16.15 |
| Patricia M. Hill | 2 | 767 | 50.02 |
| Andy King | 3 | 170 | 11.03 |