Verifying safety properties of concurrent Java programs using 3-valued logic
- 1 January 2001
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 36 (3) , 27-40
- https://doi.org/10.1145/373243.360206
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Static Analyses for Eliminating Unnecessary Synchronization from Java ProgramsPublished by Springer Nature ,1999
- dSPIN: A Dynamic Extension of SPINPublished by Springer Nature ,1999
- An Event-Based Structural Operational Semantics of Multi-threaded JavaPublished by Springer Nature ,1999
- A conservative data flow algorithm for detecting all pairs of statements that may happen in parallelPublished by Association for Computing Machinery (ACM) ,1998
- Constructing compact models of concurrent Java programsPublished by Association for Computing Machinery (ACM) ,1998
- Verifying parameterized networksACM Transactions on Programming Languages and Systems, 1997
- Non-concurrency analysisACM SIGPLAN Notices, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- What are race conditions?ACM Letters on Programming Languages and Systems, 1992
- Recursive data structuresInternational Journal of Parallel Programming, 1975