hh.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Varshosaz, Mahsa
Publications (10 of 13) Show all publications
Varshosaz, M. & Mousavi, M. R. (2019). Comparative Expressiveness of Product Line Calculus of Communicating Systems and 1-Selecting Modal Transition Systems. In: Barbara Catania, Rastislav Královič, Jerzy Nawrocki & Giovanni Pighizzini (Ed.), SOFSEM 2019: Theory and Practice of Computer Science. Paper presented at 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2019), Nový Smokovec, Slovakia, January 27-30, 2019 (pp. 490-503). Cham: Springer
Open this publication in new window or tab >>Comparative Expressiveness of Product Line Calculus of Communicating Systems and 1-Selecting Modal Transition Systems
2019 (English)In: SOFSEM 2019: Theory and Practice of Computer Science / [ed] Barbara Catania, Rastislav Královič, Jerzy Nawrocki & Giovanni Pighizzini, Cham: Springer, 2019, p. 490-503Conference paper, Published paper (Refereed)
Abstract [en]

Product line calculus of communicating systems (PL-CCSs) is a process calculus proposed to model the behavior of software product lines. Modal transition systems (MTSs) are also used to model variability in behavioral models. MTSs are known to be strictly less expressive than PL-CCS. In this paper, we show that the extension of MTSs with hyper transitions by Fecher and Schmidt, called 1-selecting modal transition systems (1MTSs), closes this expressiveness gap. To this end, we propose a novel notion of refinement for 1MTSs that makes them more suitable for specifying variability for software product lines and prove its various essential properties. © Springer Nature Switzerland AG 2019

Place, publisher, year, edition, pages
Cham: Springer, 2019
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11376
Keywords
Product line calculus of communicating systems (PL-CCS), Modal transition system (MTSs), 1-selecting modal transition system (1MTS), Comparative expressiveness
National Category
Computer Systems
Identifiers
urn:nbn:se:hh:diva-38920 (URN)10.1007/978-3-030-10801-4_38 (DOI)2-s2.0-85062361970 (Scopus ID)978-3-030-10800-7 (ISBN)978-3-030-10801-4 (ISBN)
Conference
45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2019), Nový Smokovec, Slovakia, January 27-30, 2019
Available from: 2019-02-15 Created: 2019-02-15 Last updated: 2020-02-03Bibliographically approved
David, J., Mostowski, W., Aramrattna, M., Fan, Y., Varshosaz, M., Karlsson, P., . . . Andersson, E. (2019). Design and Development of a Hexacopter for the Search and Rescue of a Lost Drone. In: : . Paper presented at IROS 2019 - Workshop on Challenges in Vision-based Drones Navigation, Macau, China, November 8, 2019.
Open this publication in new window or tab >>Design and Development of a Hexacopter for the Search and Rescue of a Lost Drone
Show others...
2019 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Search and rescue with an autonomous robot is an attractive and challenging task within the research community. This paper presents the development of an autonomous hexacopter that is designed for retrieving a lost object, like a drone, from a vast-open space, like a desert area. Navigating its path with a proposed coverage path planning strategy, the hexacopter can efficiently search for a lost target and locate it using an image-based object detection algorithm. Moreover, after the target is located, our hexacopter can grasp it with a customised gripper and transport it back to a destined location. It is also capable of avoiding static obstacles and dynamic objects. The proposed system was realised in simulations before implementing it in a real hardware setup, i.e. assembly of the drone, crafting of the gripper, software implementation and testing under real-world scenarios. The designed hexacopter won the best UAV design award at the CPS-VO 2018 Competition held in Arizona, USA.

Keywords
drones, UAV, competition, search and rescue
National Category
Robotics
Identifiers
urn:nbn:se:hh:diva-40830 (URN)
Conference
IROS 2019 - Workshop on Challenges in Vision-based Drones Navigation, Macau, China, November 8, 2019
Available from: 2019-11-04 Created: 2019-11-04 Last updated: 2019-11-05
Varshosaz, M., Luthmann, L., Mohr, P., Lochau, M. & Mousavi, M. R. (2019). Modal Transition System Encoding of Featured Transition Systems. The Journal of logical and algebraic methods in programming, 106, 1-28
Open this publication in new window or tab >>Modal Transition System Encoding of Featured Transition Systems
Show others...
2019 (English)In: The Journal of logical and algebraic methods in programming, ISSN 2352-2208, E-ISSN 2352-2216, Vol. 106, p. 1-28Article in journal (Refereed) Published
Abstract [en]

Featured transition systems (FTSs) and modal transition systems (MTSs) are two of the most prominent and well-studied formalisms for modeling and analyzing behavioral variability as apparent in software product line engineering. On one hand, it is well-known that for finite behavior FTSs are strictly more expressive than MTSs, essentially due to the inability of MTSs to express logically constrained behavioral variability such as persistently exclusive behaviors. On the other hand, MTSs enjoy many desirable formal properties such as compositionality of semantic refinement and parallel composition. In order to finally consolidate the two formalisms for variability modeling, we establish a rigorous connection between FTSs and MTSs by means of an encoding of one FTS into an equivalent set of multiple MTSs. To this end, we split the structure of an FTS into several MTSs whenever it is necessary to denote exclusive choices that are not expressible in a single MTS. Moreover, extra care is taken when dealing with infinite behaviour: loops may have to be unrolled to accumulate FTS path constraints when encoding them into MTSs. We prove our encoding to be semanticpreserving (i.e., the resulting set of MTSs induces, up to bisimulation, the same set of derivable variants as their FTS counterpart) and to commute with modal refinement. We further give an algorithm to calculate a concise representation of a given FTS as a minimal set of MTSs. Finally, we present experimental results gained from applying a tool implementation of our approach to a collection of case studies.

Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2019
Keywords
Featured Transition Systems, Modal Transition Systems, Expressiveness Power, Product Lines, Modeling
National Category
Computer Systems
Identifiers
urn:nbn:se:hh:diva-38941 (URN)10.1016/j.jlamp.2019.03.003 (DOI)000474505200001 ()2-s2.0-85054040481 (Scopus ID)
Projects
AUTO-CAAS
Funder
Knowledge Foundation, 20140312Swedish Research Council, 621-2014-5057ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funding: The work of Mahsa Varshosaz and Mohammad Reza Mousavi has been partially supported by grants from the Swedish Knowledge Foundation (Stiftelsen för Kunskaps- och Kompetensutveckling) in the context of the AUTO-CAAS HoGproject (number: 20140312), Swedish Research Council (Vetenskapsrådet) award number: 621-2014-5057 (Effective Model-Based Testing of Concurrent Systems), and the ELLIIT Strategic Research Environment. The work of Lars Luthmann, Paul Mohr and Malte Lochau has been supported by the German Research Foundation (DFG) in the Priority Programme SPP 1593: Design For Future – Managed Software Evolution (LO 2198/2-1).

Available from: 2019-02-18 Created: 2019-02-18 Last updated: 2020-01-31Bibliographically approved
Varshosaz, M. (2019). Modeling and Model-Based Testing of Software Product Lines. (Doctoral dissertation). Halmstad: Halmstad University Press
Open this publication in new window or tab >>Modeling and Model-Based Testing of Software Product Lines
2019 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Software product line (SPL) engineering has become common practice for mass production and customization of variability intensive systems. A software product line comprises a family of software systems which share a managed core set of artifacts and also have a set of well-defined variabilities. The main idea in SPL engineering is to enable systematic reuse in different phases of software development to reduce cost and time to release.

Model-Based Testing (MBT) is a technique that is widely used for quality assurance of software systems. In MBT, an abstract model, which captures the desired behavior of the system, is used to generate test cases. The test cases are executed against a real implementation of the system and the conformance between the implementation and the specification is checked by comparing the observed outputs with the ones prescribed by the model.

Software product lines have been applied in a number of domains with mission critical systems. MBT is one of the techniques that has been used for analysis of such systems. As the number of products can be potentially large in an SPL, using conventional approaches for MBT of the products of an SPL individually can be very costly and time consuming. To tackle this problem, several approaches have been proposed in order to enable systematic reuse in different phases of the MBT process.

An efficient modeling technique is the first step towards an efficient MBT technique for SPLs. So far, several formalisms have been proposed for modeling SPLs. In this thesis, we conduct a study on such modeling techniques, focusing on four fundamental formalisms, namely featured transition systems, modal transition systems, product line calculus of communicating systems, and 1- selecting modal transition systems. We compare the expressive power and the succinctness of these formalisms.

Furthermore, we investigate adapting existing MBT methods for efficient testing of SPLs. As a part of this line of our research, we adapt the test case generation algorithm of one of the well-known black-box testing approaches, namely, Harmonized State Identification (HSI) method by exploiting the idea of delta-oriented programming. We apply the adapted test case generation algorithm to a case study taken from industry and the results show up to 50 percent reduction of time in test case generation by using the delta-oriented HSI method.

In line with our research on investigating existing MBT techniques, we compare the relative efficiency and effectiveness of the test case generation algorithms of the well-known Input-Output Conformance (ioco) testing approach and the complete ioco which is another testing technique used for input output transition systems that guarantees fault coverage. The comparison is done using three case studies taken from the automotive and railway domains. The obtained results show that complete ioco is more efficient in detecting deep faults (i.e., the faults reached through longer traces) in large state spaces while ioco is more efficient in detecting shallow faults (i.e., the faults reached through shorter traces) in small state spaces.

Moreover, we conduct a survey on sampling techniques, which have been proposed as a solution for handling the large number of products in analysis. In general, in product sampling a subset of products that collectively cover the behavior of the product line are selected. Performing tests on well selected sample set can reveal most of the faults in all products. We provide a classification for a catalog of studies on product sampling for software product lines. Additionally, we present a number of insights on the studied work as well as gaps for the future research.

Place, publisher, year, edition, pages
Halmstad: Halmstad University Press, 2019
Series
Halmstad University Dissertations ; 54
National Category
Computer Systems
Identifiers
urn:nbn:se:hh:diva-38921 (URN)978-91-88749-16-1 (ISBN)978-91-88749-17-8 (ISBN)
Public defence
2019-02-27, HAV, H22, Kristian IV:s väg 3, Halmstad, 13:00 (English)
Opponent
Supervisors
Available from: 2019-02-18 Created: 2019-02-15 Last updated: 2019-04-25Bibliographically approved
Bin Ali, N., Engström, E., Taromirad, M., Mousavi, M. R., Minhas, N. M., Helgesson, D., . . . Varshosaz, M. (2019). On the search for industry-relevant regression testing research. Journal of Empirical Software Engineering, 24(4), 2020-2055
Open this publication in new window or tab >>On the search for industry-relevant regression testing research
Show others...
2019 (English)In: Journal of Empirical Software Engineering, ISSN 1382-3256, E-ISSN 1573-7616, Vol. 24, no 4, p. 2020-2055Article in journal (Refereed) Published
Abstract [en]

Regression testing is a means to assure that a change in the software, or its execution environment, does not introduce new defects. It involves the expensive undertaking of rerunning test cases. Several techniques have been proposed to reduce the number of test cases to execute in regression testing, however, there is no research on how to assess industrial relevance and applicability of such techniques. We conducted a systematic literature review with the following two goals: firstly, to enable researchers to design and present regression testing research with a focus on industrial relevance and applicability and secondly, to facilitate the industrial adoption of such research by addressing the attributes of concern from the practitioners' perspective. Using a reference-based search approach, we identified 1068 papers on regression testing. We then reduced the scope to only include papers with explicit discussions about relevance and applicability (i.e. mainly studies involving industrial stakeholders). Uniquely in this literature review, practitioners were consulted at several steps to increase the likelihood of achieving our aim of identifying factors important for relevance and applicability. We have summarised the results of these consultations and an analysis of the literature in three taxonomies, which capture aspects of industrial-relevance regarding the regression testing techniques. Based on these taxonomies, we mapped 38 papers reporting the evaluation of 26 regression testing techniques in industrial settings. © The Author(s) 2019

Place, publisher, year, edition, pages
New York, NY: Springer, 2019
Keywords
Regression testing, Industrial relevance, Systematic literature review, Taxonomy, Recommendations
National Category
Software Engineering
Identifiers
urn:nbn:se:hh:diva-41451 (URN)10.1007/s10664-018-9670-1 (DOI)000477582700010 ()2-s2.0-85061506841 (Scopus ID)
Funder
ELLIIT - The Linköping‐Lund Initiative on IT and Mobile CommunicationsSwedish Research Council, 621-2014-5057Knowledge Foundation, 20140312
Note

Other funder: EASE, the Industrial Excellence Centre for Embedded Applications Software Engineering.

Available from: 2020-01-31 Created: 2020-01-31 Last updated: 2020-02-06Bibliographically approved
Varshosaz, M., Al-Hajjaji, M., Thüm, T., Runge, T., Mousavi, M. R. & Schaefer, I. (2018). A classification of product sampling for software product lines. In: Berger et al. (Ed.), SPLC '18 Proceedings of the 22nd International Systems and Software Product Line Conference - Volume 1: . Paper presented at 22nd International Systems and Software Product Line Conference, SPLC 2018, Gothenburg, Sweden, 10-14 September, 2018 (pp. 1-13). New York, NY: Association for Computing Machinery (ACM)
Open this publication in new window or tab >>A classification of product sampling for software product lines
Show others...
2018 (English)In: SPLC '18 Proceedings of the 22nd International Systems and Software Product Line Conference - Volume 1 / [ed] Berger et al., New York, NY: Association for Computing Machinery (ACM), 2018, p. 1-13Conference paper, Published paper (Refereed)
Abstract [en]

The analysis of software product lines is challenging due to the potentially large number of products, which grow exponentially in terms of the number of features. Product sampling is a technique used to avoid exhaustive testing, which is often infeasible. In this paper, we propose a classification for product sampling techniques and classify the existing literature accordingly. We distinguish the important characteristics of such approaches based on the information used for sampling, the kind of algorithm, and the achieved coverage criteria. Furthermore, we give an overview on existing tools and evaluations of product sampling techniques. We share our insights on the state-of-the-art of product sampling and discuss potential future work. © 2018 Association for Computing Machinery.

Place, publisher, year, edition, pages
New York, NY: Association for Computing Machinery (ACM), 2018
Series
ACM International Conference Proceeding Serie
Keywords
Domain models, Feature interaction, Sampling algorithms, Software product lines, Testing, Software design, Software testing, Coverage criteria, Domain model, Exhaustive testing, Feature interactions, Product samplings, Sampling algorithm, Software Product Line, State of the art, Importance sampling
National Category
Production Engineering, Human Work Science and Ergonomics
Identifiers
urn:nbn:se:hh:diva-38742 (URN)10.1145/3233027.3233035 (DOI)2-s2.0-85055486094 (Scopus ID)9781450363716 (ISBN)9781450364645 (ISBN)
Conference
22nd International Systems and Software Product Line Conference, SPLC 2018, Gothenburg, Sweden, 10-14 September, 2018
Note

Funding: partially supported by the European project ITEA 3 15010 REV aMP2 and by the German Research Foundation within the project IMoTEP (grant agreement LO 2198/2-1).

Available from: 2019-01-10 Created: 2019-01-10 Last updated: 2019-02-15Bibliographically approved
Varshosaz, M., Beohar, H. & Mousavi, M. R. (2018). Basic Behavioral Models For Software Product Lines: Revisited. Science of Computer Programming, 168, 171-185
Open this publication in new window or tab >>Basic Behavioral Models For Software Product Lines: Revisited
2018 (English)In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 168, p. 171-185Article in journal (Other academic) Published
Abstract [en]

In Beohar et al. (2016) [9], we established an expressiveness hierarchy and studied the notions of refinement and testing for three fundamental behavioral models for software product lines. These models were featured transition systems, product line labeled transition systems, and modal transition systems. It turns out that our definition of product line labeled transition systems is more restrictive than the one introduced by Gruler, Leucker, and Scheidemann. Adopting the original and more liberal notion changes the expressiveness results, as we demonstrate in this paper. Namely, we show that the original notion of product line labeled transition systems and featured transition systems are equally expressive. As an additional result, we show that there are featured transition systems for which the size of the corresponding product line labeled transition system, resulting from any sound encoding, is exponentially larger than the size of the original model. Furthermore, we show that each product line labeled transition system can be encoded into a featured transition system, such that the size of featured transition system is linear in terms of the size of the corresponding model. To summarize, featured transition systems are equally expressive as, but exponentially more succinct than, product line labeled transition systems. © 2018 Elsevier B.V.

Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2018
Keywords
Software product lines, Behavioral model, Featured transition systems, Calculus of communicating systems, Product line labeled transition systems
National Category
Embedded Systems
Identifiers
urn:nbn:se:hh:diva-33892 (URN)10.1016/j.scico.2018.09.001 (DOI)000450385200010 ()2-s2.0-85054040481 (Scopus ID)
Projects
AUTO-CAAS HoG
Funder
Knowledge Foundation, 20140312Swedish Research Council, 621-2014-5057ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2017-05-26 Created: 2017-05-26 Last updated: 2020-02-03Bibliographically approved
Mousavi, M. R. & Varshosaz, M. (2018). Telling Lies in Process Algebra. In: Proceedings. 2018 12th International Symposium on Theoretical Aspects of Software Engineering: TASE 2018. Guangzhou, China. 29-31 August 2018. Paper presented at 2018 International Symposium on Theoretical Aspects of Software Engineering (TASE 2018), Guangzhou, China, August 29-31, 2018 (pp. 116-123). Guangzhou: Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>Telling Lies in Process Algebra
2018 (English)In: Proceedings. 2018 12th International Symposium on Theoretical Aspects of Software Engineering: TASE 2018. Guangzhou, China. 29-31 August 2018, Guangzhou: Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 116-123Conference paper, Published paper (Refereed)
Abstract [en]

Epistemic logic is a powerful formalism for reasoning about communication protocols, particularly in the setting with dishonest agents and lies. Operational frameworks such as algebraic process calculi, on the other hand, are powerful formalisms for specifying the narrations of communication protocols. We bridge these two powerful formalisms by presenting a process calculus in which lies can be told. A lie in our framework is a communicated message that is pretended to be a different message (or nothing at all). In our formalism, we focus on what credulous rational agents can infer about a particular run if they know the protocol beforehand. We express the epistemic properties of such specifications in a rich extension of modal mu-calculus with the belief modality and define the semantics of our operational models in the semantic domain of our logic. We formulate and prove criteria that guarantee belief consistency for credulous agents. ©2018 IEEE

Place, publisher, year, edition, pages
Guangzhou: Institute of Electrical and Electronics Engineers (IEEE), 2018
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-41507 (URN)10.1109/TASE.2018.00023 (DOI)000454985900015 ()2-s2.0-85062385615 (Scopus ID)978-1-5386-7305-8 (ISBN)978-1-5386-7306-5 (ISBN)
Conference
2018 International Symposium on Theoretical Aspects of Software Engineering (TASE 2018), Guangzhou, China, August 29-31, 2018
Available from: 2020-02-03 Created: 2020-02-03 Last updated: 2020-02-03Bibliographically approved
Varshosaz, M. (2017). Test Models and Algorithms for Model-Based Testing of Software Product Lines. (Licentiate dissertation). Halmstad: Halmstad University Press
Open this publication in new window or tab >>Test Models and Algorithms for Model-Based Testing of Software Product Lines
2017 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Software product line (SPL) engineering has become common practice for mass production and customization of software. A software product line comprises a family of software systems which share a managed core set of artifacts. There are also a set of well-defined variabilities between the products of a product line. The main idea in SPL engineering is to enable systematic reuse in different phases of software development to reduce cost and time to release.

Model-Based Testing (MBT) is a technique that is widely used for checking the quality of software systems. In MBT, test cases are generated from an abstract model, which captures the desired behavior of the system. Then, the test cases are executed against a real implementation of the system and the compliance of the implementation to the specification is checked by comparing the observed outputs with the ones prescribed by the model.

Software product lines have been applied in many domains in which sys- tems are mission critical and MBT is one of the techniques that is widely used for quality assurance of such systems. As the number of products can be potentially large in an SPL, using conventional approaches for MBT of the products of an SPL individually and as single systems can be very costly and time consuming. Hence, several approaches have been proposed in order to enable systematic reuse in different phases of the MBT process.

An efficient modeling technique is the first step towards an efficient MBT technique for SPLs. There have been several formalisms proposed for modeling SPLs. In this thesis, we conduct a study on such modeling techniques, focusing on three fundamental formalisms, namely featured transition systems, modal transition systems, and product line calculus of communicating systems. We compare the expressive power and the succinctness of these formalisms.

Furthermore, we investigate adapting existing MBT methods for efficient testing of SPLs. As a part of this line of our research, we adapt the test case generation algorithm of one of the well-known black-box testing approaches, namely, Harmonized State Identification (HSI) method by exploiting the idea of delta-oriented programming. We apply the adapted test case generation algorithm to a case study taken from industry and the results show up to 50 percent reduction of time in test case generation by using the delta-oriented HSI method.

In line with our research on investigating existing MBT techniques, we compare the relative efficiency and effectiveness of the test case generation algorithms of the well-known Input-Output Conformance (ioco) testing approach and the complete ioco which is another testing technique used for input output transition systems that guarantees fault coverage. The comparison is done using three case studies taken from the automotive and railway domains. The obtained results show that complete ioco is more efficient in detecting deep faults (i.e., the faults reached through longer traces) in large state spaces while ioco is more efficient in detecting shallow faults (i.e., the faults reached through shorter traces) in small state spaces.

Place, publisher, year, edition, pages
Halmstad: Halmstad University Press, 2017. p. 91
Series
Halmstad University Dissertations ; 30
National Category
Embedded Systems
Identifiers
urn:nbn:se:hh:diva-33893 (URN)978-91-87045-62-2 (ISBN)978-91-87045-63-9 (ISBN)
Presentation
2017-05-29, Trade Center, Kristian IV:s väg 3, Halmstad, 10:00 (English)
Opponent
Supervisors
Available from: 2017-07-05 Created: 2017-05-26 Last updated: 2018-03-23Bibliographically approved
Beohar, H., Varshosaz, M. & Mousavi, M. R. (2016). Basic behavioral models for software product lines: Expressiveness and testing pre-orders. Paper presented at 29th Symposium On Applied Computing, Gyeongju, South Korea, March 24-28, 2014. Science of Computer Programming, 123, 42-60
Open this publication in new window or tab >>Basic behavioral models for software product lines: Expressiveness and testing pre-orders
2016 (English)In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 123, p. 42-60Article in journal (Refereed) Published
Abstract [en]

In order to provide a rigorous foundation for Software Product Lines (SPLs), several fundamental approaches have been proposed to their formal behavioral modeling. In this paper, we provide a structured overview of those formalisms based on labeled transition systems and compare their expressiveness in terms of the set of products they can specify. Moreover, we define the notion of tests for each of these formalisms and show that our notions of testing precisely capture product derivation, i.e., all valid products will pass the set of test cases of the product line and each invalid product fails at least one test case of the product line. © 2015 The Authors.

Place, publisher, year, edition, pages
Amsterdam: Elsevier, 2016
Keywords
Software product lines, Formal specification, Behavioral specification, Labeled transition systems, Featured transition systems, Modal transition systems, Calculus of communicating systems (CCS), Product line CCS (PL-CCS)
National Category
Computer Sciences
Identifiers
urn:nbn:se:hh:diva-29104 (URN)10.1016/j.scico.2015.06.005 (DOI)000374367600003 ()2-s2.0-84937604468 (Scopus ID)
Conference
29th Symposium On Applied Computing, Gyeongju, South Korea, March 24-28, 2014
Projects
EFFEMBAC
Funder
Swedish Research Council, 621-2014-5057Knowledge Foundation, 20140312
Note

Issue with selected and extended papers from ACM SVT 2014.

Available from: 2015-08-10 Created: 2015-08-10 Last updated: 2019-02-15Bibliographically approved
Organisations

Search in DiVA

Show all publications