Vladimiro Sassone

Orcid: 0000-0002-6432-1482

Affiliations:
  • University of Southampton, UK


According to our database1, Vladimiro Sassone authored at least 130 papers between 1991 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
CIST: A Serious Game for Hardware Supply Chain.
Comput. Secur., 2022

A lightweight approach to the concurrent use and integration of SysML and formal methods in systems design.
Proceedings of the 25th International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings, 2022

Evaluating Blockchain Systems: A Comprehensive Study of Security and Dependability Attributes.
Proceedings of the 4th Workshop on Distributed Ledger Technology co-located with the Italian Conference on Cybersecurity 2022 (ITASEC 2022), 2022

2021
MOTENS: A Pedagogical Design Model for Serious Cyber Games.
CoRR, 2021

Connecting Regulatory Requirements to Audit Outcomes: A Model-driven Approach to Auditable Compliance.
Proceedings of the ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion, 2021

Verifying System-Level Security of a Smart Ballot Box.
Proceedings of the Rigorous State-Based Methods - 8th International Conference, 2021

2020
A Methodology to Select Topology Generators for Ad Hoc Mesh Network Simulations.
J. Commun., 2020

Decentralised provenance for healthcare data.
Int. J. Medical Informatics, 2020

EATCS Distinguished Dissertation Award 2020 - Call for Nominations.
Bull. EATCS, 2020

Riskio: A Serious Game for Cyber Security Awareness and Education.
Comput. Secur., 2020

2019
A methodology for assuring the safety and security of critical infrastructure based on STPA and Event-B.
Int. J. Crit. Comput. Based Syst., 2019

EATCS Distinguished Dissertation Award 2019 - Call for Nominations.
Bull. EATCS, 2019

A Methodology to Select Topology Generators for WANET Simulations (Extended Version).
CoRR, 2019

2018
Differentially Private Data Sharing in a Cloud Federation with Blockchain.
IEEE Cloud Comput., 2018

Cross-Cloud Management of Sensitive Data via Blockchain: a Payslip Calculation Use Case.
Proceedings of the Second Italian Conference on Cyber Security, Milan, Italy, February 6th - to, 2018

PBFT vs Proof-of-Authority: Applying the CAP Theorem to Permissioned Blockchain.
Proceedings of the Second Italian Conference on Cyber Security, Milan, Italy, February 6th - to, 2018

Towards Adaptive Access Control.
Proceedings of the Data and Applications Security and Privacy XXXII, 2018

2017
Quantifying leakage in the presence of unreliable sources of information.
J. Comput. Syst. Sci., 2017

Blockchain-Based Database to Ensure Data Integrity in Cloud Computing Environments.
Proceedings of the First Italian Conference on Cybersecurity (ITASEC17), 2017

Decentralised Runtime Monitoring for Access Control Systems in Cloud Federations.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

A Distributed Access Control System for Cloud Federations.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

Formal Analysis of Safety and Security Requirements of Critical Systems Supported by an Extended STPA Methodology.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy Workshops, 2017

A Prototype Evaluation of a Tamper-Resistant High Performance Blockchain-Based Transaction Log for a Distributed Database.
Proceedings of the 13th European Dependable Computing Conference, 2017

A Distributed Infrastructure for Democratic Cloud Federations.
Proceedings of the 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), 2017

Privacy-Preserving Access Control in Cloud Federations.
Proceedings of the 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), 2017

2016
A descriptive type foundation for RDF Schema.
J. Log. Algebraic Methods Program., 2016

FaaS: Federation-as-a-Service.
CoRR, 2016

2015
An analysis of trust in anonymity networks in the presence of adaptive attackers.
Math. Struct. Comput. Sci., 2015

Minimal type inference for Linked Data consumers.
J. Log. Algebraic Methods Program., 2015

EATCS Award 2015.
Bull. EATCS, 2015

Obscuring Provenance Confidential Information via Graph Transformation.
Proceedings of the Trust Management IX - 9th IFIP WG 11.11 International Conference, 2015

2014
A verified algebra for read-write Linked Data.
Sci. Comput. Program., 2014

The EATCS Award 2015 - Call for Nominations.
Bull. EATCS, 2014

ETAPS Award Laudatio for Kohei Honda.
Bull. EATCS, 2014

Descriptive Types for Linked Data Resources.
Proceedings of the Perspectives of System Informatics, 2014

2013
Structural operational semantics for stochastic and weighted transition systems.
Inf. Comput., 2013

Local Type Checking for Linked Data Consumers.
Proceedings of the Proceedings 9th International Workshop on Automated Specification and Verification of Web Systems, 2013

An HMM-Based Reputation Model.
Proceedings of the Advances in Security of Information and Communication Networks, 2013

2012
Tracing where and who provenance in Linked Data: A calculus.
Theor. Comput. Sci., 2012

A Game-Theoretic Analysis of Cooperation in Anonymity Networks.
Proceedings of the Principles of Security and Trust - First International Conference, 2012

2011
A Verified Algebra for Linked Data
Proceedings of the Proceedings 10th International Workshop on the Foundations of Coordination Languages and Software Architectures, 2011

Permission-Based Separation Logic for Message-Passing Concurrency
Log. Methods Comput. Sci., 2011

Minimising Anonymity Loss in Anonymity Networks under DoS Attacks.
Proceedings of the Information and Communications Security - 13th International Conference, 2011

Operational Semantics for SPARQL Update.
Proceedings of the Semantic Web - Joint International Semantic Technology Conference, 2011

2010
Trust in Crowds: Probabilistic Behaviour in Anonymity Protocols.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Reconciling Belief and Vulnerability in Information Flow.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010

Trust in Anonymity Networks.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
An analysis of the exponential decay principle in probabilistic trust models.
Theor. Comput. Sci., 2009

Probable Innocence in the Presence of Independent Knowledge.
Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

HMM-Based Trust Model.
Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

A Formal Model of Provenance in Distributed Systems.
Proceedings of the First Workshop on the Theory and Practice of Provenance, 2009

2008
Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005.
Theor. Comput. Sci., 2008

A logical framework for history-based access control and reputation systems.
J. Comput. Secur., 2008

Structural Operational Semantics for Stochastic Process Calculi.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Models of Computation: A Tribute to Ugo Montanari's Vision.
Proceedings of the Concurrency, 2008

2007
Semantic and logical foundations of global computing: Papers from the EU-FET global computing initiative (2001-2005).
Theor. Comput. Sci., 2007

Space-aware ambients and processes.
Theor. Comput. Sci., 2007

Static BiLog: a Unifying Language for Spatial Structures.
Fundam. Informaticae, 2007

A Bayesian Model for Event-based Trust.
Proceedings of the Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin, 2007

Semantic Barbs and Biorthogonality.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

2006
A Hybrid Intuitionistic Logic: Semantics and Decidability.
J. Log. Comput., 2006

Role-based access control for a distributed calculus.
J. Comput. Secur., 2006

Inferring dynamic credentials for rôle-based trust management.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

Typed polyadic pi-calculus in bigraphs.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

Towards a Formal Framework for Computational Trust.
Proceedings of the Formal Methods for Components and Objects, 5th International Symposium, 2006

2005
Locating reaction with 2-categories.
Theor. Comput. Sci., 2005

Observational congruences for dynamically reconfigurable tile systems.
Theor. Comput. Sci., 2005

Communication and mobility control in boxed ambients.
Inf. Comput., 2005

Jeeg: temporal constraints for the synchronization of concurrent objects.
Concurr. Pract. Exp., 2005

Bigraphical Logics for XML.
Proceedings of the Thirteenth Italian Symposium on Advanced Database Systems, 2005

Reactive Systems over Cospans.
Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 2005

Spatial Logics for Bigraphs.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

A framework for concrete reputation-systems with applications to history-based access control.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

Labels from Reductions: Towards a General Theory.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005

2004
Introduction to special issue on concurrency and coordination: Selected work from the International Workshop ConCoord.
Math. Struct. Comput. Sci., 2004

A Congruence for Petri Nets.
Proceedings of the Workshop on Petri Nets and Graph Transformations, 2004

Security Policies as Membranes in Systems for Global Computing.
Proceedings of the Workshop 3rd on the Foundations of Global Ubiquitous Computing, 2004

The inheritance anomaly: ten years after.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

A Calculus for Trust Management.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

A Dependently Typed Ambient Calculus.
Proceedings of the Programming Languages and Systems, 2004

A Distributed Calculus for Ro^le-Based Access Control.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2003
Deriving Bisimulation Congruences using 2-categories.
Nord. J. Comput., 2003

Preface.
Proceedings of the 2nd EATCS Workshop on Foundations of Global Computing, 2003

Temporal constraints for concurrent object synchronisation.
Proceedings of the Workshop on Object Oriented Developments, 2003

A Formal Model for Trust in Dynamic Networks.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Algebraic Theories for Contextual Pre-nets.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Secrecy in Untrusted Networks.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Deriving Bisimulation Congruences: 2-Categories Vs Precategories.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

A Calculus of Bounded Capacities.
Proceedings of the Advances in Computing Science, 2003

2002
Deriving Bisimulation Congruences: A 2-categorical Approach.
Proceedings of the 9th International Workshop on Expressiveness in Concurrency, 2002

Preface - F-WAN: Foundations of Wide Area Network Computing.
Proceedings of the Foundations of Wide Area Network Computing, 2002

Jeeg: a programming language for concurrent objects synchronization.
Proceedings of the 2002 Joint ACM-ISCOPE Conference on Java Grande 2002, 2002

Communication Interference in Mobile Boxed Ambients.
Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

A Survey of Name-Passing Calculi and Crypto-Primitives.
Proceedings of the Foundations of Security Analysis and Design II, 2002

Typing and Subtyping Mobility in Boxed Ambients.
Proceedings of the CONCUR 2002, 2002

A Calculus of Mobile Resources.
Proceedings of the CONCUR 2002, 2002

2001
Functorial Models for Petri Nets.
Inf. Comput., 2001

Preface.
Proceedings of the International Workshop on Concurrency and Coordination, 2001

A Type Inference Algorithm for Secure Ambients.
Proceedings of the Theory of Concurrency, Higher Order Languages and Types, 2001

Properties of Distributed Timed-Arc Petri Nets.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

High-Level Petri Nets as Type Theories in the Join Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

Towards a Notion of Distributed Time for Petri Nets.
Proceedings of the Application and Theory of Petri Nets 2001, 2001

Two Algebraic Process Semantics for Contextual Nets.
Proceedings of the Unifying Petri Nets, Advances in Petri Nets, 2001

2000
On the Algebraic Structure of Petri Nets.
Bull. EATCS, 2000

Open Ended Systems, Dynamic Bisimulation and Tile Logic.
Proceedings of the Theoretical Computer Science, 2000

Algebraic Models for Contextual Nets.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Functorial semantics for Petri nets under the individual token philosophy.
Proceedings of the Conference on Category Theory and Computer Science, 1999

1998
An Axiomatization of the Category of Petri Net Computations.
Math. Struct. Comput. Sci., 1998

A Comparison of Petri Net Semantics under the Collective Token Philosophy.
Proceedings of the Advances in Computing Science, 1998

1997
On the Semantics of Place/Transition Petri Nets.
Math. Struct. Comput. Sci., 1997

Representation Theorems for Petri Nets.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
Models for Concurrency: Towards a Classification.
Theor. Comput. Sci., 1996

An Axiomatization of the Algebra of Petri Net Concatenable Processes.
Theor. Comput. Sci., 1996

Process versus Unfolding Semantics for Place/Transition Petri Nets.
Theor. Comput. Sci., 1996

Higher Dimensional Transition Systems.
Proceedings of the Proceedings, 1996

Transition systems with independence and multi-arcs.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Comparing Transition Systems with Independence and Asynchronous Transition Systems.
Proceedings of the CONCUR '96, 1996

Petri Nets and Other Models of Concurrency.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

1995
On the Category of Petri Net Computations.
Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Axiomatizing Petri Net Concatenable Processes.
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

Characterizing Behavioural Congruences for Petri Nets.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
On the Model of Computation of Place/Transition Petri Nets.
Proceedings of the Application and Theory of Petri Nets 1994, 1994

1993
Relationships Between Models of Concurrency.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Deterministic Behavioural Models for Concurrency.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

A Classification of Models for Concurrency.
Proceedings of the CONCUR '93, 1993

A Note on Logic Programming Fixed-Point Semantics.
Proceedings of the 8th Italian Conference on Logic Programming, 1993

A Unification-Free Introduction to Logic Programming.
Proceedings of the 8th Italian Conference on Logic Programming, 1993

1992
Dynamic congruence vs. progressing bisimulation for CCS.
Fundam. Informaticae, 1992

On the Semantics of Petri Nets.
Proceedings of the CONCUR '92, 1992

1991
CCS Dynamic Bisimulation is Progressing.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991


  Loading...