Sciweavers

1226 search results - page 42 / 246
» Generating Abstractions from Static Domain Analysis
Sort
View
CP
2009
Springer
13 years 8 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey
CAV
2010
Springer
156views Hardware» more  CAV 2010»
13 years 10 months ago
A Logical Product Approach to Zonotope Intersection
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
Khalil Ghorbal, Eric Goubault, Sylvie Putot
BMCBI
2004
123views more  BMCBI 2004»
13 years 10 months ago
Interaction profile-based protein classification of death domain
Background: The increasing number of protein sequences and 3D structure obtained from genomic initiatives is leading many of us to focus on proteomics, and to dedicate our experim...
Drew Lett, Michael Hsing, Frederic Pio
IFIP
2004
Springer
14 years 3 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
ECOOP
2005
Springer
14 years 3 months ago
Expressive Pointcuts for Increased Modularity
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...
Klaus Ostermann, Mira Mezini, Christoph Bockisch