Abstract

Abstract
Based on the connection between the categorical derivation of classical programs from specifications and a category-theoretic approach to quantum information, this paper contributes to extending the laws of classical program algebra to quantum programming. This aims at building correct-by-construction quantum circuits to be deployed on quantum devices such as those available through the IBM Q Experience. Reversibility is ensured by minimal complements. Such complementation is extended inductively to encompass catamorphisms on lists (vulgo folds), giving rise to the corresponding recursion scheme in reversible computation. The same idea is then applied to the setting of quantum programming, where computation is expressed by unitary transformations. This yields the notion of 'quantamorphism', a structural form of quantum recursion implementing cycles and folds on lists with quantum control flow. By Kleisli correspondence, quantamorphisms can be written as monadic functional programs with quantum parameters. This enables the use of Haskell, a monadic functional programming language, to perform the experimental work. Such calculated quantum programs prepared in Haskell are pushed through Quipper and the Qiskit interface to IBM Q quantum devices. The generated quantum circuits - often quite large - exhibit the predicted behaviour. However, running them on real quantum devices naturally incurs a significant amount of errors. As quantum technology is rapidly evolving, an increase in reliability is likely in the future, allowing for our programs to run more accurately.

Abstract
The work presented in this article is part of ongoing research on the automated assessment of simple web applications. The proposed algorithm compares two interfaces by mapping their elements, using properties to identify those with the same role in both interfaces. The algorithm proceeds in three stages: firstly, it selects the relevant elements from both interfaces; secondly, it refines elements' attributes, excluding some and computing new ones; finally, it matches elements based on attribute similitude. The article includes an experiment to validate the algorithm as an assessment tool. As part of this experiment, a set of experts classified multiple web interfaces. Statistical analysis found a significant correlation between classifications made by the algorithm and those made by experts. The article also discusses the exploitation of the algorithm's output to access both the layout and functionality of a web interface and produce feedback messages in an automated assessment environment, which is planned as future research.

Abstract
In this article, we present solutions to visualize and interact with linked data in historical archives considering three different scenarios: search, individual record view, and creation of relationships. The created solutions were designed using nonfunctional mockups and were based on the CIDOC-CRM model, a model created and applied in the museums community liable to be extended to other cultural heritage institutions, being our solutions an application of this model to archives. A sample of 20 archival professionals was selected to evaluate the elements included in the proposed solutions. The evaluation sessions consisted in structured interviews supported by an introductory video and a survey. The think-aloud protocol was applied during the sessions. We conducted both a quantitative and qualitative analysis to the collected answers. From this analysis, we conclude that the majority of the participants showed great receptivity to the solutions presented and recognized many benefits in the application of linked data. Our contributions also include an exploratory study of some existing linked data systems, giving particular attention to their visualization and interaction modes.

Abstract
This paper proposes the first mutation-based technique for the repair of Alloy 6 first-order temporal logic specifications. This technique was developed with the educational context in mind, in particular, to repair submissions for specification challenges, as allowed, for example, in the Alloy4Fun web-platform. Given an oracle and an incorrect submission, the proposed technique searches for syntactic mutations that lead to a correct specification, using previous counterexamples to quickly prune the search space, thus enabling timely feedback to students. Evaluation shows that, not only is the technique feasible for repairing temporal logic specifications, but also outperforms existing techniques for non-temporal Alloy specifications in the context of educational challenges.

Abstract