English
Related papers

Related papers: Multiparty testing preorders

200 papers

We consider protocols where users communicate with multiple servers to perform a computation on the users' data. An adversary exerts semi-honest control over many of the parties but its view is differentially private with respect to honest…

Cryptography and Security · Computer Science 2022-08-19 Albert Cheu , Chao Yan

Objects and actors are communicating state machines, offering and consuming different services at different points in their lifecycle. Two complementary challenges arise when programming such systems. When objects interact, their state…

Programming Languages · Computer Science 2016-06-21 Roly Perera , Julien Lange , Simon J. Gay

The additional complexity caused by concurrently communicating processes in distributed systems render the verification of such systems into a very hard problem. Multiparty session types were developed to govern communication and…

Logic in Computer Science · Computer Science 2019-08-20 Kirstin Peters , Christoph Wagner , Uwe Nestmann

In the setting of message passing software, De Nicola and Hennessy must-preorder defines when a program improves on another one. Since this preorder does not come equipped with a viable proof method, using it requires an alternative…

Logic in Computer Science · Computer Science 2026-05-05 Giovanni Bernardi , Hugo Férée , Gaëtan Lopez

Relating the specification of the global communication behavior of a distributed system and the specifications of the local communication behavior of each of its nodes/peers (e.g., to check if the former is realizable by the latter under…

Logic in Computer Science · Computer Science 2014-07-17 Luís Caires , Jorge A. Pérez

In secure multi-party computation $n$ parties jointly evaluate an $n$-variate function $f$ in the presence of an adversary which can corrupt up till $t$ parties. Almost all the works that have appeared in the literature so far assume the…

Cryptography and Security · Computer Science 2010-05-28 Shailesh Vaya

This paper focuses on the analysis of real-time non preemptive multiprocessor scheduling with precedence and several latency constraints. It aims to specify a schedulability condition which enables a designer to check a priori -without…

Operating Systems · Computer Science 2013-01-22 Omar Kermia

This paper proposes a way to effectively compare the potential of processes to cause conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if they can get trapped in a situation where they are both…

Formal Languages and Automata Theory · Computer Science 2011-08-02 Simon Ware , Robi Malik

In the standard testing theory of DeNicola-Hennessy one process is considered to be a refinement of another if every test guaranteed by the former is also guaranteed by the latter. In the domain of web services this has been recast, with…

Logic in Computer Science · Computer Science 2015-07-01 Giovanni Bernardi , Matthew Hennessy

The problem of scheduling with testing in the framework of explorable uncertainty models environments where some preliminary action can influence the duration of a task. In the model, each job has an unknown processing time that can be…

Data Structures and Algorithms · Computer Science 2021-08-20 Susanne Albers , Alexander Eckl

Communication games are one of the widely used tools that are designed to demonstrate quantum supremacy over classical resources. In that, two or more parties collaborate to perform an information processing task to achieve the highest…

Quantum Physics · Physics 2023-01-02 Abhyoudai. S. S. , Sumit Mukherjee , A. K. Pan

As cloud providers push multi-tenancy to new levels to meet growing scalability demands, ensuring that externally developed untrusted microservices will preserve tenant isolation has become a high priority. Developers, in turn, lack a means…

Cryptography and Security · Computer Science 2021-06-21 Marcela S. Melara , Mic Bowman

Post-market fairness monitoring is now mandated to ensure fairness and accountability for high-risk employment AI systems under emerging regulations such as the EU AI Act. However, effective fairness monitoring often requires access to…

Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive…

Cryptography and Security · Computer Science 2025-05-15 Thomas A. Henzinger , Mahyar Karimi , K. S. Thejaswini

Leader-follower tracking control design has received significant attention in recent years due to its important and wide applications. Considering a multi-agent system composed of a leader and multiple followers, this paper proposes and…

Systems and Control · Computer Science 2019-04-02 Chuan Yan , Huazhen Fang

Multiparty session types are designed to abstractly capture the structure of communication protocols and verify behavioural properties. One important such property is progress, i.e., the absence of deadlock. Distributed algorithms often…

Logic in Computer Science · Computer Science 2024-02-14 Kirstin Peters , Uwe Nestmann , Christoph Wagner

We consider multi-party protocols for classification that are motivated by applications such as e-discovery in court proceedings. We identify a protocol that guarantees that the requesting party receives all responsive documents and the…

Cryptography and Security · Computer Science 2022-09-07 Jinshuo Dong , Jason Hartline , Aravindan Vijayaraghavan

The quality of consequences in a decision making problem under (severe) uncertainty must often be compared among different targets (goals, objectives) simultaneously. In addition, the evaluations of a consequence's performance under the…

Artificial Intelligence · Computer Science 2022-12-15 Christoph Jansen , Georg Schollmeyer , Thomas Augustin

Bipartite experiments are a recent object of study in causal inference, whereby treatment is applied to one set of units and outcomes of interest are measured on a different set of units. These experiments are particularly useful in…

In 1992 Wang & Larsen extended the may- and must preorders of De Nicola and Hennessy to processes featuring probabilistic as well as nondeterministic choice. They concluded with two problems that have remained open throughout the years,…

Logic in Computer Science · Computer Science 2015-07-01 Yuxin Deng , Matthew Hennessy , Rob van Glabbeek , Carroll Morgan
‹ Prev 1 2 3 10 Next ›