Sciweavers

TLCA
2009
Springer
13 years 11 months ago
On the Values of Reducibility Candidates
The straightforward elimination of union types is known to break subject reduction, and for some extensions of the lambda-calculus, to break strong normalization as well. Similarly...
Colin Riba
FMCAD
2009
Springer
13 years 11 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman