632 search results - page 55 / 127 » Proving Invariants of Functional Programs |
97
Voted
TCC
2010
Springer
14 years 11 months ago
2010
Springer
Previous work on program obfuscation gives strong negative results for general-purpose obfuscators, and positive results for obfuscating simple functions such as equality testing (...
DISOPT
2008
15 years 20 days ago
2008
A pseudolattice L is a poset with lattice-type binary operations. Assuming that the pseudolattice permits a modular representation as a family of subsets of a set U with certain c...
101
click to vote
SIAMCOMP
2008
15 years 15 days ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
95
Voted
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability. We expl...
98
Voted
LOPSTR
2004
Springer
15 years 6 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...