Combining static analysis and case-based search space partitioning for reducing peak memory in model checking

2003 ◽  
Vol 18 (6) ◽  
pp. 762-770 ◽  
Author(s):  
WenHui Zhang
10.29007/7lrd ◽  
2018 ◽  
Author(s):  
Ian Cassar ◽  
Adrian Francalanza ◽  
Duncan Attard ◽  
Luca Aceto ◽  
Anna Ingolfsdottir

Ensuring formal correctness for actor-based, concurrent systems is a difficult task, pri- marily because exhaustive, static analysis verification techniques such as model checking quickly run into state-explosion problems. Runtime monitoring techniques such as Run- time Verification and Adaptation circumvent this limitation by verifying the correctness of a program by dynamically analysing its executions. This paper gives an overview of a suite of monitoring tools available for verifying and adapting actor-based Erlang programs.


2021 ◽  
Author(s):  
Michele Albano ◽  
Stefano Chessa ◽  
Kim Guldstrand Larsen

Author(s):  
Michał Okoniewski ◽  
Piotr Gawrysiak ◽  
Łukasz Gancarz

2003 ◽  
Vol 3 (4) ◽  
pp. 353-362 ◽  
Author(s):  
S. B. Tor ◽  
G. A. Britton , and ◽  
W. Y. Zhang

This paper presents a case-based reasoning (CBR) methodology for metal stamping die design, that in particular addresses the indexing and retrieval of die design cases. A feature relation graph representation of stamped metal parts are used to create a high level of geometric abstraction, which is used to index design cases quickly and accurately. Though the potential search space for case retrieval is huge, by employing a novel dual-step similarity analysis between a new stamped part and existing parts in the case library, the proposed retrieval strategy can narrow down the search space efficiently and retrieve the most similar case in a reasonable period of time. An illustrative example is included to demonstrate the operation of the proposed approach and show its effectiveness in speeding up stamping die design.


Sign in / Sign up

Export Citation Format

Share Document