The following pages link to (Q4365103):
Displaying 28 items.
- Mechanizing a process algebra for network protocols (Q287372) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- A behavioural theory for a \(\pi\)-calculus with preorders (Q890617) (← links)
- Multisets and structural congruence of the pi-calculus with replication (Q1274455) (← links)
- Formalizing process algebraic verifications in the calculus of constructions (Q1355748) (← links)
- \(\pi\)-calculus in (Co)inductive-type theory (Q1589654) (← links)
- \(\mathrm{HO}\pi\) in Coq (Q2031410) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- Executable structural operational semantics in Maude (Q2369036) (← links)
- Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda (Q2683037) (← links)
- A first-order syntax for the \(\pi\)-calculus in Isabelle/HOL using permutations (Q2841231) (← links)
- The theory of contexts for first order and higher order abstract syntax (Q2841274) (← links)
- On the representation of McCarthy's amb in the \(\pi\)-calculus (Q2847406) (← links)
- A reflective higher-order calculus (Q2863844) (← links)
- A completeness proof for bisimulation in the pi-calculus using Isabelle (Q2871830) (← links)
- Specifying properties of concurrent computations in CLF (Q2871839) (← links)
- HOCore in Coq (Q2945640) (← links)
- (Q3384919) (← links)
- (Q4484504) (← links)
- (Q4499314) (← links)
- (Q4536393) (← links)
- (Q5089301) (← links)
- (Q5155688) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)
- Automata, Languages and Programming (Q5716865) (← links)
- Psi-calculi in Isabelle (Q5890661) (← links)
- Psi-calculi in Isabelle (Q5895110) (← links)
- Structural inclusion in the pi-calculus with replication (Q5941195) (← links)
