Reasoning About a Service-oriented Programming Paradigm

This paper is about a new way for programming distributed applications: the service-oriented one. It is a concept paper based upon our experience in developing a theory and a language for programming services. Both the theoretical formalization and the language interpreter showed us the evidence that a new programming paradigm exists. In this paper we illustrate the basic features it is characterized by

The Paths to Choreography Extraction

Choreographies are global descriptions of interactions among concurrent components, most notably used in the settings of verification (e.g., Multiparty Session Types) and synthesis of correct-by-construction software (Choreographic Programming). They require a top-down approach: programmers first write choreographies, and then use them to verify or synthesize their programs. However, most existing software does not come with choreographies yet, which prevents their application. To attack this problem, we propose a novel methodology (called choreography extraction) that, given a set of programs or protocol specifications, automatically constructs a choreography that describes their behavior. The key to our extraction is identifying a set of paths in a graph that represents the symbolic execution of the programs of interest. Our method improves on previous work in several directions: we can now deal with programs that are equipped with a state and internal computation capabilities; time complexity is dramatically better; we capture programs that are correct but not necessarily synchronizable, i.e., they work because they exploit asynchronous communication

Choreographies in Practice

Choreographic Programming is a development methodology for concurrent software that guarantees correctness by construction. The key to this paradigm is to disallow mismatched I/O operations in programs, called choreographies, and then mechanically synthesise distributed implementations in terms of standard process models via a mechanism known as EndPoint Projection (EPP). Despite the promise of choreographic programming, there is still a lack of practical evaluations that illustrate the applicability of choreographies to concrete computational problems with standard concurrent solutions. In this work, we explore the potential of choreographies by using Procedural Choreographies (PC), a model that we recently proposed, to write distributed algorithms for sorting (Quicksort), solving linear equations (Gaussian elimination), and computing Fast Fourier Transform. We discuss the lessons learned from this experiment, giving possible directions for the usage and future improvements of choreography languages

Behavioral types in programming languages

A recent trend in programming language research is to use behav- ioral type theory to ensure various correctness properties of large- scale, communication-intensive systems. Behavioral types encompass concepts such as interfaces, communication protocols, contracts, and choreography. The successful application of behavioral types requires a solid understanding of several practical aspects, from their represen- tation in a concrete programming language, to their integration with other programming constructs such as methods and functions, to de- sign and monitoring methodologies that take behaviors into account. This survey provides an overview of the state of the art of these aspects, which we summarize as the pragmatics of behavioral types

Lipid-Based Nanosystems for the Topical Application of Ferulic Acid: A Comparative Study

In this study, we examined and compared two different lipid-based nanosystems (LBNs), namely Transferosomes (TFs) and Monoolein Aqueous Dispersions (MADs), as delivery systems for the topical application of Ferulic Acid (FA), an antioxidant molecule derived from natural sources. Our results, as demonstrated through Franz-cell experiments, indicate that the LBNs produced with poloxamer 188 in their composition create a multilamellar system. This system effectively controls the release of the drug. Nonetheless, we found that the type of non-ionic surfactant can impact the drug release rate. Regarding FA diffusion from the MAD, this showed a lower diffusion rate compared with the TF. In terms of an in vivo application, patch tests revealed that all LBN formulations tested were safe when applied under occlusive conditions for 48 h. Ad-ditionally, human skin biopsies were used to determine whether FA-containing formulations could influence skin tissue morphology or provide protection against O3 exposure. Analyses sug-gest that treatment with TFs composed of poloxamer 188 and MAD formulations might protect against structural skin damage (as observed in hematoxylin/eosin staining) and the development of an oxidative environment (as indicated by 4-hyroxinonenal (4HNE) expression levels) induced by O3 exposure. In contrast, formulations without the active ingredient did not offer protection against the detrimental effects of O3 exposur

Collapse of a semiflexible polymer in poor solvent

We investigate the dynamics and the pathways of the collapse of a single, semiflexible polymer in a poor solvent via 3-D Brownian Dynamics simulations. Earlier work indicates that the condensation of semiflexible polymers generically proceeds via a cascade through metastable racquet-shaped, long-lived intermediates towards the stable torus state. We investigate the rate of decay of uncollapsed states, analyze the preferential pathways of condensation, and describe likelihood and lifespan of the different metastable states. The simulation are performed with a bead-stiff spring model with excluded volume interaction and exponentially decaying attractive potential. The semiflexible chain collapse is studied as functions of the three relevant length scales of the phenomenon, i.e., the total chain length $L$, the persistence length $L_p$ and the condensation length $L_0 = \sqrt{k_B T L_p/u_0}$, where $u_0$ is a measure of the attractive potential per unit length. Two dimensionless ratios, $L/L_p$ and $L_0/L_p$, suffice to describe the decay rate of uncollapsed states, which appears to scale as $(L/L_p)^{1/3} (L_0/L_p)$. The condensation sequence is described in terms of the time series of the well separated energy levels associated with each metastable collapsed state. The collapsed states are described quantitatively through the spatial correlation of tangent vectors along the chain. We also compare the results obtained with a locally inextensible bead-rod chain and with a phantom bead-spring model. Finally, we show preliminary results on the effects of steady shear flow on the kinetics of collapse.Comment: 9 pages, 8 figure

Microservice Transition and its Granularity Problem: A Systematic Mapping Study

Microservices have gained wide recognition and acceptance in software industries as an emerging architectural style for autonomic, scalable, and more reliable computing. The transition to microservices has been highly motivated by the need for better alignment of technical design decisions with improving value potentials of architectures. Despite microservices' popularity, research still lacks disciplined understanding of transition and consensus on the principles and activities underlying "micro-ing" architectures. In this paper, we report on a systematic mapping study that consolidates various views, approaches and activities that commonly assist in the transition to microservices. The study aims to provide a better understanding of the transition; it also contributes a working definition of the transition and technical activities underlying it. We term the transition and technical activities leading to microservice architectures as microservitization. We then shed light on a fundamental problem of microservitization: microservice granularity and reasoning about its adaptation as first-class entities. This study reviews state-of-the-art and -practice related to reasoning about microservice granularity; it reviews modelling approaches, aspects considered, guidelines and processes used to reason about microservice granularity. This study identifies opportunities for future research and development related to reasoning about microservice granularity.Comment: 36 pages including references, 6 figures, and 3 table