Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Andrea Bracciali is active.

Publication


Featured researches published by Andrea Bracciali.


Formal Aspects of Computing | 2012

Scalable context-dependent analysis of emergency egress models

Mieke Massink; Diego Latella; Andrea Bracciali; Michael D. Harrison; Jane Hillston

Pervasive environments offer an increasing number of services to a large number of people moving within these environments, including timely information about where to go and when, and contextual information about the surrounding environment. This information may be conveyed to people through public displays or direct to a person’s mobile phone. People using these services interact with the system but they are also meeting other people and performing other activities as relevant opportunities arise. The design of such systems and the analysis of collective dynamic behaviour of people within them is a challenging problem. We present results on a novel usage of a scalable analysis technique in this context. We show the validity of an approach based on stochastic process-algebraic models by focussing on a representative example, i.e. emergency egress. The chosen case study has the advantage that detailed data is available from studies employing alternative analysis methods, making cross-methodology comparison possible. We also illustrate how realistic, context-dependent human behaviour, often observed in emergency egress, can naturally be embedded in the models, and how the effect of such behaviour on evacuation can be analysed in an efficient and scalable way. The proposed approach encompasses both the agent modelling viewpoint, as system behaviour emerges from specific (discrete) agent interaction, and the population viewpoint, when classes of homogeneous individuals are considered for a (continuous) approximation of overall system behaviour.


fundamental approaches to software engineering | 2011

Modelling non-linear crowd dynamics in bio-PEPA

Mieke Massink; Diego Latella; Andrea Bracciali; Jane Hillston

Emergent phenomena occur due to the pattern of non-linear and distributed local interactions between the elements of a system over time. Surprisingly, agent based crowd models, in which the movement of each individual follows a limited set of simple rules, often reproduce quite closely the emergent behaviour of crowds that can be observed in reality. An example of such phenomena is the spontaneous self-organisation of drinking parties in the squares of cities in Spain, also known as El Botellon [20]. We revisit this case study providing an elegant stochastic process algebraic model in Bio-PEPA amenable to several forms of analyses, among which simulation and fluid flow analysis. We show that a fluid flow approximation, i.e. a deterministic reading of the average behaviour of the system, can provide an alternative and efficient way to study the same emergent behaviour as that explored in [20] where simulation was used instead. Besides empirical evidence, also an analytical justification is provided for the good correspondence found between simulation results and the fluid flow approximation.


software engineering and formal methods | 2010

A Scalable Fluid Flow Process Algebraic Approach to Emergency Egress Analysis

Mieke Massink; Diego Latella; Andrea Bracciali; Michael D. Harrison

Pervasive environments offer an increasing number of services to a large number of people moving within these environments including timely information about where to go and when. People using these services interact with the system but they are also meeting other people and performing other activities as relevant opportunities arise. The design of such systems and the analysis of collective dynamic behaviour of people within them is a challenging problem. In previous work we have successfully explored a scalable analysis of stochastic process algebraic models of smart signage systems. In this paper we focus on the validation of a representative example of this class of models in the context of emergency egress. This context has the advantage that detailed data is available from studies with alternative analysis methods. A second aim is to show how realistic human behaviour, often observed in emergency egress, can be embedded in the model and how the effect of this behaviour on building evacuation can be analysed in an efficient and scalable way.


Electronic Notes in Theoretical Computer Science | 2005

A Coordination-based Methodology for Security Protocol Verification

Giacomo Baldi; Andrea Bracciali; Gian Luigi Ferrari; Emilio Tuosto

The quest for the formal certification of properties of systems is one of the most challenging research issues in the field of formal methods. It requires the development of formal models together with effective verification techniques. In this paper, we describe a formal methodology for verifying security protocols based on ideas borrowed from the analysis of open systems, where applications interact with one another by dynamically sharing common resources and services in a not fully trusted environment. The methodology is supported by ASPASyA, a tool based on symbolic model checking techniques.


european conference on parallel processing | 2010

StochKit-FF: efficient systems biology on multicore architectures

Marco Aldinucci; Andrea Bracciali; Pietro Liò; Anil Sorathiya; Massimo Torquati

The stochastic modelling of biological systems is informative and often very adequate, but it may easily be more expensive than other modelling approaches, such as differential equations. We present Stoch-Kit-FF, a parallel version of StochKit, a reference toolkit for stochastic simulations. StochKit-FF is based on the FastFlow programming toolkit for multicores and on the novel concept of selective memory. We experiment StochKit-FF on a model of HIV infection dynamics, with the aim of extracting information from efficiently run experiments, here in terms of average and variance and, on a longer term, of more structured data.


Lecture Notes in Computer Science | 2015

Validation of Decentralised Smart Contracts Through Game Theory and Formal Methods

Giancarlo Bigi; Andrea Bracciali; Giovanni Meacci; Emilio Tuosto

Decentralised smart contracts represent the next step in the development of protocols that support the interaction of independent players without the presence of a coercing authority. Based on protocols i la BitCoin for digital currencies, smart contracts are believed to be a potentially enabling technology for a wealth of future applications. The validation of such an early developing technology is as necessary as it is complex. In this paper we combine game theory and formal models to tackle the new challenges posed by the validation of such systems.


workshop scalable and resilient infrastructures for distributed ledgers | 2017

A general framework for blockchain analytics

Massimo Bartoletti; Stefano Lande; Livio Pompianu; Andrea Bracciali

Modern cryptocurrencies exploit decentralised blockchains to record a public and unalterable history of transactions. Besides transactions, further information is stored for different, and often undisclosed, purposes, making the blockchains a rich and increasingly growing source of valuable information, in part of difficult interpretation. Many data analytics have been developed, mostly based on specifically designed and ad-hoc engineered approaches. We propose a general-purpose framework, seamlessly supporting data analytics on both Bitcoin and Ethereum --- currently the two most prominent cryptocurrencies. Such a framework allows us to integrate relevant blockchain data with data from other sources, and to organise them in a database, either SQL or NoSQL. Our framework is released as an open-source Scala library. We illustrate the distinguishing features of our approach on a set of significant use cases, which allow us to empirically compare ours to other competing proposals, and evaluate the impact of the database choice on scalability.


computational intelligence methods for bioinformatics and biostatistics | 2016

pWhatsHap: efficient haplotyping for future generation sequencing

Andrea Bracciali; Marco Aldinucci; Murray Patterson; Tobias Marschall; Nadia Pisanti; Ivan Merelli; Massimo Torquati

BackgroundHaplotype phasing is an important problem in the analysis of genomics information. Given a set of DNA fragments of an individual, it consists of determining which one of the possible alleles (alternative forms of a gene) each fragment comes from. Haplotype information is relevant to gene regulation, epigenetics, genome-wide association studies, evolutionary and population studies, and the study of mutations. Haplotyping is currently addressed as an optimisation problem aiming at solutions that minimise, for instance, error correction costs, where costs are a measure of the confidence in the accuracy of the information acquired from DNA sequencing. Solutions have typically an exponential computational complexity. WhatsHap is a recent optimal approach which moves computational complexity from DNA fragment length to fragment overlap, i.e., coverage, and is hence of particular interest when considering sequencing technology’s current trends that are producing longer fragments.ResultsGiven the potential relevance of efficient haplotyping in several analysis pipelines, we have designed and engineered pWhatsHap, a parallel, high-performance version of WhatsHap. pWhatsHap is embedded in a toolkit developed in Python and supports genomics datasets in standard file formats. Building on WhatsHap, pWhatsHap exhibits the same complexity exploring a number of possible solutions which is exponential in the coverage of the dataset. The parallel implementation on multi-core architectures allows for a relevant reduction of the execution time for haplotyping, while the provided results enjoy the same high accuracy as that provided by WhatsHap, which increases with coverage.ConclusionsDue to its structure and management of the large datasets, the parallelisation of WhatsHap posed demanding technical challenges, which have been addressed exploiting a high-level parallel programming framework. The result, pWhatsHap, is a freely available toolkit that improves the efficiency of the analysis of genomics information.


2018 International Workshop on Blockchain Oriented Software Engineering (IWBOSE) | 2018

Smart contracts vulnerabilities: a call for blockchain software engineering?

Giuseppe Destefanis; Michele Marchesi; Marco Ortu; Roberto Tonelli; Andrea Bracciali; Robert M. Hierons

Smart Contracts have gained tremendous popularity in the past few years, to the point that billions of US Dollars are currently exchanged every day through such technology. However, since the release of the Frontier network of Ethereum in 2015, there have been many cases in which the execution of Smart Contracts managing Ether coins has led to problems or conflicts. Compared to traditional Software Engineering, a discipline of Smart Contract and Blockchain programming, with standardized best practices that can help solve the mentioned problems and conflicts, is not yet sufficiently developed. Furthermore, Smart Contracts rely on a non-standard software life-cycle, according to which, for instance, delivered applications can hardly be updated or bugs resolved by releasing a new version of the software. In this paper we advocate the need for a discipline of Blockchain Software Engineering, addressing the issues posed by smart contract programming and other applications running on blockchains.We analyse a case of study where a bug discovered in a Smart Contract library, and perhaps unsafe programming, allowed an attack on Parity, a wallet application, causing the freezing of about 500K Ethers (about 150M USD, in November 2017). In this study we analyze the source code of Parity and the library, and discuss how recognised best practices could mitigate, if adopted and adapted, such detrimental software misbehavior. We also reflect on the specificity of Smart Contract software development, which makes some of the existing approaches insufficient, and call for the definition of a specific Blockchain Software Engineering.


Third International Conference on the History and Philosophy of Computing (HaPoC 2015) | 2016

From cells as computation to cells as apps

Andrea Bracciali; Enrico Cataldo; Luisa Damiano; Claudio Felicioli; Roberto Marangoni; Pasquale Stano

We reflect on the computational aspects that are embedded in life at the molecular and cellular level, where life machinery can be understood as a massively distributed system whose macroscopic behaviour is an emerging property of the interaction of its components. Such a relatively new perspective, clearly pursued by systems biology, is contributing to the view that biology is, in several respects, a quantitative science. The recent developments in biotechnology and synthetic biology, noticeably, are pushing the computational interpretation of biology even further, envisaging the possibility of a programmable biology. Several in-silico, in-vitro and in-vivo results make such a possibility a very concrete one. The long-term implications of such an “extended” idea of programmable living hardware, as well as the applications that we intend to develop on those “computers”, pose fundamental questions.

Collaboration


Dive into the Andrea Bracciali's collaboration.

Top Co-Authors

Avatar

Diego Latella

Istituto di Scienza e Tecnologie dell'Informazione

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Pietro Liò

University of Cambridge

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Mieke Massink

Istituto di Scienza e Tecnologie dell'Informazione

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge