SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Mousavi Mohammad Reza 1978 ) "

Sökning: WFRF:(Mousavi Mohammad Reza 1978 )

  • Resultat 31-40 av 62
  • Föregående 123[4]567Nästa
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
31.
  • Gebler, Daniel, et al. (författare)
  • Algebraic Meta-Theory of Processes with Data
  • 2013
  • Ingår i: ; , s. 63-77
  • Konferensbidrag (refereegranskat)abstract
    • There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong bisimilarity of processes. To our knowledge, this literature has never been extended to the setting with data (e.g. to model storage and memory). We show how the rule formats for algebraic properties can be exploited in a genericmanner in the setting with data. Moreover, we introduce a new approach for deriving sound and ground-complete axiom schemata for a notion of bisimilarity with data, called stateless bisimilarity, based on intuitive auxiliary function symbols for handling the store component. We do restrict, however, the axiomatization to the setting where the store component is only given in terms of constants. © Gebler, Goriac & Mousavi.
  •  
32.
  • Ghassemi, Fatemeh, et al. (författare)
  • Product Line Process Theory
  • 2016
  • Ingår i: Effective Model-Based Testing of Concurrent Systems. - Amsterdam : Elsevier. ; 85:1, part 2, s. 200-226
  • Tidskriftsartikel (refereegranskat)abstract
    • Software product lines (SPLs) facilitate reuse and customization in software development by genuinely addressing the concept of variability. Product Line Calculus of Communicating Systems (PL-CCS) is a process calculus for behavioral modeling of SPLs, in which variability can be explicitly modeled by a binary variant operator. In this paper, we study different notions of behavioral equivalence for PL-CCS, based on Park and Milner's strong bisimilarity. These notions enable reasoning about the behavior of SPLs at different levels of abstraction. We study the compositionality property of these notions and the mutual relationship among them. We further show how the strengths of these notions can be consolidated in an equational reasoning method. Finally, we designate the notions of behavioral equivalence that are characterized by the property specification language for PL-CCS, called multi-valued modal μ-calculus. © 2015 The Authors. Published by Elsevier Inc.
  •  
33.
  •  
34.
  •  
35.
  • Hafemann Fragal, Vanderson, 1988- (författare)
  • Automatic generation of configurable test-suites for software product lines
  • 2018
  • Doktorsavhandling (övrigt vetenskapligt)abstract
    • Software Product Line Engineering (SPLE) is an approach used in the development of similar products, which aims at systematic reuse of software artifacts. The SPLE process has several activities executed to assure software quality. Quality assurance is of vital importance for achieving and maintaining a high quality for various artifacts, such as products and processes. Testing activities are widely used in industry for quality assurance. However, the effort for applying testing is usually high, and increasing the testing efficiency is a major concern. A common means of increasing efficiency is automation of test design. Several techniques, processes, and strategies were developed for SPLE testing, but still many problems are open in this area of research. The challenge in focus is the reduction of the overall test effort required to test SPLE products. Test effort can be reduced by maximizing test reuse using models that take advantage of the similarity between products. The thesis goal is to automate the generation of small test-suites with high fault detection and low test redundancy between products. To achieve the goal, equivalent tests are identified for a set of products using complete and configurable test-suites. Two research directions are explored, one is product-based centered, and the other is product line-centered. For test design, test-suites that have full fault coverage were generated from state machines with and without feature constraints. A prototype tool was implemented for test design automation. In addition, the proposed approach was evaluated using examples, experimental studies, and an industrial case study for the automotive domain. The results of the product-based centered approach indicate a reduction of 36% on the number of test cases that need to be concretized. The results of the product line-centered approach indicate a reduction of 50% on the number of test cases generated for groups of product configurations.
  •  
36.
  • Hierons, Robert M., et al. (författare)
  • Hardness of deriving invertible sequences from finite state machines
  • 2017
  • Ingår i: SOFSEM 2017: SOFSEM 2017: Theory and Practice of Computer Science. - Heidelberg : Springer Berlin/Heidelberg. - 9783319519623 - 9783319519630 ; , s. 147-160
  • Konferensbidrag (refereegranskat)abstract
    • Many test generation algorithms use unique input/output sequences (UIOs) that identify states of the finite state machine specification M. However, it is known that UIO checking the existence of UIO sequences is PSPACE-complete. As a result, some UIO generation algorithms utilise what are called invertible sequences; these allow one to construct additional UIOs once a UIO has been found. We consider three optimisation problems associated with invertible sequences: deciding whether there is a (proper) invertible sequence of length at least K; deciding whether there is a set of invertible sequences for state set S′ that contains at most K input sequences; and deciding whether there is a single input sequence that defines invertible sequences that take state set S″ to state set S′. We prove that the first two problems are NP-complete and the third is PSPACE-complete. These results imply that we should investigate heuristics for these problems. © Springer International Publishing AG 2017.
  •  
37.
  • Keshishzadeh, Sarmen, et al. (författare)
  • Early Fault Detection in DSLs using SMT Solving and Automated Debugging
  • 2013
  • Ingår i: ; , s. 182-196
  • Konferensbidrag (refereegranskat)abstract
    • In the context of Domain Specic Languages (DSLs), westudy ways to detect faults early in the software development cycle. Wepropose techniques that validate a wide range of properties, classiedinto basic and advanced. Basic validation includes syntax checking, reference checking and type checking. Advanced validation concerns domainspecic properties related to the semantics of the DSL. For verication,we mechanically translate the DSL instance and the advanced propertiesinto Satisability Modulo Theory (SMT) problems, and solve these problems using an SMT solver. For user feedback, we extend the vericationwith automated debugging, which pinpoints the causes of the violatedproperties and traces them back to the syntactic constructs of the DSL.We illustrate this integration of techniques using an industrial case oncollision prevention for medical imaging equipment. © 2013 Springer-Verlag.
  •  
38.
  • Kunze, Sebastian, 1990-, et al. (författare)
  • Generation of Failure Models through Automata Learning
  • 2016
  • Ingår i: AUTO-CAAS. - Los Alamitos : IEEE Computer Society. ; , s. 22-25
  • Konferensbidrag (refereegranskat)abstract
    • In the context of the AUTO-CAAS project that deals with model-based testing techniques applied in the automotive domain, we present the preliminary ideas and results of building generalised failure models for non-conformant software components. These models are a necessary building block for our upcoming efforts to detect and analyse failure causes in automotive software built with AUTOSAR components. Concretely, we discuss how to build these generalised failure models using automata learning techniques applied to a guided model-based testing procedure of a failing component. We illustrate our preliminary findings and experiments on a simple integer queue implemented in the C programming language. © 2016 IEEE.
  •  
39.
  • Mohaqeqi, Morteza, et al. (författare)
  • Conformance Testing of Cyber-Physical Systems : A Comparative Study
  • 2014
  • Ingår i: Proceedings of the 14th International Workshop on Automated Verification of Critical Systems (AVoCS 2014). - Berlin : European Association of Software Science and Technology.
  • Konferensbidrag (refereegranskat)abstract
    • For systematic and automatic testing of cyber-physical systems, in which a set of test cases is generated based on a formal specification, a number of notions of conformance testing have been proposed. In this paper, we review two existing theories of conformance testing for cyber-physical systems and compare them. We point out their fundamental differences, and prove under which assumptions they coincide.
  •  
40.
  • Mohaqeqi, Morteza, et al. (författare)
  • Sound Test-Suites for Cyber-Physical Systems
  • 2016
  • Ingår i: VR Project EFFEMBAC and KK Project AUTO-CAAS. - Piscataway : IEEE Computer Society. ; , s. 42-48
  • Konferensbidrag (refereegranskat)abstract
    • Conformance testing is a formal and structured approach to verifying system correctness. We propose a conformance testing algorithm for cyber-physical systems, based on the notion of hybrid conformance by Abbas and Fainekos. We show how the dynamics of system specification and the sampling rate play an essential role in making sound verdicts. We specify and prove error bounds that lead to sound test-suites for a given specification and a given sampling rate. © 2016 IEEE.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 31-40 av 62
  • Föregående 123[4]567Nästa
Typ av publikation
konferensbidrag (29)
tidskriftsartikel (14)
rapport (8)
proceedings (redaktörskap) (4)
doktorsavhandling (2)
bokkapitel (2)
visa fler...
samlingsverk (redaktörskap) (1)
bok (1)
recension (1)
visa färre...
Typ av innehåll
refereegranskat (43)
övrigt vetenskapligt (19)
Författare/redaktör
Mousavi, Mohammad Re ... (61)
Reniers, Michel A. (8)
Beohar, Harsh, 1984- (7)
Varshosaz, Mahsa, 19 ... (7)
Aceto, Luca (6)
Ingólfsdóttir, Anna (5)
visa fler...
Mohaqeqi, Morteza (3)
Cimini, Matteo (3)
Taromirad, Masoumeh, ... (3)
Noroozi, Neda (3)
Goriac, Eugen-Ioan (2)
Reniers, Michael A. (2)
Dechesne, Francien (2)
Aerts, Arend (2)
Mostowski, Wojciech, ... (2)
Ali, Nauman Bin (2)
Carvalho, Gustavo (2)
Sampaio, Augusto (2)
Castellani, Ilaria (2)
Mosses, Peter D. (2)
Baier, Christel (1)
Birgisson, Arnar (1)
Aichernig, Bernhard ... (1)
Tappler, Martin (1)
Berger, Christian (1)
Bin Ali, Nauman (1)
Engström, Emelie (1)
Taromirad, Masoumeh (1)
Mousavi, Mohammad (1)
Minhas, Nasir Mehmoo ... (1)
Helgesson, Daniel (1)
Kunze, Sebastian (1)
Varshoaz, Mahsa (1)
Varshosaz, Mahsa (1)
Mousavi, Muhammad Ra ... (1)
Taha, Walid, 1972- (1)
Araujo, Hugo (1)
Arts, Thomas (1)
Khosravi, Ramtin (1)
Atif, Muhammad (1)
Cranen, Sjoerd (1)
Sirjani, Marjan (1)
Khamespanah, Ehsan (1)
Caltais, Georgiana (1)
Leue, Stefan (1)
Chaudron, Michel (1)
Churchill, Martin (1)
Gabbay, Murdoch J. (1)
Schaefer, Ina (1)
Costa Paiva, Sofia (1)
visa färre...
Lärosäte
Högskolan i Halmstad (61)
Uppsala universitet (2)
Lunds universitet (1)
Blekinge Tekniska Högskola (1)
Språk
Engelska (62)
Forskningsämne (UKÄ/SCB)
Naturvetenskap (57)
Teknik (6)

År

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy