Lisitsa, A
(2018)
Revisiting mu-puzzle. A case study in finite countermodels verification.
.
![[img]](https://livrepository.liverpool.ac.uk/style/images/fileicons/text.png) |
Text
Revisiting_MU_puzzle__A_case_study_in_finite_countermodels_verification___.pdf - Author Accepted Manuscript Download (193kB) |
Official URL: http://dx.doi.org/10.1007/978-3-030-00250-3_6
Abstract
© 2018, Springer Nature Switzerland AG. In this paper we consider well-known MU puzzle from Goedel, Escher, Bach: An Eternal Golden Braid book by D. Hofstadter, as an infinite state safety verification problem for string rewriting systems. We demonstrate fully automated solution using finite countermodels method (FCM). We highlight advantages of FCM method and compare it with alternatives methods using regular invariants.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Depositing User: | Symplectic Admin |
| Date Deposited: | 19 Oct 2018 09:22 |
| Last Modified: | 04 Feb 2023 08:21 |
| DOI: | 10.1007/978-3-030-00250-3_6 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3027148 |
Dimensions
Dimensions
DimensionsAltmetric
Share
CORE (COnnecting REpositories)