2006
DOI: 10.1007/11823230_8
|View full text |Cite
|
Sign up to set email alerts
|

Abstract Interpretation with Specialized Definitions

Abstract: Abstract. The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the partial deduction and abstract interpretation perspectives. In this work we present what we argue is the first fully described generic algorithm for efficient and precise integration of abstract interpretation and partial deduction. Taking as starting point state-of-the-art algorithms for context-sensitive, polyvariant abstract… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0
1

Year Published

2008
2008
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 25 publications
0
17
0
1
Order By: Relevance
“…We have implemented the proposed TbHEm embedding relation within the partial evaluator available in CiaoPP [19] and combined it with the results obtained from the well-typing analyzer in [5]. Table 1 shows the practical benefits that we can obtain in the context of the specialization of interpreters.…”
Section: Resultsmentioning
confidence: 99%
“…We have implemented the proposed TbHEm embedding relation within the partial evaluator available in CiaoPP [19] and combined it with the results obtained from the well-typing analyzer in [5]. Table 1 shows the practical benefits that we can obtain in the context of the specialization of interpreters.…”
Section: Resultsmentioning
confidence: 99%
“…We restrict these predicates to work only on user (i.e., not hidden) symbols. 9 More sophisticated solutions, that are outside the scope of this paper, include: producing monolithic libraries (creating versions of the imported modules and using abstract interpretation to obtain more precise assertion conditions); or disabling shallow checking (e.g., with a dynamic flag) until the execution exits the context of m (which is correct except for the case when terms are dynamically asserted).…”
Section: Discussion About Precisionmentioning
confidence: 99%
“…Let Spec(L, P re) generate a specialized version L of predicate L w.r.t. the calls given by P re (see [9]). It holds that for all θ, θ ⇒ P L iff θ ∧ P re ⇒ P L .…”
Section: Algorithm 1 Escaping_termsmentioning
confidence: 99%
“…There is an interesting conceptual connection between our approach and the abstractinterpretation-based approaches for partial evaluation of functional programs [3] and logic programs [12]. These approaches target languages whose semantics is defined using term rewriting; they specialize programs wrt given abstract criteria using term rewriting, and use abstract interpretation to ensure termination.…”
Section: Related Workmentioning
confidence: 99%