Communicating sequential processes
Communicating sequential processes
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Model-checking CSP-Z: strategy, tool support and industrial application
Science of Computer Programming - Specical issue on fundamental approaches to software engineering
A Calculus of Communicating Systems
A Calculus of Communicating Systems
An operational semantics for ZCCS
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
Formalising Flash Memory: First Steps
ICECCS '07 Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems
Pre-testing Flash Device Driver through Model Checking Techniques
ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
Verified Software: Theories, Tools, Experiments Vision of a Grand Challenge Project
Verified Software: Theories, Tools, Experiments
Formal Verification of a Flash Memory Device Driver --- An Experience Report
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Formal Modeling and Analysis of a Flash Filesystem in Alloy
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Mechanising a formal model of flash memory
Science of Computer Programming
Formal Aspects of Computing
Unit Testing of Flash Memory Device Driver through a SAT-Based Model Checker
ASE '08 Proceedings of the 2008 23rd IEEE/ACM International Conference on Automated Software Engineering
Concurrent Models of Flash Memory Device Behaviour
Formal Methods: Foundations and Applications
Concolic Testing of the Multi-sector Read Operation for Flash Memory File System
Formal Methods: Foundations and Applications
Saoithín: a theorem prover for UTP
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
| Hi-index | 0.00 |
Following the development of formalisms based on data and behavioural aspects of the system, there are number of attempts in which these two formalisms are mixed together to get benefit of both paradigms. 'Circus' being a living specification language with continuous collaboration from both academia and industry, is a combination of Z, CSP and the refinement calculus. To make use of the available and industry-proven tools for a particular programming paradigm, there is a need to develop a formally verified link between the one world and the other. The aim of this work is to develop a formally verified link between a state-rich process algebra i.e. 'Circus' to a state-free process algebra i.e. CSP. To achieve the research goal, the most suitable available tools are to identify. For developing link between targeted formal languages, we will identify the key translations required between the two languages. For ensuring correctness of the translation, we will formalise the key translation / refinement steps. These will form the theoretical core of the work and support the soundness of the link. In the end, we will select and verify a case study from the collection of software / hardware protocols.