Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs

Component identification through program slicing

This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic code. An associated tool is also introduced. This piece of research is part of a broader project on program understanding and re-engineering of legacy code supported by formal methods

COORDINSPECTOR: a tool for extracting coordination data from legacy code

More and more current software systems rely on non trivial coordination logic for combining autonomous services typically running on different platforms and often owned by different organizations. Often, however, coordination data is deeply entangled in the code and, therefore, difficult to isolate and analyse separately. COORDINSPECTOR is a software tool which combines slicing and program analysis techniques to isolate all coordination elements from the source code of an existing application. Such a reverse engineering process provides a clear view of the actually invoked services as well as of the orchestration patterns which bind them together. The tool analyses Common Intermediate Language (CIL) code, the native language of Microsoft .Net Framework. Therefore, the scope of application of COORDINSPECTOR is quite large: potentially any piece of code developed in any of the programming languages which compiles to the .Net Framework. The tool generates graphical representations of the coordination layer together and identifies the underlying business process orchestrations, rendering them as Orc specifications

Extracting and verifying coordination models from source code

Current software development relies increasingly on non-trivial coordination logic for com- bining autonomous services often running on di erent platforms. As a rule, however, in typical non-trivial software systems, such a coordination layer is strongly weaved within the application at source code level. Therefore, its precise identi cation becomes a major methodological (and technical) problem which cannot be overestimated along any program understanding or refactoring process. Open access to source code, as granted in OSS certi cation, provides an opportunity for the devel- opment of methods and technologies to extract, from source code, the relevant coordination information. This paper is a step in this direction, combining a number of program analysis techniques to automatically recover coordination information from legacy code. Such information is then expressed as a model in Orc, a general purpose orchestration language

Improving Remote Voting Security with Code Voting

One of the major problems that prevents the spread of elections with the possibility of remote voting over electronic networks, also called Internet Voting, is the use of unreliable client platforms, such as the voter's computer and the Internet infrastructure connecting it to the election server. A computer connected to the Internet is exposed to viruses, worms, Trojans, spyware, malware and other threats that can compromise the election's integrity. For instance, it is possible to write a virus that changes the voter's vote to a predetermined vote on election's day. Another possible attack is the creation of a fake election web site where the voter uses a malicious vote program on the web site that manipulates the voter's vote (phishing/pharming attack). Such attacks may not disturb the election protocol, therefore can remain undetected in the eyes of the election auditors. We propose the use of Code Voting to overcome insecurity of the client platform. Code Voting consists in creating a secure communication channel to communicate the voter's vote between the voter and a trusted component attached to the voter's computer. Consequently, no one controlling the voter's computer can change the his/her's vote. The trusted component can then process the vote according to a cryptographic voting protocol to enable cryptographic verification at the server's side.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Service-oriented mobility of java code in web services-based architectures

Dissertação apresentada na Faculdade de Ciências e Tecnologias da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática

EFFECT – Efficient finite element code

The theme of this dissertation is the finite element method applied to mechanical structures. A new finite element program is developed that, besides executing different types of structural analysis, also allows the calculation of the derivatives of structural performances using the continuum method of design sensitivities analysis, with the purpose of allowing, in combination with the mathematical programming algorithms found in the commercial software MATLAB, to solve structural optimization problems. The program is called EFFECT – Efficient Finite Element Code. The object-oriented programming paradigm and specifically the C ++ programming language are used for program development. The main objective of this dissertation is to design EFFECT so that it can constitute, in this stage of development, the foundation for a program with analysis capacities similar to other open source finite element programs. In this first stage, 6 elements are implemented for linear analysis: 2-dimensional truss (Truss2D), 3-dimensional truss (Truss3D), 2-dimensional beam (Beam2D), 3-dimensional beam (Beam3D), triangular shell element (Shell3Node) and quadrilateral shell element (Shell4Node). The shell elements combine two distinct elements, one for simulating the membrane behavior and the other to simulate the plate bending behavior. The non-linear analysis capability is also developed, combining the corotational formulation with the Newton-Raphson iterative method, but at this stage is only avaiable to solve problems modeled with Beam2D elements subject to large displacements and rotations, called nonlinear geometric problems. The design sensitivity analysis capability is implemented in two elements, Truss2D and Beam2D, where are included the procedures and the analytic expressions for calculating derivatives of displacements, stress and volume performances with respect to 5 different design variables types. Finally, a set of test examples were created to validate the accuracy and consistency of the result obtained from EFFECT, by comparing them with results published in the literature or obtained with the ANSYS commercial finite element code.

Ontology-based representation and generation of workflows for micro-task human-machine computation

Doctoral Program in Computer Science

Automatic generation of ETL physical systems from BPMN conceptual models

ETL conceptual modeling is a very important activity in any data warehousing system project implementation. Owning a high-level system representation allowing for a clear identification of the main parts of a data warehousing system is clearly a great advantage, especially in early stages of design and development. However, the effort to model conceptually an ETL system rarely is properly rewarded. Translating ETL conceptual models directly into something that saves work and time on the concrete implementation of the system process it would be, in fact, a great help. In this paper we present and discuss a hybrid approach to this problem, combining the simplicity of interpretation and power of expression of BPMN on ETL systems conceptualization with the use of ETL patterns to produce automatically an ETL skeleton, a first prototype system, which has the ability to be executed in a commercial ETL tool like Kettle.

Quantifying, generating and mitigating radio interference in Low-Power Wireless Networks

Doctoral Programme in Telecommunication - MAP-tele

A study of risk-aware program transformation

In the trend towards tolerating hardware unreliability, accuracy is exchanged for cost savings. Running on less reliable machines, functionally correct code becomes risky and one needs to know how risk propagates so as to mitigate it. Risk estimation, however, seems to live outside the average programmer’s technical competence and core practice. In this paper we propose that program design by source-to-source transformation be risk-aware in the sense of making probabilistic faults visible and supporting equational reasoning on the probabilistic behaviour of programs caused by faults. This reasoning is carried out in a linear algebra extension to the standard, `a la Bird-Moor algebra of programming. This paper studies, in particular, the propagation of faults across standard program transformation techniques known as tupling and fusion, enabling the fault of the whole to be expressed in terms of the faults of its parts.

A novel hanging spherical drop system for the generation of cellular spheroids and high throughput combinatorial drug screening

We propose a novel hanging spherical drop system for anchoring arrays of droplets of cell suspension based on the use of biomimetic superhydrophobic flat substrates, with controlled positional adhesion and minimum contact with a solid substrate. By facing down the platform, it was possible to generate independent spheroid bodies in a high throughput manner, in order to mimic in vivo tumour models on the lab-on-chip scale. To validate this system for drug screening purposes, the toxicity of the anti-cancer drug doxorubicin in cell spheroids was tested and compared to cells in 2D culture. The advantages presented by this platform, such as feasibility of the system and the ability to control the size uniformity of the spheroid, emphasize its potential to be used as a new low cost toolbox for high-throughput drug screening and in cell or tissue engineering.

Role of ATH5 in the specification of retinal ganglion cells and expression and cell compartmentalization of EFEMP1, a protein associated with Malattia Leventinese

ABSTRACT : The development of the retina is a very complex process, occurring through the progressive restriction of cell fates, from pluripotent cell populations to complex tissues and organs. In all vertebrate species analyzed so far, retinal differentiation starts with the generation of retinal ganglion cells (RGC)s. One of the documented key essential events in the specification of RGCs is the expression of ATHS, an atonal homolog encoding a bHLH transcription factor. Despite the putative role of master regulator of RGC differentiation, the mechanism of integrating its functions into a coherent program underlying the production of this subclass of retinal neurons has not yet been elucidated. By using chromatin immunoprecipitation combined with microarray (ChIP-on-chip) we have screened for ATH5 direct targets in the developing chick retina at two consecutive periods: E3.5 (stage HH22) and E6 (stage HH30), covering the stages of progenitor proliferation, neuroepithelium patterning, RGC specification, cell cycle exit and early neuronal differentiation. In parallel, complementary analysis with Affymetrix expression microarrays was conducted. We compared RGCs versus retina to see if the targets correspond to genes preferentially expressed in RGCs. We also precociously overexpressed ATH5 in the retina of individual embryo, and contralateral retina vas used as a control. Our integrated approach allowed us to establish a compendium of ATH5-targets and enabled us to position ATH5 in the transcription network underlying neurogenesis in the retina. Malattia Leventinese (ML) is an autosomal, dominant retinal dystrophy characterized by extracellular, amorphous deposits known as drusen, between the retinal pigment epithelium (RPE) and Bruch's membrane. On the genetic level, it has been associated with a single missense mutation (R345W) in a widely expressed gene with unknown function called EFEMP1. We determined expression patterns of the EFEMP1 gene in normal and ML human retinas. Our data shown that the upregulation of EFEMP1 is not specific to ML eye, except for the region of the ciliary body. We also analyzed the cell compartmentalization of different versions of the protein (both wild type and mutant). Our studies indicate that both abnormal expression of the EFEMP1 gene and mutation and accumulation of EFEMP 1 protein (inside or outside the cells) might contribute to the ML pathology. Résumé : 1er partie : L'ontogenèse de la rétine est un processus complexe au cours duquel des cellules progénitrices sont engagée, par vagues successives, dans des lignées où elles vont d'abord être déterminées puis vont se différencier pour finalement construire un tissu rétinien composé de cinq classes de neurones (les photorécepteurs, les cellules horizontales, bipolaires, amacrines et ganglionnaires) et d'une seule de cellules gliales (les cellules de Muller). Chez tous les vertébrés, la neurogenèse rétinienne est d'abord marquée par la production des cellules ganglionnaires (RGCs). La production de cette classe de neurone est liée à l'expression du gène ATH5 qui est un homologue du gène atonal chez la Drosophile et qui code pour un facteur de transcription de la famille des protéines basic Helix-Loop-Helix (bHLH). Malgré le rôle central que joue ATH5 dans la production des RGCs, le mécanisme qui intègre la fonction de cette protéine dans le programme de détermination neuronale et ceci en relation avec le développement de la rétine n'est pas encore élucidé. Grâce à une technologie qui permet de combiner la sélection de fragments de chromatine liant ATH5 et la recherche de séquences grâce à des puces d'ADN non-codants (ChIP-on-chip), nous avons recherché des cibles potentielles de la protéine ATH5 dans la rétine en développement. Nous avons conduit cette recherche à deux stades de développement de manière à englober la phase de prolifération cellulaire, la détermination des RGCs, la sortie du cycle cellulaire ainsi que les premières étapes de la différentiation de ces neurones. Des expériences complémentaires nous ont permis de définir les patrons d'expression des gènes sélectionnés ainsi que l'activité promotrice des éléments de régulation identifiés lors de notre criblage. Ces approches expérimentales diverses et complémentaires nous ont permis de répertorier des gènes cibles de la protéine ATH5 et d'établir ainsi des liens fonctionnels entre des voies métaboliques dont nous ne soupçonnions pas jusqu'alors qu'elles puissent être associées à la production d'une classe de neurones centraux. 2ème partie : Malattia Leventinese (ML) est une maladie génétique qui engendre une dystrophie de la rétine. Elle se caractérise par l'accumulation de dépôt amorphe entre l'épithélium pigmentaire et la membrane de Bruch et connu sous le nom de drusen. Cette maladie est liée à une simple mutation non-sens (R345W) dans un gène dénommé EFEMP1 qui est exprimé dans de nombreux tissus mais dont la fonction reste mal définie. Une étude détaillée de l'expression de ce gène dans des rétines humaines a révélé une expression à un niveau élevé du gène EFEMP1 dans divers tissus de l'oeil ML mais également dans des yeux contrôles. Alors que l'accumulation d'ARN messager EFEMP1 dans les cellules de l'épithélium pigmentaire n'est pas spécifique à ML, l'expression de ce gène dans le corps cilié n'a été observée que dans l'oeil ML. Nous avons également comparé la sécrétion de la protéine sauvage avec celle porteuse de la mutation. En résumé, notre étude révèle que le niveau élevé d'expression du gène EFEMP1 ainsi que l'accumulation de la protéine dans certains compartiments cellulaires pourraient contribuer au développement de pathologies rétiniennes liées à ML.

Targeted Small Business Program Report, 2008

Targeted Small Business (TSB) compliance is authorized by Iowa Code Chapter 19B.7. Iowa Code Chapters 73.16-73.19 requires the establishment of TSB procurement provisions through the Departments of Management, Inspections and Appeals and Economic Development. This report will provide an overview of the State of Iowa’s Targeted Small Business Program and efforts to assure equal opportunity through targeted small business procurement during FY 2007.