<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pessanha, Vasco</style></author><author><style face="normal" font="default" size="100%">Ricardo J. Dias</style></author><author><style face="normal" font="default" size="100%">João M. Lourenço</style></author><author><style face="normal" font="default" size="100%">Farchi, Eitan</style></author><author><style face="normal" font="default" size="100%">Sousa, Diogo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Practical verification of high-level dataraces in transactional memory programs</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of 9th the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">PADTAD'11</style></tertiary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">concurrency</style></keyword><keyword><style  face="normal" font="default" size="100%">software transactional memory</style></keyword><keyword><style  face="normal" font="default" size="100%">static analysis</style></keyword><keyword><style  face="normal" font="default" size="100%">testing</style></keyword><keyword><style  face="normal" font="default" size="100%">verification</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2011</style></year><pub-dates><date><style  face="normal" font="default" size="100%">July</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/2002962.2002968</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://docentes.fct.unl.pt/sites/default/files/joao-lourenco/files/isstaws11padtad-4-pessanha.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><pages><style face="normal" font="default" size="100%">26–34</style></pages><isbn><style face="normal" font="default" size="100%">9781-450-3080-9-0</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we present MoTh, a tool that uses static analysis to enable the automatic verification of concurrency anomalies in Transactional Memory Java programs. Currently MoTh detects high-level dataraces and stale-value errors, but it is extendable by plugging-in sensors, each sensor implementing an anomaly detecting algorithm. We validate and benchmark MoTh by applying it to a set of well known concurrent buggy programs and by close comparison of the results with other similar tools. The results achieved so far are very promising, yielding good accuracy while triggering only a very limited number of false warnings.&lt;/p&gt;
</style></abstract></record></records></xml>