Daniela da Cruz

Daniela da Cruz

Auto-generated profile, based on publicly available information

Daniela da Cruz

University of Minho, Portugal

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010 in Computer Science and Information Systems
Verified
Journal Article
Open access
TKTomaz Kosar
Tomaz Kosar
NONuno Oliveira
Nuno Oliveira
MMMarjan Mernik
Marjan Mernik
MPMaria João Varanda Pereira
Maria João Varanda Pereira
MCMatej Crepinsek
Matej Crepinsek
PHPedro Rangel Henriques
Pedro Rangel Henriques
Many domain-specific languages, that try to bring feasible alternatives for existing solutions while simplifying programming work, have come up in recent years. Although, these little languages seem to be easy to use, there is an open issue whether they bring advantages in comparison to the application libraries, which are the most commonly used implementation approach. In this work, we present an experiment, which was carried out to compare such a domain-specific language with a comparable application library. The experiment was conducted with 36 programmers, who have answered a questionnaire on both implementation approaches. The questionnaire is more than 100 pages long. For a domain-specific language and the application library, the same problem domain has been used - construction of graphical user interfaces. In terms of a domain-specific language, XAML has been used and C# Forms for the application library. A cognitive dimension framework has been used for a comparison between XAML and C# Forms.

1 January 2008 in Computer Science and Information Systems
Verified
Journal Article
Open access
MPMaria João Varanda Pereira
Maria João Varanda Pereira
MMMarjan Mernik
Marjan Mernik
CDCruz da
Cruz da
PHPedro Rangel Henriques
Pedro Rangel Henriques
In the past, we have been looking for program comprehension tools that are able to interconnect operational and behavioral views, aiming at aiding the software analyst to relate problem and program domains in order to reach a full understanding of software systems. In this paper we are concerned with Program Comprehension issues applied to Domain Specific Languages (DSLs). We are now willing to understand how techniques and tools for the comprehension of traditional programming languages fit in the understanding of DSLs. Being the language tailored for the description of problems in a specific domain, we believe that specific visualizations (at a higher abstraction level, closer to the problem level) could and should be defined to enhance the comprehension of the descriptions in that particular domain. .

23 September 2011 in Formal Aspects of Computing
Verified
Journal Article
Open access
PDF file
JBJosé Bernardo Barros
José Bernardo Barros
DCDaniela da Cruz
Daniela da Cruz
PHPedro Rangel Henriques
Pedro Rangel Henriques
JPJorge Sousa Pinto
Jorge Sousa Pinto
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than using criteria based on control/data dependencies. We show how the forward propagation of preconditions and the backward propagation of postconditions can be combined in a new slicing algorithm that is more precise than the existing specification-based algorithms. The algorithm is based on (a) a precise test for removable statements, and (b) the construction of aslice graph, a program control flow graph extended with semantic labels and additional edges that “short-circuit” removable commands. It improves on previous approaches in two aspects: it does not fail to identify removable commands; and it produces the smallest possible slice that can be obtained (in a sense that will be made precise). Iteration is handled through the use of loop invariants and variants to ensure termination. The paper also discusses in detail applications of these forms of slicing, including the elimination of (conditionally) unreachable and dead code, and compares them to other related notions.

1 October 2012
Verified
Conference Paper
Closed access
JFJose Luis Freitas
Jose Luis Freitas
DCDaniela da Cruz
Daniela da Cruz
PHPedro Rangel Henriques
Pedro Rangel Henriques
Comments are interspersed by the Programmer among code lines, at software development phase, with two main purposes: to help himself during the development phase; to help other programmers later on, during the maintenance phase. The former are memos to help him remembering to do something; they are not useful for those willing to understand code. The latter are explanations about the ideas he has in mind when he wrote the code; they can be a relevant aid for others and should be taken into consideration as a first step in program comprehension. Comments are scattered all over the source code, sometimes wrapping a block of code (placed at the beginning or at its end), other times complementing a single statement. If comments are inserted to help in understanding the programmer ideas, they will contain for sure concepts associated with problem domain In this paper we discuss an approach to locate a relevant code chunk (one where the programmer should focus the attention for software maintenance), using information retrieval techniques to locate problem domain concepts within comments. In our approach, comments are isolated marking their type (inline, block or javadoc comment) and keeping their context (code lines to which they are associated). Picking up concepts from the ontology that describes the problem, it is possible to find all the comments that contain that concept (similar words) and rate them. Reading comments from the retrieved list, the programmer can select those that seem to him meaningful and dive directly into the associated chunk. In the paper, we also survey Comment Analysis techniques and describe an environment, Darius, that aims at automatizing the approach proposed. Moreover, Darius provides functionality to study comments frequency in the source files of a given project, to support the discussion weather it is worthwhile or not to apply this program comprehension step.

1 September 2010
Verified
Conference Paper
Closed access
JBJose Bernardo Barros
Jose Bernardo Barros
DCDaniela da Cruz
Daniela da Cruz
PHPedro Rangel Henriques
Pedro Rangel Henriques
JPJorge Sousa Pinto
Jorge Sousa Pinto
This paper revisits the idea of slicing programs based on their axiomatic semantics, rather than using criteria based on control/data dependencies. We show how the forward propagation of preconditions and the backward propagation of post conditions can be combined in a new slicing algorithm that is more precise than the existing specification-based algorithms. The algorithm is based on (i) a precise test for removable statements, and (ii) the construction of a slice graph, a program control flow graph extended with semantic labels. It improves on previous approaches in two aspects: it does not fail to identify removable commands; and it produces the smallest possible slice that can be obtained (in a sense that will be made precise). The paper also reviews in detail, through examples, the ideas behind the use of preconditions and post conditions for slicing programs.

28 March 2010
Verified
Conference Paper
Open access
PDF file
DCDaniela da Cruz
Daniela da Cruz
PHPedro Rangel Henriques
Pedro Rangel Henriques
JPJorge Sousa Pinto
Jorge Sousa Pinto
In this paper we present the GamaSlicer tool, which is primarily a semantics-based program slicer that also offers formal verification (generation of verification conditions) and program visualization functionality. The tool allows users to obtain slices using a number of different families of slicing algorithms (\precond-based, \postcond-based, and specification-based), from a correct software component annotated with pre and postconditions (contracts written in JML-annotated Java). Each family in turn contains algorithms of different precision (with more precise algorithms being asymptotically slower). A novelty of our work at the theoretical level is the inclusion of a new, much more effective algorithm for specification-based slicing, and in fact other current work at this level is being progressively incorporated in the tool. The tool also generates (in a step-by-step fashion) a set of verification conditions (as formulas written in the SMT-lib language, which enables the use of different automatic SMT provers). This allows to establish the initial correctness of the code with respect to their contracts.Fundação para a Ciência e a Tecnologia (FCT