3221 search results - page 35 / 645 » Termination of Linear Programs |
129
click to vote
AC
2000
Springer
15 years 7 months ago
2000
Springer
This tutorial paper discusses a particular style of operational semantics that enables one to give a ‘syntax-directed’ inductive definition of termination which is very useful...
118
click to vote
ARC
2008
Springer
15 years 3 months ago
2008
Springer
: This paper describes the theory of feedback control in the class inputs which allow delta-functions and their derivatives. It indicates a modification of dynamic programming tech...
124
click to vote
ENTCS
2006
15 years 2 months ago
2006
We build a realizability model for linear logic using a name-passing process calculus. The construction is based on testing semantics for processes, drawing ideas from spatial and...
111
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
125
click to vote
DBPL
1999
Springer
15 years 7 months ago
1999
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...