Skip to main content
SpringerLink
Log in

Fun with Formal Methods for Better Education

  • Conference paper
  • First Online:
Formal Methods – Fun for Everybody (FMFun 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1301))

Included in the following conference series:

  • 344 Accesses

Abstract

Is there a need to popularize Formal Methods in Software Engineering? Maybe industrial demand in Formal Methods is the best way to explain their utility and importance? – We try to argue educational and emotional role of popularization for a better comprehension and a positive attitude to Formal Methods and discuss several Math Olympiad problems that can be solved using Formal Methods (while, unfortunately, Mathematical education suffers of lack of Theoretical Computer science curricular) .

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

Similar content being viewed by others

References

  1. Curzon, P., McOwan, P.: Teaching formal methods using magic tricks. In: Contributed talk at the CAV Workshop Fun With Formal Methods, St.Petersburg, Russia, 13 July 2013. http://www.chi-med.ac.uk/publicdocs/WP122.pdf. Accessed 20 Jan 2020

  2. Dijkstra, E.W.: On a cultural gap. Math. Intell. 8(1), 48–52 (1986). https://doi.org/10.1007/BF03023921

    Article  MATH  Google Scholar 

  3. Ershov, A.P.: Aesthetics and the human factor in programming. Commun. ACM 15(7), 501–505 (1972)

    Google Scholar 

  4. Ershov, A.P.: Programming as the second literacy (1980) (In Russian). http://ershov.iis.nsk.su/ru/second_literacy/article. Accessed 20 Jan 2020

  5. Ershov, A.P., Knuth, D.E. (eds.): Algorithms in Modern Mathematics and Computer Science. LNCS, vol. 122. Springer, Heidelberg (1981). https://doi.org/10.1007/3-540-11157-3

    Book  MATH  Google Scholar 

  6. Floyd, R.W.: Assigning Meaning to Programs. In: Proceedings of Symposium on Applied Mathematics, vol 19, pp. 19–32. Amer. Math. Soc. (1967)

    Google Scholar 

  7. Furia, C.A., Nordio, M., Polikarpova, N., Tschannen, J.: AutoProof: auto-active functional verification of object-oriented programs. Int. J. Softw. Tools Technol. Transfer 19(6) 697–716 (2017)

    Google Scholar 

  8. Gay, S.J.: Cables, trains and types. In: Chris Hankin’s Festschrift (to appear). http://www.dcs.gla.ac.uk/~simon/publications/CablesTrainsTypes.pdf. Accessed 20 Jan 2020

  9. Gries, D.: The Science of Programming. Monographs in Computer Science. Springer-Verlag, New York (1981). https://doi.org/10.1007/978-1-4612-5983-1

    Book  MATH  Google Scholar 

  10. Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576–580 (1969)

    Article  Google Scholar 

  11. Holzmann, G.J.: Mars code. Commun. ACM 57(2), 64–73 (2014)

    Article  Google Scholar 

  12. Karpov, Y.G.: Model checking: verification of concurrent and distributed systems. BHV-Petersburg (2010) (In Russian)

    Google Scholar 

  13. Khazeev, M., Mazzara, M., De Carvalho, D., Aslam, H.: Towards a broader acceptance of formal verification tools: the role of education. arXiv:1906.01430 [cs.SE]. https://arxiv.org/abs/1906.01430. Accessed 20 Jan 2020

  14. Knuth, D.E.: Computer science and its relation to mathematics. Am. Math. Mon. 81(4), 323–343 (1974)

    Article  MathSciNet  Google Scholar 

  15. Knuth, D.E.: Textbook Examples of Recursion. https://arxiv.org/pdf/cs/9301113.pdf (1991). Accessed 20 Jan 2020

  16. Knuth, D.E.: The Art of Computer Programming, Volumes 1–3 Boxed Set, 2nd edn. Addison-Wesley, Reading (1998)

    Google Scholar 

  17. Lisitsa, A.: Tackling Fibonacci words puzzles by finite countermodels. In: Contributed talk at the CAV Workshop Fun With Formal Methods, St.Petersburg, Russia, 13 July 2013. http://cgi.csc.liv.ac.uk/~alexei/Fibonacci_Challenge/fun2013.pdf. Accessed 20 Jan 2020

  18. Logas, H., Kirchner, F., Murray, J., Schaf, M., Whitehead, E.J. (Jr.): Chekofv: crowd-sourced formal verification. In: Contributed talk at the CAV Workshop Fun With Formal Methods, Vienna, Austria, 13 July 2014

    Google Scholar 

  19. Murray, J., Whitehead, J., Kirchner, F.: Crowd-sourced help with emergent knowledge for optimized formal verification (CHEKOFV). SRI INTERNATIONAL, March 2016, FINAL TECHNICAL REPORT. https://users.soe.ucsc.edu/~ejw/papers/Chekofv%20Final%20Report%20Part%20A.pdf. Accessed 20 Jan 2020

  20. Parnas, D.L.: Really rethinking “Formal Methods”. IEEE Comput. 43(1), 28–34 (2010)

    Article  Google Scholar 

  21. Rushby, J.: The ontological argument in PVS. In: Invited talk at the CAV Workshop Fun With Formal Methods, St.Petersburg, Russia, 13 July 2013. http://www.csl.sri.com/users/rushby/papers/ontological.pdf. Accessed 20 Jan 2020

  22. Shilov, N.V.: Etude on recursion elimination. Model. Anal. Inf. Syst. 25(5), 549–560 (2018)

    Article  MathSciNet  Google Scholar 

  23. Shilov, N.V.: Using esoteric language for teaching formal semantics. Contributed talk at the CAV Worthe same languagekshop Fun With Formal Methods, Vienna, Austria, 13 July 2014

    Google Scholar 

  24. Shilov, N.V.: Make formal semantics popular and useful. Bull. Novosibirsk Comput. Center Ser. Comput. Sci. IIS Special Issue 32, 107–126 (2011)

    Google Scholar 

  25. Shilov, N.V., Shilova, S.O.: On mathematical contents of computer science contests. In: Enhancing University Mathematics: Proceedings of the First KAIST International Symposium on Teaching. American Society, CBMS Issues in Mathematics Education, vol. 14, 193–204 (2007)

    Google Scholar 

  26. Shilov, N.V., Yi, K.: Engaging students with theory through ACM collegiate programming contests. Commun. ACM 45(9) (2002)

    Google Scholar 

  27. Uspensky, A.V.: Mathematics Apology. Amphora, Sant-Petersburg (2009) (In Russian)

    Google Scholar 

  28. Vardi, M.Y.: Publish and Perish. Commun. ACM 63(1), 7 (2020)

    Google Scholar 

  29. A.M. Turing Award Winners. http://amturing.acm.org/award_winners/clarke_1167964.cfm, http://amturing.acm.org/award_winners/emerson_1671460.cfm. http://amturing.acm.org/award_winners/sifakis_1701095.cfm. Accessed 20 Jan 2020

  30. Fun With Formal Methods (2013). http://www.iis.nsk.su/fwfm2013. Accessed 20 Jan 2020

  31. Fun With Formal Methods (2014). http://www.easychair.org/smart-program/VSL2014/FWFM-cfp.html. Accessed 20 Jan 2020

  32. Fun With Formal Methods (2018). https://persons.iis.nsk.su/en/FWFM2018. Accessed 20 Jan 2020

  33. Fun With Formal Methods (2019). https://persons.iis.nsk.su/en/FWFM19. Accessed 20 Jan 2020

  34. COVID-19 pandemic. https://en.wikipedia.org/wiki/COVID-19_pandemic. Accessed 15 June 2020

  35. Tools 50+1 conference. Day 3. Fun With Formal Method Workshop. https://www.youtube.com/watch?v=QqLRUWD9Ngg. Accessed 20 Jan 2020

  36. PVS specification and verification system. https://github.com/SRI-CSL/PVS/. Accessed 20 Jan 2020

  37. CS4F. www.cs4fn.org. Accessed 20 Jan 2020

  38. Esoteric Programming Languages. https://en.wikipedia.org/wiki/Esoteric_programming_language. Accessed 20 Jan 2020

  39. International Mathematical Olympiad. https://www.imo-official.org/default.aspx. Accessed 20 Jan 2020

  40. Problems (with solutions). In: 60th International Mathematical Olympiad. Bath - UK, 11th-22nd July 2019. https://www.imo2019.uk/wp-content/uploads/2018/07/solutions-r856.pdf. Accessed 20 Jan 2020

  41. Solving An Insanely Hard Problem For High School Students. MindYourDecisions - Math videos by Presh Talwalkar. https://www.youtube.com/watch?v=uJqbHaFqjmI. Accessed 15 June 2020

  42. ICPC. International Colegiate Programming Contest. https://icpc.baylor.edu/. Accessed 20 Jan 2020

  43. IMO Grand Challenge. https://imo-grand-challenge.github.io/. Accessed 20 Jan 2020

Download references

Author information

Authors and Affiliations

  1. Innoplolis University, 1, Universitetskaya Str., Innopolis, 420500, Russia

    Nikolay V. Shilov, Evgeniy Muravev & Svetlana Shilova

Authors
  1. Nikolay V. Shilov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evgeniy Muravev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Svetlana Shilova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nikolay V. Shilov .

Editor information

Editors and Affiliations

  1. Nazarbayev University, Nur-Sultan, Kazakhstan

    Antonio Cerone

  2. Swansea University, Swansea, UK

    Markus Roggenbach

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shilov, N.V., Muravev, E., Shilova, S. (2021). Fun with Formal Methods for Better Education. In: Cerone, A., Roggenbach, M. (eds) Formal Methods – Fun for Everybody. FMFun 2019. Communications in Computer and Information Science, vol 1301. Springer, Cham. https://doi.org/10.1007/978-3-030-71374-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-71374-4_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-71373-7

  • Online ISBN: 978-3-030-71374-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation