Regular Inference for State Machines Using Domains with Equality Tests

Berg, Therese; Jönsson, Bengt; Raffelt, Harald

doi:10.1007/978-3-540-78743-3_24

Cited by 38 publications

(26 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…AECS is part of the Amazon Associates WS suite 5 . The aim of this section is to show the applicability of StrawBerry to a complex WS that is well-known and widely used by practitioners.…”

Section: The Amazon E-commerce Ser-vice Case Studymentioning

confidence: 99%

Automatic synthesis of behavior protocols for composable web-services

Bertolino

Inverardi

Tivoli

2009

Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Found

107

View full text Add to dashboard Cite

Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing new composite web-services out of existing ones. In the literature many approaches have been proposed with the aim to automatically compose web-services. All of them assume that, along with the webservice signature, some information is provided about how clients interacting with the web-service should behave when invoking it. We call this piece of information the web-service behavior protocol. Unfortunately, in the practice this assumption turns out to be unfounded. To address this need, in this paper we propose a method to automatically derive from the web-service signature an automaton modeling its behavior protocol. The method, called StrawBerry, combines synthesis and testing techniques. In particular, synthesis is based on data type analysis. The conformance between the synthesized automaton and the implementation of the corresponding web-service is checked by means of testing. The application of StrawBerry to the Amazon E-Commerce Service shows that it is practical and realistic.

show abstract

“…AECS is part of the Amazon Associates WS suite 5 . The aim of this section is to show the applicability of StrawBerry to a complex WS that is well-known and widely used by practitioners.…”

Section: The Amazon E-commerce Ser-vice Case Studymentioning

confidence: 99%

Automatic synthesis of behavior protocols for composable web-services

Bertolino

Inverardi

Tivoli

2009

Proceedings of the 7th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Found

107

View full text Add to dashboard Cite

show abstract

“…The work described in [10] presents an approach for inferring state machines with an infinite state space. By observing the output that the system produces when stimulated with selected inputs, they extend existing algorithms for regular inference (which infer finite state machines) to deal with infinite-state systems.…”

Section: Related Workmentioning

confidence: 99%

Automated Integration of Service-Oriented Software Systems

Autili

Inverardi

Tivoli

2015

Fundamentals of Software Engineering

View full text Add to dashboard Cite

Abstract. In the near future we will be surrounded by a virtually infinite number of software applications that provide services in the digital space. This situation radically changes the way software will be produced and used: (i) software is increasingly produced according to specific goals and by integrating existing software; (ii) the focus of software production will be shifted towards reuse of third-parties software, typically blackbox, that is often provided without a machine readable documentation. The evidence underlying this scenario is that the price to pay for this software availability is a lack of knowledge on the software itself, notably on its interaction behaviour. A producer will operate with software artefacts that are not completely known in terms of their functional and non-functional characteristics. The general problem is therefore directed to the ability of interacting with the artefacts to the extent the goal is reached. This is not a trivial problem given the virtually infinite interaction protocols that can be defined at application level. Different software artefacts with heterogeneous interaction protocols may need to interoperate in order to reach the goal. In this paper we focus on techniques and tools for integration code synthesis, which are able to deal with partial knowledge and automatically produce correct-by-construction serviceoriented systems with respect to functional goals. The research approach we propose builds around two phases: elicit and integrate. The first concerns observation theories and techniques to elicit functional behavioural models of the interaction protocol of black-box services. The second deals with compositional theories and techniques to automatically synthesize appropriate integration means to compose the services together in order to realize a service choreography that satisfies the goal.

show abstract

“…In [3], the model was enhanced again to consider input/output parameters with finite (or infinite) domains; this is called Parameterized Finite State Machine (PFSM).…”

Section: A Extended Modelsmentioning

confidence: 99%

Automatic Generation of Test Drivers for Model Inference of Web Applications

Hossen¹,

Groz²,

Oriat³

et al. 2013

2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops

View full text Add to dashboard Cite

Abstract-In the "Internet of Services" (IoS) vision of the Internet, applications are developed as services using the web standards. Model-based testing combined with active model inference is one of the methods to test the applications pretty automatically, in particular to look for vulnerabilities. But one part still needs to be written manually, the test driver. It contains an abstraction of the real application and the methods to interact with the system at abstract and concrete level. We propose a generic abstraction of the web applications and an approach to generate the corresponding test driver automatically using a crawler to identify the needed information. Keywords: model inference, test driver generation, crawling method, web application I. MODEL INFERENCEIn the IoS (Internet of services) vision, information is provided to the user as a service. Applications which were developed as a single block are now built by assembling components provided by various service providers. The complexity of this kind of application, its architecture and the fact that most of the time a formal model is not available, make model-based testing and verification difficult and timeconsuming.However, in a testing context, partial models can actually be retrieved, even for black box components, from observation gathered in the testing process. Model inference -that is, methods to automatically derive models from observation of the behaviors -can seriously help to test services by providing models of the components automatically.Model inference is commonly divided into two categories: active and passive inference. Passive learning learns only from a given set of observations whereas active learning is free to interact with the tested system. In the case of web applications, we are free to interact with it through its web interface. As active learning converges faster, has better results than passive learning and is usable for website, it is the best choice. Angluin's well-known algorithm (L*) [1] is in the active learning category and can infer a deterministic finite automaton (DFA). This algorithm has often been used as a base for developing enhanced model inference algorithms. A. Extended ModelsWeb-based applications use a lot of structured messages to communicate. This makes application behavior mainly dependent on the inputs and outputs (I/O) and not only on the states. Basing the alphabet on the I/O value pairs would produce a large number of transitions and states and it would be highly inefficient. In order to use adapted models, we must have an efficient model which considers inputs and outputs, which may be structured.

show abstract

Regular Inference for State Machines Using Domains with Equality Tests

Cited by 38 publications

References 22 publications

Automatic synthesis of behavior protocols for composable web-services

Automatic synthesis of behavior protocols for composable web-services

Automated Integration of Service-Oriented Software Systems

Automatic Generation of Test Drivers for Model Inference of Web Applications

Contact Info

Product

Resources

About