Michele Boreale

Orcid: 0000-0002-1972-7491

Affiliations:
  • University of Florence, Italy


According to our database1, Michele Boreale authored at least 79 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Products, Polynomials and Differential Equations in the Stream Calculus.
ACM Trans. Comput. Log., January, 2024

Guaranteed Inference for Probabilistic Programs: A Parallelisable, Small-Step Operational Approach.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

2023
An implicit function theorem for the stream calculus.
CoRR, 2023

Bayesian Parameter Estimation with Guarantees via Interval Analysis and Simulation.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2023

2022
Output Sampling for Output Diversity in Automatic Unit Test Generation.
IEEE Trans. Software Eng., 2022

A linear-algebraic method to compute polynomial PDE conservation laws.
J. Symb. Comput., 2022

Automatic pre- and postconditions for partial differential equations.
Inf. Comput., 2022

Linearization, Model Reduction and Reachability in Nonlinear odes.
Proceedings of the Reachability Problems - 16th International Conference, 2022

2021
Weighted approximate Bayesian computation via Sanov's theorem.
Comput. Stat., 2021

Algebra and Coalgebra of Stream Products.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Relative Privacy Threats and Learning From Anonymized Data.
IEEE Trans. Inf. Forensics Secur., 2020

Complete algorithms for algebraic strongest postconditions and weakest preconditions in polynomial odes.
Sci. Comput. Program., 2020

2019
Algebra, coalgebra, and minimization in polynomial differential equations.
Log. Methods Comput. Sci., 2019

On the Coalgebra of Partial Differential Equations.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018
Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE'S.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Algorithms for exact and approximate linear abstractions of polynomial continuous systems.
Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), 2018

2016
Searching secrets rationally.
Int. J. Approx. Reason., 2016

2015
Worst- and average-case privacy breaches in randomization mechanisms.
Theor. Comput. Sci., 2015

Asymptotic information leakage under one-try attacks.
Math. Struct. Comput. Sci., 2015

A semiring-based trace semantics for processes with applications to information leakage analysis.
Math. Struct. Comput. Sci., 2015

CaSPiS: a calculus of sessions, pipelines and services.
Math. Struct. Comput. Sci., 2015

Quantitative information flow under generic leakage functions and adaptive adversaries.
Log. Methods Comput. Sci., 2015

Analysis of Probabilistic Systems via Generating Functions and Padé Approximation.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
On Formally Bounding Information Leakage by Statistical Estimation.
Proceedings of the Information Security - 17th International Conference, 2014

2013
Behavioural contracts with request-response operations.
Sci. Comput. Program., 2013

Asymptotic Risk Analysis for Trust and Reputation Systems.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012
A coalgebraic perspective on linear weighted automata.
Inf. Comput., 2012

Deciding safety properties in infinite-state pi-calculus via behavioural types.
Inf. Comput., 2012

Quantitative Multirun Security under Active Adversaries.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

2011
Linear-Time and May-Testing in a Probabilistic Reactive Setting.
Proceedings of the Formal Techniques for Distributed Systems, 2011

Quantitative Information Flow, with a View.
Proceedings of the Computer Security - ESORICS 2011, 2011

Advanced Mechanisms for Service Composition, Query and Discovery.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

Static Analysis Techniques for Session-Oriented Calculi.
Proceedings of the Rigorous Software Engineering for Service-Oriented Systems, 2011

2010
Spatial and behavioral types in the pi-calculus.
Inf. Comput., 2010

On the Relationship between Spatial Logics and Behavioral Simulations.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009
Quantifying information leakage in process calculi.
Inf. Comput., 2009

Deciding Spatial and behavioral properties in the pi-calculus.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Weighted Bisimulation in Linear Algebraic Form.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Responsiveness in process calculi.
Theor. Comput. Sci., 2008

XPi: A typed process calculus for XML messaging.
Sci. Comput. Program., 2008

Sessions and Pipelines for Structured Service Programming.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2008

A Type System for Client Progress in a Service-Oriented Calculus.
Proceedings of the Concurrency, 2008

2007
Type Abstractions of Name-Passing Processes.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

A Concurrent Calculus with Atomic Transactions.
Proceedings of the Programming Languages and Systems, 2007

2006
Processes as formal power series: A coinductive approach to denotational semantics.
Theor. Comput. Sci., 2006

SCC: A Service Centered Calculus.
Proceedings of the Web Services and Formal Methods, Third International Workshop, 2006

A Typed Calculus for Querying Distributed XML Documents.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Attacking Right-to-Left Modular Exponentiation with Timely Random Faults.
Proceedings of the Fault Diagnosis and Tolerance in Cryptography, 2006

2005
A method for symbolic analysis of security protocols.
Theor. Comput. Sci., 2005

A General Name Binding Mechanism.
Proceedings of the Trustworthy Global Computing, International Symposium, 2005

2004
D-Fusion: A Distinctive Fusion Calculus.
Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2003
Denotational Testing Semantics in Coinductive Form.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Trace and Testing Equivalence on Asynchronous Processes.
Inf. Comput., 2002

Experimenting with STA, a tool for automatic analysis of security protocols.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

On Compositional Reasoning in the Spi-calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

A Framework for the Analysis of Security Protocols.
Proceedings of the CONCUR 2002, 2002

2001
Divergence in testing and readiness semantics.
Theor. Comput. Sci., 2001

Proof Techniques for Cryptographic Processes.
SIAM J. Comput., 2001

Symbolic Trace Analysis of Cryptographic Protocols.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
A complexity analysis of bisimilarity for value-passing processes.
Theor. Comput. Sci., 2000

Process Algebraic Analysis of Cryptographic Protocols.
Proceedings of the Formal Techniques for Distributed System Development, 2000

1999
Basic Observables for Processes.
Inf. Comput., 1999

A Theory of "May" Testing for Asynchronous Languages.
Proceedings of the Foundations of Software Science and Computation Structure, 1999

1998
Some Congruence Properties for Pi-Calculus Bisimilarities.
Theor. Comput. Sci., 1998

On the Expressiveness of Internal Mobility in Name-Passing Calculi.
Theor. Comput. Sci., 1998

A Fully Abstract Semantics for Causality in the \pi-Calculus.
Acta Informatica, 1998

Bisimulations in the join-calculus.
Proceedings of the Programming Concepts and Methods, 1998

Bisimulation in Name-Passing Calculi without Matching.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Asynchronous Observations of Processes.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1996
A Symbolic Semantics for the pi-Calculus.
Inf. Comput., 1996

Bisimilarity Problems Requiring Exponential Time.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Symbolic Bisimulation for Timed Processes.
Proceedings of the Algebraic Methodology and Software Technology, 1996

1995
Testing Equivalence for Mobile Processes
Inf. Comput., August, 1995

On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

1994
A Symbolic Semantics for the pi-calculus (Extended Abstract).
Proceedings of the CONCUR '94, 1994

1992
Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences.
Inf. Process. Lett., 1992

Testing Equivalence for Mobile Processes (Extended Abstract).
Proceedings of the CONCUR '92, 1992


  Loading...