Faculty members

Gianlorenzo D’Angelo

Gianlorenzo D’Angelo

Dr. Gianlorenzo D’Angelo obtained his B.Sc., M.Sc. and Ph.D. from the University of L’Aquila, Italy in 2004, 2006 and 2010, respectively. Before joining GSSI, where he is currently assistant professor (tenure track), he has been a post-doc at the University of L’Aquila, at INRIA Sophia-Antipolis (France), at the University of Perugia (Italy), and at the University of Pisa (Italy). He is (co-)author of more than 80 papers in international journals and peer-reviewed conference proceedings.

In 2016 he received the annual EATCS award for the best Italian young researcher in theoretical computer science.

His research interests include combinatorial algorithms, computational complexity, combinatorial optimization, scheduling, network analysis, distributed computing, and algorithm engineering.

Gianlorenzo’s homepage

Catia Trubiani

Catia Trubiani

Catia is Junior Assistant Professor at the Gran Sasso Science Institute (GSSI), L’Aquila, Italy, since November 2017. She received the Ph.D. in Computer Science at the University of L’Aquila in April 2011 with a dissertation on the automated generation of architectural feedback from software performance analysis results. During the Ph.D. program she collaborated with the Imperial College of London and the Karlsruhe Institute of Technology. She received the Best Research Paper Award at European Conference on Software Architectures (conference rank A in the core classification) in 2015, the Microsoft Azure Research Award in 2014, and the Best Research Paper Award at International Conference on Performance Engineering in 2011. Her main research interests include the quantitative modelling and analysis of interacting heterogeneous distributed systems. More information is available here: https://cs.gssi.it/catia.trubiani

Michele Flammini

Michele Flammini

I am a full professor at the Department of Information Engineering, Computer Science, and Mathematics of the University of L’Aquila and Full professor at the GSSI.
My research interests include algorithms and computational complexity, game theory, communication problems in interconnection networks, routing. 
Luca Aceto

Luca Aceto

Luca Aceto’s Contact Information
School of Computer Science
Reykjavik University
Menntavegur 1
IS-101 Reykjavik

Work place: Venus (Third floor)
Email : luca AT ru.is AND luca.aceto AT gmail.com 

Skype : luca_aceto  
PHONE : +354  599 6200 (Switchboard) To be used only for very urgent matters
PHONE : +354  599 6419 (Direct) To be used only for very urgent matters
FAX   : +354  599 6301

Hot links

Member of the Informatics Section of Academia Europaea (the Academy of Europe)President of the European Association for Theoretical Computer Science (July 2012-July 2016)The power of logic. This is the video of a six-minute talk for a general public I delivered at the Reykjavik University Lecture Marathon on 28 March 2014.Pearls of Computation seminar series at Reykjavik University.Process Algebra Diary (my professional blog).


I am a full professor at the School of Computer Science, Reykjavik University. Information on the positions I have held previously may be found in my curriculum vitae.


Semantics of concurrency, with emphasis on the study of algebraic process description languages and on the techniques they support to specify and reason about reactive systems. Logic in Computer Science. Applications of equational logic in Computer Science, with special focus on process algebras, formal languages, automata, tropical semirings, min-max algebras and the theory of fixed points. Structural Operational Semantics. Computational complexity of verification problems and of problems in bioinformatics.

Work Related Links


Some Photos

Ludovico Iovino

Ludovico Iovino

I am Ph.D. in Computer Science, assistant professor at the  GSSI – Gran Sasso Science Institute in L’Aquila in the Computer Science department. The GSSI is an international PhD school and a center for advanced studies in physics, mathematics, computer science and social sciences, it has been instituted as a new Italian graduate school of advanced studies in 2016, after a three-years succesful experimental period.

My interests include Model Driven Engineering (MDE), Model Transformations, Metamodel Evolution, code generation and software quality evaluation. Currently I am working on model-based artifacts and issues related to the metamodel evolution problem. I worked on model to code generation but also traditional code-centric development methods. I’ve been included in the program commitees of numerous conferences and in the local organisation of the STAF conference 2015 in L’Aquila. I’m involved in different academic projects about Model Repositories, model migration tools and Eclipse Plugins.

Projects i’m in involved in:

 MDE Forge platform consists of a number of services that can be used by means of both a Web access and programmatic interfaces (API) that enable their adoption as software as a service.In particular, core services are provided to enable the management of modeling artifacts, namely transformations, models, metamodels, and editors.Atop of such core services, extensions can be developed to add new functionalities.

 is a multi-artefact migration tool for dealing with metamodel coupled evolution. The tool is under development and it will be able to adapt corrupted artifacts after metamodel changes.

 This website has the purpose to collect which kinds of changes could be applied on metamodels. We’re developing a catalog of refactorings and we’ll insert diagrams to depict the metamodel excerpt before and after the refactoring. For clarity the meta-metamodeling context used in this approach is Ecore(EMF).



Ruben Becker

Ruben Becker

I am a Postdoctoral Researcher at the Gran Sasso Science Institute since October, 2018. Before that I have been a PhD-student in the Algorithms and Complexity group of the Max Planck Institute for Informatics.

I am interested in efficient algorithms, optimization, computer algebra, and theoretical computer science in general. I enjoy developing algorithms that are promising to be of practical impact, i.e., algorithms that solve problems that appear in the real-world and algorithms whose design allows for efficient implementation. This also includes algorithms that can be implemented in parallel and distributed models of computation. My current research can be grouped into the following three categories.

• Network Optimization: I am considering different network optimization problems such as the min-cost flow problem, the transshipment problem, the single source shortest path problem, and other even more general classes of optimization problems.
• Polynomial Equation Solving: Here, I am concerned with solving polynomial equations, both in the uni-variate as well as in the multi-variate case. These are fundamental computational problems with a huge set of applications in different scientific disciplines.
• Optimization in Other Disciplines: I am interested in optimization problems that appear in different subfields of computing. So far, I have worked on problems appearing in verification and data mining.

A common underlying theme of a large part of my work is the combination of continuous, or numerical, methods with combinatorial and algebraic methods for problems from the above categories. Considering these two kinds of methods in combination often allows to profit from the advantages of both paradigms and enables to achieve results that would not be possible if the two technique sets would be considered in isolation.

Clemens Grabmayer

Clemens Grabmayer


Hugo Gilbert

Hugo Gilbert

I am a postdoc at the Gran Sasso Science Institute since October 2018.
Previously, I was a Ph.D. student at University Pierre and Marie Curie in Paris, France.
I studied Computer Science at University Pierre and Marie Curie and at Ecole National Supérieure de Techniques Avancées ParisTech.

My main research topics are algorithmic game theory and computational social choice.
As a PhD student, I have studied the mathematical and algorithmic properties of sophisticated decision criteria in sequential decision problems (represented as decision trees or Markovian decision processes) and multi-agent decision problems (e.g., multi-winner voting problems, marriage problems). These non-standard criteria are motivated by their abilities to better model human behaviors or to account for fairness properties. The study of these criteria have also led me to investigate robust combinatorial optimization problems and incremental elicitation procedures. Recently, I have been more particularly interested in problems that mix algorithmic game theory and computational social choice as the study of possible manipulations in specific matching problems or the study of equilibria in specific dynamic voting procedures.

Omar Inverso

Omar Inverso

Short Biography

I’m a post-doctoral researcher at the Gran Sasso Science Institute.
I was awarded the doctoral degree by the University of Southampton, United Kingdom, in Oct 2015. I worked 6 months as a research fellow in the Electronic and Software Systems research group, school of Electronics and Computer Science and currently I am a visiting fellow there.

Research Interests (program analysis, program verification, bounded model-checking, automated bug finding, concurrency)

Developing techniques and tools for automated program analysis aimed at improving the overall quality and reliability of real-world software systems, with a particular emphasis on large, complex, and concurrent or distributed instances.

Publications (DBLP)

C. Enea, P. Habermehl, O. Inverso, G. Parlato: On the path-width of integer linear programming. Inf. Comput. (2017)
R. De Nicola, T. Duong, O. Inverso, F. Mazzanti: Verifying Properties of Systems Relying on Attribute-Based Communication.ModelEd, TestEd, TrustEd 2017
R. De Nicola, T. Duong, O. Inverso, C. Trubiani:AErlang: Empowering Erlang with Attribute-Based Communication.COORDINATION 2017
T. L. Nguyen, O. Inverso, B. Fischer, S. La Torre, G. Parlato:Lazy-CSeq 2.0: Combining Lazy Sequentialization with Abstract Interpretation – (Competition Contribution). TACAS (2) 2017
E. Tomasco, T. L. Nguyen, O. Inverso, B. Fischer, S. La Torre, G. Parlato:
Lazy sequentialization for TSO and PSO via shared memory abstractions. FMCAD 2016
O. Inverso, T. L. Nguyen, B. Fischer, S. La Torre, G. Parlato: Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs. ASE 2015
E. Tomasco, O. Inverso, B. Fischer, S. La Torre, G. Parlato: MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings – (Competition Contribution). TACAS 2015
E. Tomasco, O. Inverso, B. Fischer, S. La Torre, G. Parlato: Verifying Concurrent Programs by Memory Unwinding. TACAS 2015
O. Inverso, E. Tomasco, B. Fischer, S. La Torre, G. Parlato: Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization. CAV 2014
O. Inverso, E. Tomasco, B. Fischer, S. La Torre, G. Parlato: Lazy-CSeq: A Lazy Sequentialization Tool for C – (Competition Contribution). TACAS 2014
E. Tomasco, O. Inverso, B. Fischer, S. La Torre, G. Parlato: MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings – (Competition Contribution). TACAS 2014
C. Enea, P. Habermehl, O. Inverso, G. Parlato: On the Path-Width of Integer Linear Programming. GandALF 2014
B. Fischer, O. Inverso, G. Parlato: CSeq: A concurrency pre-processor for sequential C verification tools. ASE 2013
B. Fischer, O. Inverso, G. Parlato: CSeq: A Sequentialization Tool for C – (Competition Contribution). TACAS 2013


SV-COMP’18, SV-COMP’17, SV-COMP’16, Intl. Competition on Software Verification held at TACAS.


CSeq: a flexible framework for analysis of shared-memory multi-threaded C programs


SV-COMP’17 Silver and Bronze medals in Concurrency category
SV-COMP’16 Gold and Silver medals in Concurrency category
SV-COMP’15 Gold and Silver medals in Concurrency category
SV-COMP’14 Gold and Silver medals in Concurrency category
SV-COMP’13 Silver medal in Concurrency category

Contact Information