Semantic Web Services Challenge 2007 An approach to mediation synthesis with (j)ABC
ABSTRACT We address the discovery scenario using miAamics, a framework for rule-based evaluation ... more ABSTRACT We address the discovery scenario using miAamics, a framework for rule-based evaluation originally developed for efficient and scalable personalization purposes, as a reasoning engine. The discovery service is again imple- mented in the jABC. The solution will be demonstrated at the workshop.
IFIP International Federation for Information Processing, 2006
We present a learning-based method for model completion and adaptation, which is based on the com... more We present a learning-based method for model completion and adaptation, which is based on the combination of two approaches: 1) R2D2C, a technique for mechanically transforming system requirements via provably equivalent models to running code, and 2) automata learning-based model extrapolation. The intended impact of this new combination is to make model completion and adaptation accessible to experts of the field, like biologists or engineers. The principle is briefly illustrated by generating models of biological procedures concerning gene activities in the production of proteins, although the main application is going to concern autonomic systems for space exploration.
In this paper we show how to apply a tableau-based software com- position technique to automatica... more In this paper we show how to apply a tableau-based software com- position technique to automatically generate the mediator's service logic. This uses an LTL planning (or configuration) algorithm originally embedded in the ABC and in the ETI platforms. The algorithm works on the basis of the existing jABC library of available services (SIB library) and of an enhanced description of their semantics given in terms of a taxonomic classification of their behaviour (modules) and abstract interfaces/messages (types).
Efficient test-based model generation for legacy reactive systems
Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940), 2004
... of Computer Science, August 2002 [51 J. E. Cook, A. L. Wolf Discovering Models of Software Pr... more ... of Computer Science, August 2002 [51 J. E. Cook, A. L. Wolf Discovering Models of Software Processes from Event-Based Data ACM Transactions on Software Engineering and Methodology (TOSEM) 2 15-249, 1998 [6] M. D. Emst, A. Czeisler, W. G. Griswold, D. Notkin. ...
Regular Inference for State Machines Using Domains with Equality Tests
Lecture Notes in Computer Science, 2008
Existing algorithms for regular inference (aka automata learning) allows to infer a finite state ... more Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to a selected sequence of input strings. We generalize regular inference techniques to infer a class of state machines with an infinite state space. We consider Mealy machines extended with state variables that can assume
Conformance testing for finite state machines and regular inference both aim at identifying the m... more Conformance testing for finite state machines and regular inference both aim at identifying the model structure underlying a black box system on the basis of a limited set of observations. Whereas the former technique checks for equivalence with a given conjecture model, the latter techniques addresses the corresponding synthesis problem by means of techniques adopted from automata learning. In this paper we establish a common framework to investigate the similarities of these techniques by showing how results in one area can be transferred to results in the other and to explain the reasons for their differences.
When developing hard- or software systems one starts with a collection of requirements. Most requ... more When developing hard- or software systems one starts with a collection of requirements. Most requirements arise due to the needs of the customer, others originate from design decisions and further constraints. Of course, the final system should fulfill these requirements. Besides general requirements like scalability and performance, there is often a large number of formal requirements which concern the functionality
Regular Inference for State Machines with Parameters
Lecture Notes in Computer Science, 2006
Techniques for inferring a regular language, in the form of a nite automaton, from a suciently la... more Techniques for inferring a regular language, in the form of a nite automaton, from a suciently large sample of accepted and nonac- cepted input words, have been employed to construct models of software and hardware systems, for use, e.g., in test case generation. We intend to adapt these techniques to construct state machine models of entities of communication protocols. The
12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007), 2007
The FMICS-jETI platform is a collaborative, servicebased demonstrator of tools and techniques for... more The FMICS-jETI platform is a collaborative, servicebased demonstrator of tools and techniques for the analysis of industrial critical systems. It is the FMICS Working Group contribution to the Verified Software Initiative.
LearnLib: A Library for Automata Learning and Experimentation
Lecture Notes in Computer Science, 2006
... 215-249, 1998 [7] MD Ernst, A. Czeisler, WG Griswold, D. Notkin. ... Workshop on Protocol Tes... more ... 215-249, 1998 [7] MD Ernst, A. Czeisler, WG Griswold, D. Notkin. ... Workshop on Protocol Test Systems, 161176, 1990 [10] Yinan N. Shen, Fabrizio Lombardi, Anton T. Dahbura Protocol Conformance Testing Using Multiple UIO Sequences Proceedings of the IFIP WG6.1 Ninth ...
International Journal on Software Tools for Technology Transfer, 2009
In this paper, we present the LearnLib, a library of tools for automata learning, which is explic... more In this paper, we present the LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic experimental analysis of the profile of available learning algorithms and corresponding optimizations. Its modular structure allows users to configure their own tailored learning scenarios, which exploit specific properties of their envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios.
International Journal on Software Tools for Technology Transfer, 2009
This paper presents dynamic testing, a method that exploits automata learning to systematically t... more This paper presents dynamic testing, a method that exploits automata learning to systematically test (black box) systems almost without prerequisites. Based on interface descriptions and optional sample test cases, our method successively explores the system under test (SUT), in order to extrapolate a behavioural model. This is in turn used to steer the further exploration process. Due to the applied
Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications - TAV-WEB '08, 2008
In this paper, we present hybrid testing, a method that combines replay-testing (static testing) ... more In this paper, we present hybrid testing, a method that combines replay-testing (static testing) with automata learning techniques that generate models of black box systems (dynamic testing). This combination helps bridging the gap towards model based testing also for legacy systems. Webtest is an implementation of hybrid testing that builds on top of preexisting technology such as the LearnLib, a framework for automata learning, and the jABC, a framework for modeldriven and service-oriented design, that we use here for modelling, executing, and managing test suites for and models of the web applications under analysis. In particular we intend to move towards Rich Internet Applications (RIAs), that include e.g. advanced client side capabilities and access to heavy resources (e.g. database access) over the Web.
Semantic Web Services Challenge 2007 An approach to mediation synthesis with (j)ABC
ABSTRACT We address the discovery scenario using miAamics, a framework for rule-based evaluation ... more ABSTRACT We address the discovery scenario using miAamics, a framework for rule-based evaluation originally developed for efficient and scalable personalization purposes, as a reasoning engine. The discovery service is again imple- mented in the jABC. The solution will be demonstrated at the workshop.
IFIP International Federation for Information Processing, 2006
We present a learning-based method for model completion and adaptation, which is based on the com... more We present a learning-based method for model completion and adaptation, which is based on the combination of two approaches: 1) R2D2C, a technique for mechanically transforming system requirements via provably equivalent models to running code, and 2) automata learning-based model extrapolation. The intended impact of this new combination is to make model completion and adaptation accessible to experts of the field, like biologists or engineers. The principle is briefly illustrated by generating models of biological procedures concerning gene activities in the production of proteins, although the main application is going to concern autonomic systems for space exploration.
In this paper we show how to apply a tableau-based software com- position technique to automatica... more In this paper we show how to apply a tableau-based software com- position technique to automatically generate the mediator's service logic. This uses an LTL planning (or configuration) algorithm originally embedded in the ABC and in the ETI platforms. The algorithm works on the basis of the existing jABC library of available services (SIB library) and of an enhanced description of their semantics given in terms of a taxonomic classification of their behaviour (modules) and abstract interfaces/messages (types).
Efficient test-based model generation for legacy reactive systems
Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940), 2004
... of Computer Science, August 2002 [51 J. E. Cook, A. L. Wolf Discovering Models of Software Pr... more ... of Computer Science, August 2002 [51 J. E. Cook, A. L. Wolf Discovering Models of Software Processes from Event-Based Data ACM Transactions on Software Engineering and Methodology (TOSEM) 2 15-249, 1998 [6] M. D. Emst, A. Czeisler, W. G. Griswold, D. Notkin. ...
Regular Inference for State Machines Using Domains with Equality Tests
Lecture Notes in Computer Science, 2008
Existing algorithms for regular inference (aka automata learning) allows to infer a finite state ... more Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to a selected sequence of input strings. We generalize regular inference techniques to infer a class of state machines with an infinite state space. We consider Mealy machines extended with state variables that can assume
Conformance testing for finite state machines and regular inference both aim at identifying the m... more Conformance testing for finite state machines and regular inference both aim at identifying the model structure underlying a black box system on the basis of a limited set of observations. Whereas the former technique checks for equivalence with a given conjecture model, the latter techniques addresses the corresponding synthesis problem by means of techniques adopted from automata learning. In this paper we establish a common framework to investigate the similarities of these techniques by showing how results in one area can be transferred to results in the other and to explain the reasons for their differences.
When developing hard- or software systems one starts with a collection of requirements. Most requ... more When developing hard- or software systems one starts with a collection of requirements. Most requirements arise due to the needs of the customer, others originate from design decisions and further constraints. Of course, the final system should fulfill these requirements. Besides general requirements like scalability and performance, there is often a large number of formal requirements which concern the functionality
Regular Inference for State Machines with Parameters
Lecture Notes in Computer Science, 2006
Techniques for inferring a regular language, in the form of a nite automaton, from a suciently la... more Techniques for inferring a regular language, in the form of a nite automaton, from a suciently large sample of accepted and nonac- cepted input words, have been employed to construct models of software and hardware systems, for use, e.g., in test case generation. We intend to adapt these techniques to construct state machine models of entities of communication protocols. The
12th IEEE International Conference on Engineering Complex Computer Systems (ICECCS 2007), 2007
The FMICS-jETI platform is a collaborative, servicebased demonstrator of tools and techniques for... more The FMICS-jETI platform is a collaborative, servicebased demonstrator of tools and techniques for the analysis of industrial critical systems. It is the FMICS Working Group contribution to the Verified Software Initiative.
LearnLib: A Library for Automata Learning and Experimentation
Lecture Notes in Computer Science, 2006
... 215-249, 1998 [7] MD Ernst, A. Czeisler, WG Griswold, D. Notkin. ... Workshop on Protocol Tes... more ... 215-249, 1998 [7] MD Ernst, A. Czeisler, WG Griswold, D. Notkin. ... Workshop on Protocol Test Systems, 161176, 1990 [10] Yinan N. Shen, Fabrizio Lombardi, Anton T. Dahbura Protocol Conformance Testing Using Multiple UIO Sequences Proceedings of the IFIP WG6.1 Ninth ...
International Journal on Software Tools for Technology Transfer, 2009
In this paper, we present the LearnLib, a library of tools for automata learning, which is explic... more In this paper, we present the LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic experimental analysis of the profile of available learning algorithms and corresponding optimizations. Its modular structure allows users to configure their own tailored learning scenarios, which exploit specific properties of their envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios.
International Journal on Software Tools for Technology Transfer, 2009
This paper presents dynamic testing, a method that exploits automata learning to systematically t... more This paper presents dynamic testing, a method that exploits automata learning to systematically test (black box) systems almost without prerequisites. Based on interface descriptions and optional sample test cases, our method successively explores the system under test (SUT), in order to extrapolate a behavioural model. This is in turn used to steer the further exploration process. Due to the applied
Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications - TAV-WEB '08, 2008
In this paper, we present hybrid testing, a method that combines replay-testing (static testing) ... more In this paper, we present hybrid testing, a method that combines replay-testing (static testing) with automata learning techniques that generate models of black box systems (dynamic testing). This combination helps bridging the gap towards model based testing also for legacy systems. Webtest is an implementation of hybrid testing that builds on top of preexisting technology such as the LearnLib, a framework for automata learning, and the jABC, a framework for modeldriven and service-oriented design, that we use here for modelling, executing, and managing test suites for and models of the web applications under analysis. In particular we intend to move towards Rich Internet Applications (RIAs), that include e.g. advanced client side capabilities and access to heavy resources (e.g. database access) over the Web.
Uploads
Papers by Harald Raffelt