Podrobná bibliografie
| Název: |
A Translator of Java Programs to TADDs. |
| Autoři: |
Rataj, Artur, Wożna, Bożzena, Zbrzezny, Andrzej |
| Zdroj: |
Fundamenta Informaticae; 2009, Vol. 93 Issue 1-3, p305-324, 20p, 6 Diagrams, 6 Charts |
| Témata: |
JAVA programming language, MACHINE theory, TEMPORAL automata, RECURSIVE functions, PROGRAMMING languages |
| Abstrakt: |
The model checking tools Uppaal and VerICS accept a description of a network of Timed Automata with Discrete Data (TADDs) as input. Thus, to verify a concurrent programwritten in Java by means of these tools, first a TADD model of the program must be build. Therefore, we have developed the J2TADD tool that translates a Java program to a network of TADDs; the paper presents this tool. The J2TADD tool works in two stages. The first one consists in translation of a Java code to an internal assembly language (IAL). Then, the resulting assembly code is translated to a network of TADDs. We exemplify the use of the translator by means of the following well-known concurrency examples written in Java: race condition problem, dining philosophers problem, single sleeping barber problem and readers and writers problem. [ABSTRACT FROM AUTHOR] |
|
Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Databáze: |
Complementary Index |
Nájsť tento článok vo Web of Science