Programmable data planes increasingly rely on stateful P4 programs to implement complex in-network functions. However, verifying and debugging these programs remains challenging because stateful temporal violations can span multiple packets and …
This extended article presents the JustAct framework, for distributed systems of decentralised control over how normative policy fragments are created, disseminated, and enforced on agent actions. The article explains the article in detail, and …
In software-defined networking, the domain-specific language P4 allows developers to program the behavior of networking devices at a comparatively high level of abstraction. A P4 program defines a state machine to parse incoming packets. The parsers …
Presenting the theory of the Reowolf project, its protocol language and runtime system, as formalised in Rocq. Reowolf was developed to let peers distributed over the Internet share ad-hoc communication sessions according to piecemeal session …
Debugging non-deterministic programs is inherently difficult as the compound effects of non-deterministic execution steps is hard to predict and gives rise to a (potentially) vast space of reachable program states such that manual exploration of all …
Specification languages are useful for expressing what a program or system should do. But what if specifications are assembled by fragments from different contributors? This is necessary in reality, where systems are under the control of several …
Computational agents based on the BDI framework typically rely on abstract plans and plan refinement to reach a degree of autonomy in dynamic environments, agents are provided with the ability to select how-to achieve their goals by choosing from a …