Valentina Castiglioni
Valentina Castiglioni
Geverifieerd e-mailadres voor ru.is - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Logical Characterization of Bisimulation Metrics
V Castiglioni, D Gebler, S Tini
QAPL 2016 227, 44--62, 2016
192016
Modal Decomposition on Nondeterministic Probabilistic Processes
V Castiglioni, D Gebler, S Tini
CONCUR 2016, 36:1-36:15, 2016
132016
Logical Characterization of Trace Metrics
V Castiglioni, S Tini
Quantitative Aspects of Programming Languages and Systems 2017, 36, 2017
72017
Trace and Testing Metrics on Nondeterministic Probabilistic Processes
V Castiglioni
arXiv preprint arXiv:1808.08649, 2018
62018
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes
V Castiglioni, D Gebler, S Tini
Logical Methods in Computer Science 14, 2018
52018
Logical characterization of branching metrics for nondeterministic probabilistic transition systems
V Castiglioni, S Tini
Information and Computation 268, 104432, 2019
42019
A logical characterization of differential privacy
V Castiglioni, K Chatzikokolakis, C Palamidessi
Science of Computer Programming 188, 102388, 2020
32020
A Logical Characterization of Differential Privacy via Behavioral Metrics
V Castiglioni, K Chatzikokolakis, C Palamidessi
International Conference on Formal Aspects of Component Software, 75-96, 2018
32018
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
V Castiglioni, M Loreti, S Tini
Theoretical Computer Science 813, 20-69, 2020
22020
A Specification Format for Rooted Branching Bisimulation
V Castiglioni, R Lanotte, S Tini
Fundamenta Informaticae 135 (4), 355-369, 2014
22014
Probabilistic divide & congruence: Branching bisimilarity
V Castiglioni, S Tini
Theoretical Computer Science 802, 147-196, 2020
12020
On the axiomatizability of priority III: The return of sequential composition⋆
L Aceto, E Anastasiadi, V Castiglioni, A Ingólfsdóttir, MR Pedersen
ICTCS 2019, 2019
12019
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics
V Castiglioni, L Ruggero, T Simone
Fundamenta Informaticae 143 (1-2), 51-71, 2016
12016
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics.
V Castiglioni, R Lanotte, S Tini
CS&P, 46-57, 2014
12014
On the axiomatisability of priority III: Priority strikes again
L Aceto, E Anastasiadi, V Castiglioni, A Ingólfsdóttir, B Luttik, ...
Theoretical Computer Science 837, 223-246, 2020
2020
Raiders of the Lost Equivalence: Probabilistic Branching Bisimilarity
V Castiglioni, S Tini
Information Processing Letters, 105947, 2020
2020
On the Axiomatisability of Parallel Composition: A Journey in the Spectrum
L Aceto, V Castiglioni, A Ingólfsdóttir, B Luttik, MR Pedersen
31st International Conference on Concurrency Theory (CONCUR 2020), 2020
2020
Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics
V Castiglioni, R Lanotte, S Tini
The Art of Modelling Computational Systems: A Journey from Logic and …, 2019
2019
Probabilistic Semantics: Metric and Logical Characterizations for Nondeterministic Probabilistic Processes
V Castiglioni
Università degli Studi dell'Insubria, 2017
2017
A Rule Format for Rooted Branching Bisimulation.
V Castiglioni, R Lanotte, S Tini
CS&P, 49-60, 2013
2013
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20