%0 Journal Article %1 360206 %A Yahav, Eran %C New York, NY, USA %D 2001 %I ACM %J SIGPLAN Not. %K concurrency infinitestate tvla verification %N 3 %P 27--40 %R http://doi.acm.org/10.1145/373243.360206 %T Verifying safety properties of concurrent Java programs using 3-valued logic %U http://portal.acm.org/citation.cfm?id=360206 %V 36 %X We provide a parametric framework for verifying safety properties of concurrent Java programs. The framework combines thread-scheduling information with information about the shape of the heap. This leads to error-detection algorithms that are more precise than existing techniques. The framework also provides the most precise shape-analysis algorithm for concurrent programs. In contrast to existing verification techniques, we do not put a bound on the number of allocated objects. The framework even produces interesting results when analyzing Java programs with an unbounded number of threads. The framework is applied to successfully verify the following properties of a concurrent program: •Concurrent manipulation of linked-list based ADT preserves the ADT datatype invariant 19. •The program does not perform inconsistent updates due to interference. •The program does not reach a deadlock. •The program does not produce run-time errors due to illegal thread interactions. We also find bugs in erroneous versions of such implementations. A prototype of our framework has been implemented.

@article{360206, abstract = {We provide a parametric framework for verifying safety properties of concurrent Java programs. The framework combines thread-scheduling information with information about the shape of the heap. This leads to error-detection algorithms that are more precise than existing techniques. The framework also provides the most precise shape-analysis algorithm for concurrent programs. In contrast to existing verification techniques, we do not put a bound on the number of allocated objects. The framework even produces interesting results when analyzing Java programs with an unbounded number of threads. The framework is applied to successfully verify the following properties of a concurrent program: •Concurrent manipulation of linked-list based ADT preserves the ADT datatype invariant [19]. •The program does not perform inconsistent updates due to interference. •The program does not reach a deadlock. •The program does not produce run-time errors due to illegal thread interactions. We also find bugs in erroneous versions of such implementations. A prototype of our framework has been implemented.}, added-at = {2010-01-11T11:11:14.000+0100}, address = {New York, NY, USA}, author = {Yahav, Eran}, biburl = {https://www.bibsonomy.org/bibtex/2bb7f5dcbec7c124a85f63a4e8cd11634/giuliano.losa}, description = {Verifying safety properties of concurrent Java programs using 3-valued logic}, doi = {http://doi.acm.org/10.1145/373243.360206}, interhash = {05fb2bd69b740434a14343b38c843436}, intrahash = {bb7f5dcbec7c124a85f63a4e8cd11634}, issn = {0362-1340}, journal = {SIGPLAN Not.}, keywords = {concurrency infinitestate tvla verification}, number = 3, pages = {27--40}, publisher = {ACM}, timestamp = {2010-01-11T11:11:14.000+0100}, title = {Verifying safety properties of concurrent Java programs using 3-valued logic}, url = {http://portal.acm.org/citation.cfm?id=360206}, volume = 36, year = 2001 }