5 citations · 11 across the 7 of their papers we have counts for
7 papers
Formally Verifying a Real World Smart Contract
Alexandre Mota, Fei Yang, Cristiano Teixeira
Nowadays, smart contracts have become increasingly popular and, as with software development in general, testing is the standard method for verifying their correctness. However, sm…
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
Jos Baeten, Bas Luttik, Fei Yang
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequen…
Sequential Composition in the Presence of Intermediate Termination
Jos Baeten, Bas Luttik, Fei Yang
The standard operational semantics of the sequential composition operator gives rise to unbounded branching and forgetfulness when transparent process expressions are put in sequen…
Reactive Turing Machines with Infinite Alphabets
Bas Luttik, Fei Yang
The notion of Reactive Turing machine (RTM) was proposed as an orthogonal extension of Turing machines with interaction. RTMs are used to define the notion of executable transition…
On the Executability of Interactive Computation
Bas Luttik, Fei Yang
The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTM…
Executable Behaviour and the π-Calculus (extended abstract)
Bas Luttik, Fei Yang
Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour executable if, and only if, it is behaviour…