3221 search results - page 45 / 645 » Termination of Linear Programs |
CAV
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
109
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
118
click to vote
WSC
2007
15 years 5 months ago
2007
We develop a sequential sampling procedure for solving a class of stochastic programs. A sequence of feasible solutions, with at least one optimal limit point, is given as input t...
135
click to vote
ESOP
2010
Springer
16 years 7 days ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
106
click to vote
SIGSOFT
2005
ACM
16 years 3 months ago
2005
ACM
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...