Sciweavers

5216 search results - page 440 / 1044
» Planning as Model Checking
Sort
View
ICECCS
2007
IEEE
82views Hardware» more  ICECCS 2007»
16 years 1 months ago
Formalising Flash Memory: First Steps
We present first steps in the construction of formal models of NAND Flash memory, based on a recently emerged open standard for such devices. The model is at a level of abstracti...
Andrew Butterfield, Jim Woodcock
IJSYSC
2006
113views more  IJSYSC 2006»
15 years 6 months ago
Neural network approach to collision free path-planning for robotic manipulators
: The paper deals with collision free path planning for industrial robotic manipulators. A new efficient algorithm is proposed that is based on a topologically ordered neural netwo...
Anatoly Pashkevich, M. Kazheunikau, A. E. Ruano
SBMF
2009
Springer
184views Formal Methods» more  SBMF 2009»
16 years 1 months ago
Concolic Testing of the Multi-sector Read Operation for Flash Memory File System
In today’s information society, flash memory has become a virtually indispensable component, particularly for mobile devices. In order for mobile devices to operate successfully...
Moonzoo Kim, Yunho Kim
B
2007
Springer
16 years 29 days ago
Symmetry Reduction for B by Permutation Flooding
Symmetry reduction is an established method for limiting the amount of states that have to be checked during exhaustive model checking. The idea is to only verify a single represen...
Michael Leuschel, Michael J. Butler, Corinna Sperm...
FMCAD
2004
Springer
15 years 10 months ago
A Simple Method for Parameterized Verification of Cache Coherence Protocols
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
Ching-Tsun Chou, Phanindra K. Mannava, Seungjoon P...