Changes between Version 4 and Version 5 of CompositionalBiblio
- Timestamp:
- Mar 1, 2012, 1:09:41 PM (13 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
CompositionalBiblio
v4 v5 670 670 <tr id="5374376" class="entry"> 671 671 <td>Zheng, H., Yao, H. & Yoneda, T. </td> 672 <td>Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement <p class="infolinks">[<a href="javascript:toggleInfo('5374376','abstract')">Abstract</a>] [<a href="javascript:toggleInfo('5374376',' bibtex')">BibTeX</a>]</p></td>672 <td>Modular Model Checking of Large Asynchronous Designs with Efficient Abstraction Refinement <p class="infolinks">[<a href="javascript:toggleInfo('5374376','abstract')">Abstract</a>] [<a href="javascript:toggleInfo('5374376','review')">Review</a>] [<a href="javascript:toggleInfo('5374376','bibtex')">BibTeX</a>]</p></td> 673 673 <td>2010</td> 674 674 <td>Computers, IEEE Transactions on<br/>Vol. 59(4), pp. 561 -573 </td> … … 679 679 <td colspan="7"><b>Abstract</b>: Divide-and-conquer is essential to address state explosion in model checking. Verifying each individual component in a system, in isolation, efficiently requires an appropriate context, which traditionally is obtained by hand. This paper presents an efficient modular model checking approach for asynchronous design verification. It is equipped with a novel abstraction refinement method that can refine a component abstraction to be accurate enough for successful verification. It is fully automated, and eliminates the need of finding an accurate context when verifying each individual component, although such a context is still highly desirable. This method is also enhanced with additional state space reduction techniques. The experiments on several nontrivial asynchronous designs show that this method efficiently removes impossible behaviors from each component including ones violating correctness requirements.</td> 680 680 </tr> 681 <tr id="rev_5374376" class="review noshow"> 682 <td colspan="7"><b>Review</b>: Verification of a whole system by verifying each components. When verifying each components individually assumptions has to be made on the environnment ot avoid false counter-examples. Use component abstraction to over-approximated the environment. This abastraction must be refined to obtain only the behavior allowed at the interface. They propose : 683 <ul> 684 <li> to identify and remove unsynchronized behavior. 685 <li> to extend the refinement to more than two components itemize 686 </ul> 687 688 Main contribution : Local synchronization detection method for component based on parallel composition and an AR methof for modular MC. 689 <br> 690 Circuit class : Asynchronous</td> 691 692 </tr> 693 681 694 <tr id="bib_5374376" class="bibtex noshow"> 682 695 <td colspan="7"><b>BibTeX</b>: