Luca Aceto

Luca Aceto

Auto-generated profile, based on publicly available information

Luca Aceto

Reykjavik University

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
24 March 2017 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
AFAdrian Francalanza
Adrian Francalanza
LALuca Aceto
Luca Aceto
AIAnna Ingolfsdottir
Anna Ingolfsdottir

23 August 2017 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
ICIan Cassar
Ian Cassar
AFAdrian Francalanza
Adrian Francalanza
LALuca Aceto
Luca Aceto
AIAnna Ingólfsdóttir
Anna Ingólfsdóttir
Runtime Monitoring is a lightweight and dynamic verification technique that involves observing the internal operations of a software system and/or its interactions with other external entities, with the aim of determining whether the system satisfies or violates a correctness specification. Compilation techniques employed in Runtime Monitoring tools allow monitors to be automatically derived from high-level correctness specifications (aka. properties). This allows the same property to be converted into different types of monitors, which may apply different instrumentation techniques for checking whether the property was satisfied or not. In this paper we compare and contrast the various types of monitoring methodologies found in the current literature, and classify them into a spectrum of monitoring instrumentation techniques, ranging from completely asynchronous monitoring on the one end and completely synchronous monitoring on the other.Comment: In Proceedings PrePost 2017, arXiv:1708.0688

1 September 2014 in Science of Computer Programming
Verified
Journal Article
Closed access
ARArni Hermann Reynisson
Arni Hermann Reynisson
MSMarjan Sirjani
Marjan Sirjani
LALuca Aceto
Luca Aceto
MCMatteo Cimini
Matteo Cimini
AJAli Jafari
Ali Jafari
SSSteinar Hugi Sigurdarson
Steinar Hugi Sigurdarson

14 April 2018
Verified
Book Chapter
Open access
PDF file
LALuca Aceto
Luca Aceto
AAAntonis Achilleos
Antonis Achilleos
AFAdrian Francalanza
Adrian Francalanza
AIAnna Ingólfsdóttir
Anna Ingólfsdóttir
We introduce a general framework for Runtime Verification, parameterized with respect to a set of conditions. These conditions are encoded in the trace generated by a monitored process, which a monitor can observe. We present this parameterized framework in its general form and prove that it corresponds to a fragment of HML with recursion, extended with these conditions. We then show how this framework can be applied to a number of instantiations of the set of conditions.

15 November 2015
Verified
Book Chapter
Closed access
PDF file
AFAdrian Francalanza
Adrian Francalanza
LALuca Aceto
Luca Aceto
AIAnna Ingolfsdottir
Anna Ingolfsdottir

28 February 2012 in Mathematical Structures in Computer Science
Verified
Journal Article
Closed access
PDF file
LALuca Aceto
Luca Aceto
AIAnna Ingolfsdottir
Anna Ingolfsdottir
PLPaul Blain Levy
Paul Blain Levy
JSJoshua Sack
Joshua Sack
The concurrency theory literature offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but have a common underlying structure. This paper provides a general view of characteristic formulae that are expressed in terms of logics that have a facility for the recursive definition of formulae. We show how several examples of characteristic-formula constructions in the literature can be recovered as instances of the proposed general framework, and how the framework can be used to yield novel constructions. The paper also offers general results pertaining to the definition of co-characteristic formulae and of characteristic formulae expressed in terms of infinitary modal logics.