Dafny is an imperative object-based language with built-in specification constructs. The Dafny static program verifier can be used to verify the functional correctness of programs.The Dafny programming language is designed to support the static verification of programs. It is imperative, sequential, supports generic classes, dynamic allocation, and inductive datatypes, and builds in specification constructs. The specifications include pre- and postconditions, frame specifications (read and write sets), and termination metrics. To further support specifications, the language also offers updatable ghost variables, recursive functions, and types like sets and sequences. Specifications and ghost constructs are used only during verification; the compiler omits them from the executable code.The Dafny verifier is run as part of the compiler. As such, a programmer interacts with it much in the same way as with the static type checker—when the tool produces errors, the programmer responds by changing the program’s type declarations, specifications, and statements.

References in zbMATH (referenced in 24 articles , 2 standard articles )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Armstrong, Alasdair; Gomes, Victor B.F.; Struth, Georg: Building program construction and verification tools from algebraic principles (2016)
  2. Filli^atre, Jean-Christophe; Gondelman, Léon; Paskevich, Andrei: The spirit of ghost code (2016)
  3. Tan, Jiaqi; Tay, Hui Jun; Gandhi, Rajeev; Narasimhan, Priya: AUSPICE-R: automatic safety-property proofs for realistic features in machine code (2016)
  4. Wiik, Jonatan; Boström, Pontus: Contract-based verification of MATLAB-style matrix programs (2016)
  5. Ahrendt, Wolfgang; Kovács, Laura; Robillard, Simon: Reasoning about loops using Vampire in KeY (2015)
  6. Dalvandi, Mohammadsadegh; Butler, Michael; Rezazadeh, Abdolbaghi: From Event-B models to Dafny code contracts (2015)
  7. Rosén, Dan; Smallbone, Nicholas: TIP: tools for inductive provers (2015)
  8. Kroening, Daniel; Sharygina, Natasha; Tonetta, Stefano; Tsitovich, Aliaksei; Wintersteiger, Christoph M.: Loop summarization using state and transition invariants (2013)
  9. Leino, K.Rustan M.: Automating theorem proving with SMT (2013)
  10. Qin, Shengchao; He, Guanhua; Luo, Chenguang; Chin, Wei-Ngan; Chen, Xin: Loop invariant synthesis in a combined abstract domain (2013)
  11. Reddy, Uday S.: Automata-theoretic semantics of idealized Algol with passive expressions (2013)
  12. Bjørner, Nikolaj: Taking satisfiability to the next level with Z3 (abstract) (2012)
  13. Christakis, Maria; Müller, Peter; Wüstholz, Valentin: Collaborative verification and testing with explicit assumptions (2012)
  14. Leino, K.Rustan M.: Automating induction with an SMT solver (2012)
  15. Leino, K.Rustan M.; Yessenov, Kuat: Stepwise refinement of heap-manipulating code in Chalice (2012)
  16. Nedunuri, Srinivas; Smith, Douglas R.; Cook, William R.: Theory and techniques for synthesizing efficient breadth-first search algorithms (2012)
  17. Parkinson, Matthew J.; Summers, Alexander J.: The relationship between separation logic and implicit dynamic frames (2012)
  18. Böhme, Sascha; Moskal, Michał: Heaps and data structures: a challenge for automated provers (2011)
  19. Bubel, Richard; Hähnle, Reiner; Geilmann, Ulrich: A formalisation of Java strings for program specification and verification (2011)
  20. Garbervetsky, Diego; Gorín, Daniel; Neisen, Ariel: Enforcing structural invariants using dynamic frames (2011)

1 2 next