184 search results - page 25 / 37 » Formal Verification of an Optimizing Compiler |
POPL
2008
ACM
14 years 7 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...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
ICFP
2001
ACM
14 years 7 months ago
2001
ACM
We present a dependently typed assembly language (DTAL) in which the type system supports the use of a restricted form of dependent types, reaping some benefits of dependent types...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
C32SAT is a tool for checking C expressions. It can check whether a given C expression can be satisfied, is tautological, or always defined according to the ISO C99 standard. C32...
IFL
2005
Springer
14 years 1 months ago
2005
Springer
With-loops are versatile array comprehensions used in the functional array language SaC to implement universally applicable array operations. We describe the fusion of with-loops a...