3573 search results - page 445 / 715 » Reasoning about Codata |
155
click to vote
ICSE
2008
IEEE-ACM
16 years 6 months ago
2008
IEEE-ACM
Enforcing compliance to API usage protocols is notoriously hard due to possible aliasing of objects through multiple references. In previous work we proposed a sound, modular appr...
150
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
195
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
148
click to vote
PLDI
2010
ACM
16 years 4 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
179
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Software pipelining is a loop optimization that overlaps the execution of several iterations of a loop to expose more instruction-level parallelism. It can result in first-class p...