Sciweavers

336 search results - page 46 / 68
» Program Speedups in Theory and Practice
Sort
View
POPL
2011
ACM
14 years 3 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
108
Voted
APLAS
2005
ACM
15 years 6 months ago
Integrating Physical Systems in the Static Analysis of Embedded Control Software
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
Patrick Cousot
89
Voted
DAC
2005
ACM
16 years 1 months ago
IODINE: a tool to automatically infer dynamic invariants for hardware designs
We describe IODINE, a tool to automatically extract likely design properties using dynamic analysis. A practical bottleneck in the formal verification of hardware designs is the n...
Sudheendra Hangal, Naveen Chandra, Sridhar Narayan...
88
Voted
SOCO
2009
Springer
15 years 7 months ago
Lazy Composition of Representations in Java
Abstract. The separation of concerns has been a core idiom of software engineering for decades. In general, software can be decomposed properly only according to a single concern, ...
Rémi Douence, Xavier Lorca, Nicolas Loriant
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
15 years 6 months ago
Search space modulation in genetic algorithms: evolving the search space by sinusoidal transformations
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
José Antonio Martin H.