Valentina Castiglioni

Orcid: 0000-0002-8112-6523

Affiliations:
  • Eindhoven University of Technology, The Netherlands


According to our database1, Valentina Castiglioni authored at least 34 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Back to the format: A survey on SOS for probabilistic processes.
J. Log. Algebraic Methods Program., February, 2024

2023
A framework to measure the robustness of programs in the unpredictable environment.
Log. Methods Comput. Sci., 2023

DisTL: A Temporal Logic for the Analysis of the Expected Behaviour of Cyber-Physical Systems.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Stark: A Software Tool for the Analysis of Robustness in the unKnown Environment.
Proceedings of the Coordination Models and Languages, 2023

2022
Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition?
ACM Trans. Comput. Log., 2022

On the Axiomatisability of Parallel Composition.
Log. Methods Comput. Sci., 2022

RobTL: A Temporal Logic for the Robustness of Cyber-Physical Systems.
CoRR, 2022

EvTL: A Temporal Logic for the Transient Analysis of Cyber-Physical Systems.
CoRR, 2022

On the Axiomatisation of Branching Bisimulation Congruence over CCS.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS Restriction.
Proceedings of the A Journey from Process Algebra via Timed Automata to Model Learning, 2022

2021
In search of lost time: Axiomatising parallel composition in process algebras.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

How Adaptive and Reliable is Your Program?
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

Are Two Binary Operators Necessary to Finitely Axiomatise Parallel Composition?
Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020
Probabilistic divide & congruence: Branching bisimilarity.
Theor. Comput. Sci., 2020

The metric linear-time branching-time spectrum on nondeterministic probabilistic processes.
Theor. Comput. Sci., 2020

On the axiomatisability of priority III: Priority strikes again.
Theor. Comput. Sci., 2020

A logical characterization of differential privacy.
Sci. Comput. Program., 2020

Raiders of the lost equivalence: Probabilistic branching bisimilarity.
Inf. Process. Lett., 2020

Measuring Adaptability and Reliability of Large Scale Systems.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles, 2020

On the Axiomatisability of Parallel Composition: A Journey in the Spectrum.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Logical characterization of branching metrics for nondeterministic probabilistic transition systems.
Inf. Comput., 2019

On the Axiomatizability of Priority III: The Return of Sequential Composition.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics.
Proceedings of the Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, 2019

2018
SOS-based Modal Decomposition on Nondeterministic Probabilistic Processes.
Log. Methods Comput. Sci., 2018

Trace and Testing Metrics on Nondeterministic Probabilistic Processes.
Proceedings of the Proceedings Combined 25th International Workshop on Expressiveness in Concurrency and 15th Workshop on Structural Operational Semantics, 2018

A Logical Characterization of Differential Privacy via Behavioral Metrics.
Proceedings of the Formal Aspects of Component Software - 15th International Conference, 2018

2017
Probabilistic Semantics: Metric and Logical Character¨ations for Nondeterministic Probabilistic Processes.
PhD thesis, 2017

Logical Characterization of Trace Metrics.
Proceedings of the Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems, 2017

2016
A Function Elimination Method for Checking Satisfiability of Arithmetical Logics.
Fundam. Informaticae, 2016

Logical Characterization of Bisimulation Metrics.
Proceedings of the Proceedings 14th International Workshop Quantitative Aspects of Programming Languages and Systems, 2016

Modal Decomposition on Nondeterministic Probabilistic Processes.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
A Semantic Theory for the Internet of Things.
CoRR, 2015

2014
A Specification Format for Rooted Branching Bisimulation.
Fundam. Informaticae, 2014

2013
A Rule Format for Rooted Branching Bisimulation.
Proceedings of the 22nd International Workshop on Concurrency, 2013


  Loading...