4502 search results - page 430 / 901 » Regular Model Checking |
170
click to vote
RE
2001
Springer
15 years 11 months ago
2001
Springer
at different levels of abstraction. There are two very different ways of using such languages. One approach is based on the manifestation of a single model, with construction of di...
187
Voted
SPIN
2010
Springer
15 years 5 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...
173
click to vote
ICFP
2007
ACM
16 years 6 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...
206
Voted
ICECCS
2010
IEEE
15 years 7 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 ...
206
Voted
ENTCS
2006
15 years 6 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 ...