Sciweavers

2864 search results - page 216 / 573
» Constraint Programming in OPL
Sort
View
ICFP
2003
ACM
14 years 10 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
ESOP
2004
Springer
14 years 4 months ago
Extracting a Data Flow Analyser in Constructive Logic
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...
SIGSOFT
2009
ACM
14 years 11 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 8 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall
AOR
2010
13 years 8 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi