The Experts below are selected from a list of 477 Experts worldwide ranked by ideXlab platform
Johan Montagnat - One of the best experts on this subject based on the ideXlab platform.
-
Orchestration Evolution Following Dataflow Concepts: Introducing Unanticipated Loops inside a Legacy Workflow
2009 Fourth International Conference on Internet and Web Applications and Services, 2009Co-Authors: Sébastien Mosser, Mireille Blay-fornarino, Johan MontagnatAbstract:Web Services Oriented Architecture (WSOA) supports development of high quality applications based on a control--flow between services. The introduction of a loop to deal with a dataset inside an orchestration is a typical evolution use case inside a WSOA, but there is no tool support to perform such Refactoring Operation. In this paper we propose a new method to refactor an orchestration dealing with a variable v so that it iterates over a dataset v* automatically. This algorithm is then validated on a running software used as a validation platform by the French research project called FAROS.
-
ICIW - Orchestration Evolution Following Dataflow Concepts: Introducing Unanticipated Loops inside a Legacy Workflow
2009 Fourth International Conference on Internet and Web Applications and Services, 2009Co-Authors: Sébastien Mosser, Mireille Blay-fornarino, Johan MontagnatAbstract:Web Services Oriented Architecture (WSOA) supports development of high quality applications based on a control--flow between services. The introduction of a loop to deal with a dataset inside an orchestration is a typical evolution use case inside a WSOA, but there is no tool support to perform such Refactoring Operation. In this paper we propose a new method to refactor an orchestration dealing with a variable v so that it iterates over a dataset v* automatically. This algorithm is then validated on a running software used as a validation platform by the French research project called FAROS.
Julien Cohen - One of the best experts on this subject based on the ideXlab platform.
-
VPT@ETAPS - Renaming Global Variables in C Mechanically Proved Correct
Electronic Proceedings in Theoretical Computer Science, 2016Co-Authors: Julien CohenAbstract:Most integrated development environments are shipped with Refactoring tools. However, their Refactoring Operations are often known to be unreliable. As a consequence, developers have to test their code after applying an automatic Refactoring. In this article, we consider a Refactoring Operation (renaming of global variables in C), and we prove that its core implementation preserves the set of possible behaviors of transformed programs. That proof of correctness relies on the Operational semantics of C provided by CompCert C in Coq.
-
Renaming Global Variables in C Mechanically Proved Correct
2016Co-Authors: Julien CohenAbstract:Most integrated development environments are shipped with Refactoring tools. However, their Refactoring Operations are often known to be unreliable. As a consequence, developers have to test their code after applying an automatic Refactoring. In this article, we consider a Refactoring Operation (renaming of global variables in C), and we prove that its core implementation preserves the set of possible behaviors of transformed programs. That proof of correctness relies on the Operational semantics of C provided by CompCert C in Coq.
-
A Correct Refactoring Operation to Rename Global Variables in C Programs
2015Co-Authors: Julien CohenAbstract:Most integrated development environments are shipped with Refactoring tools. However, their Refactoring Operations are often known to be unreliable. As a consequence, developers have to test their code after applying an automatic Refactoring. In this report, we consider a Refactoring Operation (renaming of global variables in C), and we prove that its core implementation preserves the set of possible behaviors of transformed programs. That proof of correctness relies on the Operational semantics of C provided by Compcert C in Coq. We also prove some static properties of the considered Refactoring Operation and we use them to find properties of some composed Refactoring Operations.
-
Program Transformation based Views for Modular Maintenance
2011Co-Authors: Akram Ajouli, Julien Cohen, Rémi DouenceAbstract:Modular programming is a practical solution for separation of concerns but the support for modularity provided by programming languages does not resolve the classic expression problem and more generally the tyranny of the dominant decomposition: evolutions are modular only on the principal axis of decomposition. To solve this problem, a practical solution would be to be able to choose the architecture of an application each time one has to make it evolve. We provide a prototype tool for the Haskell language to support that. Our tool allows to build transformations to switch Haskell programs from one structure to another. We do this by driving a Refactoring tool for Haskell (HaRe): transformations are built by chaining elementary Operations of Refactoring. Since each elementary Refactoring Operation preserve the semantics, the whole transformations also do.
Sébastien Mosser - One of the best experts on this subject based on the ideXlab platform.
-
Orchestration Evolution Following Dataflow Concepts: Introducing Unanticipated Loops inside a Legacy Workflow
2009 Fourth International Conference on Internet and Web Applications and Services, 2009Co-Authors: Sébastien Mosser, Mireille Blay-fornarino, Johan MontagnatAbstract:Web Services Oriented Architecture (WSOA) supports development of high quality applications based on a control--flow between services. The introduction of a loop to deal with a dataset inside an orchestration is a typical evolution use case inside a WSOA, but there is no tool support to perform such Refactoring Operation. In this paper we propose a new method to refactor an orchestration dealing with a variable v so that it iterates over a dataset v* automatically. This algorithm is then validated on a running software used as a validation platform by the French research project called FAROS.
-
ICIW - Orchestration Evolution Following Dataflow Concepts: Introducing Unanticipated Loops inside a Legacy Workflow
2009 Fourth International Conference on Internet and Web Applications and Services, 2009Co-Authors: Sébastien Mosser, Mireille Blay-fornarino, Johan MontagnatAbstract:Web Services Oriented Architecture (WSOA) supports development of high quality applications based on a control--flow between services. The introduction of a loop to deal with a dataset inside an orchestration is a typical evolution use case inside a WSOA, but there is no tool support to perform such Refactoring Operation. In this paper we propose a new method to refactor an orchestration dealing with a variable v so that it iterates over a dataset v* automatically. This algorithm is then validated on a running software used as a validation platform by the French research project called FAROS.
Cohen Julien - One of the best experts on this subject based on the ideXlab platform.
-
Renaming Global Variables in C Mechanically Proved Correct
HAL CCSD, 2016Co-Authors: Cohen JulienAbstract:International audienceMost integrated development environments are shipped with Refactoring tools. However, their Refactoring Operations are often known to be unreliable. As a consequence, developers have to test their code after applying an automatic Refactoring.In this article, we consider a Refactoring Operation (renaming of global variables in C), and we prove that its core implementation preserves the set of possible behaviors of transformed programs. That proof of correctness relies on the Operational semantics of C provided by CompCert C in Coq
-
A Correct Refactoring Operation to Rename Global Variables in C Programs
HAL CCSD, 2015Co-Authors: Cohen JulienAbstract:GALLINETTE_HCERES2020Most integrated development environments are shipped with Refactoring tools. However, their Refactoring Operations are often known to be unreliable. As a consequence, developers have to test their code after applying an automatic Refactoring. In this report, we consider a Refactoring Operation (renaming of global variables in C), and we prove that its core implementation preserves the set of possible behaviors of transformed programs. That proof of correctness relies on the Operational semantics of C provided by Compcert C in Coq. We also prove some static properties of the considered Refactoring Operation and we use them to find properties of some composed Refactoring Operations
-
Program Transformation based Views for Modular Maintenance
HAL CCSD, 2011Co-Authors: Ajouli Akram, Cohen Julien, Douence RémiAbstract:PosterNational audienceModular programming is a practical solution for separation of concerns but the support for modularity provided by programming languages does not resolve the classic expression problem and more generally the tyranny of the dominant decomposition: evolutions are modular only on the principal axis of decomposition. To solve this problem, a practical solution would be to be able to choose the architecture of an application each time one has to make it evolve. We provide a prototype tool for the Haskell language to support that. Our tool allows to build transformations to switch Haskell programs from one structure to another. We do this by driving a Refactoring tool for Haskell (HaRe): transformations are built by chaining elementary Operations of Refactoring. Since each elementary Refactoring Operation preserve the semantics, the whole transformations also do
Montagnat Johan - One of the best experts on this subject based on the ideXlab platform.
-
Orchestration Evolution Following Dataflow Concepts: Introducing Unanticipated Loops Inside a Legacy Workflow
IEEE Computer Society, 2009Co-Authors: Mosser Sébastien, Blay-fornarino Mireille, Montagnat JohanAbstract:International audienceWeb Services Oriented Architecture (WSOA) supports development of high quality applications based on a control–flow between services. The introduction of a loop to deal with a dataset inside an orchestration is a typical evolution use case inside a WSOA, but there is no tool sup- port to perform such Refactoring Operation. In this paper we propose a new method to refactor an orchestration deal- ing with a variable v so that it iterates over a dataset v⋆ automatically. This algorithm is then validated on a run- ning software used as a validation platform by the French research project called FAROS