The Automatic Detection of Token Structures and Invariants Using SAT Checking-Reference-Cited by-同舟云学术

The Automatic Detection of Token Structures and Invariants Using SAT Checking

Published:2017 Issue: Volume: Page:249-265
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

https://link.springer.com/content/pdf/10.1007/978-3-662-54580-5_15

Reference26 articles.

1. Agerwala, T., Choed-Amphai, Y.-C.: A synthesis rule for concurrent systems. In: 15th Conference on Design Automation, pp. 305–311. IEEE (1978)

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

3. Antonino, P., Gibson-Robinson, T., Roscoe, A.W.: The automatic detection of token structures and invariants using SAT checking. Technical report, University of Oxford (2016). http://www.cs.ox.ac.uk/people/pedro.antonino/techreport-vt.pdf

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

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

Cited by 5 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. Discovering and correcting a deadlock in a channel implementation;Formal Aspects of Computing;2019-08

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

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