Filters








106 Hits in 3.2 sec

HOL-Boogie — An Interactive Prover for the Boogie Program-Verifier [chapter]

Sascha Böhme, K. Rustan M. Leino, Burkhart Wolff
2008 Lecture Notes in Computer Science  
In this paper, however, we present a proofenvironment, HOL-Boogie, that combines Boogie with the interactive theorem prover Isabelle/HOL.  ...  Boogie is a program verification condition generator for an imperative core language. It has front-ends for the programming languages C# and C enriched by annotations in first-order logic.  ...  Scenario II: Interactive Verification of C-Programs Verifying C programs in HOL-Boogie seems to be a straightforward extension to the previous section.  ... 
doi:10.1007/978-3-540-71067-7_15 fatcat:odqtglfglvhvxhvoxhhybwl7ey

HOL-Boogie—An Interactive Prover-Backend for the Verifying C Compiler

Sascha Böhme, Michał Moskal, Wolfram Schulte, Burkhart Wolff
2009 Journal of automated reasoning  
In this paper, we present a proof environment, HOL-Boogie, that combines Boogie with the interactive theorem prover Isabelle/HOL, for a specific C front-end and a machine/memory model.  ...  Boogie is a verification condition generator for an imperative core language.  ...  Acknowledgements Sascha Böhme was supported by the German Federal Ministry of Education and Research under grant 01IS07008.  ... 
doi:10.1007/s10817-009-9142-9 fatcat:rzk3lxalf5ewhd52jxdpbcpdi4

The 1st Verified Software Competition: Experience Report [chapter]

Vladimir Klebanov, Peter Müller, Natarajan Shankar, Gary T. Leavens, Valentin Wüstholz, Eyad Alkassar, Rob Arthan, Derek Bronish, Rod Chapman, Ernie Cohen, Mark Hillebrand, Bart Jacobs (+10 others)
2011 Lecture Notes in Computer Science  
We, the organizers and participants, report our experiences from the 1st Verified Software Competition, held in August 2010 in Edinburgh at the VSTTE 2010 conference.  ...  For example, for Invert we proved surjectivity of A from injectivity and boundedness.  ...  Queue was fairly easy, once the right encoding of sharability was found. (Quantify over the list's fraction, or over each field's fraction separately?  ... 
doi:10.1007/978-3-642-21437-0_14 fatcat:vkjleltbkrdchok44arrshxfua

Extended static checking in JML4

Perry R. James, Patrice Chalin
2009 Proceedings of the 2009 ACM symposium on Applied Computing - SAC '09  
ESC4, the ESC component of the JML4 project, is able to verify many more kinds of methods in part because of its use of novel techniques which apply multiple theorem provers.  ...  The implementations of many seemingly simple algorithms are beyond the ability of traditional Extended Static Checking (ESC) tools to verify.  ...  Spec#, VCC, and HOL-Boogie Spec# is Microsoft's extension to C# for supporting verified software [6] .  ... 
doi:10.1145/1529282.1529410 dblp:conf/sac/JamesC09 fatcat:qxjq2thsojhjho7kuw45t57ipy

The Design and Algorithms of a Verification Condition Generator [article]

Radu Grigore
2012 arXiv   pre-print
That is, how to work less when re-verifying a program that changed only a little since the verifier was last run. (4) How to detect unreachable code, taking into account formal specifications?  ...  The Boogie language is introduced; the architecture of a verification-generator is described.  ...  The Boogie tool is part of the Spec program verifier [26] , which verifies programs written in a superset of C ; the Why tool is part of Frama-C [7] , which verifies C programs.  ... 
arXiv:1204.6719v1 fatcat:zfnb5e4ysrc4xngkels75amtpe

Specification and verification

Mike Barnett, Manuel Fähndrich, K. Rustan M. Leino, Peter Müller, Wolfram Schulte, Herman Venter
2011 Communications of the ACM  
The Spec# tool suite consists of a compiler that emits run-time checks for contracts, a static program verifier that attempts to mathematically prove the correctness of programs, and an integration into  ...  This paper reflects on the six-year history of the Spec# project, scientific contributions it has made, remaining challenges for tools that seek to establish program correctness, and prospects of incorporating  ...  For instance, various Java/JML, bytecode/BML, and Eiffel projects use Boogie as target for their verifiers. At the other end, Boogie's output is now also fed to interactive theorem provers.  ... 
doi:10.1145/1953122.1953145 fatcat:lau4ydul6vaspatge73es4hnoq

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

Sascha Böhme, Michał Moskal
2011 Lecture Notes in Computer Science  
Our results led to a performance gain of an order of magnitude for the C code verifier VCC.  ...  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.  ...  The Quest for Fast Automated Provers Automatic code verifiers demand an interactive feedback-driven style of verifying code: The user annotates the code and invokes the verifier, which, in turn, asks the  ... 
doi:10.1007/978-3-642-22438-6_15 fatcat:6psbiqawtvay5mltgy2q2pynia

Formally Validating a Practical Verification Condition Generator (extended version) [article]

Gaurav Parthasarathy and Peter Müller and Alexander J. Summers
2021 arXiv   pre-print
In this paper, we present an alternative approach: we validate successful runs of the widely-used Boogie verifier by producing a certificate which proves correctness of the obtained verification result  ...  A program verifier produces reliable results only if both the logic used to justify the program's correctness is sound, and the implementation of the program verifier is itself correct.  ...  We thank Alain Delaët-Tixeuil for his earlier work on this topic, Thibault Dardinier for improving our artifact, Martin Clochard for helpful discussions and the anonymous reviewers for their valuable comments  ... 
arXiv:2105.14381v1 fatcat:qgn2lahfkndzxjt63bxllbzmia

Faster and More Complete Extended Static Checking for the Java Modeling Language

Perry R. James, Patrice Chalin
2009 Journal of automated reasoning  
ESC4, the ESC component of the JML4 project, is able to verify many more kinds of methods in part because of its use of novel techniques which apply multiple theorem provers.  ...  To help address the added cost of using multiple provers and this lack of scalability, we present the multi-threaded version of ESC4 and its distributed prover back-end.  ...  Acknowledgements This papers is an extended version of [11] . We would like to thank the anonymous reviewers for their helpful comments and suggestions.  ... 
doi:10.1007/s10817-009-9134-9 fatcat:znep37u2mfhsjcksx73xiazquq

Formal Verification of a Parameterized Data Aggregation Protocol [chapter]

Sergio Feo-Arenis, Bernd Westphal
2013 Lecture Notes in Computer Science  
The presented work forms the basis for a generalization to verification rules for aggregation protocols that integrate automatic verification into an inductive framework.  ...  We report on our experiences on the successful verification of a parameterized wireless fault-tolerant data aggregation protocol.  ...  We report on the automatic verification of a Boogie [2] model that integrates the axiomatization and the program, and on how we validated our axiomatization using an interactive theorem prover.  ... 
doi:10.1007/978-3-642-38088-4_29 fatcat:3l6erltrpfg6za4glbiqcdnf4u

Deductive Software Verification: From Pen-and-Paper Proofs to Industrial Tools [chapter]

Reiner Hähnle, Marieke Huisman
2019 Lecture Notes in Computer Science  
We follow the trajectory of the field from its inception in the late 1960s via its current state to its promises for the future, from pen-and-paper proofs for programs written in small, idealized languages  ...  Deductive software verification aims at formally verifying that all possible behaviors of a given program satisfy formally defined, possibly complex properties, where the verification process is based  ...  Schmitt and Bernhard Steffen, for carefully reading our paper and for their very useful feedback. Many thanks to Richard Bubel for help with the preparation of the example in Sect. 2.  ... 
doi:10.1007/978-3-319-91908-9_18 fatcat:t3verkvbx5givfekzmbpiw6zla

FASiM: A Framework for Automatic Formal Analysis of Simulink Models of Linear Analog Circuits [article]

Adnan Rashid, Ayesha Gauhar, Osman Hasan
2020 arXiv   pre-print
analysis of the Simulink models of linear analog circuits using the HOL Light theorem prover.  ...  However, the formal modeling of a system is not a straightforward task due to the lack of formal methods background for engineers working in the industry.  ...  [12] proposed to conduct the formal verification of the discrete-time MAT-LAB/Simulink models using Microsoft Boogie program verifier.  ... 
arXiv:2001.06702v1 fatcat:pvhvnadd2bggzg57cs47j3cn34

VCC: A Practical System for Verifying Concurrent C [chapter]

Ernie Cohen, Markus Dahlweid, Mark Hillebrand, Dirk Leinenbach, Michał Moskal, Thomas Santen, Wolfram Schulte, Stephan Tobies
2009 Lecture Notes in Computer Science  
VCC is an industrial-strength verification environment for low-level concurrent system code written in C.  ...  This paper motivates VCC, describes our verification methodology, describes the architecture of VCC, and reports on our experience using VCC to verify the Microsoft Hyper-V hypervisor. 5 5  ...  Acknowledgments Thanks to everyone in the project: Artem Alekhin, Eyad Alkassar, Mike Barnett  ... 
doi:10.1007/978-3-642-03359-9_2 fatcat:rx2mo46vivdhzhdmpyjinauypy

Automating Induction with an SMT Solver [chapter]

K. Rustan M. Leino
2012 Lecture Notes in Computer Science  
I have implemented the technique in the Dafny program verifier [19] 0 and have used it, for example, to automatically prove 45 of the first 47 problems in an evaluation corpus for automatic induction.  ...  The paper describes the tactic and its implementation in a program verifier, and reports on the positive experience with using the tactic.  ...  I appreciate the valuable comments by Jean-Christophe Filliâtre and the referees on an earlier version of this paper.  ... 
doi:10.1007/978-3-642-27940-9_21 fatcat:jghhbkqa7reknhxopc37vr5a7i

Slicing ATL model transformations for scalable deductive verification and fault localization

Zheng Cheng, Massimo Tisi
2018 International Journal on Software Tools for Technology Transfer (STTT)  
Model-driven engineering (MDE) is increasingly accepted in industry as an effective approach for managing the full life cycle of software development.  ...  In this paper we show that this information can be used to decompose the MT contract and, for each sub-contract, slice the MT to the only rules that may be responsible for fulfilling it.  ...  The Z3 au-tomatic theorem prover [31] is then used by Boogie to verify the correctness of the ATL transformation.  ... 
doi:10.1007/s10009-018-0491-8 fatcat:nrzwxvnfdzcdxhuj75tuz6xury
« Previous Showing results 1 — 15 out of 106 results