Sciweavers

1914 search results - page 170 / 383
» Verification by Abstract Interpretation
Sort
View
POPL
2007
ACM
16 years 1 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
107
Voted
ICLP
2001
Springer
15 years 5 months ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
112
Voted
IPPS
2009
IEEE
15 years 7 months ago
A global scheduling framework for virtualization environments
Abstract—A premier goal of resource allocators in virtualization environments is to control the relative resource consumption of the different virtual machines, and moreover, to ...
Yoav Etsion, Tal Ben-Nun, Dror G. Feitelson
102
Voted
FSTTCS
2001
Springer
15 years 5 months ago
Rewrite Closure for Ground and Cancellative AC Theories
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...
Ashish Tiwari
96
Voted
ASM
2000
ASM
15 years 5 months ago
An ASM Dynamic Semantics for Standard ML
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 ...
Steven C. Cater, James K. Huggins