38 Hits in 2.3 sec

FDR3 — A Modern Refinement Checker for CSP [chapter]

Thomas Gibson-Robinson, Philip Armstrong, Alexandre Boulgakov, Andrew W. Roscoe
2014 Lecture Notes in Computer Science  
FDR3 is a complete rewrite of the CSP refinement checker FDR2, incorporating a significant number of enhancements.  ...  Further, we describe the new algorithm that FDR3 uses to construct its internal representation of CSP processes-this algorithm is more efficient than FDR2's, and is able to compile a large class of CSP  ...  We would also like to thank the anonymous reviewers for their useful comments.  ... 
doi:10.1007/978-3-642-54862-8_13 fatcat:ozlxn2avnnbqfisl7qrppdw5ke

Modelling the Haemodialysis Machine with Circus [chapter]

Artur O. Gomes, Andrew Butterfield
2016 Lecture Notes in Computer Science  
We then present how we model check the system using FDR. 1  ...  We present a formal model of aspects of the haemodialysis machine case study using the Circus specification notation.  ...  Finally we re-iterate our thanks to our sponsors, CNPq of Brazil, and Science Foundation Ireland.  ... 
doi:10.1007/978-3-319-33600-8_34 fatcat:pswof6hfqbfe5fo3aw75ove6aa

Verifying Critical Cyber-Physical Systems After Deployment

Colin O'Halloran
2015 Electronic Communications of the EASST  
This paper describes an approach to verifying system requirements, when they become known, by performing an automated refinement check of its composed components abstracted from the actual implementation  ...  The heterogeneous, evolving and distributed nature of CPS means that there is little chance of performing a top down development or anticipating all critical requirements such devices will need to satisfy  ...  This work was sponsored by the Charles Stark Draper Laboratories under the DARPA project on High Assurance Cyber Military Systems (HACMS).  ... 
doi:10.14279/tuj.eceasst.72.1027 dblp:journals/eceasst/OHalloran15 fatcat:seqrunodxvdebcf3o63il2i5ri

Computing Maximal Bisimulations [chapter]

Alexandre Boulgakov, Thomas Gibson-Robinson, A. W. Roscoe
2014 Lecture Notes in Computer Science  
They can therefore be used to combat the space explosion problem faced in explicit model checking for such languages.  ...  These bisimulation relations preserve CSP semantics, as well as the operational semantics of programs in other languages with operational semantics described by such GLTSs and relying only on observational  ...  This compression is new in FDR3 and is the strongest implemented compression for CSP models richer than the failures model.  ... 
doi:10.1007/978-3-319-11737-9_2 fatcat:ccxrepnufzftzn6qyjrmnbfnvy

CSP and Kripke Structures [chapter]

Ana Cavalcanti, Wen-ling Huang, Jan Peleska, Jim Woodcock
2015 Lecture Notes in Computer Science  
With this technique, we can check that a system under test satisfies properties of traces and refusals of its CSP model.  ...  Here, we present a formalisation of soundness by unifying the semantics of the languages involved: normalised graphs used in CSP model checking, action systems, and Kripke structures.  ...  The work of Wen-ling Huang and Jan Peleska is funded by the grant ITTCPS -Implementable Testing Theory for Cyber-physical Systemsas part of the German Universities Excellence Initiative.  ... 
doi:10.1007/978-3-319-25150-9_29 fatcat:pjmmpoviqbctxizs2auoayp6du

A Formal Model of the Safety-Critical Java Level 2 Paradigm [chapter]

Matt Luckcuck, Ana Cavalcanti, Andy Wellings
2016 Lecture Notes in Computer Science  
We present a formal model of SCJ Level~2 that captures the state and behaviour of both SCJ programs and the SCJ API.  ...  We show how our models can be used to prove properties of the SCJ API and applications.  ...  Our modelling approach is agnostic of Java. We model the state and behaviour of application objects in the program and the use of suspension.  ... 
doi:10.1007/978-3-319-33693-0_15 fatcat:7pnzfiycfrgr7e6dt7mcluzwxe

Modular Design and Verification of Distributed Adaptive Real-Time Systems Based on Refinements and Abstractions

Thomas Göthel, Verena Klös, Björn Bartels
2015 EAI Endorsed Transactions on Self-Adaptive Systems  
We enable the modular verification of functional and adaptation behaviour, respectively, based on the notion of process refinement in Timed CSP.  ...  Therefore, we discuss how common refinements and abstractions from the context of Timed CSP can be used as a formal basis for refinements and abstractions in SystemC.  ...  model of CSP.  ... 
doi:10.4108/sas.1.1.e5 fatcat:5kmrb67ogvhfjhi6dziivtdm2m

Modelling and Verifying a Priority Scheduler for an SCJ Runtime Environment [chapter]

Leo Freitas, James Baxter, Ana Cavalcanti, Andy Wellings
2016 Lecture Notes in Computer Science  
Our work is based on a state-rich process algebra that combines Z and CSP, and we take advantage of well established tools.  ...  We present here the result of our verification of the scheduler of the only SCJ virtual machine up to date with the standard and publicly available, the icecap HVM.  ...  The authors gratefully acknowledge useful feedback from anonymous referees, and Stephan Erbs Korsholm and Shuai Zhao for their help in understanding the icecap HVM and its rationale.  ... 
doi:10.1007/978-3-319-33693-0_5 fatcat:gnzetqyj3zd53ju26eumeatmwa

The Automatic Detection of Token Structures and Invariants Using SAT Checking [chapter]

Pedro Antonino, Thomas Gibson-Robinson, A. W. Roscoe
2017 Lecture Notes in Computer Science  
In this paper we show how a SAT checker can be used to automatically detect token and similar invariants in distributed systems, and how these invariants can improve the precision of a deadlock-checking  ...  We demonstrate by a series of practical experiments that this new framework is as efficient as similar incomplete techniques for deadlock-freedom analysis, while handling a different class of systems.  ...  Acknowledgments The first author is a CAPES Foundation scholarship holder (Process no: 13201/13-1).  ... 
doi:10.1007/978-3-662-54580-5_15 fatcat:wg76gsutknfh7ogg35ou7lcbsu

Symbolic Analysis Tools for CSP [chapter]

Liyi Li, Elsa Gunter, William Mansky
2014 Lecture Notes in Computer Science  
This more compact representation allows us to expand the original CSP systems to effectively and efficiently model check some CSP programs that are difficult or impossible for other CSP systems to analyze  ...  The model checker was transcribed by hand into Maude [3] as automatic extraction of Maude code  ...  Along the way we are writting our paper, FDR3 comes out [19] . FDR3 develops a parallelized algorithm for model checking trace refinement property over FDR2.  ... 
doi:10.1007/978-3-319-10882-7_18 fatcat:qady4et2qfdz7kws5xygilrnya

Behavioural Models for FMI Co-simulations [chapter]

Ana Cavalcanti, Jim Woodcock, Nuno Amálio
2016 Lecture Notes in Computer Science  
We illustrate the work using three algorithms for orchestration. A stateless version of the models can be verified using model checking via translation to CSP.  ...  We use the state-rich process algebra, Circus, to present our modelling approach, and indicate how models can be automatically generated from a description of the individual simulations and their dependencies  ...  Acknowledgements The work is funded by the EU INTO-CPS project (Horizon 2020, 664047). Ana Cavalcanti and Jim Woodcock are also funded by the EPSRC grant EP/M025756/1.  ... 
doi:10.1007/978-3-319-46750-4_15 fatcat:jfbabv7izvdx3e5wcds75vgfai

Local Livelock Analysis of Component-Based Models [chapter]

Madiel S. Conserva Filho, Marcel Vinicius Medeiros Oliveira, Augusto Sampaio, Ana Cavalcanti
2016 Lecture Notes in Computer Science  
Our method is based solely on the local analysis of the minimum sequences that lead the CSP model back to its initial state.  ...  In this case, we carry out livelock analysis in the context of a component model, BR I C , whose behaviour of the components is described as a CSP process.  ...  any further external model checking for CSP systems.  ... 
doi:10.1007/978-3-319-47846-3_18 fatcat:mdrjldtqcvhw5i6zfxidi5vaxu

Concurrent Depth-First Search Algorithms [chapter]

Gavin Lowe
2014 Lecture Notes in Computer Science  
We present concurrent algorithms, based on depth-first search, for three problems relevant to model checking: given a state graph, to find its strongly connected components, which states are in loops,  ...  Our algorithms typically exhibit about a four-fold speed-up over the corresponding sequential algorithms on an eight-core machine.  ...  I would also like to thank the anonymous referees for their useful comments.  ... 
doi:10.1007/978-3-642-54862-8_14 fatcat:open3c43tfao5hwnjzjl3goet4

Some recent advances in automated analysis

Erika Ábrahám, Klaus Havelund
2015 International Journal on Software Tools for Technology Transfer (STTT)  
We briefly outline some recent trends, and review some of the latest achievements, introducing six papers selected from the 20th International Conference on Tools and Algorithms for the Construction and  ...  Due to the increasing complexity of software systems, there is a growing need for automated and scalable software synthesis and analysis.  ...  We are grateful to all authors for their contributions and to the reviewers of TACAS'14 and of this special issue for their thorough and valuable work.  ... 
doi:10.1007/s10009-015-0403-0 fatcat:hwu7b64kh5brrlm7spzyucxibe

Slow Abstraction via Priority [chapter]

A. W. Roscoe, Philippa J. Hopcroft
2013 Lecture Notes in Computer Science  
This extension requires the prioritise operator recently introduced into CSP and its refinement checker FDR. We demonstrate its use in the modelling used in Verum's ASD:Suite.  ...  While it has been possible to formulate a number of forms of abstraction in these models where the abstracted actions become τ s, it has sometimes been necessary to be careful about the interpretation  ...  Beyond the scope of the present paper, we have had to bring further fairness considerations into our models to handle further nuances of the ASD models. That will be the subject of a future paper.  ... 
doi:10.1007/978-3-642-39698-4_20 fatcat:bragblajdbhxxa6bbogt2gphym
« Previous Showing results 1 — 15 out of 38 results