Deciding safety properties in infinite-state pi-calculus via behavioural types
DOI10.1016/J.IC.2012.01.006zbMATH Open1279.68192OpenAlexW1984379137MaRDI QIDQ418155FDOQ418155
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.01.006
Recommendations
- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
- Spatial and behavioral types in the pi-calculus
- Spatial and Behavioral Types in the Pi-Calculus
- Using session types for reasoning about boundedness in the \(\pi\)-calculus
- Using session types for reasoning about boundedness in the \(\pi\)-calculus
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A theory of structural stationarity in the \(\pi\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- The polynomial-time hierarchy
- Reduction and covering of infinite reachability trees
- Algorithmic analysis of programs with well quasi-ordered domains.
- Forward Analysis for WSTS, Part II: Complete WSTS
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- Type-based information flow analysis for the \(\pi\)-calculus
- A spatial logic for concurrency. I
- Ordering by Divisibility in Abstract Algebras
- Model checking mobile ambients
- A generic type system for the pi-calculus
- Spatial and behavioral types in the pi-calculus
- The name discipline of uniform receptiveness
- Title not available (Why is that?)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
- Deciding validity in a spatial logic for trees
- A logic you can count on
- On the Relationship between Spatial Logics and Behavioral Simulations
- Spatial-Behavioral Types, Distributed Services, and Resources
- Logical Semantics of Types for Concurrency
- On the Expressive Power of Restriction and Priorities in CCS with Replication
- Deciding Safety Properties in Infinite-State Pi-Calculus via Behavioural Types
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anytime, anywhere
- Types as models
- Foundations of Software Science and Computation Structures
- Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-Calculus
- Automata, Languages and Programming
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Expressiveness and complexity of graph logic
Cited In (2)
Uses Software
This page was built for publication: Deciding safety properties in infinite-state pi-calculus via behavioural types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418155)
