Skip to main content

and
Your search also matched 45 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you.
results, e.g.

Designing Exception Handling Using Event-B

Include preview-only content
  1. Chapter and Conference Paper

    Towards Adaptive Access Control

    Access control systems are nowadays the first line of defence of modern IT systems. However, their effectiveness is often compromised by policy miscofigurations that can be exploited by insider threats. In thi...

    Luciano Argento, Andrea Margheri in Data and Applications Security and Privacy… (2018)

  2. Chapter and Conference Paper

    Obscuring Provenance Confidential Information via Graph Transformation

    Provenance is a record that describes the people, institutions, entities, and activities involved in producing, influencing, or delivering a piece of data or a thing. In particular, the provenance of informati...

    Jamal Hussein, Luc Moreau, Vladimiro Sassone in Trust Management IX (2015)

  3. Chapter and Conference Paper

    A Game-Theoretic Analysis of Cooperation in Anonymity Networks

    Anonymity systems are of paramount and growing importance in communication networks. They rely on users to cooperate to the realisation of an effective anonymity service. Yet, existing systems are marred by th...

    Mu Yang, Vladimiro Sassone, Sardaouna Hamadou in Principles of Security and Trust (2012)

  4. Chapter and Conference Paper

    Minimising Anonymity Loss in Anonymity Networks under DoS Attacks

    Anonymity is a security property of paramount importance as it helps to protect users’ privacy by ensuring that their identity remains unknown. Anonymity protocols generally suffer from denial of service (DoS)...

    Mu Yang, Vladimiro Sassone in Information and Communications Security (2011)

  5. Chapter and Conference Paper

    Structural Operational Semantics for Stochastic Process Calculi

    A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeterministic processes. Stochastic bisimila...

    Bartek Klin, Vladimiro Sassone in Foundations of Software Science and Comput… (2008)

  6. Chapter and Conference Paper

    Semantic Barbs and Biorthogonality

    We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory of barbs and demonstrate its ro...

    Julian Rathke, Vladimiro Sassone in Foundations of Software Science and Comput… (2007)

  7. Chapter and Conference Paper

    A Dependently Typed Ambient Calculus

    The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to enforce elementary access cont...

    Cédric Lhoussaine, Vladimiro Sassone in Programming Languages and Systems (2004)

  8. Chapter and Conference Paper

    Deriving Bisimulation Congruences: 2-Categories Vs Precategories

    G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. This paper deve...

    Vladimiro Sassone, Paweł Sobociśki in Foundations of Software Science and Comput… (2003)

  9. Chapter and Conference Paper

    High-Level Petri Nets as Type Theories in the Join Calculus

    We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four classes of nets of increasing expressiv...

    Maria Grazia Buscemi, Vladimiro Sassone in Foundations of Software Science and Comput… (2001)

  10. Chapter and Conference Paper

    Open Ended Systems, Dynamic Bisimulation and Tile Logic

    The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to characterize the coarsest congruence for...

    Roberto Bruni, Ugo Montanari in Theoretical Computer Science: Exploring Ne… (2000)

  11. Chapter and Conference Paper

    On the category of Petri net computations

    We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor ...

    Vladimiro Sassone in TAPSOFT '95: Theory and Practice of Software Development (1995)