105 search results - page 10 / 21 » Proving optimizations correct using parameterized program eq... |
107
click to vote
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
105
click to vote
ENTCS
2002
14 years 11 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
101
click to vote
PLDI
2010
ACM
15 years 3 months ago
2010
ACM
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
SIAMJO
2008
14 years 11 months ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
84
Voted
ICFP
2002
ACM
15 years 11 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...