1,412,199 research outputs found
Checking Computations of Formal Method Tools - A Secondary Toolchain for ProB
We present the implementation of pyB, a predicate - and expression - checker
for the B language. The tool is to be used for a secondary tool chain for data
validation and data generation, with ProB being used in the primary tool chain.
Indeed, pyB is an independent cleanroom-implementation which is used to
double-check solutions generated by ProB, an animator and model-checker for B
specifications. One of the major goals is to use ProB together with pyB to
generate reliable outputs for high-integrity safety critical applications.
Although pyB is still work in progress, the ProB/pyB toolchain has already been
successfully tested on various industrial B machines and data validation tasks.Comment: In Proceedings F-IDE 2014, arXiv:1404.578
Who watches the watchers: Validating the ProB Validation Tool
Over the years, ProB has moved from a tool that complemented proving, to a
development environment that is now sometimes used instead of proving for
applications, such as exhaustive model checking or data validation. This has
led to much more stringent requirements on the integrity of ProB. In this paper
we present a summary of our validation efforts for ProB, in particular within
the context of the norm EN 50128 and safety critical applications in the
railway domain.Comment: In Proceedings F-IDE 2014, arXiv:1404.578
Symbolic Reachability Analysis of B through ProB and LTSmin
We present a symbolic reachability analysis approach for B that can provide a
significant speedup over traditional explicit state model checking. The
symbolic analysis is implemented by linking ProB to LTSmin, a high-performance
language independent model checker. The link is achieved via LTSmin's PINS
interface, allowing ProB to benefit from LTSmin's analysis algorithms, while
only writing a few hundred lines of glue-code, along with a bridge between ProB
and C using ZeroMQ. ProB supports model checking of several formal
specification languages such as B, Event-B, Z and TLA. Our experiments are
based on a wide variety of B-Method and Event-B models to demonstrate the
efficiency of the new link. Among the tested categories are state space
generation and deadlock detection; but action detection and invariant checking
are also feasible in principle. In many cases we observe speedups of several
orders of magnitude. We also compare the results with other approaches for
improving model checking, such as partial order reduction or symmetry
reduction. We thus provide a new scalable, symbolic analysis algorithm for the
B-Method and Event-B, along with a platform to integrate other model checking
improvements via LTSmin in the future
Exploration of the moon and planets
Unmanned interplanetary flight - engineering problems of mariner ii space prob
Coherent potential approximation of random nearly isostatic kagome lattice
The kagome lattice has coordination number , and it is mechanically
isostatic when nearest neighbor () sites are connected by central force
springs. A lattice of sites has zero-frequency floppy modes
that convert to finite-frequency anomalous modes when next-nearest-neighbor
() springs are added. We use the coherent potential approximation (CPA) to
study the mode structure and mechanical properties of the kagome lattice in
which springs with spring constant are added with probability
\Prob= \Delta z/4, where and is the average coordination
number. The effective medium static spring constant scales as
\Prob^2 for \Prob \ll \kappa and as \Prob for \Prob \gg \kappa,
yielding a frequency scale and a length scale . To a very good approximation at at small nonzero frequency,
\kappa_m(\Prob,\omega)/\kappa_m(\Prob,0) is a scaling function of
. The Ioffe-Regel limit beyond which plane-wave states becomes
ill-define is reached at a frequency of order .Comment: 15 pages, 8 figure
Registration of Solar Cosmic Rays on the AMS ''luna-11''
Proton flux measurements onboard lunar prob
- …
