1895 search results - page 180 / 379 » Using ATL for Checking Models |
226
click to vote
ICSE
2009
IEEE-ACM
16 years 7 months ago
2009
IEEE-ACM
Process models capture tasks performed by agents together with their control flow. Building and analyzing such models is important but difficult in certain areas such as safety-cr...
144
click to vote
TACAS
2005
Springer
15 years 11 months ago
2005
Springer
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
171
click to vote
SAT
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
172
click to vote
CAV
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space...
188
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...