Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 607013, 12 pages
http://dx.doi.org/10.1155/2015/607013
Research Article

A Deductive Approach towards Reasoning about Algebraic Transition Systems

1School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
2Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi University for Nationalities, Nanning 530006, China
3High Performance Network Lab, Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China

Received 7 June 2015; Accepted 16 August 2015

Academic Editor: Krishnaiyan Thulasiraman

Copyright © 2015 Jun Fu 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. J.-P. Katoen, “Lablelled transition systems,” in Model-Based Testing of Reactive Systems, vol. 3472 of Lecture Notes in Computer Science, chapter 29, pp. 615–616, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  2. V. D’Silva, D. Kroening, and G. Weissenbacher, “A survey of automated techniques for formal software verification,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 27, no. 7, pp. 1165–1178, 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. R. M. Keller, “Formal verification of parallel programs,” Communications of the ACM, vol. 19, no. 7, pp. 371–384, 1976. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Sankaranarayanan, H. B. Sipma, and Z. Manna, “Non-linear loop invariant generation using grobner bases,” ACM SIGPLAN Notices, vol. 39, no. 1, pp. 318–329, 2004. View at Publisher · View at Google Scholar
  5. D. A. Cox, J. Little, and D. O’Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, vol. 10, Springer, 2007.
  6. L. Lamport, “The temporal logic of actions,” ACM Transactions on Programming Languages and Systems, vol. 16, no. 3, pp. 872–923, 1994. View at Publisher · View at Google Scholar
  7. M. Fitting, “First-order logic and automated theorem proving,” Studia Logica, vol. 61, no. 2, pp. 300–302, 1998. View at Google Scholar
  8. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking, MIT Press, 1999.
  9. C. Baier and J.-P. Katoen, Principles of Model Checking, MIT Press, Cambridge, Mass, USA, 2008.
  10. T. A. Henzinger, R. Majumdar, and J.-F. Raskin, “A classification of symbolic transition systems,” ACM Transactions on Computational Logic, vol. 6, no. 1, pp. 1–32, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Chutinan and B. H. Krogh, “Verification of infinite-state dynamic systems using approximate quotient transition systems,” IEEE Transactions on Automatic Control, vol. 46, no. 9, pp. 1401–1410, 2001. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Platzer, “Differential dynamic logic for hybrid systems,” Journal of Automated Reasoning, vol. 41, no. 2, pp. 143–189, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. B. Beckert and S. Schlager, “A sequent calculus for first-order dynamic logic with trace modalities,” in Automated Reasoning, vol. 2083 of Lecture Notes in Computer Science, pp. 626–641, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  14. E. M. Clarke and J. M. Wing, “Formal methods: state of the art and future directions,” ACM Computing Surveys, vol. 28, no. 4, pp. 626–643, 1996. View at Publisher · View at Google Scholar · View at Scopus
  15. D. Harel, D. Kozen, and J. Tiuryn, Dynamic Logic, Foundations of Computing Series, MIT Press, Cambridge, Mass, USA, 2000.
  16. F. Kroger and S. Merz, “Verification of state systems,” in Temporal Logic and State Systems, Texts in Theoretical Computer Science, pp. 213–256, Springer, Berlin, Germany, 2008. View at Google Scholar
  17. S. Merz, “The specification language TLA+,” in Logics of Specification Languages, Monographs in Theoretical Computer Science, chapter 8, pp. 401–451, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  18. K. Chaudhuri, D. Doligez, L. Lamport, and S. Merz, “Verifying safety properties with the TLA+ proof system,” in Automated Reasoning, J. Giesl and R. Hahnle, Eds., vol. 6173 of Lecture Notes in Computer Science, pp. 142–148, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  19. D. Cousineau, D. Doligez, L. Lamport et al., “TLA+ proofs,” in Proceedings of the 18th International Symposium on Formal Methods (FM ’12), G. Dimitra and M. Dominique, Eds., vol. 7436, pp. 147–154, Springer, 2012. View at Google Scholar
  20. Z. Manna and A. Pnueli, Temporal Verification of Reactive Systems: Safety, vol. 2, Springer, New York, NY, USA, 1995. View at Publisher · View at Google Scholar
  21. Z. Manna and H. B. Sipma, “Deductive verification of hybrid systems using STeP,” in Hybrid Systems: Computation and Control, vol. 1386 of Lecture Notes in Computer Science, pp. 305–318, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  22. A. R. Bradley and Z. Manna, The Calculus of Computation: Decision Procedures with Applications to Verification, Springer, Berlin, Germany, 2007.
  23. A. Platzer, “The complete proof theory of hybrid systems,” in Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science (LICS ’12), pp. 541–550, IEEE Computer Society, Los Alamitos, Calif, USA, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. B. Mishra, Algorithmic Algebra, Springer, 1993. View at Publisher · View at Google Scholar
  25. S. A. Kripke, “Semantical considerations on modal logic,” Acta Philosophica Fennica, vol. 16, pp. 83–94, 1963. View at Google Scholar
  26. R. Hähnle and P. H. Schmitt, “The liberalized δ-rule in free variable semantic tableaux,” Journal of Automated Reasoning, vol. 13, no. 2, pp. 211–221, 1994. View at Publisher · View at Google Scholar · View at Scopus
  27. C. Dunchev, A. Leitsch, M. Rukhaia, and D. Weller, “Cut-elimination and proof schemata,” in Logic, Language, and Computation, M. Aher, D. Hole, E. Jeřábek, and C. Kupke, Eds., vol. 8984 of Lecture Notes in Computer Science, pp. 117–136, Springer, Berlin, Germany, 2015. View at Publisher · View at Google Scholar
  28. J. H. Gallier, Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper & Row Publishers, 2003.
  29. R. M. Smullyan, Gödel’s Incompleteness Theorems, Oxford University Press, 1992. View at MathSciNet
  30. S. Sankaranarayanan, H. B. Sipma, and Z. Manna, “Constructing invariants for hybrid systems,” in Hybrid Systems: Computation and Control, vol. 2993 of Lecture Notes in Computer Science, pp. 539–554, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  31. R. Rebiha, A. Moura, and N. Matringe, “Generating invariants for non-linear loops by linear algebraic methods,” Formal Aspects of Computing, 2015. View at Publisher · View at Google Scholar
  32. A. R. Bradley and Z. Manna, “Property-directed incremental invariant generation,” Formal Aspects of Computing, vol. 20, no. 4-5, pp. 379–405, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  33. L. González-Vega, “A combinatorial algorithm solving some quantifier elimination problems,” in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson, Eds., Texts and Monographs in Symbolic Computation, pp. 365–375, Springer, Vienna, Austria, 1998. View at Publisher · View at Google Scholar
  34. G. Pan and M. Y. Vardi, “Symbolic techniques in satisfiability solving,” Journal of Automated Reasoning, vol. 35, no. 1–3, pp. 25–50, 2005. View at Publisher · View at Google Scholar
  35. V. Weispfenning, “A new approach to quantifier elimination for real algebra,” in Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson, Eds., Texts and Monographs in Symbolic Computation, pp. 376–392, Springer, Vienna, Austria, 1998. View at Publisher · View at Google Scholar