Filters








504 Hits in 5.2 sec

Result Certification of Static Program Analysers with Automated Theorem Provers [chapter]

Frédéric Besson, Pierre-Emmanuel Cornilleau, Thomas Jensen
2014 Lecture Notes in Computer Science  
In an ideal world, user-provided invariants would be strengthened by incorporating the result of static analysers as untrusted annotations and discharged by automated theorem provers.  ...  However, the results of object-oriented analyses are heavily quantified and cannot be discharged, within reasonable time limits, by state-of-the-art automated theorem provers.  ...  Vittet for porting the Null Inference Tool (Nit) to Sawja and helping with the experiments.  ... 
doi:10.1007/978-3-642-54108-7_16 fatcat:66itrrnsgvghrdmedy3umlt24e

Software engineering and automated deduction

Willem Visser, Nikolaj Bjørner, Natarajan Shankar
2014 Proceedings of the on Future of Software Engineering - FOSE 2014  
Then we consider some of the current and future trends in software engineering and the type of advances it may require from automated deduction.  ...  In the first part we briefly summarize the use of automated deduction within software engineering.  ...  The result of the analysis is a logical formula that is passed to a theorem prover.  ... 
doi:10.1145/2593882.2593899 dblp:conf/icse/VisserBS14 fatcat:cdgga6syovar5hr4mfzjyyi4se

Verifying a Plaftorm for Digital Imaging: A Multi-tool Strategy [chapter]

Jónathan Heras, Gadea Mata, Ana Romero, Julio Rubio, Rubén Sáenz
2013 Lecture Notes in Computer Science  
In a previous work, we have formalised the correctness of the programs which use homological techniques to analyse digital images. However, the verification of Fiji's pre-processing step was missed.  ...  In particular, in our research -made together with a biologists team; we use Fiji in some pre-processing steps before undertaking a homological digital processing of images.  ...  The reliability of results is instrumental in biomedical research; therefore, we are working towards the certification of the programs that we use to analyse biomedical images.  ... 
doi:10.1007/978-3-642-39320-4_5 fatcat:r7hup57jtrcwxnix4ux2h7imm4

Verifying a platform for digital imaging: a multi-tool strategy [article]

Jónathan Heras, Gadea Mata, Ana Romero, Julio Rubio, Rubén Sáenz
2013 arXiv   pre-print
In a previous work, we have formalised the correctness of the programs which use homological techniques to analyse digital images. However, the verification of Fiji's pre-processing step was missed.  ...  In particular, in our research - made together with a biologists team; we use Fiji in some pre-processing steps before undertaking a homological digital processing of images.  ...  Due to the fact that the reliability of results is instrumental in biomedical research, we are working towards the certification of the programs that we use to analyse biomedical images -here, certification  ... 
arXiv:1303.1420v2 fatcat:7mekzvfstzgpdcgya3igc33fx4

Language Based Verification Tools for Functional Programs (Dagstuhl Seminar 16131)

Marco Gaboardi, Suresh Jagannathan, Ranjit Jhala, Stephanie Weirich, Marc Herbstritt
2016 Dagstuhl Reports  
These techniques include advanced type systems, contract systems, model checking and program analyses specially tailored to exploit the structure of functional languages.  ...  This report documents the program and the outcomes of Dagstuhl Seminar 16131 "Language Based Verification Tools for Functional Programs".  ...  Overall, this method allows to achieve both high standards of automated proof certification and compatibility of the automated prover with the target compiler.  ... 
doi:10.4230/dagrep.6.3.59 dblp:journals/dagstuhl-reports/GaboardiJJW16 fatcat:zeqdceqvzrgplfdpsbt6deoi2i

Highly Automated Formal Proofs over Memory Usage of Assembly Code [chapter]

Freek Verbeek, Joshua A. Bockenek, Binoy Ravindran
2020 Lecture Notes in Computer Science  
These binaries are the result of a complex build-chain compiling production code, and contain various complex and nested loops, large and compound data structures, and functions with over 100 basic blocks  ...  Our verification method is based on interactive theorem proving, but provides automation by generating pre-and postconditions, invariants, controlflow, and assumptions on memory layout.  ...  The certificate is loaded into a theorem prover, where it is verified. Since the problem of memory usage is undecidable, we use an interactive theorem prover.  ... 
doi:10.1007/978-3-030-45237-7_6 fatcat:jlabxfgxonfojob46dquwcx4zi

Certified Complexity (CerCo) [chapter]

Roberto M. Amadio, Nicolas Ayache, Francois Bobot, Jaap P. Boender, Brian Campbell, Ilias Garnier, Antoine Madet, James McKinna, Dominic P. Mulligan, Mauro Piccolo, Randy Pollack, Yann Régis-Gianas (+3 others)
2014 Lecture Notes in Computer Science  
The plugin certifies that the program respects these costs by calling automated theorem provers, a new and innovative technique in the field of cost analysis.  ...  To reduce the trusted code base, we implemented a prototype and a static analyser in an interactive theorem prover, which was used to certify that the costs added to the source code are indeed those incurred  ... 
doi:10.1007/978-3-319-12466-7_1 fatcat:v7qsmewnarectofwkpjvyuwdbu

A Certifying Code Generation Phase

Jan Olaf Blech, Arnd Poetzsch-Heffter
2007 Electronical Notes in Theoretical Computer Science  
The proof is checked in a separate theorem prover. If the theorem prover is content with the proof one can be sure that the compiler produced correct code.  ...  It turns out that the checking of the certificates is the actual bottleneck of certifying compilation. We present a proof schema to overcome this bottleneck.  ...  A related area of future work is to investigate the potential advantages of other theorem provers for use as certificate checkers.  ... 
doi:10.1016/j.entcs.2007.09.008 fatcat:nlupz6t4zvdqtouwp23l2m72wq

An Evidential Tool Bus [chapter]

John Rushby
2005 Lecture Notes in Computer Science  
formal verification with a theorem prover.  ...  Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and development of computer systems and  ...  Acknowledgments This proposal for an evidential tool bus was developed through discussions with my colleagues Leonardo de Moura, Sam Owre, N. Shankar, and Ashish Tiwari.  ... 
doi:10.1007/11576280_3 fatcat:4jl4aprq2ndevopbpewwtmniae

Computational Verification of Network Programs in Coq [chapter]

Gordon Stewart
2013 Lecture Notes in Computer Science  
We report on the design of the first fully automatic, machinechecked tool suite for verification of high-level network programs.  ...  The tool suite targets programs written in NetCore, a new declarative network programming language.  ...  I am indebted to the members of the Princeton programming languages group for reading and commenting on early versions of this paper, and to the anonymous reviewers for their insightful comments.  ... 
doi:10.1007/978-3-319-03545-1_3 fatcat:qwo3wy6uajaxfi3i2xwkyl7hjy

A Proof-Carrying-Code Infrastructure for Resources

Hans-Wolfgang Loidl, Kenneth MacKenzie, Steffen Jost, Lennart Beringer
2009 2009 Fourth Latin-American Symposium on Dependable Computing  
To this end we present a complete Proof-carrying-code (PCC) infrastructure for independent and automatic certification of resource bounds of mobile JVM programs.  ...  This includes a certifying compiler for a high-level language, which produces a certificate of bounded heap consumption, and independent certificate validation, realised via proof-checking, on the code-consumer  ...  theorem prover.  ... 
doi:10.1109/ladc.2009.13 dblp:conf/ladc/LoidlMJB09 fatcat:bt3m5rvwmbcdhm5tw6zxuzwh7q

Certifying deadlock-freedom for BIP models

Jan Olaf Blech, Michaël Périn
2009 Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems - SCOPES '09  
These certificates comprise a proof of deadlock-freedom of the BIP model which can be checked by an independent checker. We use the Coq theorem prover as certificate checker.  ...  With the help of certificates one gets a deadlock-freedom guarantee of BIP models without having to trust or even take a look at the deadlock checking tool.  ...  For checking certificates we rely on the proof-checker of the higher-order theorem prover Coq. Certificates are proof scripts for Coq.  ... 
doi:10.1145/1543820.1543832 fatcat:shh356vvwvgt5e5lauchjdcqhu

Sound methods and effective tools for model-based security engineering with UML

Jan Jürjens
2005 Proceedings of the 27th international conference on Software engineering - ICSE '05  
Here, we concentrate on an automated theorem prover binding to verify security properties of UMLsec models which make use of cryptography (such as cryptographic protocols).  ...  In particular, it includes various plugins performing different security analyses on models of the security extension UMLsec of UML.  ...  Fruitful collaborations with Robert Schmidt and Thomas Kuhn and helpful discussions with Gernot Stenz and Matthias Schwan are gratefully acknowledged, as well as interesting discussions with Carlo Montangero  ... 
doi:10.1145/1062455.1062519 dblp:conf/icse/Jurjens05 fatcat:ktgzyrpznbg4pfolguurvx6ope

Auditing User-Provided Axioms in Software Verification Conditions [chapter]

Paul Jackson, Florian Schanda, Angela Wallenburg
2013 Lecture Notes in Computer Science  
Such axioms can also describe properties of constants, functions and relations that are introduced to help with program specification.  ...  Such axioms can capture aspects of the program's specification or can be hints to help automatic provers. There is always the danger of mistakes in these axioms.  ...  The results obtained with main approaches are dependent on the theorem proving power of the selected prover.  ... 
doi:10.1007/978-3-642-41010-9_11 fatcat:x67mvo77d5fzxp7jtywn2klhwq

Operating system verification—An overview

Gerwin Klein
2009 Sadhana (Bangalore)  
This paper gives a high-level introduction to the topic of formal, interactive, machine-checked software verification in general, and the verification of operating systems code in particular.  ...  We survey the state of the art, the advantages and limitations of machinechecked code proofs, and describe two specific ongoing larger-scale verification projects in more detail.  ...  Acknowledgements The author would like to thank Elisabeth Meister, Timothy Bourke, Mark Hillebrand, Tom in der Rieden, Norbert Schirmer, and Hendrik Tews for their feedback and for reading drafts of this  ... 
doi:10.1007/s12046-009-0002-4 fatcat:pl7j3msbsncnhmwg5w34r2uee4
« Previous Showing results 1 — 15 out of 504 results