Zobrazeno 1 - 10
of 458
pro vyhledávání: '"Aceto, Luca"'
We continue the development of TinySol, a minimal object-oriented language based on Solidity, the standard smart-contract language used for the Ethereum platform. We first extend TinySol with exceptions and a gas mechanism, and equip it with a small-
Externí odkaz:
http://arxiv.org/abs/2407.15676
Reactive software calls for instrumentation methods that uphold the reactive attributes of systems. Runtime verification imposes another demand on the instrumentation, namely that the trace event sequences it reports to monitors are sound -- that is,
Externí odkaz:
http://arxiv.org/abs/2406.19904
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the formulae in
Externí odkaz:
http://arxiv.org/abs/2405.13697
In this paper we focus on TinySol, a minimal calculus for Solidity smart contracts, introduced by Bartoletti et al. We start by rephrasing its syntax (to emphasise its object-oriented flavour) and give a new big-step operational semantics. We then us
Externí odkaz:
http://arxiv.org/abs/2405.12976
Autor:
Aceto, Luca, Achilleos, Antonis, Anastasiadi, Elli, Francalanza, Adrian, Gorla, Daniele, Wagemaker, Jana
This paper focuses on the runtime verification of hyperproperties expressed in HypermuHML, an expressive yet simple logic for describing properties of sets of traces. To this end, we first consider a simple language of monitors that can observe sets
Externí odkaz:
http://arxiv.org/abs/2405.12882
Publikováno v:
J. Log. Algebraic Methods Program. Vol. 92. 2017
We present a unified rule format for structural operational semantics with terms as labels that guarantees that the associated labelled transition system has some bounded-nondeterminism property. The properties we consider include finite branching, i
Externí odkaz:
http://arxiv.org/abs/2402.02847
Autor:
Aceto, Luca, Fábregas, Ignacio, García-Pérez, Álvaro, Ingólfsdóttir, Anna, Ortega-Mallén, Yolanda
The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifi
Externí odkaz:
http://arxiv.org/abs/2402.00982
Logical characterisations, rule formats and compositionality for input-output conformance simulation
Input-output conformance simulation (iocos) has been proposed by Gregorio-Rodr\'iguez, Llana and Mart\'inez-Torres as a simulation-based behavioural preorder underlying model-based testing. This relation is inspired by Tretmans' classic ioco relation
Externí odkaz:
http://arxiv.org/abs/2402.00973
Publikováno v:
Theoretical Computer Science vol 777. 2019
In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are ex
Externí odkaz:
http://arxiv.org/abs/2402.00970
Autor:
Aceto, Luca, Fábregas, Ignacio, Escrig, David de Frutos, Ingólfsdóttir, Anna, Palomino, Miguel
Publikováno v:
Science of Computer Programming 78. 2013
This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders
Externí odkaz:
http://arxiv.org/abs/2402.00966