378 search results - page 67 / 76 » Automating Mathematical Program Transformations |
134
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...
116
Voted
EMSOFT
2008
Springer
15 years 3 months ago
2008
Springer
C's volatile qualifier is intended to provide a reliable link between operations at the source-code level and operations at the memorysystem level. We tested thirteen product...
124
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
108
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
147
Voted
SIGSOFT
2003
ACM
16 years 2 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...