@eagleoutice/flowr 2.9.8 → 2.9.10

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.9.7, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.9.9, R grammar v14 (tree-sitter engine)
     R> :query @linter "read.csv(\"/root/x.txt\")"
     ```
     
@@ -33,19 +33,19 @@ It offers a wide variety of features, for example:
     
     
     ```text
-    Query: linter (2 ms)
+    Query: linter (3 ms)
        ╰ Deprecated Functions (deprecated-functions):
-           ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0
+           ╰ Metadata: totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 1, 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: 1, processTimeMs: 0
+           ╰ Metadata: totalReads: 1, totalUnknown: 0, totalWritesBeforeAlways: 0, totalValid: 0, searchTimeMs: 0, 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: 0, processTimeMs: 0
+           ╰ Metadata: totalConsidered: 1, totalUnknown: 0, searchTimeMs: 1, processTimeMs: 0
        ╰ Unused Definitions (unused-definitions):
            ╰ Metadata: totalConsidered: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Naming Convention (naming-convention):
@@ -53,12 +53,12 @@ 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: 1, processTimeMs: 0
+           ╰ Metadata: numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Dead Code (dead-code):
-           ╰ Metadata: consideredNodes: 5, searchTimeMs: 0, processTimeMs: 0
+           ╰ Metadata: consideredNodes: 5, searchTimeMs: 1, processTimeMs: 0
        ╰ Useless Loops (useless-loop):
            ╰ Metadata: numOfUselessLoops: 0, searchTimeMs: 0, processTimeMs: 0
-    All queries together required ≈2 ms (1ms accuracy, total 3 ms)
+    All queries together required ≈3 ms (1ms accuracy, total 4 ms)
     ```
     
     
@@ -82,7 +82,7 @@ It offers a wide variety of features, for example:
     
     Query: **linter** (3 ms)\
        ╰ **Deprecated Functions** (deprecated-functions):\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0</code>\
+    &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):\
     &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\
@@ -92,7 +92,7 @@ It offers a wide variety of features, for example:
     &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):\
@@ -100,7 +100,7 @@ It offers a wide variety of features, for example:
     &nbsp;&nbsp;&nbsp;╰ **Network Functions** (network-functions):\
     &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalCalls: 0, totalFunctionDefinitions: 0, searchTimeMs: 0, processTimeMs: 0</code>\
     &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: 1</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 1, 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;╰ **Useless Loops** (useless-loop):\
@@ -109,7 +109,7 @@ It offers a wide variety of features, for example:
     
     <details> <summary style="color:gray">Show Detailed Results as Json</summary>
     
-    The analysis required _3.3 ms_ (including parsing and normalization and the query) within the generation environment.
+    The analysis required _3.1 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.
@@ -126,7 +126,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalCalls": 0,
               "totalFunctionDefinitions": 0,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -181,7 +181,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalConsidered": 1,
               "totalUnknown": 0,
-              "searchTimeMs": 1,
+              "searchTimeMs": 0,
               "processTimeMs": 0
             }
           },
@@ -217,8 +217,8 @@ It offers a wide variety of features, for example:
               "numOperations": 0,
               "numAccesses": 0,
               "totalAccessed": 0,
-              "searchTimeMs": 0,
-              "processTimeMs": 1
+              "searchTimeMs": 1,
+              "processTimeMs": 0
             }
           },
           "dead-code": {
@@ -308,7 +308,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.9.7, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.9.9, R grammar v14 (tree-sitter engine)
     R> :query @static-slice (11@sum) file://test/testfiles/example.R
     ```
     
@@ -322,7 +322,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 ≈3 ms (1ms accuracy, total 3 ms)
+    All queries together required ≈3 ms (1ms accuracy, total 4 ms)
     ```
     
     
@@ -356,7 +356,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!">111.7 ms</span></i> (as of Feb 7, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
+  Within just [<i><span title="This measurement is automatically fetched from the latest benchmark!">112.3 ms</span></i> (as of Feb 9, 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/wiki/dataflow-graph) for more details on the [dataflow graphs](https://github.com/flowr-analysis/flowr/wiki/wiki/dataflow-graph) as well as [call graphs](https://github.com/flowr-analysis/flowr/wiki/wiki/dataflow-graph#perspectives-cg).
 
@@ -392,7 +392,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.9.7, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.9.9, R grammar v14 (tree-sitter engine)
     R> :dataflow* test/testfiles/example.R
     ```
     
@@ -401,7 +401,7 @@ It offers a wide variety of features, for example:
     
     
     ```text
-    https://mermaid.live/view#base64:eyJjb2RlIjoiZmxvd2NoYXJ0IEJUXG4gICAgMChbXCJgIzkxO1JTeW1ib2wjOTM7IHRlc3RcbiAgICAgICgwKVxuICAgICAgKjEuMS00KmBcIl0pXG4gICAgMShbXCJgIzkxO1JTeW1ib2wjOTM7IHRlc3RmaWxlc1xuICAgICAgKDEpXG4gICAgICAqMS42LTE0KmBcIl0pXG4gICAgMltbXCJgIzkxO1JCaW5hcnlPcCM5MzsgL1xuICAgICAgKDIpXG4gICAgICAqMS4xLTE0KlxuICAgICgwLCAxKWBcIl1dXG4gICAgYnVpbHQtaW46X1tcImBCdWlsdC1Jbjpcbi9gXCJdXG4gICAgc3R5bGUgYnVpbHQtaW46XyBzdHJva2U6Z3JheSxmaWxsOmdyYXksc3Ryb2tlLXdpZHRoOjJweCxvcGFjaXR5Oi44O1xuICAgIDMoW1wiYCM5MTtSU3ltYm9sIzkzOyBleGFtcGxlLlJcbiAgICAgICgzKVxuICAgICAgKjEuMTYtMjQqYFwiXSlcbiAgICA0W1tcImAjOTE7UkJpbmFyeU9wIzkzOyAvXG4gICAgICAoNClcbiAgICAgICoxLjEtMjQqXG4gICAgKDIsIDMpYFwiXV1cbiAgICAyIC0tPnxcInJlYWRzLCBhcmd1bWVudFwifCAwXG4gICAgMiAtLT58XCJyZWFkcywgYXJndW1lbnRcInwgMVxuICAgIDIgLS4tPnxcInJlYWRzLCBjYWxsc1wifCBidWlsdC1pbjpfXG4gICAgbGlua1N0eWxlIDIgc3Ryb2tlOmdyYXk7XG4gICAgNCAtLT58XCJyZWFkcywgYXJndW1lbnRcInwgMlxuICAgIDQgLS0+fFwicmVhZHMsIGFyZ3VtZW50XCJ8IDNcbiAgICA0IC0uLT58XCJyZWFkcywgY2FsbHNcInwgYnVpbHQtaW46X1xuICAgIGxpbmtTdHlsZSA1IHN0cm9rZTpncmF5OyIsIm1lcm1haWQiOnsiYXV0b1N5bmMiOnRydWV9fQ==
+    https://mermaid.live/view#base64:eyJjb2RlIjoiZmxvd2NoYXJ0IEJUXG4gICAgMChbXCJgIzkxO1JTeW1ib2wjOTM7IHRlc3RcbiAgICAgICgwKVxuICAgICAgKjEuMS00KmBcIl0pXG4gICAlJSBObyBlZGdlcyBmb3VuZCBmb3IgMFxuICAgIDEoW1wiYCM5MTtSU3ltYm9sIzkzOyB0ZXN0ZmlsZXNcbiAgICAgICgxKVxuICAgICAgKjEuNi0xNCpgXCJdKVxuICAgJSUgTm8gZWRnZXMgZm91bmQgZm9yIDFcbiAgICAyW1tcImAjOTE7UkJpbmFyeU9wIzkzOyAvXG4gICAgICAoMilcbiAgICAgICoxLjEtMTQqXG4gICAgKDAsIDEpYFwiXV1cbiAgICBidWlsdC1pbjpfW1wiYEJ1aWx0LUluOlxuL2BcIl1cbiAgICBzdHlsZSBidWlsdC1pbjpfIHN0cm9rZTpncmF5LGZpbGw6Z3JheSxzdHJva2Utd2lkdGg6MnB4LG9wYWNpdHk6Ljg7XG4gICAgMyhbXCJgIzkxO1JTeW1ib2wjOTM7IGV4YW1wbGUuUlxuICAgICAgKDMpXG4gICAgICAqMS4xNi0yNCpgXCJdKVxuICAgJSUgTm8gZWRnZXMgZm91bmQgZm9yIDNcbiAgICA0W1tcImAjOTE7UkJpbmFyeU9wIzkzOyAvXG4gICAgICAoNClcbiAgICAgICoxLjEtMjQqXG4gICAgKDIsIDMpYFwiXV1cbiAgICAyIC0tPnxcInJlYWRzLCBhcmd1bWVudFwifCAwXG4gICAgMiAtLT58XCJyZWFkcywgYXJndW1lbnRcInwgMVxuICAgIDIgLS4tPnxcInJlYWRzLCBjYWxsc1wifCBidWlsdC1pbjpfXG4gICAgbGlua1N0eWxlIDIgc3Ryb2tlOmdyYXk7XG4gICAgNCAtLT58XCJyZWFkcywgYXJndW1lbnRcInwgMlxuICAgIDQgLS0+fFwicmVhZHMsIGFyZ3VtZW50XCJ8IDNcbiAgICA0IC0uLT58XCJyZWFkcywgY2FsbHNcInwgYnVpbHQtaW46X1xuICAgIGxpbmtTdHlsZSA1IHN0cm9rZTpncmF5OyIsIm1lcm1haWQiOnsiYXV0b1N5bmMiOnRydWV9fQ==
     ```
     
     
@@ -416,6 +416,7 @@ It offers a wide variety of features, for example:
         1{{"`#91;RNumber#93; 0
           (1)
           *1.8*`"}}
+       %% No edges found for 1
         0["`#91;RSymbol#93; sum
           (0)
           *1.1-3*`"]
@@ -429,6 +430,7 @@ It offers a wide variety of features, for example:
         4{{"`#91;RNumber#93; 1
           (4)
           *2.12*`"}}
+       %% No edges found for 4
         3["`#91;RSymbol#93; product
           (3)
           *2.1-7*`"]
@@ -439,6 +441,7 @@ It offers a wide variety of features, for example:
         7{{"`#91;RNumber#93; 7
           (7)
           *3.6*`"}}
+       %% No edges found for 7
         6["`#91;RSymbol#93; w
           (6)
           *3.1*`"]
@@ -449,6 +452,7 @@ It offers a wide variety of features, for example:
         10{{"`#91;RNumber#93; 10
           (10)
           *4.6-7*`"}}
+       %% No edges found for 10
         9["`#91;RSymbol#93; N
           (9)
           *4.1*`"]
@@ -462,12 +466,14 @@ It offers a wide variety of features, for example:
         13{{"`#91;RNumber#93; 1
           (13)
           *6.11*`"}}
+       %% No edges found for 13
         16(["`#91;RSymbol#93; N
           (16)
           *6.14*`"])
         17{{"`#91;RNumber#93; 1
           (17)
           *6.16*`"}}
+       %% No edges found for 17
         18[["`#91;RBinaryOp#93; #45;
           (18)
           *6.14-16*
@@ -544,16 +550,15 @@ It offers a wide variety of features, for example:
         38{{"`#91;RString#93; #34;Sum#58;#34;
           (38)
           *11.5-10*`"}}
+       %% No edges found for 38
         40(["`#91;RSymbol#93; sum
           (40)
           *11.13-15*`"])
-        built-in:sum["`Built-In:
-    sum`"]
-        style built-in:sum stroke:gray,fill:gray,stroke-width:2px,opacity:.8;
         42{{"`#91;RString#93; #34;
     #34;
           (42)
           *11.18-21*`"}}
+       %% No edges found for 42
         44[["`#91;RFunctionCall#93; cat
           (44)
           *11.1-22*
@@ -564,6 +569,7 @@ It offers a wide variety of features, for example:
         46{{"`#91;RString#93; #34;Product#58;#34;
           (46)
           *12.5-14*`"}}
+       %% No edges found for 46
         48(["`#91;RSymbol#93; product
           (48)
           *12.17-23*`"])
@@ -571,6 +577,7 @@ It offers a wide variety of features, for example:
     #34;
           (50)
           *12.26-29*`"}}
+       %% No edges found for 50
         52[["`#91;RFunctionCall#93; cat
           (52)
           *12.1-30*
@@ -680,24 +687,22 @@ It offers a wide variety of features, for example:
         linkStyle 75 stroke:gray;
         40 -->|"reads"| 0
         40 -->|"reads"| 23
-        40 -.->|"reads"| built-in:sum
-        linkStyle 78 stroke:gray;
         44 -->|"argument"| 38
         44 -->|"reads, argument"| 40
         44 -->|"argument"| 42
         44 -.->|"reads, calls"| built-in:cat
-        linkStyle 82 stroke:gray;
+        linkStyle 81 stroke:gray;
         48 -->|"reads"| 3
         48 -->|"reads"| 30
         52 -->|"argument"| 46
         52 -->|"reads, argument"| 48
         52 -->|"argument"| 50
         52 -.->|"reads, calls"| built-in:cat
-        linkStyle 88 stroke:gray;
+        linkStyle 87 stroke:gray;
     ```
     
     	
-    (The analysis required _1.8 ms_ (including parse and normalize, using the [tree-sitter](https://github.com/flowr-analysis/flowr/wiki/Engines) engine) within the generation environment.)
+    (The analysis required _1.9 ms_ (including parse and normalize, using the [tree-sitter](https://github.com/flowr-analysis/flowr/wiki/Engines) engine) within the generation environment.)
     
     
     

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

@@ -10,31 +10,37 @@ 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';
-export interface AbsintVisitorConfiguration<Domain extends AnyAbstractDomain> extends Omit<SemanticCfgGuidedVisitorConfiguration<NoInfo, ControlFlowInformation, NormalizedAst>, 'defaultVisitingOrder' | 'defaultVisitingType'> {
-    readonly domain: StateAbstractDomain<Domain>;
-}
+import { MutableStateAbstractDomain } from './domains/state-abstract-domain';
+export type AbsintVisitorConfiguration = Omit<SemanticCfgGuidedVisitorConfiguration<NoInfo, ControlFlowInformation, NormalizedAst>, 'defaultVisitingOrder' | 'defaultVisitingType'>;
 /**
  * A control flow graph visitor to perform abstract interpretation.
  *
  * However, the visitor does not yet support inter-procedural abstract interpretation and abstract condition semantics.
  */
-export declare abstract class AbstractInterpretationVisitor<Domain extends AnyAbstractDomain, Config extends AbsintVisitorConfiguration<Domain> = AbsintVisitorConfiguration<Domain>> extends SemanticCfgGuidedVisitor<NoInfo, ControlFlowInformation, NormalizedAst, DataflowGraph, Config & {
+export declare abstract class AbstractInterpretationVisitor<Domain extends AnyAbstractDomain, Config extends AbsintVisitorConfiguration = AbsintVisitorConfiguration> extends SemanticCfgGuidedVisitor<NoInfo, ControlFlowInformation, NormalizedAst, DataflowGraph, Config & {
     defaultVisitingOrder: 'forward';
     defaultVisitingType: 'exit';
 }> {
     /**
      * The abstract trace of the abstract interpretation visitor mapping node IDs to the abstract state at the respective node.
      */
-    protected readonly trace: Map<NodeId, StateAbstractDomain<Domain>>;
+    protected readonly trace: Map<NodeId, MutableStateAbstractDomain<Domain>>;
     /**
      * The current abstract state domain at the currently processed AST node.
      */
-    protected currentState: StateAbstractDomain<Domain>;
+    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);
+    get currentState(): StateAbstractDomain<Domain>;
+    removeState(node: NodeId): void;
+    updateState(node: NodeId, value: Domain): void;
     /**
      * Resolves the inferred abstract value of an AST node.
      * This requires that the abstract interpretation visitor has been completed, or at least started.
@@ -62,6 +68,7 @@ export declare abstract class AbstractInterpretationVisitor<Domain extends AnyAb
      */
     getAbstractTrace(): ReadonlyMap<NodeId, StateAbstractDomain<Domain>>;
     start(): void;
+    protected startVisitor(start: readonly NodeId[]): void;
     protected visitNode(vertexId: NodeId): boolean;
     protected onDispatchFunctionCallOrigin(call: DataflowGraphVertexFunctionCall, origin: BuiltInProcName): void;
     protected onVariableDefinition({ vertex }: {
@@ -93,21 +100,16 @@ 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[];
-    /** We only perform widening at `for`, `while`, or `repeat` loops with more than one incoming CFG edge */
+    /** We only perform widening at `for`, `while`, or `repeat` loops with more than one ingoing CFG edge */
     protected isWideningPoint(nodeId: NodeId): boolean;
-    /**
-     * Checks whether to continue visiting the control flow graph after a widening point.
-     * By default, we only continue visiting if the widening point is visited for the first time or the abstract state at the widening point changed.
-     */
-    protected shouldContinueVisiting(wideningPoint: CfgVertex, oldState: StateAbstractDomain<Domain>): boolean;
     /**
      * Checks whether a control flow graph vertex should be skipped during visitation.
-     * By default, we only process vertices of leaf nodes and exit vertices (no entry nodes of complex nodes).
+     * By default, we only process entry vertices of widening points, vertices of leaf nodes, and exit vertices (no entry nodes of complex nodes).
      */
     protected shouldSkipVertex(vertex: CfgVertex): boolean;
     /**
      * Whether widening should be performed at a widening point.
-     * By default, we perform widening when the number of visitation of the widening point reaches the widening threshold of the config.
+     * By default, we perform widening when the number of visits of the widening point reaches the widening threshold of the config.
      */
     protected shouldWiden(wideningPoint: CfgVertex): boolean;
 }

package/abstract-interpretation/absint-visitor.js

@@ -10,6 +10,7 @@ const r_function_call_1 = require("../r-bridge/lang-4.x/ast/model/nodes/r-functi
 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");
 /**
  * A control flow graph visitor to perform abstract interpretation.
  *
@@ -23,14 +24,35 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
     /**
      * The current abstract state domain at the currently processed AST node.
      */
-    currentState;
+    _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) {
         super({ ...config, defaultVisitingOrder: 'forward', defaultVisitingType: 'exit' });
-        this.currentState = config.domain.bottom();
+        this._currentState = new state_abstract_domain_1.MutableStateAbstractDomain(new Map());
+    }
+    get currentState() {
+        return this._currentState;
+    }
+    removeState(node) {
+        if (!this.stateCopied) {
+            this._currentState = this._currentState.create(this.currentState.value);
+            this.stateCopied = true;
+        }
+        this._currentState.remove(node);
+    }
+    updateState(node, value) {
+        if (!this.stateCopied) {
+            this._currentState = this._currentState.create(this.currentState.value);
+            this.stateCopied = true;
+        }
+        this._currentState.set(node, value);
     }
     /**
      * Resolves the inferred abstract value of an AST node.
@@ -49,7 +71,7 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
             return state.get(node.info.id);
         }
         const vertex = this.getDataflowGraph(node.info.id);
-        const call = vertex?.tag === vertex_1.VertexType.FunctionCall ? vertex : undefined;
+        const call = (0, vertex_1.isFunctionCallVertex)(vertex) ? vertex : undefined;
         const origins = Array.isArray(call?.origin) ? call.origin : [];
         if (node.type === type_1.RType.Symbol) {
             const values = this.getVariableOrigins(node.info.id).map(origin => state?.get(origin));
@@ -100,9 +122,9 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
      */
     getEndState() {
         const exitPoints = this.config.controlFlow.exitPoints.map(id => this.getCfgVertex(id)).filter(assert_1.isNotUndefined);
-        const exitNodes = exitPoints.map(vertex => control_flow_graph_1.CfgVertex.getRootId(vertex)).filter(assert_1.isNotUndefined);
-        const states = exitNodes.map(node => this.getAbstractState(node)).filter(assert_1.isNotUndefined);
-        return this.config.domain.bottom().joinAll(states);
+        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());
     }
     /**
      * Gets the inferred abstract trace mapping AST nodes to the inferred abstract state at the respective node.
@@ -116,38 +138,66 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
         super.start();
         this.unassigned.clear();
     }
+    startVisitor(start) {
+        const stack = Array.from(start);
+        while (stack.length > 0) {
+            const current = 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);
+                }
+            }
+        }
+    }
     visitNode(vertexId) {
         const vertex = this.getCfgVertex(vertexId);
-        if (vertex === undefined) {
+        // skip exit vertices of widening points and entry vertices of complex nodes
+        if (vertex === undefined || this.shouldSkipVertex(vertex)) {
             return true;
         }
+        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];
+        }
+        else {
+            this._currentState = abstract_domain_1.AbstractDomain.joinAll(predecessorStates, this._currentState.top());
+            this.stateCopied = true;
+        }
         const nodeId = control_flow_graph_1.CfgVertex.getRootId(vertex);
+        // differentiate between widening points and other vertices
         if (this.isWideningPoint(nodeId)) {
-            // only check widening points at the entry vertex
-            if (control_flow_graph_1.CfgVertex.isMarker(vertex)) {
-                return true;
-            }
-            const oldState = this.getAbstractState(nodeId) ?? this.config.domain.bottom();
-            const predecessorDomains = this.getPredecessorNodes(control_flow_graph_1.CfgVertex.getId(vertex)).map(pred => this.getAbstractState(pred)).filter(assert_1.isNotUndefined);
-            this.currentState = this.config.domain.bottom().joinAll(predecessorDomains);
+            const oldState = this.trace.get(nodeId) ?? this._currentState.top();
             if (this.shouldWiden(vertex)) {
-                this.currentState = oldState.widen(this.currentState);
+                this._currentState = oldState.widen(this._currentState);
+                this.stateCopied = true;
             }
-            this.trace.set(nodeId, this.currentState);
-            return this.shouldContinueVisiting(vertex, oldState);
-        }
-        else if (this.shouldSkipVertex(vertex)) {
-            return true;
+            this.trace.set(nodeId, this._currentState);
+            this.stateCopied = false;
+            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);
         }
-        const predecessorDomains = this.getPredecessorNodes(control_flow_graph_1.CfgVertex.getId(vertex)).map(pred => this.getAbstractState(pred)).filter(assert_1.isNotUndefined);
-        this.currentState = this.config.domain.bottom().joinAll(predecessorDomains);
-        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)) {
-            this.currentState = this.currentState.bottom();
+        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)) {
+                this._currentState = this._currentState.top();
+                this.stateCopied = true;
+            }
+            this.trace.set(nodeId, this._currentState);
+            this.stateCopied = false;
+            const predecessorVisits = predecessors.map(pred => this.visited.get(pred) ?? 0);
+            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]);
         }
-        this.trace.set(nodeId, this.currentState);
-        return true;
     }
     onDispatchFunctionCallOrigin(call, origin) {
         super.onDispatchFunctionCallOrigin(call, origin);
@@ -183,8 +233,9 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
         const value = this.getAbstractValue(source);
         this.unassigned.delete(target);
         if (value !== undefined) {
-            this.currentState.set(target, value);
-            this.trace.set(target, this.currentState.create(this.currentState.value));
+            this.updateState(target, value);
+            this.trace.set(target, this._currentState);
+            this.stateCopied = false;
         }
     }
     onReplacementCall({ target }) {
@@ -204,7 +255,7 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
     onFunctionCall(_data) { }
     /** Gets all AST nodes for the predecessor vertices that are leaf nodes and exit vertices */
     getPredecessorNodes(vertexId) {
-        return this.config.controlFlow.graph.outgoingEdges(vertexId)?.keys() // outgoing dependency edges are incoming CFG edges
+        return this.config.controlFlow.graph.outgoingEdges(vertexId)?.keys() // outgoing dependency edges are ingoing CFG edges
             .map(id => this.getCfgVertex(id))
             .flatMap(vertex => {
             if (vertex === undefined) {
@@ -226,10 +277,10 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
             .map(origin => origin.id)
             .filter(origin => this.trace.has(origin) && !this.unassigned.has(origin)) ?? [];
     }
-    /** We only perform widening at `for`, `while`, or `repeat` loops with more than one incoming CFG edge */
+    /** We only perform widening at `for`, `while`, or `repeat` loops with more than one ingoing CFG edge */
     isWideningPoint(nodeId) {
-        const incomingEdges = this.config.controlFlow.graph.outgoingEdges(nodeId)?.size; // outgoing dependency edges are incoming CFG edges
-        if (incomingEdges === undefined || incomingEdges <= 1) {
+        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);
@@ -243,26 +294,20 @@ class AbstractInterpretationVisitor extends semantic_cfg_guided_visitor_1.Semant
         const origin = dataflowVertex.origin;
         return origin.includes(built_in_1.BuiltInProcName.ForLoop) || origin.includes(built_in_1.BuiltInProcName.WhileLoop) || origin.includes(built_in_1.BuiltInProcName.RepeatLoop);
     }
-    /**
-     * Checks whether to continue visiting the control flow graph after a widening point.
-     * By default, we only continue visiting if the widening point is visited for the first time or the abstract state at the widening point changed.
-     */
-    shouldContinueVisiting(wideningPoint, oldState) {
-        const wid = control_flow_graph_1.CfgVertex.getId(wideningPoint);
-        const visitedCount = this.visited.get(wid) ?? 0;
-        this.visited.set(wid, visitedCount + 1);
-        return visitedCount === 0 || !oldState.equals(this.currentState);
-    }
     /**
      * Checks whether a control flow graph vertex should be skipped during visitation.
-     * By default, we only process vertices of leaf nodes and exit vertices (no entry nodes of complex nodes).
+     * By default, we only process entry vertices of widening points, vertices of leaf nodes, and exit vertices (no entry nodes of complex nodes).
      */
     shouldSkipVertex(vertex) {
+        if (this.isWideningPoint(control_flow_graph_1.CfgVertex.getRootId(vertex))) {
+            // skip exit vertices of widening points
+            return control_flow_graph_1.CfgVertex.isMarker(vertex);
+        }
         return !control_flow_graph_1.CfgVertex.isMarker(vertex) && !control_flow_graph_1.CfgVertex.isBlock(vertex) && control_flow_graph_1.CfgVertex.getEnd(vertex) !== undefined;
     }
     /**
      * Whether widening should be performed at a widening point.
-     * By default, we perform widening when the number of visitation of the widening point reaches the widening threshold of the config.
+     * By default, we perform widening when the number of visits of the widening point reaches the widening threshold of the config.
      */
     shouldWiden(wideningPoint) {
         return (this.visited.get(control_flow_graph_1.CfgVertex.getId(wideningPoint)) ?? 0) >= this.config.ctx.config.abstractInterpretation.wideningThreshold;

package/abstract-interpretation/data-frame/shape-inference.d.ts

@@ -1,7 +1,6 @@
 import type { DataflowGraphVertexFunctionCall } from '../../dataflow/graph/vertex';
 import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
 import { AbstractInterpretationVisitor, type AbsintVisitorConfiguration } from '../absint-visitor';
-import { StateAbstractDomain } from '../domains/state-abstract-domain';
 import { DataFrameDomain } from './dataframe-domain';
 import { ConstraintType, type DataFrameOperationArgs, type DataFrameOperationName, type DataFrameOperationOptions } from './semantics';
 interface Operation<Name extends DataFrameOperationName> {
@@ -30,15 +29,13 @@ export type DataFrameOperationType<OperationName extends DataFrameOperationName
  * A possible `undefined` array of abstract data frame operations (see {@link DataFrameOperation}).
  */
 export type DataFrameOperations<OperationName extends DataFrameOperationName = DataFrameOperationName> = DataFrameOperation<OperationName>[] | undefined;
-interface DataFrameShapeInferenceConfiguration extends Omit<AbsintVisitorConfiguration<DataFrameDomain>, 'domain'> {
+interface DataFrameShapeInferenceConfiguration extends AbsintVisitorConfiguration {
     readonly trackOperations?: boolean;
 }
 /**
  * The control flow graph visitor to infer the shape of data frames using abstract interpretation
  */
-export declare class DataFrameShapeInferenceVisitor extends AbstractInterpretationVisitor<DataFrameDomain, DataFrameShapeInferenceConfiguration & {
-    domain: StateAbstractDomain<DataFrameDomain>;
-}> {
+export declare class DataFrameShapeInferenceVisitor extends AbstractInterpretationVisitor<DataFrameDomain, DataFrameShapeInferenceConfiguration> {
     /**
      * The abstract data frame operations the function call nodes are mapped to.
      */

package/abstract-interpretation/data-frame/shape-inference.js

@@ -2,7 +2,6 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DataFrameShapeInferenceVisitor = void 0;
 const absint_visitor_1 = require("../absint-visitor");
-const state_abstract_domain_1 = require("../domains/state-abstract-domain");
 const dataframe_domain_1 = require("./dataframe-domain");
 const access_mapper_1 = require("./mappers/access-mapper");
 const function_mapper_1 = require("./mappers/function-mapper");
@@ -17,7 +16,7 @@ class DataFrameShapeInferenceVisitor extends absint_visitor_1.AbstractInterpreta
      */
     operations;
     constructor({ trackOperations = true, ...config }) {
-        super({ ...config, domain: state_abstract_domain_1.StateAbstractDomain.bottom() });
+        super(config);
         if (trackOperations) {
             this.operations = new Map();
         }
@@ -74,13 +73,13 @@ class DataFrameShapeInferenceVisitor extends absint_visitor_1.AbstractInterpreta
             value = (0, semantics_1.applyDataFrameSemantics)(operation, operandValue ?? dataframe_domain_1.DataFrameDomain.top(maxColNames), args, options);
             const constraintType = type ?? (0, semantics_1.getConstraintType)(operation);
             if (operand !== undefined && constraintType === semantics_1.ConstraintType.OperandModification) {
-                this.currentState.set(operand, value);
+                this.updateState(operand, value);
                 for (const origin of this.getVariableOrigins(operand)) {
-                    this.currentState.set(origin, value);
+                    this.updateState(origin, value);
                 }
             }
             else if (constraintType === semantics_1.ConstraintType.ResultPostcondition) {
-                this.currentState.set(node.info.id, value);
+                this.updateState(node.info.id, value);
             }
         }
     }

package/abstract-interpretation/domains/abstract-domain.d.ts

@@ -55,14 +55,14 @@ export declare abstract class AbstractDomain<Concrete, Abstract, Top, Bot, Value
     abstract isValue(): this is AbstractDomain<Concrete, Abstract, Top, Bot, Abstract>;
     /**
      * Joins an array of abstract values by joining the first abstract value with the other values in the array.
-     * The provided array of abstract values cannot be empty!
+     * The provided array of abstract values must not be empty or a default value must be provided!
      */
-    static joinAll<Domain extends AnyAbstractDomain>(values: Domain[]): Domain;
+    static joinAll<Domain extends AnyAbstractDomain>(values: Domain[], defaultValue?: Domain): Domain;
     /**
      * Meets an array of abstract values by meeting the first abstract value with the other values in the array.
-     * The provided array of abstract values cannot be empty!
+     * The provided array of abstract values must not be empty or a default value must be provided!
      */
-    static meetAll<Domain extends AnyAbstractDomain>(values: Domain[]): Domain;
+    static meetAll<Domain extends AnyAbstractDomain>(values: Domain[], defaultValue?: Domain): Domain;
 }
 /**
  * A type representing any abstract domain without additional information.