Static analysis for the \(\pi\)-calculus with applications to security

DOI10.1006/inco.2000.3020zbMath1007.68118OpenAlexW2002622794WikidataQ59416359 ScholiaQ59416359MaRDI QIDQ1854437

Hanne Riis Nielson, Pierpaolo Degano, Flemming Nielson, Chiara Bodei

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f04100c06eb601057a96adc8a42472cb9443eaa7

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (20)

MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI ⋮ Relational Analysis of Correlation ⋮ A calculus of trustworthy ad hoc networks ⋮ Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation ⋮ Control Flow Analysis of Generalised Boolean Networks ⋮ A monotone framework for CCS ⋮ Automated verification of selected equivalences for security protocols ⋮ From flow logic to static type systems for coordination languages ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ Secrecy and group creation ⋮ Static analysis of topology-dependent broadcast networks ⋮ Weakening the perfect encryption assumption in Dolev-Yao adversaries ⋮ A control flow analysis for Beta-binders with and without static compartments ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ Pierpaolo Degano ⋮ Cryptographic Analysis in Cubic Time ⋮ Techniques for Security Checking ⋮ Analysis of security protocols as open systems ⋮ A Static Analysis for Beta-Binders ⋮ Validating firewalls using flow logics

Uses Software

• KLAIM

Cites Work

• Modal logics for mobile processes
• A calculus of mobile processes. II
• A calculus for cryptographic protocols: The spi calculus
• Mobile ambients
• Types for access control
• Secrecy by typing in security protocols
• Trust in the λ-calculus
• Systematic realisation of control flow analyses for CML
• Implicit typing à la ML for the join-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Static analysis for the \(\pi\)-calculus with applications to security