1071 search results - page 124 / 215 » Programming with enumerable sets of structures |
83
Voted
AUTOMATICA
2006
15 years 20 days ago
2006
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
103
click to vote
ENTCS
2006
15 years 19 days ago
2006
We present a denotational semantics for the hardware compilation language Handel-C that maps language constructs to a set of equations, which describe the structure of the resulti...
103
click to vote
CDC
2009
IEEE
14 years 10 months ago
2009
IEEE
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...
191
click to vote
POPL
2008
ACM
16 years 28 days ago
2008
ACM
This paper presents a demand-driven, flow-insensitive analysis algorithm for answering may-alias queries. We formulate the computation of alias queries as a CFL-reachability probl...
161
click to vote
ECOOP
2003
Springer
15 years 5 months ago
2003
Springer
Despite Java’s automatic reclamation of memory, memory leaks remain an important problem. For example, we frequently encounter memory leaks that cause production servers to crash...