Larisa Safina

dblp:172/1245 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-4490-7451ORCID · corroborated

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

Software engineering, systems software and programming languages · 3 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 1
YearPublicationVenuePosition
2026 Hyalinos: From Type Inference to Community Knowledge
abstract
We present Hyalinos, a transparent type discovery framework for Pharo that combines HYPHE for multi-source type inference with Mycelium as an open type knowledge storage. HYPHE integrates several existing tools for type inference, type heuristics, results from offline test profiling, and then merges them using one of available reconciliation strategies. Mycelium stores collected types in a GitHub repository, enabling community-wide type knowledge sharing and synchronises with a local type storage. The bundle integrates seamlessly into Pharo IDE, providing existing type information during coding and methods investigation. Hyalinos is an open-source tool available on https://github.com/hyalinos.
Larisa Safina
ICPC1
2023 JavaBIP meets VerCors: Towards the Safety of Concurrent Software Systems in Java
abstract
Abstract We present “Verified JavaBIP”, a tool set for the verification of JavaBIP models. A JavaBIP model is a Java program where classes are considered as components, their behaviour described by finite state machine and synchronization annotations. While JavaBIP guarantees execution progresses according to the indicated state machines, it does not guarantee properties of the data exchanged between components. It also does not provide verification support to check whether the behaviour of the resulting concurrent program is as (safe as) expected. This paper addresses this by extending the JavaBIP engine with run-time verification support, and by extending the program verifier VerCors to verify JavaBIP models deductively. These two techniques complement each other: feedback from run-time verification allows quicker prototyping of contracts, and deductive verification can reduce the overhead of run-time verification. We demonstrate our approach on the “Solidity Casino” case study, known from the VerifyThis Collaborative Long Term Challenge.
Simon Bliudze, Petra van den Bos, Marieke Huisman, Robert Rubbens, Larisa Safina
FASE5
2023 Parsing Fortran-77 with proprietary extensions
abstract
Far from the latest innovations in software development, many organizations still rely on old code written in "obsolete" programming languages. Because this source code is old and proven it often contributes significantly to the continuing success of these organizations. Yet to keep the applications relevant and running in an evolving environment, they sometimes need to be updated or migrated to new languages or new platforms. One difficulty of working with these "veteran languages" is being able to parse the source code to build a representation of it. Parsing can also allow modern software development tools and IDEs to offer better support to these veteran languages. We initiated a project between our group and the Framatome company to help migrate old Fortran-77 with proprietary extensions (called Esope) into more modern Fortran. In this paper, we explain how we parsed the Esope language with a combination of island grammar and regular parser to build an abstract syntax tree of the code.
Younoussa Sow, Larisa Safina, Léandre Brault, Papa Ibou Diouf, Stéphane Ducasse, Nicolas Anquetil
ICSME2
2016 Data-Driven Workflows for Microservices: Genericity in Jolie
abstract
Microservices is an architectural style inspired by service-oriented computing that has recently started gainingpopularity. Jolie is a programming language based on the microservices paradigm: the main building block of Jolie systems are services, in contrast to, e.g., functions or objects. The primitives offered by the Jolie language elicit many of the recurring patterns found in microservices, like load balancers and structured processes. However, Jolie still lacks some useful constructs for dealing with message types and data manipulation that are present in service-oriented computing. In this paper, we focus on the possibility of expressing choices at the level of data types, a feature well represented in standards for Web Services, e.g., WSDL. We extend Jolie to support such type choices, and enable Jolie processes to act on data generically (without knowing which type it has in the choice). We show the impact of our implementation on some of the typical scenarios found in microservice systems. This shows how computation can move from a process-driven to a data-driven approach, and leads to the preliminary identification of recurring communication patterns that can be shaped as design patterns.
Larisa Safina, Manuel Mazzara, Fabrizio Montesi, Victor Rivera
AINA1
2016 Robot Dream
Alexander Tchitchigin, Max Talanov, Larisa Safina, Manuel Mazzara
KES-AMSTA3