SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2205.01240 · IJCAI · 2022

Using Constraint Programming and Graph Representation Learning for Generating Interpretable Cloud Security Policies

Mohit Tiwari, Akshat Kumar, Mikhail Kazdagli, Symmetry Systems

arXiv · PDF · Open in the Atlas

Code that ran

4 of 8 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 3 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 4 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2205.01240.json · badge: /api/ran/2205.01240.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
mikhail247/IAMAX community
Papers with Code archive
4 ran · 4 no recorded run
FunctionStatusWhere it lives
compute_avg_entity_dissimilarity Ran
ran, honoured the contract we drafted
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("f4d4140106b99f80")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

find_max_n_distinct_entities Ran
ran; our contract draft was wrong, not the code
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("5360090c946489bd")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_max_group_diameter Ran
ran, honoured the contract we drafted
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("5d7c6c0390e324f4")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_relative_dark_permissions_fraction Ran
ran, honoured the contract we drafted
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("d09e4697f86f3d4a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

add_data_store_xor_constraint Not yet run
unverified (harvested, no recorded run)
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("656404614d1b8c71")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

add_user_xor_constraint Not yet run
unverified (harvested, no recorded run)
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("04e78148a0a62a52")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

compute_number_of_unsatisfied_constraints Not yet run
unverified (harvested, no recorded run)
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("4dcef4faa092b9a8")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

solve Not yet run
unverified (harvested, no recorded run)
mikhail247/IAMAX/src/iam_optimization_cp.py
pointer only (licence: NONE) · get_code("adde8df688a11d8e")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, mikhail247/IAMAX when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 8 samples lifted from this paper's linked repositories, 8 carry a function identity and 0 do not. Of the 8 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 8 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Modern software systems rely on mining insights from business sensitive data stored in public clouds. A data breach usually incurs significant (monetary) loss for a commercial organization. Conceptually, cloud security heavily relies on Identity Access Management (IAM) policies that IT admins need to properly configure and periodically update. Security negligence and human errors often lead to misconfiguring IAM policies which may open a backdoor for attackers. To address these challenges, first, we develop a novel framework that encodes generating optimal IAM policies using constraint programming (CP). We identify reducing dormant permissions of cloud users as an optimality criterion, which intuitively implies minimizing unnecessary datastore access permissions. Second, to make IAM policies interpretable, we use graph representation learning applied to historical access patterns of users to augment our CP model with similarity constraints: similar users should be grouped together and share common IAM policies. Third, we describe multiple attack models and show that our optimized IAM policies significantly reduce the impact of security attacks using real data from 8 commercial organizations, and synthetic instances.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2205.01240")
get_code_for_paper("2205.01240")
have("2205.01240")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2205.01240.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2205.01240.svg)](https://syntology.ai/paper/2205.01240)

Connect an agent — have() is free.