A monotone framework for CCS

DOI10.1016/j.cl.2008.07.001zbMath1387.68172OpenAlexW2085809004WikidataQ59416345 ScholiaQ59416345MaRDI QIDQ1749243

Hanne Riis Nielson, Flemming Nielson

Publication date: 16 May 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2008.07.001

zbMATH Keywords

static analysisprocess calculiCCSmonotone frameworks

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Static analysis of topology-dependent broadcast networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• A framework for security analysis of mobile wireless networks
• Pathway analysis for BioAmbients
• Mobile ambients
• Validating firewalls using flow logics
• Static analysis for the \(\pi\)-calculus with applications to security
• BioAmbients: an abstraction for biological compartments
• Nesting analysis of mobile ambients
• Cryptographic Analysis in Cubic Time
• Modal Abstractions of Concurrent Behaviour
• Topology-Dependent Abstractions of Broadcast Networks
• Data Flow Analysis for CCS
• Flow logic for Dolev–Yao secrecy in cryptographic processes
• CONCUR 2004 - Concurrency Theory
• Static Analysis
• Global Computing. Programming Environments, Languages, Security, and Analysis of Systems
• Foundations of Security Analysis and Design II

This page was built for publication: A monotone framework for CCS