A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Program Synthesis for Program Analysis
2018
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
We provide instantiations of our framework for solving a diverse range of program verification tasks such as termination, non-termination, safety and bug finding, superoptimisation and refactoring. ...
As our focus is on programs that use bit-vectors, we build a decision procedure for this fragment over finite domains in the form of a program synthesiser. ...
Encoding the synthesis problem We now express the synth and verif formulae as safety properties of C − programs as shown in Fig. 3 . ...
doi:10.1145/3174802
fatcat:iop4bqbtardarc7kuxxud6sudq
Programmed Strategies for Program Verification
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. ...
In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module. ...
Fixed-point predicate definitions are particularly useful in defining properties of potentially infinite data structures, but that topic is beyond the scope of the present paper. ...
doi:10.1016/j.entcs.2007.02.045
fatcat:3gnit7ab3zd4hilkj7h2ahsjmu
Validation process for railway interlocking systems
2016
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
An interlocking system monitors the status of the objects in a railway yard, allowing or denying the movement of trains, in accordance with safety rules. ...
The high number of complex interlocking rules that guarantee the safe movements of independent trains in a large station makes the verification of such systems a complex task, which needs to be addressed ...
Acknowledgments The second author has been partially funded by Villum Fonden. ...
doi:10.1016/j.scico.2016.04.004
fatcat:sqftsseqqjhdfduib6h7fxha3a
Automating the Verification of Floating-Point Programs
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In the context of deductive program verification, handling floating-point computations is challenging. ...
Our approach is implemented in the Why3 environment and its front-end SPARK 2014 for the development of safety-critical Ada programs. ...
Regarding the use of abstract interpretation to verifying FP programs, this indeed obtained very good successes in industrial contexts. In 2004, Miné used Acknowledgements. ...
doi:10.1007/978-3-319-72308-2_7
fatcat:pj5a5gredzeu7ezxshgnrrjowe
Program sketching
2012
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In sketching, the programmer uses a partial program, a sketch, to describe the desired implementation strategy, and leaves the low-level details of the implementation to an automated synthesis procedure ...
The result is a synthesis procedure that is able to handle complex problems from a variety of domains including ciphers, scientific programs, and even concurrent data-structures. ...
Moving beyond semantic equivalence and safety In many situations, programmers care about many other factors that go beyond functional correctness. ...
doi:10.1007/s10009-012-0249-7
fatcat:mlktcgt2kve4jb6c7frrn3cz6a
Accurate Theorem Proving for Program Verification
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
This paper also provides experimental evidence that the proposed approach is practical when applied to industrial program verification. This paper is an extended version of [1] . ...
We propose the use of a theorem prover called Cogent, which provides better accuracy for ANSI-C expressions with the possibility of nested logic quantifiers. ...
Acknowledgments The authors would like to thank Mike Barnett, Sergey Berezin, Vijay Ganesh, Rustan Leino, Madan Musuvathi, and Lintao Zhang for their ideas and comments related to this work. ...
doi:10.1007/11925040_7
fatcat:uzsrqszp6jezvlukyvzgbdbvka
Verifying Procedural Programs via Constrained Rewriting Induction
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show that we can automatically verify memory safety and prove correctness of realistic functions. ...
This paper aims to develop a verification method for procedural programs via a transformation into Logically Constrained Term Rewriting Systems (LCTRSs). ...
Equivalence checking is also used in proofs of secure information flow [Terauchi and Aiken 2005] and can be used to prove safety properties, e.g., memory safety. Why LCTRSs. ...
arXiv:1409.0166v5
fatcat:pkretib4p5d47cft2zoshbrssi
Evaluating Robustness of Neural Networks with Mixed Integer Programming
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Verification of networks enables us to gauge their vulnerability to such adversarial examples. We formulate verification of piecewise-linear neural networks as a mixed integer program. ...
The computational speedup allows us to verify properties on convolutional networks with an order of magnitude more ReLUs than networks previously verified by any complete verifier. ...
the objective becomes quadratic, and we have to use a Mixed Integer Quadratic Program (MIQP) solver. ...
arXiv:1711.07356v3
fatcat:jwvlp3qh7jabji3vfblbtt3swu
Towards Mutation Analysis for Lustre Programs
2008
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mutation analysis is usually used to provide indication of the fault detection ability of a test set. It is mainly used for unit testing evaluation. ...
This paper describes mutation analysis principles and their adaptation to the Lustre programming language. Alien-V, a mutation tool for Lustre is presented. ...
It can be used to prove the correctness of a Lustre program with respect to some safety properties or to compare two programs. As input, Lesar need a verification program [19] . ...
doi:10.1016/j.entcs.2008.05.009
fatcat:eiln2f3p5jbl7kiitsrf625kv4
Program Verification via Predicate Constraint Satisfiability Modulo Theories
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We have implemented the proposed framework and obtained promising results on diverse verification problems that are beyond the scope of the previous verification frameworks based on CHCs. ...
While it is known that the satisfiability of CHCs and the validity of queries for Constrained Logic Programs (CLP) are inter-reducible, we show that, thanks to the added expressiveness, pCSP is expressive ...
Authors' addresses: Hiroshi Unno, University of Tsukuba, Japan , RIKEN AIP, Japan, uhiro@cs.tsukuba.ac.jp; Yuki Satake, University of Tsukuba, Japan, satake@logic.cs.tsukuba.ac.jp; Tachio Terauchi, Waseda ...
arXiv:2007.03656v1
fatcat:lxrru6gt7rgknnc35mrv5iqzda
Guaranteed Optimization for Domain-Specific Programming
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
They can also function as decision procedures, suggesting an approach of 'optimizers as theorem provers,' in which optimizing compilers can be used to check domainspecific safety properties and check proofs ...
For software engineering reasons, it is often best to provide domain-specific programming environments in the context of a generalpurpose language. ...
Acknowledgments We thank Andrew Lumsdaine and the referees for helpful discussions and comments on drafts of this paper. ...
doi:10.1007/978-3-540-25935-0_18
fatcat:2oqzis2z2fcmbhrdn24xntdhiy
Trusting Computations: a Mechanized Proof from Partial Differential Equations to Actual Program
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This C program implements the second-order centered finite difference explicit scheme for solving the 1D wave equation. ...
Scientific computing programs make no exception in that respect, and even bring specific accuracy issues due to their massive use of floating-point computations. ...
Acknowledgments We are grateful to Manuel Kauers, Veronika Pillwein, and Bruno Salvy, who provided us help with the nonnegativity of the fundamental solution of the discrete wave equation (Lemma 5.2). ...
arXiv:1212.6641v3
fatcat:h25wy4wfr5fm3orhck5qzsyjdu
Overview of the Languages for Safe Smart Contract Programming
2019
Proceedings of the Institute for System Programming of RAS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
172 as other properties according to reasoning, safety, expressiveness, and readability. In the end, we have summarized related work and possible future research topics. ...
So, [17] provides an overview of smart contracts programming languages, security properties, and verification methods along with some classification of them. ...
SCILLA has been shallow-embedded in COQ, specifying such properties as contract terminology, contract state, and transitions along with blockchain states, which allows properties verification in isolation ...
doi:10.15514/ispras-2019-31(3)-13
fatcat:3xo4izhtszdjze6cqpz6smtkhy
Automatic verification for interactive graphical programs
2009
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications - ACL2 '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the past, verification efforts for such programs have usually ignored the I/O aspects of programs and focused instead on their core functionality. ...
We have successfully verified theorems about a number of interactive programs with Dracula; we have also successfully used Dracula as a motivational tool to introduce students to the world of automated ...
VERIFIED INTERACTIVE GRAPHICAL PROGRAMS To validate the applicability of Dracula and the above recipes for safety and liveness, we conducted six experiments proving properties of interactive programs. ...
doi:10.1145/1637837.1637843
fatcat:7bd5bnemdndrrndiw54x5vdkhi
Algebraic Program Analysis
[chapter]
2021
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It explains the foundations of algebraic program analysis, its strengths and limitations, and gives examples of algebraic program analyses for numerical invariant generation and termination analysis. ...
AbstractThis paper is a tutorial on algebraic program analysis. ...
Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors, and do not necessarily reflect the views of the sponsoring entities. ...
doi:10.1007/978-3-030-81685-8_3
fatcat:375brjonbbgfdfwpp72juwnljq
« Previous
Showing results 1 — 15 out of 4,755 results