Filters








79 Hits in 4.0 sec

Dafny Meets the Verification Benchmarks Challenge [chapter]

K. Rustan M. Leino, Rosemary Monahan
2010 Lecture Notes in Computer Science  
A suite of verification benchmarks for software verification tools and techniques, presented at VSTTE 2008 [11], provides an initial catalogue of benchmark challenges for the Verified Software Initiative  ...  Each of the eight programs is fed to the Dafny verifier, which without further user interaction automatically performs the verification in a few seconds.  ...  Acknowledgments We thank the authors of [11] and their research students for feedback on our initial attempts at these verification benchmarks.  ... 
doi:10.1007/978-3-642-15057-9_8 fatcat:bbnuys42ava4jmmt5ru565zhua

Designing a verifying compiler: Lessons learned from developing Whiley

David J. Pearce, Lindsay Groves
2015 Science of Computer Programming  
An ongoing challenge for computer science is the development of a tool which automatically verifies programs meet their specifications, and are free from runtime errors such as divide-by-zero, array out-of-bounds  ...  We have been developing a programming language from scratch to simplify verification, called Whiley, and an accompanying verifying compiler.  ...  Acknowledgements This work is supported by the Marsden Fund, administered by the Royal Society of New Zealand, Grant number VUW1105.  ... 
doi:10.1016/j.scico.2015.09.006 fatcat:epbssye4uncdvk5pk74epbyeay

Heaps and Data Structures: A Challenge for Automated Provers [chapter]

Sascha Böhme, Michał Moskal
2011 Lecture Notes in Computer Science  
Software verification is one of the most prominent application areas for automatic reasoning systems, but their potential improvement is limited by shortage of good benchmarks.  ...  In contrast, we propose a family of benchmarks in first-order logic with equality which is scalable, relatively simple to understand, yet closely resembles difficult verification conditions stemming from  ...  The Challenge Verifying dynamic data structures is one of the challenges in code verification.  ... 
doi:10.1007/978-3-642-22438-6_15 fatcat:6psbiqawtvay5mltgy2q2pynia

Robust, generic, modularly-verified map

Derek Bronish, Hampton Smith
2011 Proceedings of the 5th ACM workshop on Programming languages meets program verification - PLPV '11  
The foundational-yet-sophisticated nature of this concept makes it an ideal benchmark for software verification efforts.  ...  This paper elaborates on the criteria for modular verification of robust map components and their clients and it presents a survey of existing attempts to verify map components. 2010/10/18  ...  Acknowledgments The authors would like to thank the following individuals for their input and feedback: Bruce Adcock, Paolo Bucci, Harvey M.  ... 
doi:10.1145/1929529.1929533 dblp:conf/plpv/BronishS11 fatcat:sltppnqwafcdbkavyaaa7aey5m

Verifying security invariants in ExpressOS

Haohui Mai, Edgar Pek, Hui Xue, Samuel Talmadge King, Parthasarathy Madhusudan
2013 Proceedings of the eighteenth international conference on Architectural support for programming languages and operating systems - ASPLOS '13  
effort while still proving the security relevant aspects of our system.  ...  In our use of formal methods, we focus solely on proving that our OS implements our security invariants correctly, rather than striving for full functional correctness, requiring significantly less verification  ...  We thank Rustan Leino for encouraging us to use Dafny for our verification tasks. We also thank Shuo Tang for implementing an earlier version of the system.  ... 
doi:10.1145/2451116.2451148 dblp:conf/asplos/MaiPXKM13 fatcat:e6sxytmbrbd2dmgs2aq4qb53py

Verifying security invariants in ExpressOS

Haohui Mai, Edgar Pek, Hui Xue, Samuel Talmadge King, Parthasarathy Madhusudan
2013 SIGPLAN notices  
effort while still proving the security relevant aspects of our system.  ...  In our use of formal methods, we focus solely on proving that our OS implements our security invariants correctly, rather than striving for full functional correctness, requiring significantly less verification  ...  We thank Rustan Leino for encouraging us to use Dafny for our verification tasks. We also thank Shuo Tang for implementing an earlier version of the system.  ... 
doi:10.1145/2499368.2451148 fatcat:e3kqzgbohrf2bbtuirtb6nmngy

Finding Bugs with Specification-Based Testing is Easy!

Janice Chin, David Pearce
2021 The Art, Science, and Engineering of Programming  
We then report on several large experiments investigating the tool's effectiveness at bug finding using a range of benchmarks, including a suite of 1800+ mutants.  ...  In general, one would assume automated testing is less effective at bug finding than static verification. But, how much less effective?  ...  The authors would also like thank the various anonymous reviewers of earlier drafts of this paper.  ... 
doi:10.22152/programming-journal.org/2021/5/13 fatcat:45qi7aycvjg77de62y7v3qekzm

The COST IC0701 Verification Competition 2011 [chapter]

Thorsten Bormer, Marc Brockschmidt, Dino Distefano, Gidon Ernst, Jean-Christophe Filliâtre, Radu Grigore, Marieke Huisman, Vladimir Klebanov, Claude Marché, Rosemary Monahan, Wojciech Mostowski, Nadia Polikarpova (+5 others)
2012 Lecture Notes in Computer Science  
We discuss the three different challenges that were posed and the solutions developed by the teams.  ...  This paper reports on the experiences with the program verification competition held during the FoVeOOS conference in October 2011. There were 6 teams participating in this competition.  ...  Acknowledgements The competition received generous supported from COST Action IC0701. Huisman and Mostowski are partially supported by ERC grant 258405 for the VerCors project.  ... 
doi:10.1007/978-3-642-31762-0_2 fatcat:jt5hy4ioevewfcubpq4lq4o4qu

Automated Verification of Nested DFS [chapter]

Jaco C. van de Pol
2015 Lecture Notes in Computer Science  
In this paper we demonstrate the automated verification of the Nested Depth-First Search (NDFS) algorithm for detecting accepting cycles.  ...  The starting point is a recursive formulation of the NDFS algorithm. We use Dafny to annotate the algorithm with invariants and a global specification.  ...  Actually, the soundness proof posed some verification challenges to the underlying Z3 SMT solver, since it introduces quantifications over sequences.  ... 
doi:10.1007/978-3-319-19458-5_12 fatcat:ahgw6v7fcbdehnv4lmfgysenvm

VerifyThis – Verification Competition with a Human Factor [chapter]

Gidon Ernst, Marieke Huisman, Wojciech Mostowski, Mattias Ulbrich
2019 Msphere  
Regarding the impact of VerifyThis on deductive verification research, a survey conducted among the previous participants shows that the event is a key enabler for gaining insight into other approaches  ...  In this paper, we discuss the role of the human in the competition setup and explore possible future changes to the current format.  ...  We thank Rosemary Monahan for suggestions to improve the competition format and feedback on the manuscript.  ... 
doi:10.1007/978-3-030-17502-3_12 fatcat:3jpplx4n3bcg3mkle5nrdfkmo4

SafeRESTScript: Statically Checking REST API Consumers [article]

Nuno Burnay and Antónia Lopes and Vasco T. Vasconcelos
2020 arXiv   pre-print
We present SafeRESTScript and its validation system, based on a general-purpose verification tool (Boogie).  ...  The evaluation of SafeRESTScript and of the prototype implementations for its validator, available in the form of an Eclipse plugin, is also discussed.  ...  Verification Challenges In 2008, Wide et al [35] proposed a suite composed of eight incremental benchmarks for verification tools and techniques that prove total correction of objectbased and object-oriented  ... 
arXiv:2007.08048v1 fatcat:utj4s7ltnvh5tj7v5sosv6k42e

A fully verified container library

Nadia Polikarpova, Julian Tschannen, Carlo A. Furia
2017 Formal Aspects of Computing  
The comprehensive functionality and nontrivial design of realistic general-purpose container libraries pose challenges to formal verification that go beyond those of individual benchmark problems mainly  ...  Verification uses the automated deductive verifier AutoProof, which we extended as part of the present work.  ...  An important step towards achieving this vision, our work explored the major hurdles that lie in the often neglected "last mile" of verification-from challenging benchmarks to fully-specified general-purpose  ... 
doi:10.1007/s00165-017-0435-1 fatcat:obna42dwqjdtzm4ueugh2yzql4

A Fully Verified Container Library [chapter]

Nadia Polikarpova, Julian Tschannen, Carlo A. Furia
2015 Lecture Notes in Computer Science  
The comprehensive functionality and nontrivial design of realistic general-purpose container libraries pose challenges to formal verification that go beyond those of individual benchmark problems mainly  ...  Verification uses the automated deductive verifier AutoProof, which we extended as part of the present work.  ...  An important step towards achieving this vision, our work explored the major hurdles that lie in the often neglected "last mile" of verification-from challenging benchmarks to fully-specified general-purpose  ... 
doi:10.1007/978-3-319-19249-9_26 fatcat:fa7spx43urdp3o5izfsyr3n2vi

AutoProof meets some verification challenges

Julian Tschannen, Carlo A. Furia, Martin Nordio
2014 International Journal on Software Tools for Technology Transfer (STTT)  
This paper illustrates some of AutoProof's capabilities when tackling the three challenges of the VerifyThis verification competition held at FM 2012, as well as on three other problems proposed in related  ...  Tackling the challenges demonstrates to what extent this design goal is met in the current implementation: while some of AutoProof's current limitations prevent us from verifying the complete specification  ...  Verification Benchmarks Can Shape the Field For better or worse, benchmarks shape a field [16] .  ... 
doi:10.1007/s10009-014-0300-y fatcat:re5smgmenrhv7bxrrubifx64mq

Refinement Types for Ruby [article]

Milod Kazerounian, Niki Vazou, Austin Bourgerie, Jeffrey S. Foster, Emina Torlak
2017 arXiv   pre-print
RTR is built on top of RDL, a Ruby type checker that provides basic type information for the verification process.  ...  RTR works by encoding its verification problems into Rosette, a solver-aided host language.  ...  Acknowledgements We thank Thomas Gilray and the anonymous reviewers for their feedback on earlier versions of this paper.  ... 
arXiv:1711.09281v1 fatcat:ddhv7ccfwfcmlbdrqjielpisqu
« Previous Showing results 1 — 15 out of 79 results