We introduce a static analysis and two program transformations for Datalog to circumvent performance ssues that arise with the implementation of primitive predicates, notably in the framework of a large scale telecommunication application. To this effect, we introduce a new trace semantics for Datalog with a verified mechanization. This work can be seen as both a first step and a proof of concept for the creation of a full-blown library of verified Datalog optimizations, on top of an existing Coq/MathComp formalization of Datalog towards the development of a realistic environment for certified data centric applications.

With the ATM block transfer with a delayed transmission (ABT/DT) capability, the amount of bandwidth allocated to the different cell flows of a connection (namely the CLP=0+1 and possibly the OAM cell flows) is constant over an ATM block and is referred to as the block cell rate (BCR). Successive BCR values are dynamically negotiated between the user and the network via the exchange of resource management cells. The BCR negotiation for a given ATM block may be initiated either by the source or the destination. As a basic principle, before transmitting an ATM block the source should receive an explicit authorization from the network. This paper gives the existence proof of a protocol for supporting the ABT/DT capability as specified in the May 1996 version of lTU-T Recommendation I.371.