856 search results - page 75 / 172 » Dependent Types in Practical Programming |
PLDI
2011
ACM
12 years 11 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
PEPM
2011
ACM
12 years 11 months ago
2011
ACM
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
CCS
2010
ACM
13 years 6 months ago
2010
ACM
Given a single program (i.e., bit string), one may assume that the program's behaviors can be determined by first identifying the native runtime architecture and then executi...
SIGSOFT
2002
ACM
14 years 9 months ago
2002
ACM
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
PPOPP
2005
ACM
14 years 2 months ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...