Sciweavers

945 search results - page 66 / 189
» Incremental Branching Programs
Sort
View
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 5 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 3 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
IFIP
2001
Springer
14 years 1 months ago
Functional Test Generation using Constraint Logic Programming
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
Zhihong Zeng, Maciej J. Ciesielski, Bruno Rouzeyre
CLIMA
2004
13 years 10 months ago
From Logic Programs Updates to Action Description Updates
An important branch of investigation in the field agents has been the definition of high level languages for representing effects of actions, the programs written in such languages...
José Júlio Alferes, Federico Banti, ...
AOSD
2007
ACM
14 years 1 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore