4814 search results - page 171 / 963 » Combining abstract interpreters |
161
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
153
click to vote
ASM
2000
ASM
15 years 10 months ago
2000
ASM
Abstract. The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the dynamic semantics of the ...
182
click to vote
ESOP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
152
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
154
click to vote
ERCIMDL
2006
Springer
15 years 10 months ago
2006
Springer
ined abstract Access Points combined with specific attributes (Attribute Sets)