{"id":16313917,"url":"https://github.com/johnwickerson/hsv","last_synced_at":"2026-02-13T05:34:53.421Z","repository":{"id":161654096,"uuid":"423360700","full_name":"johnwickerson/HSV","owner":"johnwickerson","description":null,"archived":false,"fork":false,"pushed_at":"2025-05-15T19:43:04.000Z","size":49330,"stargazers_count":29,"open_issues_count":0,"forks_count":19,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-05-15T20:32:58.716Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Isabelle","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/johnwickerson.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2021-11-01T06:31:11.000Z","updated_at":"2025-05-15T19:43:07.000Z","dependencies_parsed_at":"2023-06-14T11:15:21.519Z","dependency_job_id":"19e09533-30f6-4dfc-ae04-b19dabfc77d5","html_url":"https://github.com/johnwickerson/HSV","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/johnwickerson/HSV","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/johnwickerson%2FHSV","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/johnwickerson%2FHSV/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/johnwickerson%2FHSV/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/johnwickerson%2FHSV/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/johnwickerson","download_url":"https://codeload.github.com/johnwickerson/HSV/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/johnwickerson%2FHSV/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274231033,"owners_count":25245687,"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":"2025-09-08T02:00:09.813Z","response_time":121,"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-10T21:52:41.367Z","updated_at":"2026-02-13T05:34:53.415Z","avatar_url":"https://github.com/johnwickerson.png","language":"Isabelle","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Hardware \u0026 Software Verification\n\nThis is the homepage of the above-named module, which is offered to MSc and 4th-year MEng students at Imperial College London.\n\n* The module is run by [Dr John Wickerson](https://johnwickerson.github.io/).\n\n* Worksheets are available for [Dafny](dafny), [Isabelle](isabelle), and [SymbiYosys](yosys).\n\n* All coursework is to be done in pairs. Please use [this spreadsheet from October 2025](https://imperiallondon.sharepoint.com/:x:/r/sites/elec70056-202510/Shared%20Documents/General/pairings.xlsx?d=we69152f13a3b464f9027c023502c868d\u0026csf=1\u0026web=1\u0026e=opwcVl) to support this. The spreadsheet contains two sheets. The first sheet contains students who have already paired up. The second sheet contains students who are still looking for a pair. Please enter yourself initially onto the second sheet, and then once you have found a pair, please move yourselves over to the first sheet.\n\n* All coursework is due at 15:00 on Friday 12 December 2025 (the last day of Autumn term).\n\n* The Isabelle coursework for 2025 is [now available](isabelle/2025).\n\n* The Dafny coursework for 2025 is [now available](dafny/2025).\n\n* The SymbiYosys coursework for 2025 is [now available](yosys/2025).\n\n## Summary of past coursework questions\n\nClick on the links below to access the coursework questions (with model answers) from previous years.\n\n- [Dafny 2019](dafny/2019): bubble sort; selection sort; insertion sort; shellsort; Johnsort.\n\n- [Isabelle 2019](isabelle/2019): irrationality of 2*sqrt(2); L-numbers; pyramidal numbers; `opt-NOT` is effective; `opt-NOT` is idempotent; `opt-DM` is sound; `opt-DM` and `opt-NOT` never increase area; `opt-DM` and `opt-NOT` never increase delay; constant folding; circuits with fan-out.\n\n- [Dafny 2020](dafny/2020): zeroing an array; backwards selection sort; recursive selection sort; early-termination bubble sort; cocktail-shaker sort.\n\n- [Isabelle 2020](isabelle/2020): irrationality of 3/sqrt(2); centred pentagonal numbers; Lucas numbers; balanced circuits; NAND gates.\n\n- [Dafny 2021](dafny/2021): array of multiples of two; exchange sort; Fung sort; odd/even sort; bubble sort with triples.\n\n- [Isabelle 2021](isabelle/2021): factorising circuits; divisibility of powers; binary coded decimal.\n\n- [Dafny 2022](dafny/2022): counting squares in a grid; binary search; quicksort.\n\n- [Isabelle 2022](isabelle/2022): full adders; fifth powers; `opt-ident` is sound and never increases area; `opt-redundancy` is sound and never increases area.\n\n- [Dafny 2023](dafny/2023): integer square roots; analogue-to-digital conversion; stupidsort.\n\n- [Isabelle 2023](isabelle/2023): introducing and eliminating XOR gates; lists of clones; analogue-to-digital conversion; Fermat's Last Theorem.\n\n- [SymbiYosys 2023](yosys/2023): binary-to-BCD conversion; verifying a circular queue.\n\n- [Dafny 2024](dafny/2024): verifying SAT solvers.\n\n- [Isabelle 2024](isabelle/2024): introducing and eliminating NAND gates; conversions between numbers and lists of digits; verifying SAT solvers.\n\n- [SymbiYosys 2024](yosys/2024): verifying a multiplier.\n\n- [Isabelle 2025](isabelle/2025): estimating computational complexity of `opt-NOT` and `factorise`; proving that even-length palindromes are divisible by 11; reducing SAT queries to 3SAT form.\n\n- [Dafny 2025](dafny/2025): doublesort.\n\n- [SymbiYosys 2025](yosys/2025): verifying a divider.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjohnwickerson%2Fhsv","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjohnwickerson%2Fhsv","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjohnwickerson%2Fhsv/lists"}