1445 search results - page 103 / 289 » Abstract Interpretation of Logic Programs |
104
click to vote
VMCAI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
240
Voted
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
108
click to vote
AMAST
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we give an operational and denotational semantics for a 3APL meta-language, with which various 3APL interpreters can be programmed. We moreover prove equiv...
113
click to vote
ICFP
2006
ACM
16 years 3 months ago
2006
ACM
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
123
click to vote
FLOPS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...