The Experts below are selected from a list of 3174 Experts worldwide ranked by ideXlab platform
Maria Bielikova - One of the best experts on this subject based on the ideXlab platform.
-
qos aware semantic web service composition approach considering pre Postconditions
International Conference on Web Services, 2010Co-Authors: Peter Bartalos, Maria BielikovaAbstract:Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in the user goal. This paper proposes also an approach to restriction on the service space which provided a dramatic improvement in terms of composition time.
-
fast and scalable semantic web service composition approach considering complex pre Postconditions
IEEE Congress on Services, 2009Co-Authors: Peter Bartalos, Maria BielikovaAbstract:The process of semantic web service composition arranges several web services into one composite service to realize complex workflows with an exploitation of semantics. This paper proposes an approach to automatic semantic web service composition. Its advantage is good scalability regarding the complexity of user constraints and pre/post conditions. Based on these conditions it propagates the value restrictions constraint from the user goal through the overall composite service. The resulting plan depicts all the possible branches of the workflow leading to a goal. This includes the automatic generation of the conditions deciding which branch will be chosen during the execution. Finally, our approach exploits available data which can be used as input parameters for web services. If these are not offered, it searches for a web service producing them.
Betty H C Cheng - One of the best experts on this subject based on the ideXlab platform.
-
strongest postcondition semantics as the formal basis for reverse engineering
Automated Software Engineering, 1996Co-Authors: Gerald C Gannod, Betty H C ChengAbstract:Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a “legacy” or “geriatric” state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. This paper describes the application of the strongest postcondition predicate transformer (sp) as the formal basis for the reverse engineering of imperative program code.
-
strongest postcondition semantics as the formal basis for reverse engineering
Working Conference on Reverse Engineering, 1995Co-Authors: Gerald C Gannod, Betty H C ChengAbstract:Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a "legacy" or "geriatric" state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. This paper describes the application of the strongest postcondition predicate transformer (strongest postcondition) as the formal basis for the reverse engineering of imperative program code.
Duan Repov - One of the best experts on this subject based on the ideXlab platform.
-
l fuzzy strongest postcondition predicate transformers as l idempotent linear or affine operators between semimodules of monotonic predicates
Fuzzy Sets and Systems, 2012Co-Authors: Oleh Nykyforchyn, Duan RepovAbstract:For a completely distributive quantale L, L-fuzzy strongest postcondition predicate transformers are introduced, and it is shown that, under reasonable assumptions, they are linear or affine continuous mappings between continuous L-idempotent semimodules of L-fuzzy monotonic predicates.
Peter Bartalos - One of the best experts on this subject based on the ideXlab platform.
-
qos aware semantic web service composition approach considering pre Postconditions
International Conference on Web Services, 2010Co-Authors: Peter Bartalos, Maria BielikovaAbstract:Web service composition is a topic bringing several issues to be resolved. Our work deals with the effectiveness and scalability of service composition. During composition we consider QoS and pre-/post-conditions of single services to create a composite service satisfying the user needs the best. Regarding pre-/post-conditions we propose an approach to fast determination of which services produce results expected by the user, i.e. the post-condition of which services implicates the desired condition defined in the user goal. This paper proposes also an approach to restriction on the service space which provided a dramatic improvement in terms of composition time.
-
fast and scalable semantic web service composition approach considering complex pre Postconditions
IEEE Congress on Services, 2009Co-Authors: Peter Bartalos, Maria BielikovaAbstract:The process of semantic web service composition arranges several web services into one composite service to realize complex workflows with an exploitation of semantics. This paper proposes an approach to automatic semantic web service composition. Its advantage is good scalability regarding the complexity of user constraints and pre/post conditions. Based on these conditions it propagates the value restrictions constraint from the user goal through the overall composite service. The resulting plan depicts all the possible branches of the workflow leading to a goal. This includes the automatic generation of the conditions deciding which branch will be chosen during the execution. Finally, our approach exploits available data which can be used as input parameters for web services. If these are not offered, it searches for a web service producing them.
Gerald C Gannod - One of the best experts on this subject based on the ideXlab platform.
-
strongest postcondition semantics as the formal basis for reverse engineering
Automated Software Engineering, 1996Co-Authors: Gerald C Gannod, Betty H C ChengAbstract:Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a “legacy” or “geriatric” state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. This paper describes the application of the strongest postcondition predicate transformer (sp) as the formal basis for the reverse engineering of imperative program code.
-
strongest postcondition semantics as the formal basis for reverse engineering
Working Conference on Reverse Engineering, 1995Co-Authors: Gerald C Gannod, Betty H C ChengAbstract:Reverse engineering of program code is the process of constructing a higher level abstraction of an implementation in order to facilitate the understanding of a system that may be in a "legacy" or "geriatric" state. Changing architectures and improvements in programming methods, including formal methods in software development and object-oriented programming, have prompted a need to reverse engineer and re-engineer program code. This paper describes the application of the strongest postcondition predicate transformer (strongest postcondition) as the formal basis for the reverse engineering of imperative program code.
