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.
Filters
Verifying Array Programs by Transforming Verification Conditions
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
We present a method for verifying properties of imperative programs manipulating integer arrays. We assume that we are given a program and a property to be verified. ...
Our approach provides a very rich program verification framework where one can compose together several verification strategies, each of them being implemented by transformations of CLP(Array) programs ...
Acknowledgements We would like to thank the anonymous referees for their helpful comments and constructive criticism. ...
doi:10.1007/978-3-642-54013-4_11
fatcat:f347lp3cwndclmjj7qprwc2r4e
Debugging Program Verification Proof Scripts (Tool Paper)
[article]
2018
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.
The tool is built on top of KeY, a system for deductive verification of Java programs. ...
To support the process of constructing a complete proof, many interactive program verification systems offer a proof scripting language as a text-based way to describe the non-automatic steps in a proof ...
It implements our interaction concept for interactive program verification described in [1] . psdbg combines point-and-click with textbased interaction based on a scripting language for proofs, kps (Sect ...
arXiv:1804.04402v1
fatcat:s5nwb5ne5zbfbieixkqwhm4hbq
VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution)
[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 2020; you can also visit the original URL.
The file type is application/pdf.
VeriAbs is a strategy selection based reachability verifier for C code. ...
These changes have improved the verification of programs with arrays, and unstructured loops and unstructured control flows. ...
Loop Pruning is an array abstraction technique that defines a set of criteria (and a resulting set of program transformation rules) which if satisfied by loops processing arrays, it is sufficient to analyze ...
doi:10.1007/978-3-030-45237-7_25
fatcat:5y4nsgyi3jbsxm7e2w7bykn2au
Verification of Imperative Programs by Constraint Logic Program Transformation
2013
Electronic Proceedings 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.
Other Versions
We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs ...
These transformations are based on well-known transformation rules, such as unfolding and folding, guided by suitable transformation strategies, such as specialization and generalization. ...
Acknowledgments We thank the anonymous referees for their constructive comments. ...
doi:10.4204/eptcs.129.12
fatcat:ot54j7sol5errm7cryxolqywcy
An Exercise in Invariant-based Programming with Interactive and Automatic Theorem Prover Support
2012
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1202.4829v1 fatcat:jx7zpob7k5crxfnnb4j4oitq6u
Invariant-Based Programming (IBP) is a diagram-based correct-by-construction programming methodology in which the program is structured around the invariants, which are additionally formulated before the ...
Socos is a program construction and verification environment built specifically to support IBP. ...
Introduction Invariant-based programming (IBP) is a method for formal verification of imperative programs [3] . ...
doi:10.4204/eptcs.79.2
fatcat:osm5bbo5ync63mmnbcy5jm6l34
QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
[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 2017; you can also visit the original URL.
The file type is application/pdf.
As a library, it is useful for inferring relational data invariants in programs that manipulate data structures. ...
In this paper we present the architecture of the library, guidelines on how to select heuristics, and an example instantiation of the library using the Apron library to verify set-manipulating programs ...
This kind of reasoning is useful for a variety of applications: -Whole-program verification of container-manipulating programs -The QUICr library can reason about constants and known sets as well as unknown ...
doi:10.1007/978-3-319-08867-9_57
fatcat:2crmdxtazrg2zm4y7yxtghsbm4
Proof-carrying code from certified abstract interpretation and fixpoint compression
2006
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.
Certificates take the form of strategies for reconstructing a fixpoint and are kept small due to a technique for fixpoint compression. ...
array-out-of-bounds accesses will occur. ...
For example, a safety test of array bounds checks would check the value of the index before each array access instruction of a program. ...
doi:10.1016/j.tcs.2006.08.012
fatcat:euvgvxbrcve6jkh5wzhuxahiyy
Introducing Formal Methods via Program Derivation
2015
Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education - ITiCSE '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 2017; you can also visit the original URL.
The file type is application/pdf.
Based on our learning from multiple years of paper and pencil based teaching, we have developed a programming assistant tool that addresses several of the issues faced by the students in the manual program ...
When using the verification tools, there is no structured help available to the students in the actual task of implementing the program, except for the hints provided by the failed proof obligations. ...
The work of the first author was supported by the Tata Consultancy Services (TCS) Research Fellowship and a grant from the Ministry of Human Resource Development, Government of India. ...
doi:10.1145/2729094.2742628
dblp:conf/iticse/ChaudhariD15
fatcat:tjuacgzgq5abbbmtnxcudnjkzq
Optimization of extrusion blow molding processes using soft computing and Taguchi's method
2004
Journal of Intelligent Manufacturing
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.
To do so, we proposed a new strategy called FUNTGA (FUzzy Neural-Taguchi network with Genetic Algorithm) that establishes a back propagation network using a Taguchi's experimental array to predict the ...
Genetic algorithm is then applied to search for the optimum design of die gap parison programming. ...
Acknowledgement The authors would like to thank the National Science Council of the Republic of China for financially supporting this research under Contract No. NSC89-2212-E155-019. ...
doi:10.1023/b:jims.0000037712.33636.41
fatcat:sgry2fxwmrcz5cyssfllw7l7qe
An interactive program verification system
1975
SIGPLAN notices
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 evaluator also has a limited capability for symbolic manipulation of arrays. ...
The system does have some built-in simplification rules for ASWAP(A,I,J) which swaps elements I and J in array A. ...
doi:10.1145/390016.808472
fatcat:jp3u45ngsfbobhawbs373byc4e
An interactive program verification system
1975
Proceedings of the international conference on Reliable software -
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 evaluator also has a limited capability for symbolic manipulation of arrays. ...
The system does have some built-in simplification rules for ASWAP(A,I,J) which swaps elements I and J in array A. ...
doi:10.1145/800027.808472
fatcat:ndrmy32ivbgmtjilbyun6uazyq
An interactive program verification system
1975
IEEE Transactions on Software Engineering
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 evaluator also has a limited capability for symbolic manipulation of arrays. ...
The system does have some built-in simplification rules for ASWAP(A,I,J) which swaps elements I and J in array A. ...
doi:10.1109/tse.1975.6312820
fatcat:hzu52wd3ofadvovowd4zxtkb3e
Java Bytecode Verification with OCL Why, How and Whenc
2020
Journal of Object Technology
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.
Following this path, a meta-model for bytecode is needed including OCL constraints for bytecode verification. ...
We analyze the semantic rules of the bytecode verifier according to their complexity factor, present a meta-model for Java bytecode, show how the semantic rules can be expressed as OCL constraints on top ...
We would also like to thank Mehmet Akşit, Arend Rensink and Bugra Yildiz for their contributions to early versions of our Java bytecode meta-model. ...
doi:10.5381/jot.2020.19.3.a13
fatcat:fndlb475ojabpkn6qxuhumwsfy
RustHorn: CHC-Based Verification for Rust Programs
[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 2020; you can also visit the original URL.
The file type is application/pdf.
The current CHC-based methods for pointer-manipulating programs, however, are not very scalable. ...
Reduction to the satisfiablility problem for constrained Horn clauses (CHCs) is a widely studied approach to automated program verification. ...
We are grateful to the anonymous reviewers for insightful comments. ...
doi:10.1007/978-3-030-44914-8_18
fatcat:ywyfga2j75g47aqrucvzt5qj74
Quantifiers on Demand
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
Automated program verification is a difficult problem. It is undecidable even for transition systems over Linear Integer Arithmetic (LIA). ...
We have implemented Quic3 within the Constrained Horn Clause solver engine of Z3 and experimented with it by applying Quic3 to verifying a variety of public benchmarks of array manipulating C programs. ...
This publication is part of a project that has received funding from the European Research Council ( ...
arXiv:2106.00664v1
fatcat:l2qehchwybcrfef5u4m57lgd4q
« Previous
Showing results 1 — 15 out of 15,517 results