1,981 research outputs found
A Control Flow Analysis for Beta-binders with and without Static Compartments
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-binders calculus and in an extended version of the calculus modelling static compartments. Our analysis of a system is able to describe the essential behaviour of each box, tracking all the possible bindings of variables, all the possible intra- and inter-boxes communications, and, finally, all the possible movements across compartments. The analysis offers a basis for establishing static checks of biological dynamic properties. We apply our analysis to an abstract specification of the interaction between a virus and cells of the immune system and to a model of the cAMP-signaling Pathway in Olfactory Sensory Neurons
Static Evidences for Attack Reconstruction
Control Flow Analysis (CFA) has been proven successful for the analysis of cryptographic protocols. Due to its over-approximative nature, the absence of detected flaws implies their absence also at run time, while their presence only says that there is the possibility for flaws to occur. Nevertheless, the static detection of a flaw can be considered as a warning bell that alerts against a possible attack, of which the flaw is the result. Reconstructing the possible attack leading to the detected flaw is not trivial, though. We propose a CFA enriched with causal information that accounts for attacker activity. In case a flaw is predicted, the causal information provides a sort of climbing holds that can be escalated to reconstruct the attack sequence leading to the flaw
Some Concurrency Models in a Categorical Framework
The paper defines a taxonomy of concurrent models.
Concurrent models are seen as categories and passages
between models as functors.
We particularly care about the notions of concurrency, causal and temporal
dependencies and their possible different perception. According to the chosen
model, only part of these notions are, indeed, relevant and recoverable
from the
observation of a concurrent system
Some Concurrency Models In A Categorical Framework (Extended Abstract)
CHIARA BODEI Dipartimento di Informatica, Universit`a di Pisa Corso Italia, 40, I-56125 Pisa, Italy [email protected] The paper defines a taxonomy of concurrent models. Concurrent models are seen as categories and passages between models as functors. We particularly care about the notions of concurrency, causal and temporal dependencies and their possible different perception. According to the chosen model, only part of these notions are, indeed, relevant and recoverable from the observation of a concurrent system. 1 Introduction In the last decades a great deal of efforts have been devoted to study suitable models in order to describe concurrent and distributed systems and to understand their semantics. Several and heterogeneous models have been introduced, each focusing on a peculiar aspect of concurrency and laying at a particular description level. Categories, as in 1;2;3 , can help in classifying the different models and in formally characterizing the passages between them. ..
Pierpaolo Degano
We present here a laudatio that illustrates the distinguished career and the main scientific contributions of Pierpaolo Degano, in the volume of essays dedicated to him, on the occasion of his 65th birthday
Securing IoT communications: at what cost?
IoT systems use wireless links for local communication, where locality depends on the
transmission range and include many devices with low computational power such as sensors.
In IoT systems, security is a crucial requirement, but difficult to obtain, because standard cryptographic techniques have a cost
that is usually unaffordable.
We resort to an extended version of the process calculus LySa, called IoTLySa,
to model the patterns of communication of IoT devices.
Moreover, we assign rates to each transition
to infer quantitative measures on the specified systems.
The derived performance evaluation can be exploited to
establish the cost of the possible security countermeasures
Pianeta Galileo 2013
Giunge alla decima edizione di PIANETA GALILEO, l'iniziativa del Consiglio Regionale della Toscana per la divulgazione della cultura scientifica presso le scuole secondarie di II grado della regione, in collaborazione con l’Ufficio Scolastico Regionale e con gli atenei di Firenze, Pisa e Siena e, per la prima volta, con la Rete delle Scuole, nata sempre su impulso del Consiglio Regionale, con l'idea di creare ponti percorribili tra chi fa ricerca e chi fa sperimentazione didattica.
I presenti atti sono una sintesi delle molte e molto seguite sono state le attività promosse da associazioni culturali e istituti operanti in Toscana, segno della vitalità del territorio e delle infinite possibilità esistenti di declinare la divulgazione scientifica: dalle più tradizionali quali mostre, convegni, conferenze, seminari, a visite guidate a musei e osservatori astronomici, fino ad arrivare a esperienze dirette in laboratori di università e istituti di ricerca o a spettacoli teatrali dedicati a figure o eventi legati alla scienza
A Static Analysis for Beta-Binders
AbstractWe introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to describe the essential behaviour of each box, tracking all the possible bindings of variables and all the possible intra- e inter-boxes communications. The analysis offers a basis for establishing static checks of biological dynamic properties. We finally apply our analysis to an example, based on an abstract specification of the interaction between a virus and cells of the immune system
L'informatica: non è un paese per donne.
Siamo proprio sicuri che l’informatica sia sempre stata materia appannaggio degli uomini? Le storie di donne che qui raccontiamo - quelle di Ada Lovelace Byron, delle ragazze del frigorifero, e di Jean Sammet – vanno a confutare questa certezza: sono modelli a cui ispirarsi mentre il numero di ragazze che studiano informatica pare essere in declino.Are we really sure that computer science has always been a subject for men only? The stories of women we are going to tell – those of Ada Lovelace Byron, of the refrigerator ladies, and of Jean Sammet – may lead to refute this certainty: they represent inspiring models for girls, in a period in which the number of female students in computer
science is getting lower
- …
