Modeling and Validation of Java Multithreading Applications Using Spin

Uloženo v:
Podrobná bibliografie
Název: Modeling and Validation of Java Multithreading Applications Using Spin
Autoři: C. Demartini
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: http://spinroot.com/spin/Workshops/ws98/p23.pdf.
Sbírka: CiteSeerX
Popis: This paper presents some issues about the design and implementation of a concurrency analysis tool for deadlock detection on Java programs based on Promela and SPIN. An abstract formal model expressed in Promela is generated from the Java source using the Java2Spin translator. Then the model is analyzed by SPIN and possible error traces are converted back to traces of Java statements and reported to the user. We carried out a set of experiments, to evaluate the extent to which this approach is feasible, and found that non-trivial Java programs can be successfully analyzed.
Druh dokumentu: text
Popis souboru: application/pdf
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.4703; http://spinroot.com/spin/Workshops/ws98/p23.pdf
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.4703
http://spinroot.com/spin/Workshops/ws98/p23.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Přístupové číslo: edsbas.184B49FF
Databáze: BASE
Popis
Abstrakt:This paper presents some issues about the design and implementation of a concurrency analysis tool for deadlock detection on Java programs based on Promela and SPIN. An abstract formal model expressed in Promela is generated from the Java source using the Java2Spin translator. Then the model is analyzed by SPIN and possible error traces are converted back to traces of Java statements and reported to the user. We carried out a set of experiments, to evaluate the extent to which this approach is feasible, and found that non-trivial Java programs can be successfully analyzed.