This work formalises the problems of ODRL evaluation for the access control and monitoring scenarios, in both static and streaming settings, and provides a novel, efficient algorithm and implementation of the first ODRL Evaluator with transparent formal semantics and supporting all rule types.
Abstract
The ODRL policy language is emerging as the de-facto standard for policy modelling data access and usage preferences, AI governance policies and data workflows in European dataspaces. The current standard has no mathematical formal semantics to describe how a system should implement policy evaluation. This has resulted in a variety of systems and tools that implement their own interpretation of the language, which limits interoperability and cannot guarantee consistent results. Based on an existing semantic model of ODRL, we formalise the problems of ODRL evaluation for the access control and monitoring scenarios, in both static and streaming settings, and we provide a novel, efficient algorithm and implementation. We present the first ODRL Evaluator with transparent formal semantics and supporting all rule types. We experimentally measure its performance, analysing different scalability dimensions related to policy complexity and size of the data on which a policy is evaluated. We compare our system with the state-of-the-art by providing a comparative review of existing ODRL evaluators, which highlights the differences in supported ODRL features and evaluation modes.
This paper proposes the Evaluation Context Protocol (ECP), an early-stage, vendor-neutral framework intended to act as a portable evaluation contract layer for agentic systems and describes an open-source reference implementation that includes adapters for LangChain, LlamaIndex, CrewAI, and PydanticAI.
It is shown that LLM-driven agents can violate this condition and introduced a canonical deployment wrapper that guarantees it for arbitrary base agents while preserving already-equivariant behaviour, and it is proved that computing canonical representations required by this construction is graph-isomorphism-hard.
ReATest is introduced, an automated approach to enhancing PaC workflows through systematic test case generation from Rego specifications, which achieves an average 35.43% reduction in test suite size and retains 64.57% of the generated test cases.
Thanh-Binh Trinh, N. Le, H. Nguyen· Software quality journal· 0 citations
It is argued that GraphQL constitutes a principled, testable alternative to function calling for agentic systems, combining lower cost, stronger safety, and improved cognitive robustness.
Viktor Zhakhalov· CEUR Workshop Proceedings, V...· 0 citations
A structured mapping between DPV and ODRL is presented that aligns DPV concepts with ODRL constructs using RDF and SKOS properties, and provides it in a machine-readable form to support implementation, establishing a reusable foundation for implementing legally-oriented, interoperable usage control policies in data spa...
An LLM-based prototype designed to support the application of a documented rule catalog within GitLab merge requests is presented, which demonstrates the technical feasibility of integrating rule-based governance with LLM-supported contextual interpretation in a practical GitLab workflow.
Sehyang Na, D. Kostunin· TH Wildau Engineering and Na...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.