3221 search results - page 195 / 645 » Termination of Linear Programs |
179
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
149
click to vote
KBSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
160
click to vote
FM
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
261
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...