Sciweavers

1205 search results - page 99 / 241
» Program Extraction from Large Proof Developments
Sort
View
TCBB
2008
122views more  TCBB 2008»
15 years 1 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
SOCO
2007
Springer
15 years 7 months ago
Aspect-Oriented Programming: Selecting and Exposing Object Paths
Aspects require access to the join point context in order to select and adapt join points. For this purpose, current aspect-oriented systems offer a large number of pointcut constr...
Mohammed Al-Mansari, Stefan Hanenberg, Rainer Unla...
KBSE
2008
IEEE
15 years 8 months ago
Predicting Effectiveness of Automatic Testing Tools
—Automatic white-box test generation is a challenging problem. Many existing tools rely on complex code analyses and heuristics. As a result, structural features of an input prog...
Brett Daniel, Marat Boshernitsan
INFORMS
1998
150views more  INFORMS 1998»
15 years 1 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
105
Voted
BIRTHDAY
2010
Springer
15 years 2 months ago
Inferring Loop Invariants Using Postconditions
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
Carlo A. Furia, Bertrand Meyer