Engineering of An Assertion-based PSLSimple-Verilog Dynamic Verifier by Alternating Automata

Authors:
Naiyong Jin;Chengjie Shen;Jun Chen;Taoyong Ni
Affiliations:
Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China;Software Engineering Institute, East China Normal University, Shanghai, China
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 9
Cited 0

An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Weak alternating automata and tree automata emptiness

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Weak alternating automata are not that weak

ACM Transactions on Computational Logic (TOCL)
Communication and Concurrency

Communication and Concurrency
FoCs: Automatic Generation of Simulation Checkers from Formal Specifications

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Assertion-Based Design

Assertion-Based Design
Checking Finite Traces Using Alternating Automata

Formal Methods in System Design
Dynamic Verifying The Properties of The Simple Subset of PSL

TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Symbolic implementation of alternating automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Alternating Finite Automata (AFA) has linear space complexity in representing Linear-Time Temporal Logics. However, It is difficult to manipulate AFA in the run-time. In this paper, we focus on implementation methods to make alternating automata from static representation to run-time verification engines. 1) We have Directed Acyclic Graphs (DAG) represent all possible runs of a Local-variable-enhanced AFA (LAFA). The acceptance of universal choices is conditioned on successful synchronization of universal branches. 2) We encode states and local variables by symbolic approaches, and adopt historic trees in representing all possible parallel runs. The encoding enables multiple assignments to states and local variables in a configuration. By those methods, we are able to maintain the linear complexity of verification in both space and time.