An Extended PROMELA Parser Which Generates Compact CCS State Graphs Using Data Flow Analysis for Refactoring Automation
碩士 === 國立臺灣師範大學 === 資訊教育研究所 === 91 === Automated finite-state verification techniques have matured considerably in the past decades, but state-space explosion remains an obstacle to their use. Theoretical lower bounds on complexity imply that all of the techniques that have been developed...
Main Authors: | Chia Yi Pan, 潘珈逸 |
---|---|
Other Authors: | Yung-Ping Cheng |
Format: | Others |
Language: | en_US |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/50929352371886929884 |
Similar Items
-
Automated Refactoring for Stampedlock
by: Yang Zhang, et al.
Published: (2019-01-01) -
Chinese Question Answering Using Parser-Generated Conceptual Graphs
by: Chen-Yan Yang, et al.
Published: (2002) -
A Parser-based Call-graph Generator for Script Languages
by: Wang, Han-Lin, et al.
Published: (2012) -
Fully Automated Translation of BoxTalk to Promela
by: Kajarekar, Tejas
Published: (2011) -
Fully Automated Translation of BoxTalk to Promela
by: Kajarekar, Tejas
Published: (2011)