Learning regular sets from queries and counterexamples
Information and Computation
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Automatic generation of software behavioral models
Proceedings of the 30th international conference on Software engineering
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
Synthesizing intensional behavior models by graph transformation
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
Automatic synthesis of behavior protocols for composable web-services
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Dynamic testing via automata learning
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Synthesizing adapters for conversational web-services from their WSDL interface
Proceedings of the 2010 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems
Generating test cases for specification mining
Proceedings of the 19th international symposium on Software testing and analysis
Executable interface specifications for testing asynchronous creol components
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
libalf: the automata learning framework
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Regular inference for state machines with parameters
FASE'06 Proceedings of the 9th international conference on Fundamental Approaches to Software Engineering
| Hi-index | 0.00 |
Correctness of system compositions is automatically ensured by using formal behavioural models of services. However, such models are not always provided. We present a model inference technique for black-box asynchronous services, that interleaves behavioural exploration and incremental model refinement. To save learning effort, only behaviour relevant to the desired system specification is explored. Compared to existing inference techniques that assume only controllable behaviour, our method addresses also uncontrollable events. Experimental results show that obtained models can be successfully used for a safe composition.