{"id":21565085,"url":"https://github.com/mrrodrigo/formal-stack-implementation","last_synced_at":"2026-02-15T03:32:48.117Z","repository":{"id":67811747,"uuid":"370188597","full_name":"mrRodrigo/Formal-Stack-implementation","owner":"mrRodrigo","description":"Build formal specifications and checks in Dafny for Limited Stack structure.","archived":false,"fork":false,"pushed_at":"2021-05-24T00:58:11.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-10-08T19:08:45.959Z","etag":null,"topics":["dafny","formal-verification","formal-verification-methods"],"latest_commit_sha":null,"homepage":"","language":"Dafny","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/mrRodrigo.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}},"created_at":"2021-05-24T00:48:10.000Z","updated_at":"2021-05-24T01:00:05.000Z","dependencies_parsed_at":"2023-02-22T10:45:12.304Z","dependency_job_id":null,"html_url":"https://github.com/mrRodrigo/Formal-Stack-implementation","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mrRodrigo/Formal-Stack-implementation","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrRodrigo%2FFormal-Stack-implementation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrRodrigo%2FFormal-Stack-implementation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrRodrigo%2FFormal-Stack-implementation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrRodrigo%2FFormal-Stack-implementation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mrRodrigo","download_url":"https://codeload.github.com/mrRodrigo/Formal-Stack-implementation/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrRodrigo%2FFormal-Stack-implementation/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29466929,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-15T01:01:38.065Z","status":"online","status_checked_at":"2026-02-15T02:00:07.449Z","response_time":118,"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":["dafny","formal-verification","formal-verification-methods"],"created_at":"2024-11-24T10:18:19.253Z","updated_at":"2026-02-15T03:32:48.099Z","avatar_url":"https://github.com/mrRodrigo.png","language":"Dafny","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Formal-Stack-implementation\n\n## Dafny\nDafny is a programming language with a program verifier. As you type in your program, the verifier constantly looks over your shoulders and flags any errors.\n[Documentation](https://rise4fun.com/Dafny/tutorialcontent) and [Github](https://github.com/dafny-lang/dafny).\n\n\n### Objetive\n\nBuild formal specifications and checks in Dafny for Limited Stack structure.\n\n\n\nConstructor must instantiate an empty stack from the maximum stack size information. \n\n- Add an element at the top of the stack and return true, if added, or false, if the stack is already full \n- Remove an element from the top of the stack, if it is not empty. \n- Read the top value of the stack, without removing it. \n- Check whether the stack is full or not, returning true or false. \n- Check whether the stack is empty or not, returning true or false. Inform the number of elements stored in the pile \n- Inform the maximum pile size • Reverse the order of the pile elements.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrrodrigo%2Fformal-stack-implementation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmrrodrigo%2Fformal-stack-implementation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrrodrigo%2Fformal-stack-implementation/lists"}