82 search results - page 14 / 17 » On the Correctness of Transformations in Compiler Back-Ends |
LATIN
2004
Springer
14 years 26 days ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
ECOOP
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. Aspects have emerged as a powerful tool in the design and development of systems, allowing for the encapsulation of program transformations. The dynamic semantics of aspe...
CC
2009
Springer
14 years 4 days ago
2009
Springer
Abstract. It is difficult to develop style-preserving source-to-source transformation engines for C and C++. The main reason is not the complexity of those languages, but the use o...
EPEW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We present an application of partial evaluation to performance models expressed in the PEPA stochastic process algebra [1]. We partially evaluate the state-space of a PEP...
ENTCS
2002
13 years 7 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...