Filters








64 Hits in 3.5 sec

Using First-Order Theorem Provers in the Jahob Data Structure Verification System [chapter]

Charles Bouillaguet, Viktor Kuncak, Thomas Wies, Karen Zee, Martin Rinard
Lecture Notes in Computer Science  
This paper presents our integration of efficient resolution-based theorem provers into the Jahob data structure verification system.  ...  Our initial goal was to incorporate first-order theorem provers into Jahob to verify data structure clients.  ...  We thank Konstantine Arkoudas, Lawrence Paulson, Stephan Schulz, and Christoph Weidenbach for useful discussions. We thank VMCAI'07 reviewers for useful feedback.  ... 
doi:10.1007/978-3-540-69738-1_5 dblp:conf/vmcai/BouillaguetKWZR07 fatcat:s4w55w4bgjgylpnv4exunid2ve

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
, first-order theorem provers, and, in the worst case, interactive theorem provers to prove each subformula.  ...  Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
doi:10.1145/1375581.1375624 dblp:conf/pldi/ZeeKR08 fatcat:xdwn3c6bdvgpvkzakt44gj7iu4

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
2008 SIGPLAN notices  
, first-order theorem provers, and, in the worst case, interactive theorem provers to prove each subformula.  ...  Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
doi:10.1145/1379022.1375624 fatcat:lblfpn5a5nh6jm276xlgbzxp24

Verifying linked data structure implementations

Karen Zee, Viktor Kuncak, Martin Rinard
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
The Jahob program verification system leverages state of the art automated theorem provers, shape analysis, and decision procedures to check that programs conform to their specifications.  ...  We present our results using Jahob to achieve full functional verification of a collection of linked data structures.  ...  Using the Jahob system, we have verified many of the data structures that programmers use in practice.  ... 
doi:10.1109/ipdps.2008.4536430 dblp:conf/ipps/ZeeKR08 fatcat:o23nqtozrbbqlhlradxwybf7fm

Requirement and Result of Verifying the Program Code
English

Er. Abhishek Pandey, Prof. Roshni Dubey
2014 International Journal of Computer Trends and Technology  
firstorder theorem proves, and, in the worst case, interactive theorem proverbs to prove each sub formula.  ...  such as replacing complex sub formulas with stronger but simpler alternatives, exploiting structure inherently present in the verification conditions, and, when necessary, inserting verified lemmas and  ...  Using the Jahob system, we have verified many of the data structures that programmers use in practice.  ... 
doi:10.14445/22312803/ijctt-v9p112 fatcat:nyl4ze7f2rgwfg62lrfrsh4fhu

An overview of the Jahob analysis system: project goals and current status

V. Kuncak, M. Rinard
2006 Proceedings 20th IEEE International Parallel & Distributed Processing Symposium  
It uses monadic secondorder logic over trees to reason about reachability in linked data structures, the Isabelle theorem prover and Nelson-Oppen style theorem provers to reason about high-level properties  ...  We present an overview of the Jahob system for modular analysis of data structure properties.  ...  We thank Thomas Wies, Karen Zee, Peter Schmitt, and Hai Huu Nguyen for contributions to the Jahob project.  ... 
doi:10.1109/ipdps.2006.1639580 dblp:conf/ipps/KuncakR06 fatcat:xqshphujjbfirf7v7kzjbf4acq

An integrated proof language for imperative programs

Karen Zee, Viktor Kuncak, Martin C. Rinard
2009 SIGPLAN notices  
We have implemented our integrated proof language in the context of a program verification system for Java and used the resulting system to verify a collection of linked data structure implementations.  ...  The language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations.  ...  The first-order theorem provers use these shape properties as lemmas to establish the relationships between the shape properties, ordering properties, and abstraction properties required to prove the verification  ... 
doi:10.1145/1543135.1542514 fatcat:7qbsbwma5fg3xjxnaqi22eljby

An integrated proof language for imperative programs

Karen Zee, Viktor Kuncak, Martin C. Rinard
2009 Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '09  
We have implemented our integrated proof language in the context of a program verification system for Java and used the resulting system to verify a collection of linked data structure implementations.  ...  The language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations.  ...  The first-order theorem provers use these shape properties as lemmas to establish the relationships between the shape properties, ordering properties, and abstraction properties required to prove the verification  ... 
doi:10.1145/1542476.1542514 dblp:conf/pldi/ZeeKR09 fatcat:5uzckco6n5dqvfvplxwxn2n54y

Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival [chapter]

Martin Rinard
2009 Lecture Notes in Computer Science  
We have used Jahob to prove the full functional correctness of a collection of linked data structure implementations.  ...  In contrast to many such systems, which use a monolithic reasoning approach, Jahob provides a general integrated reasoning framework, which enables multiple automated reasoning systems to work together  ...  We have developed a general program specification and verification system, Jahob, and used Jahob to verify, for the first time, the full functional correctness of a collection of linked data structure  ... 
doi:10.1007/978-3-642-02959-2_1 fatcat:vnzeyjzrrneopp2swxreizxsuu

On Verifying Complex Properties using Symbolic Shape Analysis [article]

Thomas Wies, Viktor Kuncak, Karen Zee, Andreas Podelski, Martin Rinard
2006 arXiv   pre-print
We have deployed Bohne in the Hob and Jahob data structure analysis systems, enabling us to combine Bohne with analyses of data structure clients and apply it in the context of larger programs.  ...  One of the main challenges in the verification of software systems is the analysis of unbounded data structures with dynamic memory allocation, such as linked data structures and arrays.  ...  Automated theorem provers such as Vampire [40] and SPASS [41] can be used to reason about properties of linked data structures, but axiomatizing reachability in first-order logic is non-trivial in  ... 
arXiv:cs/0609104v1 fatcat:fvo3jony5ja23fecutl6s5otzu

Building a push-button RESOLVE verifier: Progress and challenges

Murali Sitaraman, Bruce Adcock, Jeremy Avigad, Derek Bronish, Paolo Bucci, David Frazier, Harvey M. Friedman, Heather Harton, Wayne Heym, Jason Kirschenbaum, Joan Krone, Hampton Smith (+1 others)
2010 Formal Aspects of Computing  
The VCs are currently verified using automated capabilities of the Isabelle proof assistant, the SMT solver Z3, a minimalist rewrite prover, and some specialized decision procedures.  ...  The software developer's role is then to provide suitable specifications and annotated code, but otherwise to have no direct involvement in the verification step.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation or the John Templeton  ... 
doi:10.1007/s00165-010-0154-3 fatcat:c4qbniaoave4tpevnhrr4a2y3a

Proving Resource Consumption of Low-level Programs Using Automated Theorem Provers

Jaroslav Ševčík
2007 Electronical Notes in Theoretical Computer Science  
In this paper we use a program logic and automatic theorem provers to certify resource usage of low-level bytecode programs equipped with annotations describing resource consumption for methods.  ...  We have adapted an existing resource counting logic [1] to fit the first-order setting, implemented a verification condition generator, and tested our approach on programs that contain recursion and deal  ...  It was suggested to us that Kuncak and Rinard [14] combine several logical approaches, including interfacing a first order theorem prover [4] , to prove full correctness of data structure implementations  ... 
doi:10.1016/j.entcs.2007.02.065 fatcat:5xs5kattzvfndcbzbn37ooaiw4

iProve: A scalable technique for consumer-verifiable software guarantees

S Andrica, H Jula, G Candea
2010 2010 IEEE/IFIP International Conference on Dependable Systems & Networks (DSN)  
Desired properties are proven in iProve as a combination of two proofs: one of a complex property applied to a small piece of code-a nucleus-using existing theorem provers, and a proof of a simple property  ...  applied to the rest of the codethe program body-using iProve.  ...  We thank our shepherd Keith Marzullo, the anonymous reviewers, and our EPFL colleagues for their help in refining our paper. We are especially indebted to Viktor Kuncak for his help with Jahob.  ... 
doi:10.1109/dsn.2010.5544309 dblp:conf/dsn/AndricaJC10 fatcat:umlg6fqsybdijbgy6g6k2mtamy

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

Sascha Böhme, Michał Moskal
2011 Lecture Notes in Computer Science  
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  ...  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 Challenge Verifying dynamic data structures is one of the challenges in code verification.  ... 
doi:10.1007/978-3-642-22438-6_15 fatcat:6psbiqawtvay5mltgy2q2pynia

Effective interactive proofs for higher-order imperative programs

Adam Chlipala, Gregory Malecha, Greg Morrisett, Avraham Shinnar, Ryan Wisnesky
2009 Proceedings of the 14th ACM SIGPLAN international conference on Functional programming - ICFP '09  
Both versions of the system have been evaluated with case studies in the verification of imperative data structures, such as hash tables with higher-order iterators.  ...  The verification burden in our new system is reduced by at least an order of magnitude compared to the old system, by replacing manual proof with automation.  ...  The Jahob (Zee et al. 2008 ) system allows the specification and verification of recursive, linked data structures in a fragment of Java.  ... 
doi:10.1145/1596550.1596565 dblp:conf/icfp/ChlipalaMMSW09 fatcat:qc5rox6vt5bchijlgkp6sw4ckm
« Previous Showing results 1 — 15 out of 64 results