Concurrency - state models and Java programs

By J. Magee, J. Kramer. 2006

627 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/8b8a2818a3f12dc00cc2210508e6482710a04039

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Edmund M. Clarke
2. Alex Groce
3. Sagar Chaki
4. Helmut Veith
5. Somesh Jha
6. Corina S. Pasareanu
7. J. M. Cobleigh
8. D. Giannakopoulou

Citations in the corpus

• Modular verification of software components in C (2003, methodology): “The textual descriptions of LTSs are given using an extended version of the FSP notation by Magee and Kramer [30].”
• Managing space for finite-state verification (2006, unknown): “The Labeled Transition System Analyser (LTSA) [14] is an FSV tool for modeling and analyzing the behavior of systems represented by labeled transition systems.”
• Learning Assumptions for Compositional Verification (2003, methodology): “The presentation of our approach is based on techniques for modeling and checking concurrent programs implemented in the LTSA tool [20].”