Symbolic Reachability Analysis of B Through ProB and LTSmin-Reference-Cited by-同舟云学术

Symbolic Reachability Analysis of B Through ProB and LTSmin

Published:2016 Issue: Volume: Page:275-291
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bendisposto Jens,Körner Philipp,Leuschel Michael,Meijer Jeroen,van de Pol Jaco,Treharne Helen,Whitefield Jorden

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-33693-0_18

Reference32 articles.

1. Abrial, J.R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press, Cambridge (2010)

2. Abrial, J.: The B-Book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (2005)

3. Lecture Notes in Computer Science;P Arcaini,2010

4. Bendisposto, J.: Directed and Distributed Model Checking of B Specifications. Ph.D. thesis, University of Düsseldorf (2015). http://docserv.uni-duesseldorf.de/servlets/DocumentServlet?id=34472

5. Bendisposto, J., Körner, P., Leuschel, M., Meijer, J., van de Pol, J., Treharne, H., Whitefield, J.: Symbolic Reachability Analysis of B through ProB and LTSmin. CoRR abs/1603.04401 (2016)

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

1. Operation Caching and State Compression for Model Checking of High-Level Models;Lecture Notes in Computer Science;2022

2. Model Checking B Models via High-Level Code Generation;Formal Methods and Software Engineering;2022

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

4. Optimal compression of combinatorial state spaces;Innovations in Systems and Software Engineering;2019-05-20

5. Software Architecture of Modern Model Checkers;Lecture Notes in Computer Science;2019