{"id":17524245,"url":"https://github.com/liyang/stm-proof","last_synced_at":"2026-01-07T05:41:52.544Z","repository":{"id":8423687,"uuid":"10010984","full_name":"liyang/stm-proof","owner":"liyang","description":"Correctness proof of a log-based semantics for software transactional memory with respect to a stop-the-world semantics, using Agda.","archived":false,"fork":false,"pushed_at":"2013-05-13T02:09:15.000Z","size":160,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2023-03-22T22:36:45.029Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/liyang.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-05-12T08:14:22.000Z","updated_at":"2016-10-25T02:00:43.000Z","dependencies_parsed_at":"2022-09-01T18:23:42.226Z","dependency_job_id":null,"html_url":"https://github.com/liyang/stm-proof","commit_stats":null,"previous_names":[],"tags_count":1,"template":null,"template_full_name":null,"purl":"pkg:github/liyang/stm-proof","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liyang%2Fstm-proof","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liyang%2Fstm-proof/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liyang%2Fstm-proof/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liyang%2Fstm-proof/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/liyang","download_url":"https://codeload.github.com/liyang/stm-proof/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/liyang%2Fstm-proof/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28233015,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2026-01-07T02:00:05.975Z","response_time":58,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-10-20T14:07:35.760Z","updated_at":"2026-01-07T05:41:52.518Z","avatar_url":"https://github.com/liyang.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"Correctness proof of a log-based semantics for software transactional memory\nwith respect to a stop-the-world semantics, using Agda.\n\nThe exact version described in chapter 9 of my [thesis][] is [tagged as\nsuch][$thesis]. Futher refinements are on the [master branch][$master],\nincluding compatibility fixes for more recent versions of [Agda][] and/or\n[Nisse's standard library][stdlib].\n\nThis current version typechecks with the development versions of the\naforementioned as of 2013-05-11, but fails with Agda 2.3.2 (released on\n2012-11-12) due to [a couple of][agda#665] [regressions][agda#824].\n\n[thesis]: http://www.cs.nott.ac.uk/~gmh/hu-thesis.pdf\n \"Compiling Concurrency Correctly: Verifying Software Transactional Memory\"\n[$thesis]: https://github.com/liyang/stm-proof/tree/thesis \"tag: thesis\"\n[$master]: https://github.com/liyang/stm-proof/tree/master \"branch: master\"\n[agda]: http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Main.Download \"Agda: is it a dependently-typed programming language? Is it a proof-assistant based on intuitionistic type theory? ¯\\(°_0)/¯ Dunno, lol.\"\n\n[agda#665]: https://code.google.com/p/agda/issues/detail?id=665\n \"auto-dotting can break with records\"\n[agda#824]: https://code.google.com/p/agda/issues/detail?id=824\n \"recCon-NOT-PRINTED in error message\"\n[stdlib]: http://wiki.portal.chalmers.se/agda/pmwiki.php?n=Libraries.StandardLibrary\n \"Agda Standard Library\"\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliyang%2Fstm-proof","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fliyang%2Fstm-proof","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fliyang%2Fstm-proof/lists"}