@eagleoutice/flowr 2.10.1 → 2.10.3

package/README.md

@@ -24,7 +24,7 @@ It offers a wide variety of features, for example:
     
     ```shell
     $ docker run -it --rm eagleoutice/flowr # or npm run flowr 
-    flowR repl using flowR v2.10.0, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.10.2, R grammar v14 (tree-sitter engine)
     R> :query @linter "read.csv(\"/root/x.txt\")"
     ```
     
@@ -35,17 +35,17 @@ It offers a wide variety of features, for example:
     ```text
     Query: linter (2 ms)
        ╰ Deprecated Functions (deprecated-functions):
-           ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 1, processTimeMs: 0
+           ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ File Path Validity (file-path-validity):
            ╰ certain:
                ╰ Path `/root/x.txt` at 1.1-23
-           ╰ Metadata: totalReads: 1, totalUnknown: 0, totalWritesBeforeAlways: 0, totalValid: 0, searchTimeMs: 0, processTimeMs: 0
+           ╰ Metadata: totalReads: 1, totalUnknown: 0, totalWritesBeforeAlways: 0, totalValid: 0, searchTimeMs: 1, processTimeMs: 0
        ╰ Seeded Randomness (seeded-randomness):
            ╰ Metadata: consumerCalls: 0, callsWithFunctionProducers: 0, callsWithAssignmentProducers: 0, callsWithNonConstantProducers: 0, callsWithOtherBranchProducers: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Absolute Paths (absolute-file-paths):
            ╰ certain:
                ╰ Path `/root/x.txt` at 1.1-23
-           ╰ Metadata: totalConsidered: 1, totalUnknown: 0, searchTimeMs: 1, processTimeMs: 0
+           ╰ Metadata: totalConsidered: 1, totalUnknown: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Unused Definitions (unused-definitions):
            ╰ Metadata: totalConsidered: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Naming Convention (naming-convention):
@@ -53,7 +53,7 @@ It offers a wide variety of features, for example:
        ╰ Network Functions (network-functions):
            ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Dataframe Access Validation (dataframe-access-validation):
-           ╰ Metadata: numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 0
+           ╰ Metadata: numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 1
        ╰ Dead Code (dead-code):
            ╰ Metadata: consideredNodes: 5, searchTimeMs: 0, processTimeMs: 0
        ╰ Useless Loops (useless-loop):
@@ -62,6 +62,8 @@ It offers a wide variety of features, for example:
            ╰ Metadata: searchTimeMs: 0, processTimeMs: 0
        ╰ Stop without call.=False argument (stop-call):
            ╰ Metadata: consideredNodes: 0, searchTimeMs: 0, processTimeMs: 0
+       ╰ Roxygen Arguments (roxygen-arguments):
+           ╰ Metadata: searchTimeMs: 0, processTimeMs: 0
     All queries together required ≈2 ms (1ms accuracy, total 2 ms)
     ```
     
@@ -84,7 +86,7 @@ It offers a wide variety of features, for example:
     
     _Results (prettified and summarized):_
     
-    Query: **linter** (2 ms)\
+    Query: **linter** (3 ms)\
        ╰ **Deprecated Functions** (deprecated-functions):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 1, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **File Path Validity** (file-path-validity):\
@@ -92,11 +94,11 @@ It offers a wide variety of features, for example:
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ Path `/root/x.txt` at 1.1-23\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalReads: 1, totalUnknown: 0, totalWritesBeforeAlways: 0, totalValid: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Seeded Randomness** (seeded-randomness):\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>consumerCalls: 0, callsWithFunctionProducers: 0, callsWithAssignmentProducers: 0, callsWithNonConstantProducers: 0, callsWithOtherBranchProducers: 0, searchTimeMs: 0, processTimeMs: 0</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>consumerCalls: 0, callsWithFunctionProducers: 0, callsWithAssignmentProducers: 0, callsWithNonConstantProducers: 0, callsWithOtherBranchProducers: 0, searchTimeMs: 1, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Absolute Paths** (absolute-file-paths):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ certain:\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ Path `/root/x.txt` at 1.1-23\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 1, totalUnknown: 0, searchTimeMs: 1, processTimeMs: 0</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 1, totalUnknown: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Unused Definitions** (unused-definitions):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Naming Convention** (naming-convention):\
@@ -106,18 +108,20 @@ It offers a wide variety of features, for example:
     &nbsp;&nbsp;&nbsp;╰ **Dataframe Access Validation** (dataframe-access-validation):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Dead Code** (dead-code):\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>consideredNodes: 5, searchTimeMs: 0, processTimeMs: 0</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>consideredNodes: 5, searchTimeMs: 1, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Useless Loops** (useless-loop):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>numOfUselessLoops: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Problematic eval** (problematic-eval):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>searchTimeMs: 0, processTimeMs: 0</code>\
     &nbsp;&nbsp;&nbsp;╰ **Stop without call.=False argument** (stop-call):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>consideredNodes: 0, searchTimeMs: 0, processTimeMs: 0</code>\
-    _All queries together required ≈2 ms (1ms accuracy, total 2 ms)_
+    &nbsp;&nbsp;&nbsp;╰ **Roxygen Arguments** (roxygen-arguments):\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>searchTimeMs: 0, processTimeMs: 0</code>\
+    _All queries together required ≈3 ms (1ms accuracy, total 3 ms)_
     
     <details> <summary style="color:gray">Show Detailed Results as Json</summary>
     
-    The analysis required _2.3 ms_ (including parsing and normalization and the query) within the generation environment.
+    The analysis required _2.5 ms_ (including parsing and normalization and the query) within the generation environment.
     
     In general, the JSON contains the Ids of the nodes in question as they are present in the normalized AST or the dataflow graph of flowR.
     Please consult the [Interface](https://github.com/flowr-analysis/flowr/wiki/Interface) wiki page for more information on how to get those.
@@ -169,7 +173,7 @@ It offers a wide variety of features, for example:
               "callsWithAssignmentProducers": 0,
               "callsWithNonConstantProducers": 0,
               "callsWithOtherBranchProducers": 0,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -189,7 +193,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalConsidered": 1,
               "totalUnknown": 0,
-              "searchTimeMs": 1,
+              "searchTimeMs": 0,
               "processTimeMs": 0
             }
           },
@@ -233,7 +237,7 @@ It offers a wide variety of features, for example:
             "results": [],
             ".meta": {
               "consideredNodes": 5,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -259,14 +263,21 @@ It offers a wide variety of features, for example:
               "searchTimeMs": 0,
               "processTimeMs": 0
             }
+          },
+          "roxygen-arguments": {
+            "results": [],
+            ".meta": {
+              "searchTimeMs": 0,
+              "processTimeMs": 0
+            }
           }
         },
         ".meta": {
-          "timing": 2
+          "timing": 3
         }
       },
       ".meta": {
-        "timing": 2
+        "timing": 3
       }
     }
     ```
@@ -331,7 +342,7 @@ It offers a wide variety of features, for example:
     
     ```shell
     $ docker run -it --rm eagleoutice/flowr # or npm run flowr 
-    flowR repl using flowR v2.10.0, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.10.2, R grammar v14 (tree-sitter engine)
     R> :query @static-slice (11@sum) file://test/testfiles/example.R
     ```
     
@@ -345,7 +356,7 @@ It offers a wide variety of features, for example:
     N <- 10
     for(i in 1:(N-1)) sum <- sum + i + w
     sum
-    All queries together required ≈2 ms (1ms accuracy, total 2 ms)
+    All queries together required ≈3 ms (1ms accuracy, total 3 ms)
     ```
     
     
@@ -379,7 +390,7 @@ It offers a wide variety of features, for example:
          
 
 * 🚀 **fast call-graph, data-, and control-flow graphs**\
-  Within just [<i><span title="This measurement is automatically fetched from the latest benchmark!">99.2 ms</span></i> (as of Mar 13, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
+  Within just [<i><span title="This measurement is automatically fetched from the latest benchmark!">100.4 ms</span></i> (as of Apr 2, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
   _flowR_ can analyze the data- and control-flow of the average real-world R&nbsp;script. See the [benchmarks](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark) for more information,
   and consult the [wiki pages](https://github.com/flowr-analysis/flowr/wiki/dataflow-graph) for more details on the [dataflow graphs](https://github.com/flowr-analysis/flowr/wiki/dataflow-graph) as well as [call graphs](https://github.com/flowr-analysis/flowr/wiki/dataflow-graph#perspectives-cg).
 
@@ -415,7 +426,7 @@ It offers a wide variety of features, for example:
     
     ```shell
     $ docker run -it --rm eagleoutice/flowr # or npm run flowr 
-    flowR repl using flowR v2.10.0, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.10.2, R grammar v14 (tree-sitter engine)
     R> :dataflow* test/testfiles/example.R
     ```
     

package/abstract-interpretation/absint-visitor.d.ts

@@ -2,6 +2,7 @@ import type { ControlFlowInformation } from '../control-flow/control-flow-graph'
 import { CfgVertex } from '../control-flow/control-flow-graph';
 import type { SemanticCfgGuidedVisitorConfiguration } from '../control-flow/semantic-cfg-guided-visitor';
 import { SemanticCfgGuidedVisitor } from '../control-flow/semantic-cfg-guided-visitor';
+import { BuiltInProcName } from '../dataflow/environments/built-in-proc-name';
 import type { DataflowGraph } from '../dataflow/graph/graph';
 import { type DataflowGraphVertexFunctionCall, type DataflowGraphVertexVariableDefinition } from '../dataflow/graph/vertex';
 import type { NoInfo, RNode } from '../r-bridge/lang-4.x/ast/model/model';
@@ -9,8 +10,6 @@ import type { NormalizedAst, ParentInformation } from '../r-bridge/lang-4.x/ast/
 import type { NodeId } from '../r-bridge/lang-4.x/ast/model/processing/node-id';
 import { type AnyAbstractDomain } from './domains/abstract-domain';
 import type { StateAbstractDomain } from './domains/state-abstract-domain';
-import { MutableStateAbstractDomain } from './domains/state-abstract-domain';
-import { BuiltInProcName } from '../dataflow/environments/built-in-proc-name';
 export type AbsintVisitorConfiguration = Omit<SemanticCfgGuidedVisitorConfiguration<NoInfo, ControlFlowInformation, NormalizedAst>, 'defaultVisitingOrder' | 'defaultVisitingType'>;
 /**
  * A control flow graph visitor to perform abstract interpretation.
@@ -24,20 +23,24 @@ export declare abstract class AbstractInterpretationVisitor<Domain extends AnyAb
     /**
      * The abstract trace of the abstract interpretation visitor mapping node IDs to the abstract state at the respective node.
      */
-    protected readonly trace: Map<NodeId, MutableStateAbstractDomain<Domain>>;
+    private readonly trace;
     /**
      * The current abstract state domain at the currently processed AST node.
      */
     private _currentState;
-    /**
-     * A set of nodes representing variable definitions that have already been visited but whose assignment has not yet been processed.
-     */
-    private readonly unassigned;
     /**
      * Whether the current abstract state has been copied/cloned and is save to modify in place.
      */
     private stateCopied;
-    constructor(config: Config);
+    /**
+     * The current worklist stack of next vertex IDs to visit.
+     */
+    private stack;
+    /**
+     * A set of nodes representing variable definitions that have already been visited but whose assignment has not yet been processed.
+     */
+    private readonly unassigned;
+    constructor(config: Config, domain: Domain);
     get currentState(): StateAbstractDomain<Domain>;
     removeState(node: NodeId): void;
     updateState(node: NodeId, value: Domain): void;
@@ -100,6 +103,8 @@ export declare abstract class AbstractInterpretationVisitor<Domain extends AnyAb
     protected getPredecessorNodes(vertexId: NodeId): NodeId[];
     /** Gets each variable origin that has already been visited and whose assignment has already been processed */
     protected getVariableOrigins(nodeId: NodeId): NodeId[];
+    /** Checks whether a node represents a unsupported (environment-changing) function call (e.g. `eval`, `load`, `attach`, `rm`, ...) */
+    protected isUnsupportedFunctionCall(nodeId: NodeId): boolean;
     /** We only perform widening at `for`, `while`, or `repeat` loops with more than one ingoing CFG edge */
     protected isWideningPoint(nodeId: NodeId): boolean;
     /**

package/abstract-interpretation/absint-visitor.js

@@ -3,6 +3,8 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.AbstractInterpretationVisitor = void 0;
 const control_flow_graph_1 = require("../control-flow/control-flow-graph");
 const semantic_cfg_guided_visitor_1 = require("../control-flow/semantic-cfg-guided-visitor");
+const built_in_proc_name_1 = require("../dataflow/environments/built-in-proc-name");
+const df_helper_1 = require("../dataflow/graph/df-helper");
 const vertex_1 = require("../dataflow/graph/vertex");
 const model_1 = require("../r-bridge/lang-4.x/ast/model/model");
 const r_function_call_1 = require("../r-bridge/lang-4.x/ast/model/nodes/r-function-call");
@@ -10,8 +12,7 @@ const type_1 = require("../r-bridge/lang-4.x/ast/model/type");
 const assert_1 = require("../util/assert");
 const abstract_domain_1 = require("./domains/abstract-domain");
 const state_abstract_domain_1 = require("./domains/state-abstract-domain");
-const df_helper_1 = require("../dataflow/graph/df-helper");
-const built_in_proc_name_1 = require("../dataflow/environments/built-in-proc-name");
+const unsupported_functions_1 = require("./unsupported-functions");
 /**
  * A control flow graph visitor to perform abstract interpretation.
  *
@@ -26,17 +27,21 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
      * The current abstract state domain at the currently processed AST node.
      */
     _currentState;
-    /**
-     * A set of nodes representing variable definitions that have already been visited but whose assignment has not yet been processed.
-     */
-    unassigned = new Set();
     /**
      * Whether the current abstract state has been copied/cloned and is save to modify in place.
      */
     stateCopied = false;
-    constructor(config) {
+    /**
+     * The current worklist stack of next vertex IDs to visit.
+     */
+    stack = [];
+    /**
+     * A set of nodes representing variable definitions that have already been visited but whose assignment has not yet been processed.
+     */
+    unassigned = new Set();
+    constructor(config, domain) {
         super({ ...config, defaultVisitingOrder: 'forward', defaultVisitingType: 'exit' });
-        this._currentState = new state_abstract_domain_1.MutableStateAbstractDomain(new Map());
+        this._currentState = state_abstract_domain_1.MutableStateAbstractDomain.top(domain);
     }
     get currentState() {
         return this._currentState;
@@ -125,7 +130,7 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
         const exitPoints = this.config.controlFlow.exitPoints.map(id => this.getCfgVertex(id)).filter(assert_1.isNotUndefined);
         const exitNodes = exitPoints.map(control_flow_graph_1.CfgVertex.getRootId).filter(assert_1.isNotUndefined);
         const states = exitNodes.map(node => this.trace.get(node)).filter(assert_1.isNotUndefined);
-        return abstract_domain_1.AbstractDomain.joinAll(states, this._currentState.top());
+        return abstract_domain_1.AbstractDomain.joinAll(states, this._currentState.bottom());
     }
     /**
      * Gets the inferred abstract trace mapping AST nodes to the inferred abstract state at the respective node.
@@ -140,15 +145,16 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
         this.unassigned.clear();
     }
     startVisitor(start) {
-        const stack = Array.from(start);
-        while (stack.length > 0) {
-            const current = stack.pop();
+        this.stack = Array.from(start);
+        while (this.stack.length > 0) {
+            const current = this.stack.pop();
             if (!this.visitNode(current)) {
                 continue;
             }
-            for (const next of this.config.controlFlow.graph.ingoingEdges(current)?.keys().toArray().reverse() ?? []) {
-                if (!stack.includes(next)) { // prevent double entries in working list
-                    stack.push(next);
+            const successors = this.config.controlFlow.graph.ingoingEdges(current)?.keys().toArray().reverse() ?? [];
+            for (const next of successors) {
+                if (!this.stack.includes(next)) { // prevent double entries in working list
+                    this.stack.push(next);
                 }
             }
         }
@@ -162,18 +168,18 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
         const predecessors = this.getPredecessorNodes(control_flow_graph_1.CfgVertex.getId(vertex));
         const predecessorStates = predecessors.map(pred => this.trace.get(pred)).filter(assert_1.isNotUndefined);
         // retrieve new abstract state by joining states of predecessor nodes
-        if (predecessorStates.length === 1) {
-            this._currentState = predecessorStates[0];
+        if (predecessorStates.length <= 1) {
+            this._currentState = predecessorStates[0] ?? this._currentState.top();
         }
         else {
-            this._currentState = abstract_domain_1.AbstractDomain.joinAll(predecessorStates, this._currentState.top());
+            this._currentState = abstract_domain_1.AbstractDomain.joinAll(predecessorStates);
             this.stateCopied = true;
         }
         const nodeId = control_flow_graph_1.CfgVertex.getRootId(vertex);
         // differentiate between widening points and other vertices
         if (this.isWideningPoint(nodeId)) {
-            const oldState = this.trace.get(nodeId) ?? this._currentState.top();
-            if (this.shouldWiden(vertex)) {
+            const oldState = this.trace.get(nodeId);
+            if (oldState !== undefined && this.shouldWiden(vertex)) {
                 this._currentState = oldState.widen(this._currentState);
                 this.stateCopied = true;
             }
@@ -182,12 +188,12 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
             const visitedCount = this.visited.get(nodeId) ?? 0;
             this.visited.set(nodeId, visitedCount + 1);
             // continue visiting after widening point if visited for the first time or the state changed
-            return visitedCount === 0 || !oldState.equals(this._currentState);
+            return visitedCount === 0 || !oldState?.equals(this._currentState);
         }
         else {
             this.onVisitNode(vertexId);
-            // discard the inferred abstract state when encountering functions with unknown side effects (e.g. `eval`)
-            if (this.config.dfg.unknownSideEffects.has(nodeId)) {
+            // discard the inferred abstract state when encountering unsupported function calls
+            if (this.isUnsupportedFunctionCall(nodeId)) {
                 this._currentState = this._currentState.top();
                 this.stateCopied = true;
             }
@@ -197,7 +203,7 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
             const visitedCount = this.visited.get(nodeId) ?? 0;
             this.visited.set(nodeId, visitedCount + 1);
             // continue visiting if vertex is not a join vertex or number of visits of predecessors is the same
-            return predecessors.length <= 1 || predecessorVisits.every(visits => visits === predecessorVisits[0]);
+            return predecessors.length <= 1 || this.stack.length === 0 || predecessorVisits.every(visits => visits === predecessorVisits[0]);
         }
     }
     onDispatchFunctionCallOrigin(call, origin) {
@@ -278,14 +284,17 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
             .map(origin => origin.id)
             .filter(origin => this.trace.has(origin) && !this.unassigned.has(origin)) ?? [];
     }
+    /** Checks whether a node represents a unsupported (environment-changing) function call (e.g. `eval`, `load`, `attach`, `rm`, ...) */
+    isUnsupportedFunctionCall(nodeId) {
+        return unsupported_functions_1.UnsupportedFunctions.isUnsupportedCall(this.getDataflowGraph(nodeId));
+    }
     /** We only perform widening at `for`, `while`, or `repeat` loops with more than one ingoing CFG edge */
     isWideningPoint(nodeId) {
         const ingoingEdges = this.config.controlFlow.graph.outgoingEdges(nodeId)?.size; // outgoing dependency edges are ingoing CFG edges
         if (ingoingEdges === undefined || ingoingEdges <= 1) {
             return false;
         }
-        const node = this.getNormalizedAst(nodeId);
-        if (model_1.RLoopConstructs.is(node)) {
+        else if (model_1.RLoopConstructs.is(this.getNormalizedAst(nodeId))) {
             return true;
         }
         const dataflowVertex = this.getDataflowGraph(nodeId);

package/abstract-interpretation/data-frame/dataframe-domain.d.ts

@@ -14,7 +14,6 @@ export type DataFrameShapeProperty<Property extends keyof AbstractDataFrameShape
  * The data frame abstract domain as product domain of a column names domain, column count domain, and row count domain.
  */
 export declare class DataFrameDomain extends ProductDomain<AbstractDataFrameShape> {
-    constructor(value: AbstractDataFrameShape);
     create(value: AbstractDataFrameShape): this;
     /**
      * The current abstract value of the column names domain.
@@ -30,5 +29,5 @@ export declare class DataFrameDomain extends ProductDomain<AbstractDataFrameShap
     get rows(): AbstractDataFrameShape['rows'];
     static bottom(maxColNames?: number): DataFrameDomain;
     static top(maxColNames?: number): DataFrameDomain;
-    private static refine;
+    protected reduce(value: AbstractDataFrameShape): AbstractDataFrameShape;
 }

package/abstract-interpretation/data-frame/dataframe-domain.js

@@ -8,13 +8,6 @@ const set_range_domain_1 = require("../domains/set-range-domain");
  * The data frame abstract domain as product domain of a column names domain, column count domain, and row count domain.
  */
 class DataFrameDomain extends product_domain_1.ProductDomain {
-    constructor(value) {
-        super(DataFrameDomain.refine({
-            colnames: value.colnames.create(value.colnames.value),
-            cols: value.cols.create(value.cols.value),
-            rows: value.rows.create(value.rows.value)
-        }));
-    }
     create(value) {
         return new DataFrameDomain(value);
     }
@@ -50,17 +43,23 @@ class DataFrameDomain extends product_domain_1.ProductDomain {
             rows: positive_interval_domain_1.PosIntervalDomain.top()
         });
     }
-    static refine(value) {
+    reduce(value) {
         if (value.colnames.isValue() && value.cols.isValue()) {
             if (value.colnames.value.min.size >= value.cols.value[1]) {
-                value.colnames = value.colnames.meet({ min: new Set(), range: value.colnames.value.min });
+                value = {
+                    ...value,
+                    colnames: value.colnames.meet({ min: new Set(), range: value.colnames.value.min })
+                };
             }
-            if (value.colnames.isValue()) {
-                const minColNames = value.colnames.value.min.size;
-                const maxColNames = value.colnames.isFinite() ? value.colnames.value.min.size + value.colnames.value.range.size : Infinity;
-                if (minColNames > value.cols.value[0] || maxColNames < value.cols.value[1]) {
-                    value.cols = value.cols.meet([minColNames, maxColNames]);
-                }
+        }
+        if (value.colnames.isValue() && value.cols.isValue()) {
+            const minColNames = value.colnames.value.min.size;
+            const maxColNames = value.colnames.isFinite() ? value.colnames.value.min.size + value.colnames.value.range.size : Infinity;
+            if (minColNames > value.cols.value[0] || maxColNames < value.cols.value[1]) {
+                value = {
+                    ...value,
+                    cols: value.cols.meet([minColNames, maxColNames])
+                };
             }
         }
         return value;

package/abstract-interpretation/data-frame/mappers/access-mapper.js

@@ -3,17 +3,11 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.mapDataFrameAccess = mapDataFrameAccess;
 exports.isStringBasedAccess = isStringBasedAccess;
 const config_1 = require("../../../config");
+const r_argument_1 = require("../../../r-bridge/lang-4.x/ast/model/nodes/r-argument");
 const r_function_call_1 = require("../../../r-bridge/lang-4.x/ast/model/nodes/r-function-call");
 const type_1 = require("../../../r-bridge/lang-4.x/ast/model/type");
 const resolve_args_1 = require("../resolve-args");
 const arguments_1 = require("./arguments");
-/**
- * Special named arguments of index-based access operators
- */
-const SpecialAccessArgumentsMapper = {
-    '[': ['drop'],
-    '[[': ['exact']
-};
 /**
  * Maps a concrete data frame access operation to abstract data frame operations.
  * @param node      - The R node of the access
@@ -50,7 +44,7 @@ function mapDataFrameIndexColRowAccess(access, inference, info) {
     const dataFrame = access.accessed;
     const drop = (0, arguments_1.getArgumentValue)(access.access, 'drop', info);
     const exact = (0, arguments_1.getArgumentValue)(access.access, 'exact', info);
-    const args = getAccessArgs(access.operator, access.access);
+    const args = access.access.filter(arg => r_argument_1.RArgument.isEmpty(arg) || r_argument_1.RArgument.isUnnamed(arg));
     if (!(0, arguments_1.isDataFrameArgument)(dataFrame, inference)) {
         return;
     }
@@ -147,13 +141,6 @@ function mapDataFrameIndexColRowAccess(access, inference, info) {
     }
     return result;
 }
-/**
- * Removes all special named arguments from the arguments of an access operator (i.e. arguments like "drop" and "exact").
- */
-function getAccessArgs(operator, args) {
-    const specialArgs = SpecialAccessArgumentsMapper[operator];
-    return args.filter(arg => arg === r_function_call_1.EmptyArgument || arg.name === undefined || !specialArgs.includes((0, resolve_args_1.unquoteArgument)(arg.name.content)));
-}
 /**
  * Checks whether an access node represents a string-based access (`$` or `@`), and no index-based access (`[` or `[[`).
  */

package/abstract-interpretation/data-frame/mappers/arguments.d.ts

@@ -1,9 +1,9 @@
 import type { ResolveInfo } from '../../../dataflow/eval/resolve/alias-tracking';
-import type { DataflowGraph } from '../../../dataflow/graph/graph';
+import { type DataflowGraph } from '../../../dataflow/graph/graph';
 import { RNode } from '../../../r-bridge/lang-4.x/ast/model/model';
-import type { RArgument } from '../../../r-bridge/lang-4.x/ast/model/nodes/r-argument';
-import { type RFunctionArgument, type RFunctionCall, EmptyArgument } from '../../../r-bridge/lang-4.x/ast/model/nodes/r-function-call';
-import type { RSymbol } from '../../../r-bridge/lang-4.x/ast/model/nodes/r-symbol';
+import { RArgument } from '../../../r-bridge/lang-4.x/ast/model/nodes/r-argument';
+import { type PotentiallyEmptyRArgument, type RFunctionCall, EmptyArgument } from '../../../r-bridge/lang-4.x/ast/model/nodes/r-function-call';
+import { RSymbol } from '../../../r-bridge/lang-4.x/ast/model/nodes/r-symbol';
 import type { ParentInformation } from '../../../r-bridge/lang-4.x/ast/model/processing/decorate';
 import { RNull } from '../../../r-bridge/lang-4.x/convert-values';
 import type { RParseRequest } from '../../../r-bridge/retriever';
@@ -44,14 +44,14 @@ export declare function filterValidNames(colnames: (string | undefined)[] | unde
  * @param info     - Argument resolve information
  * @returns The resolved value of the argument or `undefined`
  */
-export declare function getArgumentValue<T>(args: readonly RFunctionArgument<ParentInformation>[], argument: FunctionParameterLocation<T> | string, info: ResolveInfo): string | number | boolean | (string | number | boolean)[] | T | undefined;
+export declare function getArgumentValue<T>(args: readonly PotentiallyEmptyRArgument<ParentInformation>[], argument: FunctionParameterLocation<T> | string, info: ResolveInfo): string | number | boolean | (string | number | boolean)[] | T | undefined;
 /**
  * Gets all effective argument from a list of arguments by removing all arguments whose names should be excluded.
  * @param args     - The list of arguments to filter
  * @param excluded - The names of the arguments to exclude
  * @returns The filtered list of arguments
  */
-export declare function getEffectiveArgs(args: readonly RFunctionArgument<ParentInformation>[], excluded: string[]): readonly RFunctionArgument<ParentInformation>[];
+export declare function getEffectiveArgs(args: readonly PotentiallyEmptyRArgument<ParentInformation>[], excluded: readonly string[]): readonly PotentiallyEmptyRArgument<ParentInformation>[];
 /**
  * Gets an argument specified as {@link FunctionParameterLocation} from a list of arguments.
  * @param args     - The arguments to get the requested argument from
@@ -59,14 +59,14 @@ export declare function getEffectiveArgs(args: readonly RFunctionArgument<Parent
  * @param info     - Argument resolve information
  * @returns An argument matching the specified `argument` or `undefined`
  */
-export declare function getFunctionArgument(args: readonly RFunctionArgument<ParentInformation>[], argument: FunctionParameterLocation<unknown> | string, info: ResolveInfo): RFunctionArgument<ParentInformation> | undefined;
+export declare function getFunctionArgument(args: readonly PotentiallyEmptyRArgument<ParentInformation>[], argument: FunctionParameterLocation<unknown> | string, info: ResolveInfo): PotentiallyEmptyRArgument<ParentInformation> | undefined;
 /**
  * Get all function arguments of a function call node in the data flow graph.
  * @param node - The function call node to get the arguments for
  * @param dfg  - The data flow graph for retrieving the arguments
  * @returns The arguments of the function call in the data flow graph
  */
-export declare function getFunctionArguments(node: RFunctionCall<ParentInformation>, dfg: DataflowGraph): readonly RFunctionArgument<ParentInformation>[];
+export declare function getFunctionArguments(node: RFunctionCall<ParentInformation>, dfg: DataflowGraph): readonly PotentiallyEmptyRArgument<ParentInformation>[];
 /**
  * Gets all nested symbols in an expression that have no outgoing edges in the data flow graph.
  * @param expression - The expression to get the symbols from
@@ -81,7 +81,7 @@ export declare function getUnresolvedSymbolsInExpression(expression: RNode<Paren
  * @param info     - Argument resolve information
  * @returns Whether the arguments contain any critical argument
  */
-export declare function hasCriticalArgument(args: readonly RFunctionArgument<ParentInformation>[], critical: (FunctionParameterLocation<unknown> | string)[] | undefined, info: ResolveInfo): boolean;
+export declare function hasCriticalArgument(args: readonly PotentiallyEmptyRArgument<ParentInformation>[], critical: (FunctionParameterLocation<unknown> | string)[] | undefined, info: ResolveInfo): boolean;
 /**
  * Checks if a given argument has an inferred data frame shape and therefore represents a data frame
  * @param arg       - The argument to check
@@ -89,20 +89,14 @@ export declare function hasCriticalArgument(args: readonly RFunctionArgument<Par
  * @returns Whether the argument represents a data frame
  */
 export declare function isDataFrameArgument(arg: RNode<ParentInformation> | undefined, inference: DataFrameShapeInferenceVisitor): arg is RNode<ParentInformation>;
-export declare function isDataFrameArgument(arg: RFunctionArgument<ParentInformation> | undefined, inference: DataFrameShapeInferenceVisitor): arg is RArgument<ParentInformation> & {
+export declare function isDataFrameArgument(arg: PotentiallyEmptyRArgument<ParentInformation> | undefined, inference: DataFrameShapeInferenceVisitor): arg is RArgument<ParentInformation> & {
     value: RNode<ParentInformation>;
 };
-/**
- * Checks whether a function argument is a names argument.
- */
-export declare function isNamedArgument(arg: RFunctionArgument<ParentInformation> | undefined): arg is RArgument<ParentInformation> & {
-    name: RSymbol<ParentInformation>;
-};
 /**
  * Checks whether a node is `NULL` in R (represents a `NULL` symbol).
  */
 export declare function isRNull(node: RNode<ParentInformation> | undefined): node is RSymbol<ParentInformation, typeof RNull>;
-export declare function isRNull(node: RFunctionArgument<ParentInformation> | undefined): node is RArgument<ParentInformation> & {
+export declare function isRNull(node: PotentiallyEmptyRArgument<ParentInformation> | undefined): node is RArgument<ParentInformation> & {
     value: RSymbol<ParentInformation, typeof RNull>;
 };
 /**