Write Dafny programs with formal specifications and automated proofs.
npx skills add https://github.com/rainoftime/pl-skills --skill dafny-verifier
Please help me install this Agent Skill. Skill: dafny-verifier Source: https://github.com/rainoftime/pl-skills/tree/main/dafny-verifier Command: npx skills add https://github.com/rainoftime/pl-skills --skill dafny-verifier
This Skill enables the creation of software that is mathematically proven to be correct, eliminating bugs and ensuring reliability for critical applications.
Use the dafny-verifier skill to write a Dafny program that proves the correctness of a sorting algorithm.
High-intent search queries and answers about installing and using this skill.
You can formally verify program correctness by writing code in the Dafny language, integrating formal specifications and proofs that are automatically checked to guarantee software reliability and eliminate bugs in critical applications.
Formal verification is the process of using mathematical proofs to guarantee software correctness. You need formal verification for software engineering tasks requiring high assurance, such as developing critical algorithms, secure systems, and certified libraries where program termination and functional correctness are paramount.
To write a verified Dafny program, you define the sorting algorithm alongside formal specifications and proofs. The automated system then checks these proofs to mathematically guarantee that the algorithm behaves exactly as intended and satisfies functional correctness constraints.
Yes, you can use automated verification for secure systems and certified libraries. By writing programs in Dafny with integrated formal specifications and proofs, you achieve high assurance of functional correctness and guaranteed program termination for critical software.
Dafny verification relies on underlying Hoare logic and SMT solver interfaces to automatically check formal specifications and proofs. You write the Dafny code with its proofs, and these dependencies handle the automated mathematical validation of functional correctness.
kotaroyamameConvert VDM-SL proof obligations to SMT-LIB and verify with Z3.
nicholls-incGenerate Dafny implementations that satisfy specified formal properties.
rainoftimeDefine program correctness using Hoare logic and weakest preconditions.
rainoftimeProve loop termination by synthesizing and verifying ranking functions.
