Christian Colombo

Dr. Christian Colombo

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2009
Verified
Conference Paper
Closed access
CCChristian Colombo
Christian Colombo
GPGordon J. Pace
Gordon J. Pace
GSGerardo Schneider
Gerardo Schneider
The use of runtime verification, as a lightweight approach to guarantee properties of systems, has been increasingly employed on real-life software. In this paper, we present the tool LARVA, for the runtime verification of properties of Java programs, including real-time properties. Properties can be expressed in a number of notations, including timed-automata enriched with stopwatches, Lustre, and a subset of the duration calculus. The tool has been successfully used on a number of case-studies, including an industrial system handling financial transactions. LARVA also performs analysis of real-time properties, to calculate, if possible, an upper-bound on the memory and temporal overheads induced by monitoring. Moreover, through property analysis, LARVA assesses the impact of slowing down the system through monitoring, on the satisfaction of the properties.

11 November 2019 in Formal Methods in System Design
Verified
Journal Article
Open access
PDF file
CSCésar Sánchez
César Sánchez
GSGerardo Schneider
Gerardo Schneider
WAWolfgang Ahrendt
Wolfgang Ahrendt
Ezio BartocciEzio Bartocci
Ezio Bartocci
DBDomenico Bianculli
Domenico Bianculli
AWAlexander Weiss
Alexander Weiss
Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor. Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.

1 January 2009
Verified
Book Chapter
Closed access
PDF file
CCChristian Colombo
Christian Colombo
GPGordon J. Pace
Gordon J. Pace
GSGerardo Schneider
Gerardo Schneider

7 April 2017 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Open access
PDF file
Ezio BartocciEzio Bartocci
Ezio Bartocci
YFYliès Falcone
Yliès Falcone
BBBorzoo Bonakdarpour
Borzoo Bonakdarpour
CCChristian Colombo
Christian Colombo
NDNormann Decker
Normann Decker
YZYi Zhang
Yi Zhang
The first international Competition on Runtime Verification (CRV) was held in September 2014, in Toronto, Canada, as a satellite event of the 14th international conference on Runtime Verification (RV’14). The event was organized in three tracks: (1) offline monitoring, (2) online monitoring of C programs, and (3) online monitoring of Java programs. In this paper, we report on the phases and rules, a description of the participating teams and their submitted benchmark, the (full) results, as well as the lessons learned from the competition.

11 May 2016 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
CCChristian Colombo
Christian Colombo
YFYliès Falcone
Yliès Falcone

8 March 2012 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
CCChristian Colombo
Christian Colombo
GPGordon J. Pace
Gordon J. Pace
PAPatrick Abela
Patrick Abela