Tighter Reachability Criteria for Deadlock-Freedom Analysis-Reference-Cited by-同舟云学术

Tighter Reachability Criteria for Deadlock-Freedom Analysis

Published:2016 Issue: Volume: Page:43-59
ISSN:0302-9743
Container-title:FM 2016: Formal Methods
language:
Short-container-title:

Author:

Antonino Pedro,Gibson-Robinson Thomas,Roscoe A. W.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-48989-6_3

Reference19 articles.

1. Antonino, P., Gibson-Robinson, T., Roscoe, A.W.: Experiment package (2016). http://www.cs.ox.ac.uk/people/pedro.antonino/pkg.zip

2. Lecture Notes in Computer Science;P Antonino,2016

3. Lecture Notes in Computer Science;PRG Antonino,2014

4. Antonino, P., Roscoe, A.W., Gibson-Robinson, T.: Tighter reachability criteria for deadlock-freedom analysis. Technical report, University of Oxford (2016). http://www.cs.ox.ac.uk/people/pedro.antonino/reach_techreport.pdf

5. Lecture Notes in Computer Science;P Antonino,2014

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

1. Approximate verification of concurrent systems using token structures and invariants;International Journal on Software Tools for Technology Transfer;2022-04-07

2. Discovering and correcting a deadlock in a channel implementation;Formal Aspects of Computing;2019-08

3. Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving;Formal Aspects of Computing;2019-06

4. Checking Static Properties Using Conservative SAT Approximations for Reachability;Lecture Notes in Computer Science;2017

5. Local Analysis of Determinism for CSP;Lecture Notes in Computer Science;2017