Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Miguel Alexandre Ferreira

dblp:15/7512 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification
model checking
0.212013
Alloy Meets the Algebra of Programming: A Case Study · IEEE Trans. Software Eng. 2013
Program verification › refinement
refinement proof
0.212013
Alloy Meets the Algebra of Programming: A Case Study · IEEE Trans. Software Eng. 2013

Methods — techniques the papers use, named apart from their topics

relational algebra · 0.2alloy · 0.2
YearPublicationVenuePosition
2013 Alloy Meets the Algebra of Programming: A Case Study
abstract
Relational algebra offers to software engineering the same degree of conciseness and calculational power as linear algebra in other engineering disciplines. Binary relations play the role of matrices with similar emphasis on multiplication and transposition. This matches with Alloy's lemma “everything is a relation” and with the relational basis of the Algebra of Programming (AoP). Altogether, it provides a simple and coherent approach to checking and calculating programs from abstract models. In this paper, we put Alloy and the Algebra of Programming together in a case study originating from the Verifiable File System mini-challenge put forward by Joshi and Holzmann: verifying the refinement of an abstract file store model into a journaled (Flash) data model catering to wear leveling and recovery from power loss. Our approach relies on diagrams to graphically express typed assertions. It interweaves model checking (in Alloy) with calculational proofs in a way which offers the best of both worlds. This provides ample evidence of the positive impact in software verification of Alloy's focus on relations, complemented by induction-free proofs about data structures such as stores and lists.
José N. Oliveira, Miguel Alexandre Ferreira
IEEE Trans. Software Eng.2
2012 Faster issue resolution with higher technical quality of software
Dennis Bijlsma, Miguel Alexandre Ferreira, Bart Luijten, Joost Visser 0001
Softw. Qual. J.2
2011 Measuring maintainability of spreadsheets in the wild
abstract
Several studies have shown how spreadsheets are pervasive in many organizations as a form of end-user programming. Despite their importance and long lifespan, they are seldom developed with maintenance concerns in mind, and organizations have no efficient way of estimating the risk they present. In this paper we take a first step towards automated assessment of spreadsheet maintainability. We use the Goal Question Metric approach to select metrics relevant for maintainability and apply the selected metrics to a spreadsheet corpus in order to study their behavior "in the wild". We observe that the majority of the metrics behave in the same way as similar ones for traditional software systems, which means that existing methodologies to assess maintainability can be applied to spreadsheets as well. This opens the possibility of creating instruments for organizations that rely on spreadsheets to start actively managing their maintainability.
José Pedro Correia, Miguel Alexandre Ferreira
ICSM2