Papers › Using Constraint Programming and Graph Representation Learning for Generating...

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

2 May 2022arXiv:2205.01240archive 2025-07-28

Mikhail Kazdagli, Mohit Tiwari, Akshat Kumar

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 dark 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.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 8 code samples harvested from 1 repository linked to this paper: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified. Where Syntology's instrument failed: 1 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 8 samples from 1 repository, 4 ran (3 with no instrument failure; 1 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

mikhail247/iamax officialmentioned in papermentioned on GitHubSyntology: 8 samples, 4 ran (1 instrument-failed) · 4 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran · honoured contract
1ran · our draft was wrong
4unverified

Licence: 8 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from mikhail247/iamax. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

mikhail247/iamax official repository 8 samples, 4 ran (1 instrument-failed) · 4 unverified
compute_avg_entity_dissimilarity src/iam_optimization_cp.py ran · honoured contract no licence file found · pointer only · f4d4140106b99f80 · report fixture: signature entity_groups:dict/0/?, dissimilarity_func:callable/0/? · returned float · level recorded 2026-09-22
find_max_n_distinct_entities src/iam_optimization_cp.py ran · our draft was wrong no licence file found · pointer only · 5360090c946489bd · report fixture: signature entity_list:list/1/Entity, threshold:float/0/float, dissimilarity_func:callable/0/?, max_constraints_per_group:int/0/int · returned list · level recorded 2026-09-22
get_max_group_diameter src/iam_optimization_cp.py ran · honoured contract no licence file found · pointer only · 5d7c6c0390e324f4 · report fixture: signature dissimilarity_func:callable/0/?, group_info:dict/0/? · returned float · level recorded 2026-09-22
get_relative_dark_permissions_fraction src/iam_optimization_cp.py ran · honoured contract no licence file found · pointer only · d09e4697f86f3d4a · report fixture: signature model:MockModel/0/?, solution:MockSolution/0/? · returned float · level recorded 2026-09-22
add_data_store_xor_constraint src/iam_optimization_cp.py unverified no licence file found · pointer only · 656404614d1b8c71 · report
add_user_xor_constraint src/iam_optimization_cp.py unverified no licence file found · pointer only · 04e78148a0a62a52 · report
compute_number_of_unsatisfied_constraints src/iam_optimization_cp.py unverified no licence file found · pointer only · 4dcef4faa092b9a8 · report
solve in 25 papers src/iam_optimization_cp.py unverified no licence file found · pointer only · adde8df688a11d8e · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for novel framework using constraint programming and graph representation learning (graph method: novel framework using constraint programming and graph representation learning). 8 bricks; individually on a fixture: 4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified. The assembly has not been run end-to-end.

  1. solve entry · level 0 · unverified · adde8df688a11d8e
  2. add_data_store_xor_constraint model · level 0 · unverified · 656404614d1b8c71
  3. add_user_xor_constraint model · level 0 · unverified · 04e78148a0a62a52
  4. compute_avg_entity_dissimilarity metric · level 1 · ran · honoured contract · f4d4140106b99f80
  5. compute_number_of_unsatisfied_constraints metric · level 0 · unverified · 4dcef4faa092b9a8
  6. find_max_n_distinct_entities helper · level 1 · ran · our draft was wrong · 5360090c946489bd
  7. get_max_group_diameter metric · level 1 · ran · honoured contract · 5d7c6c0390e324f4
  8. get_relative_dark_permissions_fraction metric · level 1 · ran · honoured contract · d09e4697f86f3d4a

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2205.01240") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Graph Representation LearningManagementRepresentation Learning

Datasets

Introduced by this paper, per the archive.

Identity Access Management dataset

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections