VCC

VCC is a mechanical verifier for concurrent C programs. VCC takes a C program, annotated with function specifications, data invariants, loop invariants, and ghost code, and tries to prove these annotations correct. If it succeeds, VCC promises that your program actually meets its specifications.


References in zbMATH (referenced in 49 articles )

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

1 2 3 next

  1. Filli^atre, Jean-Christophe; Gondelman, Léon; Paskevich, Andrei: The spirit of ghost code (2016)
  2. Jacobs, Bart; Vogels, Frédéric; Piessens, Frank: Featherweight verifast (2015)
  3. Kirchner, Florent; Kosmatov, Nikolai; Prevosto, Virgile; Signoles, Julien; Yakobowski, Boris: Frama-C: a software analysis perspective (2015) ioport
  4. Leino, K.Rustan M.; Lucio, Paqui: An assertional proof of the stability and correctness of Natural Mergesort (2015)
  5. O’Hearn, Peter W.; Petersen, Rasmus L.; Villard, Jules; Hussain, Akbar: On the relation between concurrent separation logic and concurrent Kleene algebra (2015)
  6. Roşu, Grigore: From rewriting logic, to programming language semantics, to program verification (2015)
  7. Alkassar, Eyad; Böhme, Sascha; Mehlhorn, Kurt; Rizkallah, Christine: A framework for the verification of certifying computations (2014)
  8. Amighi, Afshin; Blom, Stefan; Darabi, Saeed; Huisman, Marieke; Mostowski, Wojciech; Zaharieva-Stojanovski, Marina: Verification of concurrent systems with VerCors (2014)
  9. Daum, Matthias; Billing, Nelson; Klein, Gerwin: Concerned with the unprivileged: user programs in kernel refinement (2014)
  10. Malkis, Alexander; Banerjee, Anindya: On automation in the verification of software barriers: experience report (2014)
  11. Meyer, Bertrand; Kogtenkov, Alexander: Negative variables and the essence of object-oriented programming (2014)
  12. Moore, J Strother: Proof pearl: proving a simple von Neumann machine Turing complete (2014)
  13. Banerjee, Anindya; Naumann, David A.: Local reasoning for global invariants. II: Dynamic boundaries (2013)
  14. Blanchette, Jasmin Christian; Böhme, Sascha; Paulson, Lawrence C.: Extending Sledgehammer with SMT solvers (2013)
  15. Cousot, Patrick; Cousot, Radhia; Fähndrich, Manuel; Logozzo, Francesco: Automatic inference of necessary preconditions (2013)
  16. Křena, Bohuslav; Vojnar, Tomáš: Automated formal analysis and verification: an overview (2013)
  17. Leino, K.Rustan M.: Automating theorem proving with SMT (2013)
  18. Anureev, I.S.; Mar’yasov, Il’ya; Nepomniashchiĭ, V.A.: Two-level mixed verification method of C-light programs in terms of safety logic (2012)
  19. Bjørner, Nikolaj: Taking satisfiability to the next level with Z3 (abstract) (2012)
  20. Greenaway, David; Andronick, June; Klein, Gerwin: Bridging the gap: automatic verified abstraction of C (2012)

1 2 3 next