Table of Contents Author Guidelines Submit a Manuscript
Wireless Communications and Mobile Computing
Volume 2018 (2018), Article ID 3193974, 8 pages
https://doi.org/10.1155/2018/3193974
Research Article

An SAT-Based Method to Multithreaded Program Verification for Mobile Crowdsourcing Networks

1College of Computer, National University of Defense Technology, Changsha, China
2The University of British Columbia, Vancouver, BC, Canada V6T 1Z4

Correspondence should be addressed to Wanxia Qu; nc.ude.tdun@aixnawuq

Received 23 September 2017; Revised 24 December 2017; Accepted 1 January 2018; Published 28 January 2018

Academic Editor: Edith Ngai

Copyright © 2018 Long Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Yang, K. Zhang, J. Ren, and X. Shen, “Security and privacy in mobile crowdsourcing networks: challenges and opportunities,” IEEE Communications Magazine, vol. 53, no. 8, pp. 75–81, August 2015. View at Publisher · View at Google Scholar
  2. Y. Guo, X. Hu, B. Hu, J. Cheng, M. Zhou, and R. Y. Kwok, “Mobile cyber physical systems: current challenges and future networking applications,” IEEE Access, pp. 1–1. View at Publisher · View at Google Scholar
  3. K. Parshotam, “Crowd computing: a literature review and definition,” in Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, pp. 121–130, the Association for Computing Machinery, East London, South Africa, October 2013. View at Publisher · View at Google Scholar
  4. Z. Ning, X. Hu, Z. Chen et al., “A cooperative quality-aware service access system for social internet of vehicles,” IEEE Internet of Things Journal, pp. 1–1. View at Publisher · View at Google Scholar
  5. R. K. Ganti, F. Ye, and H. Lei, “Mobile crowdsensing: current state and future challenges,” IEEE Communications Magazine, vol. 49, no. 11, pp. 32–39, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. X. Hu, T. H. S. Chu, H. C. B. Chan, and V. C. M. Leung, “Vita: a crowdsensing-oriented mobile cyber-physical system,” IEEE Transactions on Emerging Topics in Computing, vol. 1, no. 1, pp. 148–165, 2013. View at Publisher · View at Google Scholar
  7. X. Hu, T. H. S. Chu, V. C. M. Leung, E. C.-H. Ngai, P. Kruchten, and H. C. B. Chan, “A survey on mobile social networks: applications, platforms, system architectures, and future research directions,” IEEE Communications Surveys & Tutorials, vol. 17, no. 3, pp. 1557–1581, 2014. View at Publisher · View at Google Scholar
  8. X. Hu, J. Zhao, B.-C. Seet, V. C. M. Leung, T. H. S. Chu, and H. Chan, “S-aframe: agent-based multilayer framework with context-aware semantic service for vehicular social networks,” IEEE Transactions on Emerging Topics in Computing, vol. 3, no. 1, pp. 44–63, 2015. View at Publisher · View at Google Scholar · View at Scopus
  9. P. A. Abdulla, K. Cerans, B. Jonsson, and Y.-K. Tsay, “General decidability theorems for infinite-state systems,” in Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science (LICS’96), pp. 313–321, 1996. View at MathSciNet
  10. A. Finkel and P. Schnoebelen, “Well-structured transition systems everywhere!,” Theoretical Computer Science, vol. 256, no. 1-2, pp. 63–92, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. A. Kaiser, D. Kroening, and T. Wahl, “Efficient coverability analysis by proof minimization,” in C{ONCUR} 2012---concurrency theory, vol. 7454 of Lecture Notes in Comput. Sci., pp. 500–515, Springer, Heidelberg, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. G. Ciardo, “Petri nets with marking-dependent arc cardinality: properties and analysis,” in Application and theory of Petri nets 1994 (Zaragoza, 1994), vol. 815 of Lecture Notes in Comput. Sci., pp. 179–198, Springer, Berlin, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  13. C. Dufourd, A. Finkel, and P. Schnoebelen, “Reset nets between decidability and undecidability,” in International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci., pp. 103–115, Springer, Berlin, Germany, 1998. View at Google Scholar · View at MathSciNet
  14. J. Esparza and M. Nielsen, “Decidability Issues for Petri Nets,” BRICS Report Series, vol. 1, no. 8, 1994. View at Publisher · View at Google Scholar
  15. S. Schmitz and P. Schnoebelen, “The power of well-structured systems,” in C{ONCUR} 2013---concurrency theory, vol. 8052 of Lecture Notes in Comput. Sci., pp. 5–24, Springer, Heidelberg, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. G. Geeraerts, J.-F. Raskin, and L. Van Begin, “Expand, enlarge, and check: new algorithms for the coverability problem of WSTS,” in FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, vol. 3328 of Lecture Notes in Comput. Sci., pp. 287–298, Springer, Berlin, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  17. E. A. Emerson and K. S. Namjoshi, “On model checking for non-deterministic infinite-state systems,” in Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, pp. 70–80, IEEE, 1998. View at MathSciNet
  18. J. Esparza, A. Finkel, and R. Mayr, “On the verification of broadcast protocols,” in Proceedings of the 14th Symposium on Logic in Computer Science, pp. 352–359, IEEE, 1999. View at MathSciNet
  19. P. A. Abdulla, A. Bouajjani, and B. Jonsson, “On-the-fly analysis of systems with unbounded, lossy fifo channels,” in Proceedings of the International Conference on Computer Aided Verification, pp. 305–318, Springer, 1998. View at MathSciNet
  20. J. Bingham and A. J. Hu, “Empirically Efficient Verification for a Class of Infinite-State Systems,” in Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 3440, pp. 77–92, Springer, 2005. View at Publisher · View at Google Scholar
  21. J. Kloos, R. Majumdar, F. Niksic, and R. Piskac, “Incremental, inductive coverability,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 8044, pp. 158–173, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Kaiser, D. Kroening, and T. Wahl, “A widening approach to multithreaded program verification,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 36, no. 4, 2014. View at Publisher · View at Google Scholar · View at Scopus
  23. A. R. Bradley, “SAT-based model checking without unrolling,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 6538, pp. 70–87, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. N. Een, A. Mishchenko, and R. Brayton, “Efficient implementation of property directed reachability,” in Proceedings of the Formal Methods in Computer-Aided Design FMCAD '11, pp. 125–134, November 2011. View at Scopus
  25. S. Graf and H. Saidi, “Construction of abstract state graphs with PVS,” in Computer Aided Verification, vol. 1254 of Lecture Notes in Computer Science, pp. 72–83, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997. View at Publisher · View at Google Scholar
  26. M. A. Colón and T. E. Uribe, “Generating finite-state abstractions of reactive systems using decision procedures,” in Proceedings of the International Conference on Computer Aided Verification, vol. 1998, pp. 293–304, Springer. View at MathSciNet
  27. K. L. McMillan, Symbolic Model Checking, Springer US, Boston, Ma, USA, 1993, 25–60. View at Publisher · View at Google Scholar
  28. R. E. Bryant, “Graph-based algorithms for boolean function manipulation,” IEEE Transactions on Computers, vol. C-35, no. 8, pp. 677–691, 1986. View at Publisher · View at Google Scholar · View at Scopus
  29. J. Esparza, R. Ledesma-Garza, R. Majumdar, P. Meyer, and F. Niksic, “An SMT-based approach to coverability analysis,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 8559, pp. 603–619, 2014. View at Publisher · View at Google Scholar · View at Scopus
  30. T. Murata, “Petri nets: properties, analysis and applications,” Proceedings of the IEEE, vol. 77, no. 4, pp. 541–580, 1989. View at Publisher · View at Google Scholar · View at Scopus
  31. W. Reisig, “Understanding Petri nets: Modeling techniques, analysis methods, case studies,” Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies, pp. 1–230, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. K. Athanasiou, P. Liu, and T. Wahl, “Unbounded-thread program verification using thread-state equations,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 9706, pp. 516–531, 2016. View at Publisher · View at Google Scholar · View at Scopus
  33. G. Higman, “Ordering by Divisibility in Abstract Algebras,” Proceedings of the London Mathematical Society, vol. 3-2, no. 1, pp. 326–336, 1952. View at Publisher · View at Google Scholar · View at Scopus
  34. E. Clarke, D. Kroening, N. Sharygina, and K. Yorav, “SATABS: SAT-based predicate abstraction for ANSI-C,” in Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), vol. 3440 of Lecture Notes in Computer Science, pp. 570–574, Springer Verlag. View at Scopus
  35. L. Zhang, W. Hu, W. Qu, Y. Guo, and S. Li, “A Formal Approach to Verify Parameterized Protocols in Mobile Cyber-Physical Systems,” Mobile Information Systems, vol. 2017, Article ID 5731678, 2017. View at Publisher · View at Google Scholar · View at Scopus
  36. E. D'Osualdo, J. Kochems, and C.-H. L. Ong, “Automatic verification of Erlang-style concurrency,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 7935, pp. 454–476, 2013. View at Publisher · View at Google Scholar · View at Scopus