Sciweavers

506 search results - page 14 / 102
» Where Is the Value in a Program Verifier
Sort
View
101
Voted
NETWORKS
2008
15 years 11 days ago
A linear programming approach to increasing the weight of all minimum spanning trees
Given a graph where increasing the weight of an edge has a nondecreasing convex piecewise linear cost, we study the problem of finding a minimum cost increase of the weights so tha...
Mourad Baïou, Francisco Barahona
ECOOP
2006
Springer
15 years 4 months ago
Managing the Evolution of Aspect-Oriented Software with Model-Based Pointcuts
In spite of the more advanced modularisation mechanisms, aspect-oriented programs still suffer from evolution problems. Due to the fragile pointcut problem, seemingly safe modifica...
Andy Kellens, Kim Mens, Johan Brichau, Kris Gybels
197
Voted
POPL
2005
ACM
16 years 22 days ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
ACTA
2010
191views more  ACTA 2010»
15 years 17 days ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
INFORMS
2010
90views more  INFORMS 2010»
14 years 11 months ago
Approximate Dynamic Programming for Ambulance Redeployment
We present an approximate dynamic programming approach for making ambulance redeployment decisions in an emergency medical service system. The primary decision is where we should ...
Matthew S. Maxwell, Mateo Restrepo, Shane G. Hende...