Results 1 -
5 of
5
Minimization of symbolic automata
- In POPL
, 2014
"... Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata al-gorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this paper we study the problem of minimizing symbolic ..."
Abstract
-
Cited by 9 (5 self)
- Add to MetaCart
(Show Context)
Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata al-gorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this paper we study the problem of minimizing symbolic automata. We formally define and prove the basic properties of minimality in the symbolic set-ting, and lift classical minimization algorithms (Huffman-Moore’s and Hopcroft’s algorithms) to symbolic automata. We also intro-duce a completely new minimization algorithm that takes full ad-vantage of the symbolic representation of the alphabet, and prove its correctness. We provide comprehensive performance evaluation of all the algorithms over large benchmarks and against existing state-of-the-art implementations. The experiments show how the new symbolic algorithm is faster than previous implementations. 1.
Automated interface refinement for compositional verification
- IEEE Transaction on Computer-aided Design of Integrated Circuits and Systems
"... Abstract—Compositional verification is essential for verifying large systems. However, approximate environments are needed when verifying the constituent modules in a system. Effective compositional verification requires finding a simple but accurate over-approximate environment for each module. Oth ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
Abstract—Compositional verification is essential for verifying large systems. However, approximate environments are needed when verifying the constituent modules in a system. Effective compositional verification requires finding a simple but accurate over-approximate environment for each module. Otherwise, many verification failures may be produced, therefore incuring high computational penalty for distinguishing the false failures from the real ones. This paper presents an automated method to refine the state space of each module within an over-approximate envi-ronment. This method is sound as long as an over-approximate environment is found for each module at the beginning of the verification process, and it has less restrictions on system partitioning. It is also coupled with several state space reduction techniques for better results. Experiments of this method on several large asynchronous designs show promising results. Index Terms—formal method, model checking, compositional verification, logic verification, circuit verification, abstraction refinement. I.
A compositional Minimization Approach for Large Asynchronous Design Verification
"... Abstract. This paper presents a compositional minimization approach with efficient state space reductions for verifying non-trivial asynchronous designs. These reductions can result in a reduced model that contains the exact same set of observably equivalent behavior in the original model, therefore ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. This paper presents a compositional minimization approach with efficient state space reductions for verifying non-trivial asynchronous designs. These reductions can result in a reduced model that contains the exact same set of observably equivalent behavior in the original model, therefore no false counter-examples are produced at the end of verification on the reduced model. This approach allows designs that cannot be handled monolithically or with partial-order reduction to be verified without difficulty. The experimental results show significant scale-up of the compositional minimization approach using these reductions on a number of large asynchronous designs.
Equivalence-Based Reductions and checking for preorders
, 2002
"... Notation and Abbreviations 3 1 ..."
A Compositional Approach to Asynchronous Design Verification with Automated State Space Reduction
, 2007
"... Productivity. This thesis is also based upon work supported by the National Science Foun-dation under grant No. 0546492. I am thankful for this generous funding. I extend my most sincere thanks to Dr. Zheng for introducing me to such a fascinating topic. He has provided wonderful support, guidance, ..."
Abstract
- Add to MetaCart
(Show Context)
Productivity. This thesis is also based upon work supported by the National Science Foun-dation under grant No. 0546492. I am thankful for this generous funding. I extend my most sincere thanks to Dr. Zheng for introducing me to such a fascinating topic. He has provided wonderful support, guidance, and funding throughout this thesis. I would also like to thank Dr. Katkoori and Dr. Rundus for being on my committee and providing valuable
