Overview

Prüft behauptete direkte und transitive Reihenfolgebeziehungen sowie symmetrische, nicht transitive Ausschlussbeziehungen aus deklarierten OpenMP-Geschwistertask-depend-Klauseln; trennt insbesondere mutexinoutset und inoutset, ohne einen tatsächlichen Laufplan oder Sicherheitsurteil zu liefern.

Protocol x402 (POST)
Price $0.0030
Payment Asset USD Coin
Payment Network eip155:8453
Category uncategorized
Provider detect
Source bazaar
Indexed 2026-11-02 19:28:39

Health

Status unknown
Latency (p50) —
Uptime (30d) —
Reliability Score —
Last Checked Never
Last Healthy Never
Consecutive Failures 0

x402 Payment Validation

Payment Requirements —
Asset Verified —
Facilitator —

Input Schema

{ "body": { "artifact": { "claimed_mutex_pairs": [ [ 0, 1 ] ], "claimed_ordering_pairs": [ [ 0, 1 ] ], "claimed_precedence_pairs": [ [ 0, 1 ] ], "claims": { "all_memory_clauses": 0, "direct_order_pairs": 1, "mutex_pairs": 1, "parent_contexts": 1, "precedence_pairs": 1, "sibling_pairs": 1, "tasks": 2 }, "tasks": [ { "clauses": [ { "locators": [ 1 ], "type": "out" }, { "locators": [ 2 ], "type": "mutexinoutset" } ], "id": 0, "parent_context": 0 }, { "clauses": [ { "locators": [ 1 ], "type": "in" }, { "locators": [ 2 ], "type": "mutexinoutset" } ], "id": 1, "parent_context": 0 } ] } }, "bodyType": "json", "method": "POST", "type": "http" }

Output Schema

{ "example": { "billable": true, "findings": [ { "confidence": 100, "evidence": [], "limits": [ "OpenMP5.1 §2.19.11 depend: match only previously generated sibling tasks and identical/disjoint abstract storage tokens, with out/inout/all-memory, in, mutexinoutset and inoutset typed relations. Mutex/mutex yields mutual exclusion without choosing an order; inoutset/inoutset and in/in do not order each other.", "One bound normative clause-projection model, not actual compiler/runtime graph, OMPT callbacks, source-code parsing, a chosen execution schedule or a data-race/security verdict. Parent-context identities, construction encounter order and exact storage equality/disjointness are supplied premises. Does not infer real pointer aliasing, task hierarchy validity, partial array-section overlap, imported/newer-version dependence contexts or implicit task/barrier constraints.", "Includes all direct normative matching pairs and their transitive ordering closure; mutex constraints stay symmetric and nontransitive. Ordering and mutex may coexist through distinct locators. Duplicate locator/claim entries have set semantics. all_memory permitted only for out/inout; unresolved depobj/doacross/iterator expansion outside model is unknown. Maximum32tasks/4clauses/8locators and1024claimed pairs per relation.", "Own typed-clause matching, sibling isolation and closure; no task SDK or generic scheduler wrapper. Only bounded counts/booleans output, never task/storage/parent IDs or caller relation pairs. All exact numerical claims, including false fractional claim IDs/counters, compare without epsilon." ], "module": "openmp-sibling-typed-dependence-relations", "state": "not_observed", "value": { "all_memory_clauses": 0, "claim_mismatches": 0, "claims_match": true, "direct_order_pairs": 1, "mutex_pairs": 1, "mutex_relation_matches": true, "ordering_relation_matches": true, "parent_contexts": 1, "precedence_pairs": 1, "precedence_relation_matches": true, "sibling_pairs": 1, "tasks": 2 }, "warnings": [] } ], "known_count": 1, "scope": { "contact_values_returned": false, "network": false, "supplied_artifact_only": true }, "warnings": [] }, "type": "json" }