Sciweavers

357 search results - page 32 / 72
» Optimizing programs with intended semantics
Sort
View
POPL
2004
ACM
14 years 8 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
EMO
2009
Springer
174views Optimization» more  EMO 2009»
14 years 2 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
CIDR
2007
163views Algorithms» more  CIDR 2007»
13 years 9 months ago
Demaq: A Foundation for Declarative XML Message Processing
This paper gives an overview of Demaq, an XML message processing system operating on the foundation of transactional XML message queues. We focus on the syntax and semantics of it...
Alexander Böhm 0002, Carl-Christian Kanne, Gu...
ICPP
1998
IEEE
13 years 12 months ago
Concurrent SSA Form in the Presence of Mutual Exclusion
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper ...
Diego Novillo, Ronald C. Unrau, Jonathan Schaeffer
CC
2004
Springer
14 years 1 months ago
Developing a Foundation for Code Optimization
Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimizati...
Mary Lou Soffa