Epistemic Logic for the Applied Pi Calculus

Chadha, Rohit; Delaune, Stéphanie; Kremer, Steve

doi:10.1007/978-3-642-02138-1_12

Cited by 26 publications

(24 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we decided to focus on the detectability constraint because it has received less attention so far, but the possibility for an actor to know a given information (beyond the fact that he may receive or not a given set of variables) is obviously at the heart of privacy protection. Inference systems to prove knowledge properties (akin to epistemic logic [6,10,41]) can be defined independently of the detectability system introduced in Section 3 and used to check additional constraints. Such an inference system typically includes rules to prove that, from a given set of knowledge, an actor can derive a new knowledge.…”

Section: Discussion and Further Workmentioning

confidence: 99%

Privacy by design

Métayer

2013

Proceedings of the Third ACM Conference on Data and Application Security and Privacy

View full text Add to dashboard Cite

The privacy by design approach has already been applied in different areas. We believe that the next challenge in this area today is to go beyond individual cases and to provide methodologies to explore the design space in a systematic way. As a first step in this direction, we focus in this paper on the data minimization principle and consider different options using decentralized architectures in which actors do not necessarily trust each other. We propose a framework to express the parameters to be taken into account (the service to be performed, the actors involved, their respective requirements, etc.) and an inference system to derive properties such as the possibility for an actor to detect potential errors (or frauds) in the computation of a variable. This inference system can be used in the design phase to check if an architecture meets the requirements of the parties or to point out conflicting requirements.

show abstract

Section: Discussion and Further Workmentioning

confidence: 99%

Privacy by design

Métayer

2013

Proceedings of the Third ACM Conference on Data and Application Security and Privacy

View full text Add to dashboard Cite

show abstract

“…The BAN logic [5], proposed by Burrows, Abadi and Needham, is a notable example of epistemic logic used to model and verify the authentication in cryptographic protocols. To improve the formalization of protocols' behaviours, some epistemic approaches integrate process calculi [23,10,7].…”

Section: Related Workmentioning

confidence: 99%

Towards Logical Specification of Statistical Machine Learning

Kawamoto

2019

Software Engineering and Formal Methods

View full text Add to dashboard Cite

We introduce a logical approach to formalizing statistical properties of machine learning. Specifically, we propose a formal model for statistical classification based on a Kripke model, and formalize various notions of classification performance, robustness, and fairness of classifiers by using epistemic logic. Then we show some relationships among properties of classifiers and those between classification performance and robustness, which suggests robustness-related properties that have not been formalized in the literature as far as we know. To formalize fairness properties, we define a notion of counterfactual knowledge and show techniques to formalize conditional indistinguishability by using counterfactual epistemic operators. As far as we know, this is the first work that uses logical formulas to express statistical properties of machine learning, and that provides epistemic (resp. counterfactually epistemic) views on robustness (resp. fairness) of classifiers.

show abstract

“…Epistemic logic for process calculi has been discussed in [7,9,14]. In all of these works, however, the epistemic logic is defined outside of the process calculus, with the processes as models for the logic, whereas our processes have epistemic (or spatial) logic terms within the constraint system, as well as knowledge or space constructions on the processes.…”

Section: Compact Approximation Of Space and Knowledgementioning

confidence: 99%

Spatial and Epistemic Modalities in Constraint-Based Process Calculi

Knight

Palamidessi

Panangaden

et al. 2012

Lecture Notes in Computer Science

116

View full text Add to dashboard Cite

Abstract. We introduce spatial and epistemic process calculi for reasoning about spatial information and knowledge distributed among the agents of a system. We introduce domain-theoretical structures to represent spatial and epistemic information. We provide operational and denotational techniques for reasoning about the potentially infinite behaviour of spatial and epistemic processes. We also give compact representations of infinite objects that can be used by processes to simulate announcements of common knowledge and global information.Introduction. Distributed systems have changed substantially in the recent past with the advent of phenomena like social networks and cloud computing. In the previous incarnation of distributed computing [16] the emphasis was on consistency, fault tolerance, resource management and related topics; these were all characterized by interaction between processes. Research proceeded along two lines: the algorithmic side which dominated the Principles Of Distributed Computing conferences and the more process algebraic approach epitomized by CONCUR where the emphasis was on developing compositional reasoning principles. What marks the new era of distributed systems is an emphasis on managing access to information to a much greater degree than before.Epistemic concepts were crucial in distributed computing as was realized in the mid 1980s with Halpern and Moses' groundbreaking paper on common knowledge [13]. This led to a flurry of activity in the next few years [11] with many distributed protocols being understood from an epistemic point of view. The impact of epistemic ideas in the concurrency theory community was slower in coming. In an invited talk by one of us [20] at a joint PODC-CONCUR conference in 2008, this point was emphasized and a plea was made for epistemic ideas to be exploited more by concurrency theorists.The goal of the present paper is simple: to put epistemic concepts in the hands of programmers rather than just appearing in post-hoc theoretical analyses. One could imagine the incorporation of these ideas in a variety of process algebraic settings -and indeed we expect that such formalisms will appear in due course -but what is particularly appealing about the concurrent constraint programming (ccp) paradigm [24,25] is that it was designed to give programmers explicit access to the concept of partial information and, as such, had close ties with logic [21,18]. This makes it ideal for the incorporation of epistemic concepts by expanding the logical connections to include modal logic [15]. In particular, agents posting and querying information in the presence of spatial hierarchies for sharing information and knowledge, e.g. friend circles and

show abstract

Epistemic Logic for the Applied Pi Calculus

Cited by 26 publications

References 25 publications

Privacy by design

Privacy by design

Towards Logical Specification of Statistical Machine Learning

Spatial and Epistemic Modalities in Constraint-Based Process Calculi

Contact Info

Product

Resources

About