Skip to main content
SpringerLink
Log in

A Novel Approach to Verifying Context Free Properties of Programs

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11343))

Included in the following conference series:

  • 462 Accesses

Abstract

This paper proposes an approach to verifying programs against context free properties. To this end, the system to be verified is modeled by a program m in Modeling, Simulation and Verification Language (MSVL), and the desired property is also specified by an MSVL program \(m'\). Then program m and formula \(\lnot m'\) are interpreted by means of executing programs m and \(m'\). If an acceptable execution path is generated, a counterexample is found, otherwise the property is valid. To show how the proposed approach works, an example is given.

The research is supported by National Natural Science Foundation of China under Grant Nos. 61420106004, 61572386, 61732013 and 61751207.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. IEC 62531:2012(e) (IEEE Std 1850–2010): Standard for property specification language (PSL). IEC 62531:2012(E) (IEEE Std 1850–2010), pp. 1–184, June 2012

    Google Scholar 

  2. Beyer, D., Keremoglu, M.E.: CPAchecker: a tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184–190. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22110-1_16

    Chapter  Google Scholar 

  3. Ciortea, L., Zamfir, C., Bucur, S., Chipounov, V., Candea, G.: Cloud9: a software testing service. SIGOPS Oper. Syst. Rev. 43(4), 5–10 (2010)

    Article  Google Scholar 

  4. Clarke, E.M.: SAT-based counterexample guided abstraction refinement. In: Bošnački, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, p. 1. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-46017-9_1

    Chapter  Google Scholar 

  5. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982). https://doi.org/10.1007/BFb0025774

    Chapter  Google Scholar 

  6. de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24

    Chapter  Google Scholar 

  7. Duan, Z.: Temporal Logic and Temporal Logic Programming. Science Press, Beijing (2005)

    Google Scholar 

  8. Duan, Z., Tian, C.: A unified model checking approach with projection temporal logic. In: Liu, S., Maibaum, T., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 167–186. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-88194-0_12

    Chapter  Google Scholar 

  9. Hao, K., Duan, Z.: Traceable automata. Chin. J. Comput. 5, 340–348 (1990)

    MATH  Google Scholar 

  10. Kesten, Y., Pnueli, A.: A complete proof system for QPTL. J. Logic Comput. 12(5), 701–745 (1995)

    Article  MathSciNet  Google Scholar 

  11. Kobayashi, N., Luke Ong, C.H.: A type system equivalent to the modal mu-calculus model checking of higher-order recursion schemes. In: IEEE Symposium on Logic in Computer Science, 2009. LICS 2009, pp. 179–188 (2009)

    Google Scholar 

  12. Wang, M., Tian, C., Zhang, N., Duan, Z., Yao, C.: Translating C programs to MSVL programs. https://arxiv.org/abs/1809.00959 (2018)

  13. Wang, X., Tian, C., Duan, Z., Zhao, L.: MSVL: a typed language for temporal logic programming. Front. Comput. Sci. 11(5), 762–785 (2017)

    Article  Google Scholar 

  14. Yang, K., Duan, Z., Tian, C., Zhang, N.: A compiler for MSVL and its applications. Theoretical Computer Science (2017). https://doi.org/10.1016/j.tcs.2017.07.032

  15. Zhang, N., Duan, Z., Tian, C.: Model checking concurrent systems with MSVL. SCI. CHINA Inf. Sci. 59(11), 118101 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computing Theory and Technology, and ISN Laboratory, Xidian University, Xi’an, 710071, China

    Nan Zhang, Zhenhua Duan & Cong Tian

  2. Department of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen, 518055, China

    Hongwei Du

Authors
  1. Nan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhenhua Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cong Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hongwei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhenhua Duan .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Shaojie Tang

  2. University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

  3. University of California, Davis, Davis, CA, USA

    David Woodruff

  4. Texas A&M University, College Station, TX, USA

    Sergiy Butenko

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, N., Duan, Z., Tian, C., Du, H. (2018). A Novel Approach to Verifying Context Free Properties of Programs. In: Tang, S., Du, DZ., Woodruff, D., Butenko, S. (eds) Algorithmic Aspects in Information and Management. AAIM 2018. Lecture Notes in Computer Science(), vol 11343. Springer, Cham. https://doi.org/10.1007/978-3-030-04618-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-04618-7_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-04617-0

  • Online ISBN: 978-3-030-04618-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation