Proving Reachability in B using Substitution Refinement-Reference-Cited by-同舟云学术

Proving Reachability in B using Substitution Refinement

Published:2011-12 Issue: Volume:280 Page:47-56
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Frappier Marc,Diagne Fama,Mammar Amel

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference20 articles.

1. Introducing Dynamic Constraints in B;Abrial,1998

2. Back, R.J.R.: On the Correctness of Refinement in Program Development. Ph. D. Thesis Report A-1978-4, Dept. of Computer Science, University of Helsinki, 1978.

3. Correctness Preserving Program Refinements: Proof Theory and Applications;Back,1980

4. Barradas, H.R., D. Bert, “Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems”, in Integrated Formal Methids 2002, LNCS 2335, pp 360–379 (2002).

5. A Proof Environment for Concurrent Programs;Brown,1993

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Achieving Abstract Machine Reachability with Learning-Based Model Fulfilment;2019 26th Asia-Pacific Software Engineering Conference (APSEC);2019-12

2. Validation of IS Security Policies Featuring Authorisation Constraints;International Journal of Information System Modeling and Design;2015-01

3. A Tool for Verifying Dynamic Properties in B;Software Engineering and Formal Methods;2014

4. Combining UML, ASTD and B for the formal specification of an access control filter;Innovations in Systems and Software Engineering;2011-09-29