2203 search results - page 168 / 441 » Temporal Abstract Interpretation |
127
Voted
FSTTCS
2001
Springer
15 years 8 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...
117
Voted
ASM
2000
ASM
15 years 8 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 ...
137
click to vote
ESOP
1998
Springer
15 years 8 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...
146
click to vote
CASCON
2001
15 years 5 months ago
2001
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
118
Voted
SAS
2010
Springer
15 years 2 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...