861 search results - page 32 / 173 » Symbolic Program Analysis Using Term Rewriting and Generaliz... |
106
Voted
SIGSOFT
2006
ACM
16 years 3 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
117
Voted
POPL
2010
ACM
15 years 12 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
134
click to vote
AGP
1997
IEEE
15 years 6 months ago
1997
IEEE
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
139
click to vote
PLDI
2003
ACM
15 years 7 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
121
click to vote
FCCM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Precision analysis and optimization is very important when transforming a floating-point algorithm into fixedpoint hardware implementations. The core analysis techniqu...