768 search results - page 34 / 154 » Symbolic and Abstract Interpretation for C C Programs |
145
click to vote
ICCAD
2002
IEEE
16 years 1 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
152
click to vote
ATVA
2006
Springer
15 years 8 months ago
2006
Springer
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
159
Voted
SCP
2000
15 years 4 months ago
2000
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
141
click to vote
PLDI
1996
ACM
15 years 9 months ago
1996
ACM
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
135
Voted
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 4 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...