Sciweavers

3221 search results - page 45 / 645
» Termination of Linear Programs
Sort
View
CAV
2006
Springer
133views Hardware» more  CAV 2006»
13 years 11 months ago
Programs with Lists Are Counter Automata
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...
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Ra...
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
Programs as polygraphs: computability and complexity
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....
Guillaume Bonfante, Yves Guiraud
WSC
2007
13 years 10 months ago
Sequential sampling for solving stochastic programs
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...
Güzin Bayraksan, David P. Morton
ESOP
2010
Springer
14 years 5 months ago
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
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...
Keiko Nakata and Tarmo Uustalu
SIGSOFT
2005
ACM
14 years 8 months ago
Fluent temporal logic for discrete-time event-based models
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...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...