A novel approach to verifying context free properties of programs
- 9 January 2020
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 809, 519-530
- https://doi.org/10.1016/j.tcs.2020.01.005
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
- Shaanxi Key Science and Technology Innovation Team Project
This publication has 21 references indexed in Scilit:
- Cloud9ACM SIGOPS Operating Systems Review, 2010
- Complexity of propositional projection temporal logic with starMathematical Structures in Computer Science, 2009
- SAT-based counterexample-guided abstraction refinementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2004
- Counterexample-guided abstraction refinement for symbolic model checkingJournal of the ACM, 2003
- Complete Proof System for QPTLJournal of Logic and Computation, 2002
- Reasoning about systems with many processesJournal of the ACM, 1992
- An experience in proving regular networks of processes by modular model checkingActa Informatica, 1992
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Results on the propositional μ-calculusTheoretical Computer Science, 1983