A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Automation for exception freedom proofs
18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings.
Preserved Fulltext
Proofs are constructed to show that each run-time check will never raise an error, thus proving freedom from run-time exceptions. ...
Here we build upon the success of the SPARK approach by increasing the level of automation that can be achieved in proving freedom from exceptions. ...
Acknowledgements: In particular we would like to thank Peter Amey and Rod Chapman for their support in our research. ...
doi:10.1109/ase.2003.1240334
dblp:conf/kbse/EllisI03
fatcat:luj7ztubp5hbfkw55motjftvgu
An Integrated Approach to High Integrity Software Verification
2006
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 2007; you can also visit the original URL.
The file type is application/pdf.
The context for our work is the SPARK Approach for the development of high integrity software. The SPARK Approach provides a significant degree of automation in proving exception freedom. ...
Using automated reasoning techniques, we tackle the niche activity of proving that a program is free from run-time exceptions. ...
Acknowledgements In particular we would like to thank Peter Amey for his support in our research. ...
doi:10.1007/s10817-006-9034-1
fatcat:kdzc2dkiwbgxtlkthyljo7awm4
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 propose the use of an existing planning technique, called proof planning, as a possible basis for achieving strong integration. ...
We argue for the importance of tool integration in achieving the Program Verifier Grand Challenge. ...
NuSPADE focused in particular on automation for run-time exception freedom proofs. The above list is by no means complete. ...
doi:10.1007/978-3-540-69149-5_45
fatcat:uey2thy64zfw3fcnbgm5o4cqhm
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.
The resulting integration was applied to industrial strength problems and successfully increased the level of proof automation for exception freedom proofs [29] . ...
One of its key selling points is its support for automating so called exception freedom proofs, i.e. proving that a system is free from common run-time errors such as buffer overflows. ...
doi:10.1145/1345169.1345175
fatcat:2c5i67mz4fguzogyeoflfoe2li
The highs and lows of deploying Formal Methods in Industry
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.
Formal proofs remain difficult to construct, especially for anything but the simplest of programs. Merely constructing assertions to characterise program correctness is a difficult challenge. ...
Other general correctness properties such as freedom from deadlocks, non-determinism, incomplete cases, etc. would also be verified. ...
Formal proofs remain difficult to construct, especially for anything but the simplest of programs. Merely constructing assertions to characterise program correctness is a difficult challenge. ...
doi:10.14279/tuj.eceasst.70.976
dblp:journals/eceasst/Broadfoot14
fatcat:5gizpjugpndmniygnbxejhr53a
Industrial strength exception freedom
2002
Proceedings of the 2002 annual ACM SIGAda international conference on Ada The engineering of correct and reliable software for real-time & distributed systems using Ada and related technologies - SIGAda '02
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.
The paper explains how automated techniques based on formal verification or proof techniques have now matured and provide an industrial strength solution. ...
Despite this progress a less tractable class of errors remain: run-time exceptions. For safety-related systems a run-time error may be just as hazardous as any other logical error. ...
Using proof-based techniques, static proof of exception freedom is tractable and easy for real developers of real industrial systems right now! ...
doi:10.1145/589451.589452
dblp:conf/sigada/AmeyC02
fatcat:rpsqoqirqjftrgdltxu5eaabia
Industrial strength exception freedom
2003
ACM SIGAda Ada Letters
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.
The paper explains how automated techniques based on formal verification or proof techniques have now matured and provide an industrial strength solution. ...
Despite this progress a less tractable class of errors remain: run-time exceptions. For safety-related systems a run-time error may be just as hazardous as any other logical error. ...
Using proof-based techniques, static proof of exception freedom is tractable and easy for real developers of real industrial systems right now! ...
doi:10.1145/1066404.589452
fatcat:arl67hw67zbodgkoujwkeuo5ey
Modelling and Implementation of Correct by Construction Healthcare Workflows
[chapter]
2015
Lecture Notes in Business Information Processing
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.
, and deadlock and livelock freedom. ...
It relies on the theoretical concept of proofs-as-processes that draws a connection between logical proofs and process workflows. ...
freedom. ...
doi:10.1007/978-3-319-15895-2_3
fatcat:f7x3piwbojdixd327xv2ezy4vm
Complx: a verification framework for concurrent imperative programs
2017
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs - CPP 2017
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 aim to then target concurrent operating systems, such as the interruptible eChronos embedded operating system for which we already have a model-level OG proof using Hoare-Parallel. ...
We illustrate our framework on an example that features exceptions, guards and function calls. ...
As in Hoare-Parallel, most of the generated proof obligations get easily discharged using Isabelle/HOL automation. ...
doi:10.1145/3018610.3018627
dblp:conf/cpp/AmaniABLRT17
fatcat:yj7nwlnsk5brdc7cglimqa5iqe
Turning good practices into great businesses
2015
British Dental Journal
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 orthodontic blueprint: The ultimate guide on how to build your automated practice and get your freedom back' has been created exclusively for dentists and orthodontists who are looking to increase ...
The email marketing solution combines exceptional software from US marketing giant Infusionsoft with the business expertise of 7connections to help you not only reach new people, but also develop your ...
doi:10.1038/sj.bdj.2015.573
fatcat:zje4bibrhjezzpvvgf6aow4iuy
II Breadth
[chapter]
2015
The Greatest Possible Freedom
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 evolution went from restrictive exceptions to the freedom of services over the broadly interpreted scope of the freedom to broadly construed provisions enshrining the free movement of services in general ...
The feeling is hard to dispel that we have already moved quite deeply into legal automation. ...
doi:10.5771/9783845265490-553
fatcat:jarkneuvmjfanmbv7ups3j5g74
Proving Lock-Freedom Easily and Automatically
2015
Proceedings of the 2015 Conference on Certified Programs and Proofs - CPP '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.
As a global property, lock-freedom is typically shown by global proofs or complex iterated arguments. We show that this complexity is not needed in practice. ...
Lock-freedom is a liveness property satisfied by most non-blocking concurrent algorithms. ...
Acknowledgements We would like to thank Marko Doko and the anonymous CPP'15 reviewers for their helpful feedback. We acknowledge support from the EC FET project ADVENT. ...
doi:10.1145/2676724.2693179
dblp:conf/cpp/JiaLV15
fatcat:iu3xg3ndfvewhb27n2px6wjhie
Formal verification of standards for distance vector routing protocols
2002
Journal of the ACM
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 2010; you can also visit the original URL.
The file type is application/pdf.
These case studies show significant benefits from automated support in reduced verification workload and assistance in finding new insights and gaps for standard specifications. ...
We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector protocol for wireless networks. ...
We also thank anonymous referees for their input. ...
doi:10.1145/581771.581775
fatcat:ea7lsanwknc7pakkwzflcpjlci
DESIGN OF AUTOMATED CONVEYORISED FIXTURE ARRANGEMENT FOR BANJO BEAM IN SPECIAL PURPOSE MACHINE
2012
International Journal of Instrumentation Control and Automation
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 moving Fixture for Banjo Beam or Case Axle cleaning machine is taken from the special purpose machine in which Different 17 types of components are to be cleaned ,dry, and proceed for painting ...
The system is made for multistage processing with well defined process and operation for the decided cycle time. ...
except the three transitional degrees of freedom (-X, -Y and -Z) in order to locate the work piece in the fixture. ...
doi:10.47893/ijica.2012.1045
fatcat:oxdp7rz76rcjtgbxtbupsocagi
Automated test-data generation for exception conditions
2000
Software, Practice & Experience
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.
A process for integrating automated testing with exception freeness proofs is presented as a way forward for tackling the special needs of safety critical systems. ...
This paper presents a technique for automatically generating test-data to test exceptions. ...
The verification conditions detail the proof obligations for a proof of exception freeness. ...
doi:10.1002/(sici)1097-024x(200001)30:1<61::aid-spe292>3.0.co;2-9
fatcat:odikz4ywgfaopf7bvhgirbxfxq
« Previous
Showing results 1 — 15 out of 27,703 results