Sciweavers

1700 search results - page 96 / 340
» Specifying and implementing refactorings
Sort
View
147
Voted
ECOWS
2008
Springer
15 years 6 months ago
Automatic Timed Test Case Generation for Web Services Composition
In order to specify the composition of Web services, WSBPEL was defined as an orchestrating language by an international standards consortium. In this paper, we propose a method t...
Mounir Lallali, Fatiha Zaïdi, Ana R. Cavalli,...
FMCO
2008
Springer
143views Formal Methods» more  FMCO 2008»
15 years 6 months ago
An Asynchronous Distributed Component Model and Its Semantics
This paper is placed in the context of large scale distributed programming, providing a programming model based on asynchronous components. It focuses on the semantics of asynchron...
Ludovic Henrio, Florian Kammüller, Marcela Ri...
AWPN
2008
232views Algorithms» more  AWPN 2008»
15 years 6 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
140
Voted
ISTA
2001
15 years 5 months ago
Supporting Behavioral Contracts for COM Components
: Specifying behavioral specifications for components apart from the conventional syntactic interface specifications can be very useful in component based system development. Preco...
Sonal Bhagat, Rushikesh K. Joshi
AAAI
1997
15 years 5 months ago
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
Rahul Roy-Chowdhury, Mukesh Dalal