3909 search results - page 372 / 782 » Extreme Model Checking |
136
click to vote
SPIN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Context-Bounded Analysis has emerged as a practical automatic formal analysis technique for fine-grained, shared-memory concurrent software. Two recent papers (in CAV 20...
123
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the la...
147
click to vote
ICECCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract—Transactional Memory (TM) is a promising technique that addresses the difficulty of parallel programming. Since TM takes responsibility for all concurrency control, TM ...
146
click to vote
ENTCS
2006
15 years 4 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
196
click to vote
FMSB
2008
15 years 6 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...