632 search results - page 89 / 127 » Proving Invariants of Functional Programs |
200
Voted
POPL
2004
ACM
16 years 24 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
102
Voted
DAC
1999
ACM
16 years 1 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
134
click to vote
FLOPS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
77
Voted
COMPSAC
2009
IEEE
15 years 7 months ago
2009
IEEE
—In this paper, we define and illustrate a new form of attack in the context of software services: the software-based need-to-know (SN2K) attack. SN2K attacks can be carried out...
112
click to vote
LOPSTR
2004
Springer
15 years 5 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...