Bonsai: Cutting Models Down to Size
نویسندگان
چکیده
In model checking, abstractions can cause spurious results, which need to be verified in the concrete system to gain conclusive results. Verification based on multi-valued model checking can distinguish conclusive and inconclusive results, while increasing precision over traditional two-valued overand under-abstractions. This paper describes the theory and implementation of multi-valued model checking for Promela specifications. We believe our tool Bonsai is the first four-valued model checker capable of multi-valued verification of parallel models, i.e. consisting of multiple concurrent processes. A novel aspect is the ability to only partially abstract a model, keeping parts of it concrete.
منابع مشابه
Asymptotic Cost of Cutting Down Random Free Trees
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of...
متن کاملm-Bonsai: a Practical Compact Dynamic Trie
We consider the problem of implementing a space-efficient dynamic trie, with an emphasis on good practical performance. For a trie with n nodes with an alphabet of size σ, the informationtheoretic lower bound is n logσ + O(n) bits. The Bonsai data structure is a compact trie proposed by Darragh et al. (Softw., Pract. Exper. 23(3), 1993, pp. 277–291). Its disadvantages include the user having to...
متن کاملBonsai: Nature in Miniature
The 1914 Arnold Arboretum expedition to Japan led by Ernest H. Wilson produced, among other things, some excellent photographs which clearly show the natural inspiration for many of the forms of bonsai that most specialized kind of Japanese horticulture. Pictures such as these can help put the hobbyist in touch with the source of his art and can be of particular importance to bonsai enthusiasts...
متن کاملResource-efficient Machine Learning in 2 KB RAM for the Internet of Things
This paper develops a novel tree-based algorithm, called Bonsai, for efficient prediction on IoT devices – such as those based on the Arduino Uno board having an 8 bit ATmega328P microcontroller operating at 16 MHz with no native floating point support, 2 KB RAM and 32 KB read-only flash. Bonsai maintains prediction accuracy while minimizing model size and prediction costs by: (a) developing a ...
متن کاملBonsai: a Compact Representation of Trees
This paper shows how trees can be stored in a very compact form, called ‘Bonsai’, using hash tables. A method is described that is suitable for large trees that grow monotonically within a predefined maximum size limit. Using it, pointers in any tree can be represented within 6 + log2n bits per node where n is the maximum number of children a node can have. We first describe a general way of ...
متن کامل