Sciweavers

1901 search results - page 207 / 381
» Predicting Program Properties from
Sort
View
129
Voted
FMCAD
2009
Springer
15 years 10 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
123
Voted
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 23 days ago
On optimizing over lift-and-project closures
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
Pierre Bonami
BIBE
2005
IEEE
154views Bioinformatics» more  BIBE 2005»
15 years 9 months ago
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur...
IJFCS
2007
98views more  IJFCS 2007»
15 years 3 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
ESOP
2010
Springer
16 years 22 days ago
Fluid Updates: Beyond Strong vs. Weak Updates
Abstract. We describe a symbolic heap abstraction that unifies reasoning about arrays, pointers, and scalars, and we define a fluid update operation on this symbolic heap that rela...
Isil Dillig, Thomas Dillig and Alex Aiken