Sciweavers

80 search results - page 10 / 16
» Summarizing procedures in concurrent programs
Sort
View
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
13 years 8 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
214
Voted
POPL
2009
ACM
16 years 1 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
97
Voted
PLDI
2010
ACM
15 years 10 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
101
Voted
PPDP
2007
Springer
15 years 7 months ago
Unfolding in CHR
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara...
107
Voted
SIMPRA
2008
99views more  SIMPRA 2008»
15 years 1 months ago
Response surface methodology for constrained simulation optimization: An overview
This article summarizes `Generalized Response Surface Methodology'(GRSM), extending Box and Wilson's `Response Surface Methodology'(RSM). GRSM allows multiple rando...
Jack P. C. Kleijnen