A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf
.
Filters
Formally Verified System Initialisation
[chapter]
2013
Lecture Notes in Computer Science
In this paper we present an automatic and formally verified initialiser for component-based systems built on the general-purpose microkernel seL4. ...
The initialiser takes a declarative formal description of the desired initialised state and uses seL4-provided services to create all necessary components, setup their communication channels, and distribute ...
In particular, we show (a) an automatic initialiser for systems based on the formally verified seL4 microkernel, (b) a formal Isabelle/HOL model of this initialiser and its interaction with the kernel, ...
doi:10.1007/978-3-642-41202-8_6
fatcat:qwh3c4cu2zakxoxzljzblhmghq
Towards a verified component platform
2013
Proceedings of the Seventh Workshop on Programming Languages and Operating Systems - PLOS '13
This paper describes ongoing work on a new technique for reducing the cost of assurance of large software systems by building on a verified component platform. ...
By leveraging the isolation properties and communication guarantees of a formally verified platform, correctness arguments for critical components will be able to be derived independently and composed ...
The system initialisation described in Section 6 provides a formal theorem that the running system matches the capability distribution provided to the initialising task. ...
doi:10.1145/2525528.2525535
dblp:conf/sosp/FernandezKKA13
fatcat:74yb22lhzbc3rlvnvvyrryc6eu
Improving System-Level Verification of SystemC Models with SPIN
2013
French Singaporean Workshop on Formal Methods and Applications
Guaranteeing safety of such systems makes formal verification crucial. In this paper we present a novel approach for verifying SystemC models with SPIN. ...
Focusing on system-level verification we reuse compiled and executable code from the original model and embed it into the verifier generated by SPIN. ...
Consequently, formally verifying that certain properties of the system hold under all circumstances becomes a central task in system design. ...
doi:10.4230/oasics.fsfma.2013.74
dblp:conf/fsfma/ElshuberKP13
fatcat:2ymtqtufjnb5fhiwin2clyqbwm
A hybrid verification approach: Getting deep into the design
2002
Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)
This reduces significantly the cost (both human and computing) of verifying circuits with complex initialisation, as well as simplifying proof development by enhancing verification productivity. ...
, the overall cost of verification can be reduced and we may be able to verify larger systems. ...
This shows that the verifier can guide the system into an interesting state and continue exploration from there. ...
doi:10.1109/dac.2002.1012604
fatcat:nqropdlokrgupgl6qz73ilskdq
Towards the Verification of Pervasive Systems
2010
Electronic Communications of the EASST
Our goal is to see to what extent current state of the art formal methods are capable of coping with the verification demand introduced by pervasive systems, and to point out their limitations. ...
Pervasive systems, that is roughly speaking systems that can interact with their environment, are increasingly common. ...
Pervasive systems used in safety or mission critical areas
⇒ want to apply formal methods to verify these systems
Difficult because
• interaction between components difficult to model
• need to ...
doi:10.14279/tuj.eceasst.22.315
dblp:journals/eceasst/ArapinisCDFGKMRRSUY09
fatcat:jbe7meuvt5eu7drjoqcnszbqt4
Formal Proof from UML Models
[chapter]
2004
Lecture Notes in Computer Science
We present a practical approach to a formal analysis of UMLbased models. ...
This is achieved by an underlying formal representation in Z, which allows us to pose and discharge conjectures to analyse models. ...
For the example, we proved the initialisation theorem for the whole system, ∃ System • SysInit. ...
doi:10.1007/978-3-540-30482-1_35
fatcat:v4oy74yokrbxveh3x5ky6swq44
Translating Event-B machines to Eiffel programs
[article]
2017
arXiv
pre-print
Formal modelling languages play a key role in the development of software since they enable users to prove correctness of system properties. ...
However, there is still not a clear understanding on how to map a formal model to a specific programming language. ...
Preliminaries
Event-B Event-B is a formal modelling language for reactive systems, introduced by Abrial [1] , which allows the modelling of complete systems. ...
arXiv:1706.04578v1
fatcat:qqwsojktvnhrhnz7c33ah3l5xe
Translation from Event-B into Eiffel
2018
Modelirovanie i Analiz Informacionnyh Sistem
of system properties, especially for critical systems. ...
Thus, users can develop systems (i) starting with the modelling of functional requirements (properties) in Event-B, then (ii) formally proving the correctness of such properties in Rodin and finally (iii ...
By translating Proof Obligations into Specification Drivers [9] it will be possible to formally verify the translated Eiffel code against its contracts. ...
doi:10.18255/1818-1015-2018-6-623-636
fatcat:mbi3nwdvcrf4pbuqfmtbo5wvwe
Patterns for Refinement Automation
[chapter]
2010
Lecture Notes in Computer Science
Formal modelling is indispensable for engineering highly dependable systems. However, a wider acceptance of formal methods is hindered by their in-sufficient usability and scalability. ...
This establishes a basis for building a tool supporting formal system development via pattern reuse and instantiation. ...
System development by stepwise refinement is a formal modeldriven development approach that advocates development of systems correct by construction. ...
doi:10.1007/978-3-642-17071-3_4
fatcat:7a3nrpg6avdavaal6r7wsafknu
Formal Modelling of Separation Kernel Components
[chapter]
2010
Lecture Notes in Computer Science
The results are part of an experiment in a Grand Challenge in software verification, as part of a pilot project in verified OS kernels. ...
Their small size and widespread use in high-integrity environments make them good targets for formal modelling and verification. ...
We are grateful to Iain Craig for his useful account of formal kernel specification and modelling. ...
doi:10.1007/978-3-642-14808-8_16
fatcat:5zypmrigu5ggfjrk3cbuja6yku
Formal Verification of Railway Timetables - Using the UPPAAL Model Checker
[chapter]
2019
Lecture Notes in Computer Science
The formal model describes the system behaviour of trains driving according to the given railway timetable. ...
Model checking can then be used to check that driving according to the timetable does not lead to illegal system states. ...
have had the great pleasure of meeting Stefania Gnesi at many occasions and would like to thank her for inspiration, discussions, and collaboration, especially in European Technical Working Group on Formal ...
doi:10.1007/978-3-030-30985-5_25
fatcat:khxlcfrvs5ak3or3cth3ic64uy
Algebraic models of correctness for abstract pipelines
2003
The Journal of Logic and Algebraic Programming
We define formal correctness conditions, and introduce the one-step theorems that can reduce the complexity of formal verification. ...
systems applicable to a range of software systems. ...
To illustrate our techniques, we formally verify two simple implementations of a pipelined system. The first implementation contains a pipeline that is always full. ...
doi:10.1016/s1567-8326(03)00041-9
fatcat:fg52xyfuvngaznxligtohebar4
The Billion-Dollar Fix
[chapter]
2013
Lecture Notes in Computer Science
We initialise the security system with a null pointer, instead of a database, then initialise the database with the now-extant security subsystem, and then use a setter method to link the database back ...
Servetto et al. first attempt Security s=new Security(dba); DBA dba=new DBA(s,gui); SMS sms=new SMS(s,dba); GUI gui=new GUI(sms,dba,s); attempting to initialise the security system with the database before ...
do they accept null pointers -indeed, there are no null values at all in our formal system. ...
doi:10.1007/978-3-642-39038-8_9
fatcat:yjxvnmzk65badikadtgjfuhbj4
Towards Probabilistic Modelling in Event-B
[chapter]
2010
Lecture Notes in Computer Science
In Section 2 we overview our formal framework -Event-B. In Section 3 we introduce a general pattern for specifying cyclic systems. ...
In Section 4 we demonstrate how to augment Event-B models with probabilities to enable formal modelling and refinement of fully probabilistic systems. ...
In particular, to verify correctness of a specification, we need to prove that its initialisation and all events preserve the invariant. ...
doi:10.1007/978-3-642-16265-7_20
fatcat:jghwxcymyfgr5j2mtwscuwzof4
Secure synthesis of code: a process improvement experiment
[chapter]
1999
Lecture Notes in Computer Science
Arguments for and against the deployment of formal methods in system design are rarely supported by evidence derived from experiments that compare a particular formal approach with conventional methods ...
We illustrate an approach to the use of formal methods for secure code synthesis in safety-critical Avionics applications. ...
formally verified. ...
doi:10.1007/3-540-48118-4_46
fatcat:afsntyq5bzdwrprxvyhwakcbdq
« Previous
Showing results 1 — 15 out of 10,873 results