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
Verification of C Programs Using Automated Reasoning
2007
Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007)
Preserved Fulltext
We can then use this link to move notions of refinement between the event-and state-based worlds. ...
Here we define feature refinement to overcome some limitations of refinement and show its usefulness by applying it to examples taken from the literature. ...
Acknowledgements We thank various referees for their comments, and the Foundation for Science, Research and Technology (FRST) of New Zealand for funding this research. ...
doi:10.1109/sefm.2007.44
dblp:conf/sefm/CrockerC07
fatcat:66rnxadqs5gv7cnfk75id7ayca
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
2008
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 2009; you can also visit the original URL.
The file type is application/pdf.
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. ...
Keywords Memory model · C · Program verification · Compilation · Compiler correctness · The Coq proof assistant Introduction A prerequisite to the formal verification of computer programs-by model checking ...
Sylvain Conchon, Jean-Christophe Filliâtre and Benjamin Monate helped us experiment with automatic theorem provers. ...
doi:10.1007/s10817-008-9099-0
fatcat:3g2tgdn5hncv5gbhiebddxau4y
Towards Automatic Assertion Refinement for Separation Logic
2006
21st IEEE/ACM International Conference on Automated Software Engineering (ASE'06)
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.
Separation logic holds the promise of supporting scalable formal reasoning for pointer programs. Here we consider proof automation for separation logic. ...
In particular we propose an approach to automating partial correctness proofs for recursive procedures. Our proposal is based upon proof planning and proof patching via assertion refinement. ...
Thanks go to Alan Bundy, Bill Ellis, Jamie Gabbay, Paul Jackson, Alberto Momigliano, Alan Smaill, and members of the Dependable Systems and Mathematical Reasoning Groups for their feedback on this work ...
doi:10.1109/ase.2006.69
dblp:conf/kbse/Ireland06
fatcat:tv4c7t5axnf2ddvx435s564jp4
Cooperative reasoning for automatic software verification
2007
Proceedings of the second workshop on Automated formal methods - AFM '07
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.
This integration was used to reason about pointer programs written in C. ...
For us the pay-off of achieving this level of cooperation will be measured in terms of automation, i.e. we believe that this form of cooperation will deliver verification automation where skilled human ...
doi:10.1145/1345169.1345175
fatcat:2c5i67mz4fguzogyeoflfoe2li
Practical Aspects of Automated Deduction for Program Verification
2010
Künstliche Intelligenz
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.
This article describes the aspects of automated deduction that are important for program verification in practice, and it gives an overview of the reasoning mechanisms, the methodology, and the architecture ...
of modern program verification systems. ...
The field of deductive program verification, i.e., formal reasoning about the behaviour of programs, is old. ...
doi:10.1007/s13218-010-0001-y
fatcat:oungj4soo5dkzpaz4botsf22hq
Preface: The field of automated reasoning
1995
Computers and Mathematics with Applications
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.
The term automated reasoning (first introduced in 1980) accurately describes the objective of the field, the automation of logical reasoning. ...
Their application provides a new use for automated reasoning programs. 2.4. R. S. Boyer, M. Kaufmann, and 3. S. Moore-Nqthm and Verification
2.5. S. C. Chou and X. S. ...
They use a method of Padmanabhan to find a single axiom, then show how the automated reasoning program OTTER was used to obtain a simpler axiom. paper "Automated Reasoning about Cubic Curves," R. ...
doi:10.1016/0898-1221(95)90069-1
fatcat:oby6uqz5qrh6nhxrunon6q4aom
Tool Integration for Reasoned Programming
[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 2017; you can also visit the original URL.
The file type is application/pdf.
We argue for the importance of tool integration in achieving the Program Verifier Grand Challenge. ...
We propose the use of an existing planning technique, called proof planning, as a possible basis for achieving strong integration. ...
Caveat includes a theorem prover that supports the verification of annotated C programs. ...
doi:10.1007/978-3-540-69149-5_45
fatcat:uey2thy64zfw3fcnbgm5o4cqhm
Integrated Reasoning and Proof Choice Point Selection in the Jahob System – Mechanisms for Program Survival
[chapter]
2009
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.
The automated reasoning systems are able to automatically perform the vast majority of the reasoning steps required for this verification. ...
In recent years researchers have developed a wide range of powerful automated reasoning systems. ...
It then splits the verification conditions into subformulas and, with the aid of formula approximation, uses the integrated automated reasoning systems to prove the subformulas [10, 8] . ...
doi:10.1007/978-3-642-02959-2_1
fatcat:vnzeyjzrrneopp2swxreizxsuu
An integrated proof language for imperative programs
2009
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation - PLDI '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.
The language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations. ...
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. ...
doi:10.1145/1542476.1542514
dblp:conf/pldi/ZeeKR09
fatcat:5uzckco6n5dqvfvplxwxn2n54y
An integrated proof language for imperative programs
2009
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 language operates in the context of a program verification system that uses multiple reasoning systems to discharge generated proof obligations. ...
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. ...
doi:10.1145/1543135.1542514
fatcat:7qbsbwma5fg3xjxnaqi22eljby
Symbolic Computation and Automated Reasoning for Program Analysis
[chapter]
2016
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1704.03202v1 fatcat:ofgfrw65rrai7osanepvy5givy
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating ...
These extensions allow us to express program properties directly in first-order logic and hence use further first-order theorem provers to reason about program properties. ...
Voronkov (The University of Manchester and Chalmers University of Technology). ...
doi:10.1007/978-3-319-33693-0_2
fatcat:hyz76ibeuva2djyyejvvs2dbtu
Symbol Elimination for Automated Generation of Program Properties
2014
Electronic Communications of the EASST
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.
Automatic understanding of the intended meaning of computer programs is a very hard problem, requiring intelligence and reasoning. ...
Moreover, symbol elimination can be used as an alternative to interpolation for software verification. ...
The results summarised in this abstract describe how the combination of automated reasoning and symbolic computation methods can be used for automatic program analysis. ...
doi:10.14279/tuj.eceasst.70.974
dblp:journals/eceasst/Kovacs14
fatcat:ztdel2bq4vcujehrer2rx5dl6i
Regression verification for automated evaluation of students programs
2019
Computer Science and Information Systems
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.
In this paper we examine potentials of using it in one novel domain -in automated evaluation of students programs. ...
Regression verification is a form of software verification based on formal static analysis of code, which is used, since recently, in several domains. ...
This work was partially supported by the Serbian Ministry of Science grant 174021 and by the COST action CA15123. ...
doi:10.2298/csis181220019v
fatcat:x3llb6iwqbhatfxpfe35qdugzi
PhD Abstracts
2020
Journal of functional 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 2020; you can also visit the original URL.
The file type is application/pdf.
As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year. ...
Many students complete PhDs in functional programming each year. ...
suitable for efficient C code generation; and one functional, suitable for equational reasoning and verification. ...
doi:10.1017/s0956796819000200
fatcat:rsyetan23fgzzhrg7vlk3h2frm
Requirement and Result of Verifying the Program Code
English
2014
International Journal of Computer Trends and Technology
English
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 2015; you can also visit the original URL.
The file type is application/pdf.
A system is required that uses integrated reasoning to split each verification condition into a conjunction of simpler sub formulas, then apply a diverse collection of specialized decision procedures, ...
The verification of Java/C++ codes is critical, especially for special projects where human life will be at stake. ...
Reasoning about a small fragment of a program at a time makes the verification process easier and more scalable, and allows the use of very specific, expressive properties. ...
doi:10.14445/22312803/ijctt-v9p112
fatcat:nyl4ze7f2rgwfg62lrfrsh4fhu
« Previous
Showing results 1 — 15 out of 82,713 results