The following pages link to (Q4248252):
Displaying 50 items.
- MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI (Q3444848) (← links)
- A Declarative View of Signaling Pathways (Q3460870) (← links)
- A Probabilistic Applied Pi–Calculus (Q3498438) (← links)
- CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence (Q3498448) (← links)
- On Beta-Binders Communications (Q3507381) (← links)
- Mind the Shapes: Abstraction Refinement Via Topology Invariants (Q3510783) (← links)
- A Propositional Dynamic Logic for CCS Programs (Q3511450) (← links)
- On Recursion, Replication and Scope Mechanisms in Process Calculi (Q3525112) (← links)
- Modelling and Verifying Mobile Systems Using π-Graphs (Q3599092) (← links)
- A Typed Calculus for Querying Distributed XML Documents (Q3608459) (← links)
- Reactive Systems, Barbed Semantics, and the Mobile Ambients (Q3617735) (← links)
- The Orc Programming Language (Q3634722) (← links)
- Process Algebra Modelling Styles for Biomolecular Processes (Q3642950) (← links)
- Algebra and logic for resource-based systems modelling (Q3643362) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- Order algebras: a quantitative model of interaction (Q4577983) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- Towards Slime Mould Based Computer (Q4598044) (← links)
- Symmetry and Interactivity in Programming (Q4650295) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- Semantics of value recursion for Monadic Input/Output (Q4787832) (← links)
- Diagrammatic confluence for Constraint Handling Rules (Q4911146) (← links)
- Typing Correspondence Assertions for Communication Protocols (Q4917053) (← links)
- Relating State-Based and Process-Based Concurrency through Linear Logic (Q4917995) (← links)
- Two Graph-Based Techniques for Software Architecture Reconfiguration (Q4923539) (← links)
- Analysing privacy-type properties in cryptographic protocols (invited talk) (Q4993330) (← links)
- (Q5009413) (← links)
- A universal session type for untyped asynchronous communication (Q5009447) (← links)
- (Q5020947) (← links)
- Relating Functional and Imperative Session Types (Q5043592) (← links)
- Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding (Q5058367) (← links)
- Algebras of UTxO blockchains (Q5084313) (← links)
- (Q5101343) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- (Q5111623) (← links)
- Counting the Cost in the Picalculus (Extended Abstract) (Q5166616) (← links)
- Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) (Q5170667) (← links)
- Decidable Fragments of a Higher Order Calculus with Locations (Q5170669) (← links)
- A Calculus for Mobile Ad-hoc Networks with Static Location Binding (Q5170671) (← links)
- The ARC Programming Model – Language Constructs for Coordination (Q5179208) (← links)
- Control Flow Analysis for Brane Calculi (Q5179425) (← links)
- Finite-Chain Graded Modal Logic (Q5213655) (← links)
- Divergence and unique solution of equations (Q5228882) (← links)
- Structural Rewriting in the pi-Calculus. (Q5240137) (← links)
- Observing Success in the Pi-Calculus (Q5240185) (← links)
- A Theory Agenda for Component-Based Design (Q5256362) (← links)
- Stochastic Model Checking of the Stochastic Quality Calculus (Q5256368) (← links)
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (Q5262945) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- PHYSARUM SPATIAL LOGIC (Q5388703) (← links)
