24 search results - page 5 / 5 » Reasoning about Idealized ALGOL Using Regular Languages |
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in āregularā...
POPL
1993
ACM
13 years 9 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is veriļ¬ed at compiletime and exploited to automatically generate code fo...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
CCS
2006
ACM
13 years 9 months ago
2006
ACM
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...