Sebastian Uchitel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sebastian Uchitel has a total of 189 co-authors. Here are the top co-authors by number of shared publications:
Jeff Kramer
Imperial College London, UK
37 shared publicationsVictor Braberman
23 shared publicationsJeff Magee
Imperial College London, UK
21 shared publications- Victor Braberman
University of Buenos Aires, Instituto de Ciencias de la Computación, Autonomous City of Buenos Aires, Argentina
14 shared publications Dalal Alrajeh
Imperial College London, UK
13 shared publicationsAlessandra Russo
Imperial College London, UK
12 shared publications
Latest Publications
- Open Access
- 8 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 9-16
Controller Mimicking for On-the-Fly DES Reachability Control
- 8 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 9-16
Open AccessController Mimicking for On-the-Fly DES Reachability Control
- Open Access
- 14 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 70-75
SE Journals in 2036: Looking Back at the Future We Need to Have
- 14 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 70-75
Open AccessSE Journals in 2036: Looking Back at the Future We Need to Have
- Open Access
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 148-161
Reasoning About Hidden Hybrid Assumptions in Assured Temporal Missions
- 13 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 148-161
Open AccessReasoning About Hidden Hybrid Assumptions in Assured Temporal Missions
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (12) , 3204
State of the Journal
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (12) , 3204
State of the Journal
- 27 October 2025
- Published by Springer Nature in Software and Systems Modeling
- p. 1-33
Automated construction of predicate abstractions for smart contract validation
- 27 October 2025
- Published by Springer Nature in Software and Systems Modeling
- p. 1-33
Automated construction of predicate abstractions for smart contract validation
- 18 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (8) , 2211-2212
Relevance of Log Mining and Analytics Papers to IEEE Transactions on Software Engineering
- 18 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (8) , 2211-2212
Relevance of Log Mining and Analytics Papers to IEEE Transactions on Software Engineering
- 1 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (3) , 663-665
50 Years of Transactions on Software Engineering
- 1 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 51 (3) , 663-665
50 Years of Transactions on Software Engineering
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 50 (11) , 2709-2711
Scoping Software Engineering for AI: The TSE Perspective
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 50 (11) , 2709-2711
Scoping Software Engineering for AI: The TSE Perspective
- Open Access
- 12 July 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 1 (FSE) , 450-472
Abstraction-Aware Inference of Metamorphic Relations
Metamorphic testing is a valuable technique that helps in dealing with the oracle problem. It involves testing software against specifications of its intended behavior given in terms of so called metamorphic relations , statements that express properties relating different software elements (e.g., different inputs, methods, etc). The effective application of metamorphic testing strongly depends on identifying suitable domain-specific metamorphic relations, a challenging task, that is typically manually performed. This paper introduces MemoRIA , a novel approach that aims at automatically identifying metamorphic relations. The technique focuses on a particular kind of metamorphic relation, which asserts equivalences between methods and method sequences. MemoRIA works by first generating an object-protocol abstraction of the software being tested, then using fuzzing to produce candidate relations from the abstraction, and finally validating the candidate relations through run-time analysis. A SAT-based analysis is used to eliminate redundant relations, resulting in a concise set of metamorphic relations for the software under test. We evaluate our technique on a benchmark consisting of 22 Java subjects taken from the literature, and compare MemoRIA with the metamorphic relation inference technique SBES. Our results show that by incorporating the object protocol abstraction information, MemoRIA is able to more effectively infer meaningful metamorphic relations, that are also more precise, compared to SBES, measured in terms of mutation analysis. Also, the SAT-based reduction allows us to significantly reduce the number of reported metamorphic relations, while in general having a small impact in the bug finding ability of the corresponding obtained relations. CCS Concepts: • Theory of computation → Program specifications ; • Software and its engineering → Software testing and debugging ; Dynamic analysis .
- 12 July 2024
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 1 (FSE) , 450-472
Open AccessAbstraction-Aware Inference of Metamorphic Relations
Metamorphic testing is a valuable technique that helps in dealing with the oracle problem. It involves testing software against specifications of its intended behavior given in terms of so called metamorphic relations , statements that express properties relating different software elements (e.g., different inputs, methods, etc). The effective application of metamorphic testing strongly depends on identifying suitable domain-specific metamorphic relations, a challenging task, that is typically manually performed. This paper introduces MemoRIA , a novel approach that aims at automatically identifying metamorphic relations. The technique focuses on a particular kind of metamorphic relation, which asserts equivalences between methods and method sequences. MemoRIA works by first generating an object-protocol abstraction of the software being tested, then using fuzzing to produce candidate relations from the abstraction, and finally validating the candidate relations through run-time analysis. A SAT-based analysis is used to eliminate redundant relations, resulting in a concise set of metamorphic relations for the software under test. We evaluate our technique on a benchmark consisting of 22 Java subjects taken from the literature, and compare MemoRIA with the metamorphic relation inference technique SBES. Our results show that by incorporating the object protocol abstraction information, MemoRIA is able to more effectively infer meaningful metamorphic relations, that are also more precise, compared to SBES, measured in terms of mutation analysis. Also, the SAT-based reduction allows us to significantly reduce the number of reported metamorphic relations, while in general having a small impact in the bug finding ability of the corresponding obtained relations. CCS Concepts: • Theory of computation → Program specifications ; • Software and its engineering → Software testing and debugging ; Dynamic analysis .