3,585 Hits in 8.2 sec

Sequential Generation of Structured Arrays and Its Deductive Verification [chapter]

Richard Genestier, Alain Giorgetti, Guillaume Petiot
2015 Lecture Notes in Computer Science  
A sequential generator of structured arrays can be defined by two C functions: the first one computes an initial array, and the second one steps from one array to the next one according to some total order  ...  Generation of all arrays with a given structure up to some given length has many applications, including bounded exhaustive testing.  ...  We present a uniform approach to the rational implementation of sequential generators of structured arrays.  ... 
doi:10.1007/978-3-319-21215-9_7 fatcat:4n6ws6m5gzezlciyn5ej3tfj2m

The KeY Platform for Verification and Analysis of Java Programs [chapter]

Wolfgang Ahrendt, Bernhard Beckert, Daniel Bruns, Richard Bubel, Christoph Gladisch, Sarah Grebing, Reiner Hähnle, Martin Hentschel, Mihai Herda, Vladimir Klebanov, Wojciech Mostowski, Christoph Scheben (+2 others)
2014 Lecture Notes in Computer Science  
and code generation.  ...  We show that deductive technology that has been developed for full functional verification can be used as a basis and framework for other purposes than pure functional verification.  ...  Test Case Generation Even though the area of deductive verification made tremendous progress and provided powerful tools, deductive methods still require expert level knowledge.  ... 
doi:10.1007/978-3-319-12154-3_4 fatcat:3eunuqfaxzhdvg6xcr5muxx2sq

Deductive Verification of State-Space Algorithms [chapter]

Frédéric Gava, Jean Fortin, Michael Guedj
2013 Lecture Notes in Computer Science  
We study four algorithms (three sequential and one distributed) of state-space construction as a first step towards mechanically-assisted deductive verification of model-checkers.  ...  In this paper, we focus on using a verification condition generator that takes annotated algorithms and ensures their termination and correctness.  ...  VCG for deductive verification.  ... 
doi:10.1007/978-3-642-38613-8_9 fatcat:c5xrg7hzqbealaxy5tvle2he7e

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

Reiner Hähnle, Marieke Huisman
2019 Lecture Notes in Computer Science  
We take stock of the state-of-art and give a list of the most important challenges for the further development of the field of deductive software verification.  ...  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  ...  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

Deductive Verification of Advanced Out-of-Order Microprocessors [chapter]

Shuvendu K. Lahiri, Randal E. Bryant
2003 Lecture Notes in Computer Science  
This paper demonstrates the modeling and deductive verification of out-of-order microprocessors of varying complexities using a logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions  ...  The paper describes the challenges in modeling and verification with the addition of different design features.  ...  Deductive verification based methods [13, 9, 1] use general purpose theorem provers to establish the correctness of microprocessors.  ... 
doi:10.1007/978-3-540-45069-6_33 fatcat:wv224c2umrb3zl2qcxkzhbyvy4

A Dynamic Logic for Deductive Verification of Concurrent Programs

Bernhard Beckert, Vladimir Klebanov
2007 Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)  
We define a Dynamic Logic and a deductive verification calculus for a restricted fragment of Java with native concurrency primitives.  ...  In this paper, we present an approach aiming at full functional deductive verification of concurrent Java programs, based on symbolic execution.  ...  Together with exploiting atomic and independent code, this makes deductive verification of real concurrent systems feasible.  ... 
doi:10.1109/sefm.2007.1 dblp:conf/sefm/BeckertK07 fatcat:gyc5qvvrurbwjopoebau4zieve

Lessons Learned From Microkernel Verification — Specification is the New Bottleneck

Christoph Baumann, Bernhard Beckert, Holger Blasum, Thorsten Bormer
2012 Electronic Proceedings in Theoretical Computer Science  
Software verification tools have become a lot more powerful in recent years. Even verification of large, complex systems is feasible, as demonstrated in the L4.verified and Verisoft XT projects.  ...  Still, functional verification of large software systems is rare - for reasons beyond the large scale of verification effort needed due to the size alone.  ...  The postcondition "ensures" that the result is indeed the minimal element of the array, i.e., (a) it is less or equal than any element in the array and (b) actually one of the elements of the array.  ... 
doi:10.4204/eptcs.102.4 fatcat:rkhqobyravgezemborw6ay2zea

Towards an industrial use of sound static analysis for the verification of concurrent embedded avionics software

Antoine Miné, David Delmas
2015 2015 International Conference on Embedded Software (EMSOFT)  
: it is scalable and reports soundly all run-time errors with few false positives.  ...  For sequential C software, industrial static analyzers, such as Astrée, already exist and are deployed. This is not the case for concurrent C software.  ...  It is a complex program performing intensive string processing, and traversing large arrays of structures by means of nested loops and pointer arithmetics.  ... 
doi:10.1109/emsoft.2015.7318261 dblp:conf/emsoft/MineD15 fatcat:gduz3ancrjadlhlfxyepmxdypu

A Perfecto Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software [chapter]

Yonit Kesten, Amit Klein, Amir Pnueli, Gil Raanan
1999 Lecture Notes in Computer Science  
Based on initial experimentation, it was decided that the verification method will be based on a combination of model-checking using spin with deductive verification which handles the more data-intensive  ...  Then, we explain the need to split the verification activity into the modelchecking part which deals with the control issues such as concurrency or deadlocking and a deductive part which handles the data-intensive  ...  Weizmann Institute of Science) for his help with the smv system.  ... 
doi:10.1007/3-540-48119-2_12 fatcat:e3xta4v27nfprfowuxlmuonihm

Computing Specification-Sensitive Abstractions for Program Verification [chapter]

Tianhai Liu, Shmuel Tyszberowicz, Mihai Herda, Bernhard Beckert, Daniel Grahl, Mana Taghdiri
2016 Lecture Notes in Computer Science  
To enable scalability and address the needs of real-world software, deductive verification relies on modularization of the target program and decomposition of its requirement specification.  ...  The core idea of our approach is to use bounded program verification techniques to guide the construction of these slices.  ...  This work has been partially supported by GIF (grant No. 1131-9.6/2011) and by DFG under project "DeduSec" within SPP 1496 "RS 3 " and by BMBF under project FIfAKS within the Software Campus program.  ... 
doi:10.1007/978-3-319-47677-3_7 fatcat:mivguef24nfbnmcgr3bccththm

VerifyThis 2019: A Program Verification Competition (Extended Report) [article]

Claire Dross, Carlo A. Furia, Marieke Huisman, Rosemary Monahan, Peter Müller
2021 arXiv   pre-print
of fully automatic verification, and requires instead human expertise to suitably encode programs, specifications, and invariants.  ...  Thirteen teams entered the competition, which consisted of three verification challenges and spanned two days of work.  ...  Being part of TOOLympics further enhanced the interest and variety of the participants' experience, and made VerifyThis more widely visible.  ... 
arXiv:2008.13610v3 fatcat:zf3hegfrq5hdfnt6xp4dkuphy4

A Modular Way to Reason About Iteration [chapter]

Jean-Christophe Filliâtre, Mário Pereira
2016 Lecture Notes in Computer Science  
We validate our proposal using the deductive verification tool Why3 and two iteration paradigms, namely cursors and higher-order iterators.  ...  The idea is to specify iteration in terms of the finite sequence of the elements enumerated so far, and only those.  ...  We thank Clément Fumex, Chantal Keller, Claude Marché, Andrei Paskevich, Vitor Pereira, François Pottier, and Simão Melo de Sousa for their comments on earlier versions of this paper.  ... 
doi:10.1007/978-3-319-40648-0_24 fatcat:ezjuwb7sjzgzxpb7gbkkb4luqu


Jean Fortin, Frédéric Gava
2010 Proceedings of the fourth international workshop on High-level parallel programming and applications - HLPP '10  
BSP-Why is based on a sequential simulation of the BSP programs which allows to generate pure sequential codes for the back-end condition generator Why and thus benefit of its large range of existing proversproof  ...  It is intended to be used as an intermediate core-language for verification tools (mainly condition generators) of BSP extensions of realistic programming languages such as C, JAVA, etc.  ...  Conclusion and Future Work The paper presents a methodology and its associated tool, called BSP-Why for deductive verification of BSP programs.  ... 
doi:10.1145/1863482.1863491 fatcat:xf6qlihumzfndftgazfuei5oxi

Contract based verification of IEC 61499

Per Lindgren, Marcus Lindner, David Pereira, Luis Miguel Pinho
2016 2016 IEEE 14th International Conference on Industrial Informatics (INDIN)  
In this paper we present the formalization of a subset of the IEC 61499 standard in order to provide an underpinning for the static verification of Function Block models by means of deductive reasoning  ...  In this paper we presentthe formalization of a subset of the IEC 61499 standard inorder to provide an underpinning for the static verification ofFunction Block models by means of deductive reasoning.  ...  grant nr. 621429 (EMC2) and VIN-NOVA (Swedish Governmental Agency for Innovation Systems) and Svenska Kraftnät (Swedish national grid).  ... 
doi:10.1109/indin.2016.7819147 dblp:conf/indin/LindgrenLPP16 fatcat:47q2rq2yovf23o7r4klwrxf35q

Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)

Nikolaj Bjorner, Krishnendu Chatterjee, Laura Kovacs, Rupak M. Majumdar, Marc Herbstritt
2013 Dagstuhl Reports  
The seminar brought together researchers working in rigorous software engineering, with a special focus on the interaction between synthesis and automated deduction.  ...  This event was the first seminar of this kind and a kickoff of a series of seminars organised on rigorous systems engineering.  ...  We introduce a method for automated parameterized verification of fault-tolerant distributed algorithms.  ... 
doi:10.4230/dagrep.2.11.45 dblp:journals/dagstuhl-reports/BjornerCKM12 fatcat:gs36midqlvfhzky6v7ebawumtq
« Previous Showing results 1 — 15 out of 3,585 results