Titlebook: Automated Technology for Verification and Analysis; 4th International Sy Susanne Graf,Wenhui Zhang Conference proceedings 2006 Springer-Ver

Gentry

Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decompositionation phase. We report on an implementation based on NuSMV, and experiments that study the effectiveness of automatic decomposition and the overall savings in the computational requirements of symbolic model checking.

消瘦

Effective Contraction of Timed STGs for Decomposition Based Timed Circuit Synthesisions, which degrades the performance of the decomposition based synthesis method. This paper proposes a way to contract timed STGs effectively without losing the optimality of the synthesized circuits, and shows some experimental results.

CERE

0302-9743 nterest in formal veri?cation spurred by the booming IT industry, particularly hardware design and manufacturing in East Asia. Its purpose is to promote research on automated veri?cation and analysis in the region by providing a forum for int- action between the regional and the international resear

aplomb

intention

CON

On the Satisfiability of Modular Arithmetic Formulaethe number of constraints and variables linear in the length of the given linear modular arithmetic formula. For non-linear modular arithmetic formulae, an additional factor of . is needed. With the advent of efficient integer programming packages, our algorithm could be useful to software verification in practice.