Sciweavers

3221 search results - page 35 / 645
» Termination of Linear Programs
Sort
View
AC
2000
Springer
14 years 6 days ago
Operational Semantics and Program Equivalence
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...
Andrew M. Pitts
ARC
2008
Springer
85views Hardware» more  ARC 2008»
13 years 8 months ago
Dynamic programming for impulse controls
: 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...
Alexander B. Kurzhanski, Alexander N. Daryin
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
A Concurrent Model for Linear Logic
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...
Emmanuel Beffara
CONCUR
2006
Springer
13 years 11 months ago
Proving Liveness by Backwards Reachability
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...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
DBPL
1999
Springer
109views Database» more  DBPL 1999»
14 years 4 days ago
Expressing Topological Connectivity of Spatial Databases
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...
Floris Geerts, Bart Kuijpers