797 search results - page 15 / 160 » Eliminating Proofs from Programs |
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
TIC
2000
Springer
15 years 1 months ago
2000
Springer
Singleton kinds provide an elegant device for expressing type equality information resulting from modern module languages, but they can severely complicate the metatheory of langu...
68
Voted
SAS
1999
Springer
15 years 1 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
97
Voted
TSE
2010
14 years 7 months ago
2010
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
IWMM
2007
Springer
15 years 3 months ago
2007
Springer
We present and evaluate a new technique for detecting and eliminating memory leaks in programs with dynamic memory allocation. This technique observes the execution of the program...