24 citations · 25 across the 6 of their papers we have counts for
8 papers
Proceedings 16th International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software
Farzaneh Derakhshan, Jan Hoffmann
This volume contains the proceedings of PLACES 2025, the 16th edition of the Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software. The work…
Regrading Policies for Flexible Information Flow Control in Session-Typed Concurrency
Farzaneh Derakhshan, Stephanie Balzer, Yue Yao
Noninterference guarantees that an attacker cannot infer secrets by interacting with a program. Information flow control (IFC) type systems assert noninterference by tracking the l…
Information Flow Control in Cyclic Process Networks
Bas van den Heuvel, Farzaneh Derakhshan, Stephanie Balzer
Protection of confidential data is an important security consideration of today's applications. Of particular concern is to guard against unintentional leakage to a (malicious) obs…
Logical Relations for Session-Typed Concurrency
Stephanie Balzer, Farzaneh Derakhshan, Robert Harper +1
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an obser…
Recursive Session Logical Relations
Farzaneh Derakhshan, Stephanie Balzer
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an obser…
Session Logical Relations for Noninterference
Farzaneh Derakhshan, Stephanie Balzer, Limin Jia
Information flow control type systems statically restrict the propagation of sensitive data to ensure end-to-end confidentiality. The property to be shown is noninterference, asser…
Strong Progress for Session-Typed Processes in a Linear Metalogic with Circular Proofs
Farzaneh Derakhshan, Frank Pfenning
We introduce an infinitary first order linear logic with least and greatest fixed points. To ensure cut elimination, we impose a validity condition on infinite derivations. Our cal…
Circular Proofs as Session-Typed Processes: A Local Validity Condition
Farzaneh Derakhshan, Frank Pfenning
Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic log…