Rumyana Neykova

Dr. Rumyana Neykova


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 November 2014 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
RDRomain Demangeon
Romain Demangeon
KHKohei Honda
Kohei Honda
RHRaymond Hu
Raymond Hu
RNRumyana Neykova
Rumyana Neykova
NYNobuko Yoshida
Nobuko Yoshida

8 March 2014
Verified
Book Chapter
Closed access
PDF file
NYNobuko Yoshida
Nobuko Yoshida
RHRaymond Hu
Raymond Hu
RNRumyana Neykova
Rumyana Neykova
NNNicholas Ng
Nicholas Ng

5 February 2017
Verified
Conference Paper
Open access
RNRumyana Neykova
Rumyana Neykova
NYNobuko Yoshida
Nobuko Yoshida
Fault-tolerant communication systems rely on recovery strategies which are often error-prone (e.g. a programmer manually specifies recovery strategies) or inefficient (e.g. the whole system is restarted from the beginning). This paper proposes a static analysis based on multiparty session types that can efficiently compute a safe global state from which a system of interacting processes should be recovered. We statically analyse the communication flow of a program, given as a multiparty protocol, to extract the causal dependencies between processes and to localise failures. We formalise our recovery algorithm and prove its safety. A recovered communication system is free from deadlocks, orphan messages and reception errors. Our recovery algorithm incurs less communication cost (only affected processes are notified) and overall execution time (only required states are repeated). On top of our analysis, we design and implement a runtime framework in Erlang where failed processes and their dependencies are soundly restarted from a computed safe state. We evaluate our recovery framework on message-passing benchmarks and a use case for crawling webpages. The experimental results indicate our framework outperforms a built-in static recovery strategy in Erlang when a part of the protocol can be safely recovered.

1 September 2017 in Formal Aspects of Computing
Verified
Journal Article
Open access
RNRumyana Neykova
Rumyana Neykova
LBLaura Bocchi
Laura Bocchi
NYNobuko Yoshida
Nobuko Yoshida
We propose a dynamic verification framework for protocols in real-time distributed systems. The framework is based on Scribble, a tool-chain for design and verification of choreographies based on multiparty session types, which we have developed with our industrial partners. Drawing from recent work on multiparty session types for real-time interactions, we extend Scribble with clocks, resets, and clock predicates in order to constrain the times in which interactions occur. We present a timed API for Python to program distributed implementations of Scribble specifications. A dynamic verification framework ensures the safe execution of applications written with our timed API: we have implemented dedicated runtime monitors that check that each interaction occurs at a correct timing with respect to the corresponding Scribble specification. To demonstrate the practicality of the proposed framework, we express and verify four categories of widely used temporal patterns from use cases in literature. We analyse the performance of our implementation via benchmarking and show negligible overhead.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
RNRumyana Neykova
Rumyana Neykova
NYNobuko Yoshida
Nobuko Yoshida
RHRaymond Hu
Raymond Hu

1 January 2014
Verified
Book Chapter
Open access
PDF file
RNRumyana Neykova
Rumyana Neykova
NYNobuko Yoshida
Nobuko Yoshida
Actor coordination armoured with a suitable protocol description language has been a pressing problem in the actors community. We study the applicability of multiparty session type (MPST) protocols for verification of actor programs. We incorporate sessions to actors by introducing minimum additions to the model such as the notion of actor roles and protocol mailboxes. The framework uses Scribble, which is a protocol description language based on multiparty session types. Our programming model supports actor-like syntax and runtime verification mechanism guaranteeing communication safety of the participating entities. An actor can implement multiple roles in a similar way as an object can implement multiple interfaces. Multiple roles allow for cooperative inter-concurrency in a single actor. We demonstrate our framework by designing and implementing a session actor library in Python and its runtime verification mechanism. Benchmark results demonstrate that the runtime checks induce negligible overhead.