Filters








205,309 Hits in 4.4 sec

Transforming Event B Models into Verified C# Implementations

Dominique Mery, Rosemary Monahan
unpublished
The transformations involved are (a) the transformation from an Event B specification into a concrete recursive algorithm and (b) the transformation from the recursive algorithm into its equivalent iterative  ...  B modelling language and its associated toolset, the Rodin platform.  ...  Conclusion We have presented and verified the correctness of two transformation rules, which transform EVENT B models into iterative algorithms.  ... 
doi:10.29007/9wm9 fatcat:7qexmzxinfdcpgi4a25tdxuwhu

Transforming EVENT B Models into Verified C# Implementations

Dominique Méry, Rosemary Monahan
unpublished
The transformations involved are (a) the transformation from an EVENT B specification into a concrete recursive algorithm and (b) the transformation from the recursive algorithm into its equivalent iterative  ...  Here, we are concerned with the refinement of specifications using the EVENT B modelling language and its associated toolset, the RODIN platform.  ...  Conclusion We have presented and verified the correctness of two transformation rules, which transform EVENT B models into iterative algorithms.  ... 
fatcat:tnr7j3g6njbbndxerwkf6upeze

Automatic Generation of DistAlgo Programs from Event-B Models [chapter]

Alexis Grall
2020 Lecture Notes in Computer Science  
Our objective is to develop an automatic transformation of distributed algorithm Event-B [2] models into DistAlgo [7] programs.  ...  The correct-by-construction approach consists in developing a model of the algorithm before transforming this model into a program.  ...  The EB2ALL [8] framework provides a list of transformations of Event-B models into classical programming languages (C, C++, Java, . . . ) and this work can be considered as adding a new target programming  ... 
doi:10.1007/978-3-030-48077-6_34 fatcat:a4mbawsb6vevzasaf4echw4izm

From Stateflow Simulation to Verified Implementation: A Verification Approach and A Real-Time Train Controller Design

Yu Jiang, Yixiao Yang, Han Liu, Hui Kong, Ming Gu, Jiaguang Sun, Lui Sha
2016 2016 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)  
Next, we customize a runtime verifier for the generated nonintrusive VHDL and C code of Stateflow model for monitoring.  ...  In this way, safety-critical properties are both verified at the model level, and at the consistent system implementation level with physical execution environment in consideration.  ...  are implemented in C.  ... 
doi:10.1109/rtas.2016.7461337 dblp:conf/rtas/JiangYLKGSS16 fatcat:2uioncz5gvcwxlk7xv2d772ouy

Patterns for Refinement Automation [chapter]

Alexei Iliasov, Elena Troubitsyna, Linas Laibinis, Alexander Romanovsky
2010 Lecture Notes in Computer Science  
We present a prototype of such a tool and some examples of refinement patterns for automated development in the Event B formalism.  ...  We present a prototype of such a tool and some examples of refinement patterns for automated development in the Event B formalism.  ...  Development starts from an abstract model, which is gradually transformed into implementation.  ... 
doi:10.1007/978-3-642-17071-3_4 fatcat:7a3nrpg6avdavaal6r7wsafknu

Software Verification for Weak Memory via Program Transformation [article]

Jade Alglave, Daniel Kroening, Vincent Nimal, Michael Tautschnig
2012 arXiv   pre-print
We propose a sound transformation of the program to verify, enabling SC tools to perform verification w.r.t. weak memory.  ...  Despite multiprocessors implementing weak memory models, verification methods often assume Sequential Consistency (SC), thus may miss bugs due to weak memory.  ...  (a) Wx1 (b) Ry0 (c) Wy1 (d) Rx0 po fr po fr (a) Axiomatic model d(a) f(a) d(b) f(b) d(c) f(c) d(d) f(d) (b) Ry0 (c) Ry1 (d) Rx0 (e) Wx1 (f ) Wy1 dp dp rf fr rf fr (a) Axiomatic model d(a) f(a) d(b) f(b  ... 
arXiv:1207.7264v1 fatcat:ffrugtlwuveozcfglfy6dsn3ei

Using Semantic Anchoring to Verify Behavior Preservation in Graph Transformations

Anantha Narayanan, Gabor Karsai
2007 Electronic Communications of the EASST  
For instance, it could be necessary to transform iLogix Statechart models into Matlab Stateflow models. The preservation of behavior of the models is crucial in such transformations.  ...  We then establish bisimulation properties to verify if the behavior models of the source and target Statechart models are equivalent for a particular execution of the transformation.  ...  For instance, Events are modeled as below: interface Event structure ModelEvent implements Event structure LocalEvent implements Event structure InstantEvent implements Event Proc. GraMoT 2006  ... 
doi:10.14279/tuj.eceasst.4.22 dblp:journals/eceasst/NarayananK06 fatcat:mux7odkylrg4hiqv6tdw3g3o6y

Verifying Cross-layer Interactions through Formal Model-based Assertion Generation

Asieh Salehi Fathabadi, Mohammadsadegh Dalvandi, Michael Butler, Bashir M. Al-Hashimi
2019 IEEE Embedded Systems Letters  
Our approach involves a formal model of the APIs, developed using the Event-B formal method which is automatically translated to a set of assertions and embedded in the existing implementation of APIs.  ...  In this paper, we propose a formal approach to integration testing through automatic generation of runtime assertions in order to test the implementation of the APIs.  ...  Fig. 2 . 2 Tool OverviewIn translating a high-level Event-B event to a low level C++ implementation, we address the data abstraction gap between the model and the implementation.  ... 
doi:10.1109/les.2019.2955316 fatcat:57ncegiszffbvawf4m3sdzsg54

Transformational System Design Based on Formal Computational Model and Skeletons [chapter]

Wenbiao Wu, Ingo Sander, Axel Jantsch
2001 System-on-Chip Methodologies & Design Languages  
into a synthesizable model.  ...  The Formal System Design methodology ForSyDe [1, 2, 3] is extended by a systematic refinement methodology based on transformations, which gradually transforms a high-level, function oriented system description  ...  Synthesis of the synthesizable system model After the refinement process the HW parts of the synthesizable system model are synthesized into VHDL, while the SW parts are synthesized into C.  ... 
doi:10.1007/978-1-4757-3281-8_15 fatcat:v34ycqmbr5cn5cgoofawm4i65e

CTL-Property Transformations Along an Incremental Design Process

Cécile Braunstein, Emmanuelle Encrenaz
2005 Electronical Notes in Theoretical Computer Science  
The links between the formulae of two consecutive design steps are formalized as a set of formula-transformations F , stating that : a CTL formula f is satisfied on a design at step i, iff F (f ) is satisfied  ...  described in theorem 1 on the 80 CTL properties of the model B with the increment transforming B into B', and verified them on a system containing now B' VCI-PI master and slave.  ...  The further models (B to C') deal with external events disturbing the pipeline flow: either the k th VCI request can not be given to the wrapper, or the k − 1 th response is delayed by the PI targets,  ... 
doi:10.1016/j.entcs.2005.04.016 fatcat:pk7srk3g7rdhrnfmm5uqfyvq4a

CTL-property Transformations along an Incremental Design Process

Cécile Braunstein, Emmanuelle Encrenaz
2006 International Journal on Software Tools for Technology Transfer (STTT)  
The links between the formulae of two consecutive design steps are formalized as a set of formula-transformations F , stating that : a CTL formula f is satisfied on a design at step i, iff F (f ) is satisfied  ...  described in theorem 1 on the 80 CTL properties of the model B with the increment transforming B into B', and verified them on a system containing now B' VCI-PI master and slave.  ...  The further models (B to C') deal with external events disturbing the pipeline flow: either the k th VCI request can not be given to the wrapper, or the k − 1 th response is delayed by the PI targets,  ... 
doi:10.1007/s10009-006-0007-9 fatcat:oya3xkvkjjashgljkvmfd4q2ey

Automatic Transformation of Ordinary Timed Petri Nets into Event-B for Formal Verification

Chalika Saksupawattanakul, Wiwat Vatanawood
2018 Engineering Journal  
In this paper, we propose an automatic transformation of ordinary timed Petri nets into Event-B specifications.  ...  The final resulting Event-B codes are generated in the well-formed format which is required and successfully verified by an Event-B prover called a Rodin tool.  ...  PN into Event-B models.  ... 
doi:10.4186/ej.2018.22.4.161 fatcat:nxcpmmdc45anbk7xxdt6vvvg7y

Smart Contract Engineering

Kai Hu, Jian Zhu, Yi Ding, Xiaomin Bai, Jiehua Huang
2020 Electronics  
In this paper, the roadmap of an iterative refinement-based, model-driven formal design methodology is introduced, not only to validate smart contracts but also to support the whole life cycle of their  ...  Figure 9 . 9 Verified proof obligations of the Event-B model.  ...  Figure 8 . 8 Translation and verification of solidity contracts in Event-B. Figure 9 . 9 Verified proof obligations of the Event-B model.  ... 
doi:10.3390/electronics9122042 fatcat:iicvotm52fbr3b5jwtxhcxxvbu

Refinement-based formal verification with heterogeneous timing

Xiaohua Kong, Radu Negulescu, Larry Weidong Ying
2003 International Journal on Software Tools for Technology Transfer (STTT)  
Novel data transfer models are proposed to represent data communication between two locally independent clock domains via an asynchronous handshake environment.  ...  In this paper we propose a refinement-based technique to formally verify data transfer in a heterogeneous timing framework.  ...  Verification of C-element. a C-element implementation c = a · b + (a + b) · c; b Process of chain constraint D(a + c + a−) > D(a + c + y−); c C-element implementation with chain constraint next a transition  ... 
doi:10.1007/s10009-002-0096-z fatcat:m76zf5ngjfevbiexki6xqfcyt4

Computational verification of C protocol implementations by symbolic execution

Mihhail Aizatulin, Andrew D. Gordon, Jan Jürjens
2012 Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12  
C implementation.  ...  Our first step uses symbolic execution to extract a process calculus model from a C implementation of the protocol.  ...  Figure 5 : 5 B : A, {request, kS } k AB B : event server reply(A, B , request, response) B → A : {response} k S A : event client accept(A, B , request, response) Authenticated RPC: RPC-enc let A = if clientID  ... 
doi:10.1145/2382196.2382271 dblp:conf/ccs/AizatulinGJ12 fatcat:epmzv6u5kbbuvenpwblpvzutw4
« Previous Showing results 1 — 15 out of 205,309 results