A transformation-based approach to implication of GSTE assertion graphs
From MaRDI portal
Publication:364478
DOI10.1155/2013/709071zbMath1311.68091DBLPjournals/jam/YangHSG13OpenAlexW1994745936WikidataQ59003906 ScholiaQ59003906MaRDI QIDQ364478
William N. N. Hung, Xiaoyu Song, Wensheng Guo, Guo-wu Yang
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/709071
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Complementing deterministic Büchi automata in polynomial time
- Tools and Algorithms for the Construction and Analysis of Systems
- Computer Aided Verification
- Computer Aided Verification
- Automated Technology for Verification and Analysis
- Correct Hardware Design and Verification Methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A transformation-based approach to implication of GSTE assertion graphs