Sciweavers

2974 search results - page 166 / 595
» Model-Driven Constraint Programming
Sort
View
ESOP
2009
Springer
15 years 10 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
EMNLP
2006
15 years 7 months ago
Incremental Integer Linear Programming for Non-projective Dependency Parsing
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
Sebastian Riedel, James Clarke
MOR
2002
60views more  MOR 2002»
15 years 6 months ago
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
We examine the sequence of local minimizers of the log-barrier function for a nonlinear program near a solution at which second-order sufficient conditions and the Mangasarian-From...
Stephen J. Wright, Dominique Orban
PTS
2010
175views Hardware» more  PTS 2010»
15 years 4 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
WCET
2008
15 years 7 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti