Sciweavers

20 search results - page 3 / 4
» Operational Equivalence of CHR Programs and Constraints
Sort
View
VMCAI
2004
Springer
13 years 11 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
PLDI
1997
ACM
13 years 10 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
CCE
2008
13 years 5 months ago
Chance constrained programming approach to process optimization under uncertainty
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...
Pu Li, Harvey Arellano-Garcia, Günter Wozny
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
13 years 10 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
CC
2004
Springer
177views System Software» more  CC 2004»
13 years 11 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking