Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving-Reference-Cited by-同舟云学术

Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving

Published:2016 Issue: Volume: Page:345-360
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
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-33693-0_22

Reference20 articles.

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

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

3. Antonino, P., Roscoe, A.W., Gibson-Robinson, T.: Efficient deadlock analysis using local analysis and SAT solving. Technical report, University of Oxford (2015). http://www.cs.ox.ac.uk/people/pedro.antonino/techreport.pdf

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

5. Lecture Notes in Computer Science;PC Attie,2013

Cited by 12 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. CSP: A Practical Process Algebra;Theories of Programming;2021-10-02

3. Philosophers May Dine - Definitively!;Lecture Notes in Computer Science;2020

4. Efficient Verification of Concurrent Systems Using Synchronisation Analysis and SAT/SMT Solving;ACM Transactions on Software Engineering and Methodology;2019-08-17

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