Sciweavers

34 search results - page 7 / 7
» A Framework for Formal Verification of Compiler Optimization...
Sort
View
POPL
2004
ACM
14 years 5 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
13 years 8 months ago
A specification-based fitness function for evolutionary testing of object-oriented programs
Encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. As client code is oblivious to the internal state of a server obje...
Yoonsik Cheon, Myoung Kim
CONSTRAINTS
2002
111views more  CONSTRAINTS 2002»
13 years 4 months ago
A Constraint-Based Interactive Train Rescheduling Tool
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
C. K. Chiu, C. M. Chou, Jimmy Ho-Man Lee, Ho-fung ...
FPCA
1995
13 years 8 months ago
Pi-Calculus, Dialogue Games and PCF
Game semantics is an unusual denotational semantics in that it captures the intensional (or algorithmic) and dynamical aspects of the computation. This makes it an ideal semantica...
J. M. E. Hyland, C.-H. Luke Ong