Semantic typing via coinductively defined interpretations on a typed operational semantics ensures information flow control and non-interference for TinySol contracts that use fallback functions.
A calculus of mobile processes, I
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
Generalizes PDL to OPDL by distinguishing programs from traces via arbitrary operational semantics and proves cut-elimination for a non-wellfounded sequent calculus.
Reconfigurable async automata equal fixed ones in power via translations, but any equivalent fixed automaton must disseminate all communication knowledge to every process or render some irrelevant.
citing papers explorer
-
Typing Fallback Functions: A Semantic Approach to Type Safe Smart Contracts
Semantic typing via coinductively defined interpretations on a typed operational semantics ensures information flow control and non-interference for TinySol contracts that use fallback functions.
-
Simple grammar bisimilarity, with an application to session type equivalence
Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
-
On Propositional Dynamic Logic and Concurrency
Generalizes PDL to OPDL by distinguishing programs from traces via arbitrary operational semantics and proves cut-elimination for a non-wellfounded sequent calculus.
-
Adding Reconfiguration to Zielonka's Asynchronous Automata
Reconfigurable async automata equal fixed ones in power via translations, but any equivalent fixed automaton must disseminate all communication knowledge to every process or render some irrelevant.