Mining sequential patterns to explain concurrent counterexamples


Dateien zu dieser Ressource

Prüfsumme: MD5:23e36e5face1603f21848890948ddfc2

LEUE, Stefan, Mitra TABAEI BEFROUEI, 2013. Mining sequential patterns to explain concurrent counterexamples. In: BARTOCCI, Ezio, ed., C. R. RAMAKRISHNAN, ed.. Model Checking Software. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 264-281. ISBN 978-3-642-39175-0

@inproceedings{Leue2013Minin-24391, title={Mining sequential patterns to explain concurrent counterexamples}, year={2013}, doi={10.1007/978-3-642-39176-7_17}, number={7976}, isbn={978-3-642-39175-0}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Model Checking Software}, pages={264--281}, editor={Bartocci, Ezio and Ramakrishnan, C. R.}, author={Leue, Stefan and Tabaei Befrouei, Mitra} }

<rdf:RDF xmlns:rdf="" xmlns:bibo="" xmlns:dc="" xmlns:dcterms="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:abstract xml:lang="eng">Concurrent systems are often modeled using an interleaving semantics. Since system designers tend to think sequentially, it is highly probable that they do not foresee some interleavings that their model encompasses. As a consequence, one of the main sources of failure in concurrent systems is unforeseen interleavings. In this paper, we devise an automated method for revealing unforeseen interleavings in the form of sequences of actions derived from counterexamples obtained by explicit state model checking. In order to extract such sequences we use a data mining technique called sequential pattern mining. Our method is based on contrasting the patterns of a set of counterexamples with the patterns of a set of correct traces that do not violate a desired property. We first argue that mining sequential patterns from the dataset of counterexamples fails due to the inherent complexity of the problem. We then propose a reduction technique designed to reduce the length of the execution traces in order to make the problem more tractable. We finally demonstrate the effectiveness of our approach by applying it to a number of sample case studies.</dcterms:abstract> <dcterms:rights rdf:resource=""/> <dcterms:bibliographicCitation>Model Checking Software : 20th International Symposium, SPIN 2013, Stony Brook, NY, USA, July 8-9, 2013, Proceedings / Ezio Bartocci ... (eds.). - Berlin : Springer, 2013. - S. 264-281. - (Lecture Notes in Computer Science ; 7976). - ISBN 978-3-642-39175-0</dcterms:bibliographicCitation> <dc:contributor>Leue, Stefan</dc:contributor> <dcterms:title>Mining sequential patterns to explain concurrent counterexamples</dcterms:title> <dc:creator>Leue, Stefan</dc:creator> <dcterms:issued>2013</dcterms:issued> <dc:date rdf:datatype="">2013-09-12T13:26:28Z</dc:date> <bibo:uri rdf:resource=""/> <dc:language>eng</dc:language> <dc:contributor>Tabaei Befrouei, Mitra</dc:contributor> <dcterms:available rdf:datatype="">2014-08-30T22:25:06Z</dcterms:available> <dc:creator>Tabaei Befrouei, Mitra</dc:creator> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Leue_243913.pdf 98

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto