<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605516324</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100713.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150701xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00165-014-0328-5</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00165-014-0328-5</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A compositional automata-based semantics and preserving transformation rules for testing property patterns</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Safouan Taha, Jacques Julliand, Frédéric Dadeau, Kalou Castillos, Bilal Kanso]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Dwyer etal. provide a language to specify dynamic properties based on a limited number of predefined patterns and scopes. The semantics of these properties is defined by translating each combination of a pattern and a scope into usual temporal logics (linear temporal logic, CTL, etc.). This translational semantics suffers from two main issues. It is not easily extensible to other patterns or scopes, and it is not always faithful to the natural semantics. In this article, we propose a compositional automata-based approach defining the semantics of each pattern and each scope by an automaton, after which the semantics is composed. Hence, the semantics is compositional and the language is easily extensible. We compare the two semantics by model checking. In some cases, our semantics reveals a lack of homogeneity within Dwyer etal.'s semantics. Finally, we apply this approach in the context of property-based testing, in order to evaluate the quality of a test suite, by measuring the coverage of the property automaton. To allow the tester to adapt the coverage criteria to its goals, we propose transformation rules over the patterns automata that implement relevant unfolding strategies for loops, or predicates labeling the automata transitions. We illustrate these principles by means of an industrial case study.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">British Computer Society, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Formal methods</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Temporal properties</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Compositional automata semantics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Temporal logics</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Property patterns</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Testing transformation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Taha</subfield>
   <subfield code="D">Safouan</subfield>
   <subfield code="u">Computer Science Department, SUPELEC Systems Sciences (E3S), 3 rue Joliot-Curie, 91192, Gif-sur-Yvette Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Julliand</subfield>
   <subfield code="D">Jacques</subfield>
   <subfield code="u">FEMTO-ST/DISC-INRIA CASSIS Project, 16 route de Gray, 25030, Besançon Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Dadeau</subfield>
   <subfield code="D">Frédéric</subfield>
   <subfield code="u">FEMTO-ST/DISC-INRIA CASSIS Project, 16 route de Gray, 25030, Besançon Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Castillos</subfield>
   <subfield code="D">Kalou</subfield>
   <subfield code="u">FEMTO-ST/DISC-INRIA CASSIS Project, 16 route de Gray, 25030, Besançon Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kanso</subfield>
   <subfield code="D">Bilal</subfield>
   <subfield code="u">Computer Science Department, SUPELEC Systems Sciences (E3S), 3 rue Joliot-Curie, 91192, Gif-sur-Yvette Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Formal Aspects of Computing</subfield>
   <subfield code="d">Springer London</subfield>
   <subfield code="g">27/4(2015-07-01), 641-664</subfield>
   <subfield code="x">0934-5043</subfield>
   <subfield code="q">27:4&lt;641</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">27</subfield>
   <subfield code="o">165</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00165-014-0328-5</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00165-014-0328-5</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Taha</subfield>
   <subfield code="D">Safouan</subfield>
   <subfield code="u">Computer Science Department, SUPELEC Systems Sciences (E3S), 3 rue Joliot-Curie, 91192, Gif-sur-Yvette Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Julliand</subfield>
   <subfield code="D">Jacques</subfield>
   <subfield code="u">FEMTO-ST/DISC-INRIA CASSIS Project, 16 route de Gray, 25030, Besançon Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dadeau</subfield>
   <subfield code="D">Frédéric</subfield>
   <subfield code="u">FEMTO-ST/DISC-INRIA CASSIS Project, 16 route de Gray, 25030, Besançon Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Castillos</subfield>
   <subfield code="D">Kalou</subfield>
   <subfield code="u">FEMTO-ST/DISC-INRIA CASSIS Project, 16 route de Gray, 25030, Besançon Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kanso</subfield>
   <subfield code="D">Bilal</subfield>
   <subfield code="u">Computer Science Department, SUPELEC Systems Sciences (E3S), 3 rue Joliot-Curie, 91192, Gif-sur-Yvette Cedex, France</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Formal Aspects of Computing</subfield>
   <subfield code="d">Springer London</subfield>
   <subfield code="g">27/4(2015-07-01), 641-664</subfield>
   <subfield code="x">0934-5043</subfield>
   <subfield code="q">27:4&lt;641</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">27</subfield>
   <subfield code="o">165</subfield>
  </datafield>
 </record>
</collection>
