Sciweavers

4 search results - page 1 / 1
» Deciding Functional Lists with Sublist Sets
Sort
View
VSTTE
2012
Springer
12 years 6 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
ITA
2007
153views Communications» more  ITA 2007»
13 years 10 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
PLDI
2004
ACM
14 years 4 months ago
Inducing heuristics to decide whether to schedule
Instruction scheduling is a compiler optimization that can improve program speed, sometimes by 10% or more—but it can also be expensive. Furthermore, time spent optimizing is mo...
John Cavazos, J. Eliot B. Moss
AISC
2004
Springer
14 years 4 months ago
Solving Equations Involving Sequence Variables and Sequence Functions
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
Temur Kutsia