The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 7663 of Mathematical Reviews Vol. , Issue 95m
[page]
1995
Mathematical Reviews
Preserved Fulltext
The system ATTT is similar to ATT, but now augmented with refinement types. ...
Summary: “This paper deals with the formal verification of finite state systems that have an arbitrary number of isomorphic com- ponents. ...
Can We Build an Automatic Program Verifier? Invariant Proofs and Other Challenges
[chapter]
2008
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 2018; you can also visit the original URL.
The file type is application/pdf.
This paper reviews some common knowledge about establishing correctness of programs and the current status of program specification and verification. ...
The paper argues that invariants are central to establishing correctness of programs and that thus, a major part of an automatic program verifier must be automated support for verifying invariants, a significant ...
Acknowledgements I thank Elizabeth Leonard and Sandeep Shukla for helpful discussions, and Elizabeth for comments on an earlier version of this paper. ...
doi:10.1007/978-3-540-69149-5_33
fatcat:7scejdlnkbagrkktnriryefvhe
A PROLOG environment for developing and reasoning about data types
[chapter]
1985
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 2018; you can also visit the original URL.
The file type is application/pdf.
We also present a PROLOG-based inductive theorem proving method for proving properties of data types and correctness of implementations. ...
In this paper we introduce a discipline for incorporating abstract data types into PROLOG, and study the use of PROLOG as a uniform programming environment for the specification, implementation, and verification ...
Refine is a program transformation processor; Ver CondGen generates verification conditions that have to be proved to establish the correctness of a data type implementation; Ind.Prove is the theorem proving ...
doi:10.1007/3-540-15199-0_18
fatcat:x64r6m7aavh2lfeajxskdtfe2e
Formal methods for automated program improvement
[chapter]
1994
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 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, a11 transformed, and synthesized, programs are guaranteed correct with respect to their specifications. ...
However, formal methods, and in partieular theorem proving, are providing a growing foundation of techniques for automatie program development (synthesis, improvement, transformation and verification). ...
Program improvement by transformation is achieved through the transformation of typed proofs in a constructive logic. ...
doi:10.1007/3-540-58467-6_32
fatcat:jckmgdfumngshiffwn7ibcsc5q
Algebras for Program Correctness in Isabelle/HOL
[chapter]
2014
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.
Formalisation examples include a complex refinement theorem, a generic proof of a loop transformation theorem for partial and total correctness and a simple prototypical verification tool for while programs ...
We present a reference formalisation of Kleene algebra and demonic refinement algebra with tests in Isabelle/HOL. It provides three different formalisations of tests. ...
Isabelle/HOL, in particular, is based on a typed higher-order logic which supports reasoning with sets, polymorphic data types, inductive definitions and recursive functions. ...
doi:10.1007/978-3-319-06251-8_4
fatcat:jmwp5mqm5beyhekkirkn7oybuu
Verifying Relational Properties of Functional Programs by First-Order Refinement
2015
Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation - PEPM '15
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 2016; you can also visit the original URL.
The file type is application/pdf.
Much progress has been made recently on fully automated verification of higher-order functional programs, based on refinement types and higher-order model checking. ...
To relax this limitation, we introduce a restricted form of higher-order refinement types where refinement predicates can refer to functions, and formalize a systematic program transformation to reduce ...
To take advantage of the recent advance of verification techniques based on first-order refinement types, however, we employ automated program transformation, so that the resulting program can be verified ...
doi:10.1145/2678015.2682546
dblp:conf/pepm/AsadaS015
fatcat:lk6so4cmo5f35jac43kaaedfgq
Verifying relational properties of functional programs by first-order refinement
2017
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 2016; you can also visit the original URL.
The file type is application/pdf.
Much progress has been made recently on fully automated verification of higher-order functional programs, based on refinement types and higher-order model checking. ...
To relax this limitation, we introduce a restricted form of higher-order refinement types where refinement predicates can refer to functions, and formalize a systematic program transformation to reduce ...
To take advantage of the recent advance of verification techniques based on first-order refinement types, however, we employ automated program transformation, so that the resulting program can be verified ...
doi:10.1016/j.scico.2016.02.007
fatcat:jgiztzg2fndxvh7hf7jk2hxyqu
An Interface Theory for Program Verification
[chapter]
2020
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.
We start with the interface $$I_{P}$$ of the program itself, which represents all traces of program executions. ...
Ultimately, we want a compact representation of the program behavior as a correctness interface $$I_{C}$$ in terms of inductive invariants. ...
|= φ, with ever increasing values for length k of the inductive-step. ...
doi:10.1007/978-3-030-61362-4_9
fatcat:lnkkcvr37ndm5cmrobrsbss63u
On the role of automated theorem proving in the compile-time derivation of concurrency
1985
Journal of automated reasoning
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.
The application of formal rules lends itself to automation. We investigate the automation of one part of a methodology for programming with concurrency. ...
In this methodology, concurrency is derived by transforming the sequential execution of a program into an equivalent concurrent execution on the basis of formal transformation rules. ...
J Moore really bore the burden of introducing me to automated theorem proving. He also helped me getting started with the implementation of my theory. ...
doi:10.1007/bf00244290
fatcat:n5oyqc6v2ngm3an66ofzulaheq
Refinement Reflection (or, how to turn your favorite language into a proof assistant using SMT)
[article]
2016
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.
Refinement Reflection turns your favorite programming language into a proof assistant by reflecting the code implementing a user-defined function into the function's (output) refinement type. ...
of higher order, recursive functions to the Monoid, Applicative, Functor and Monad type class laws for a variety of instances. ...
Refinements are a pale shadow of what is possible with dependently typed languages like Coq, Agda and Idris which permit "deep" specification and verification. ...
arXiv:1610.04641v1
fatcat:rbhguza4cvfznflzmrzmdfqsba
Principles for Verification Tools: Separation Logic
[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.
A principled approach to the design of program verification and con- struction tools is applied to separation logic. ...
Verification conditions and transformation laws are derived by equational reasoning within the predicate transformer quantale. ...
This supports a shallow algebraic embedding of a simple while language with the usual pseudocode for the verification of imperative programs. ...
arXiv:1410.4439v1
fatcat:7q7xha2wund3jghq6d2kp4xtxi
Program Analysis and Verification Based on Kleene Algebra in Isabelle/HOL
[chapter]
2013
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 2017; you can also visit the original URL.
The file type is application/pdf.
Schematic Kleene algebra with tests (SKAT) supports the equational verification of flowchart scheme equivalence and captures simple while-programs with assignment statements. ...
We apply this extension in simple program verification examples and the derivation of additional Hoare-style rules. ...
While, in the context of verification, these tasks belong more or less to the metalevel, they are part of actual correctness proofs in program construction, transformation or refinement. ...
doi:10.1007/978-3-642-39634-2_16
fatcat:bzxg2fl7i5gvfevgx444jsuwgy
Page 5898 of Mathematical Reviews Vol. , Issue 87j
[page]
1987
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
by Németi [op. cit.] concerning the lattice of program verification methods, i.e., the comparative power of reasoning of various program verification methods with respect to partial cor- rectness. ...
Another consequence of the transformation of these methods into NDL is the ability to
compare their program verification powers. ...
Recursive Program Optimization Through Inductive Synthesis Proof Transformation
1999
Journal of automated reasoning
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.
We compare and contrast this approach with the more traditional approaches to program transformation, and highlight the benefits of proof transformation with regards to search, correctness, automatability ...
We describe a working proof transformation system which, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming ...
Synthesis and Verification The synthesis component of the transformation process is concerned with the formation of the target tuple, the replacement of the source induction by a target induction with ...
doi:10.1023/a:1005969312327
dblp:journals/jar/MaddenBS99
fatcat:bfa4t4khaje2donwrokh4u7yc4
Types and higher-order recursion schemes for verification of higher-order programs
2008
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '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 2009; you can also visit the original URL.
The file type is application/pdf.
A program is transformed to an HORS that generates a tree representing all the possible event sequences of the program, and then the HORS is modelchecked. ...
We also present a type-based verification algorithm for HORS's. ...
We identify the infinite tree ⊥(⊥(· · · )) with the term ⊥ below: When we are talking about typing, ⊥ is interpreted as the term ⊥, while when ⊥ is an input to an automaton, it is interpreted as the infinite ...
doi:10.1145/1480881.1480933
dblp:conf/popl/Kobayashi09
fatcat:3dnnboeoenfs7k5ye5gzxanloi
« Previous
Showing results 1 — 15 out of 19,962 results