@eagleoutice/flowr 2.9.14 → 2.10.1

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.13, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.10.0, 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: 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,11 +53,13 @@ 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: 1
+           ╰ Metadata: numOperations: 0, numAccesses: 0, totalAccessed: 0, searchTimeMs: 0, processTimeMs: 0
        ╰ Dead Code (dead-code):
            ╰ Metadata: consideredNodes: 5, searchTimeMs: 0, processTimeMs: 0
        ╰ Useless Loops (useless-loop):
            ╰ Metadata: numOfUselessLoops: 0, searchTimeMs: 0, processTimeMs: 0
+       ╰ Problematic eval (problematic-eval):
+           ╰ Metadata: searchTimeMs: 0, processTimeMs: 0
        ╰ Stop without call.=False argument (stop-call):
            ╰ Metadata: consideredNodes: 0, searchTimeMs: 0, processTimeMs: 0
     All queries together required ≈2 ms (1ms accuracy, total 2 ms)
@@ -84,17 +86,17 @@ It offers a wide variety of features, for example:
     
     Query: **linter** (2 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\
-    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalReads: 1, totalUnknown: 0, totalWritesBeforeAlways: 0, totalValid: 0, searchTimeMs: 1, processTimeMs: 0</code>\
+    &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;╰ **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: 0, processTimeMs: 0</code>\
+    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;╰ _Metadata_: <code>totalConsidered: 1, totalUnknown: 0, searchTimeMs: 1, 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):\
@@ -102,11 +104,13 @@ 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: 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;╰ **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)_
@@ -130,7 +134,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalCalls": 0,
               "totalFunctionDefinitions": 0,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -153,7 +157,7 @@ It offers a wide variety of features, for example:
               "totalUnknown": 0,
               "totalWritesBeforeAlways": 0,
               "totalValid": 0,
-              "searchTimeMs": 1,
+              "searchTimeMs": 0,
               "processTimeMs": 0
             }
           },
@@ -185,7 +189,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalConsidered": 1,
               "totalUnknown": 0,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -222,7 +226,7 @@ It offers a wide variety of features, for example:
               "numAccesses": 0,
               "totalAccessed": 0,
               "searchTimeMs": 0,
-              "processTimeMs": 1
+              "processTimeMs": 0
             }
           },
           "dead-code": {
@@ -241,6 +245,13 @@ It offers a wide variety of features, for example:
               "processTimeMs": 0
             }
           },
+          "problematic-eval": {
+            "results": [],
+            ".meta": {
+              "searchTimeMs": 0,
+              "processTimeMs": 0
+            }
+          },
           "stop-call": {
             "results": [],
             ".meta": {
@@ -320,7 +331,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.13, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.10.0, R grammar v14 (tree-sitter engine)
     R> :query @static-slice (11@sum) file://test/testfiles/example.R
     ```
     
@@ -334,7 +345,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 ≈1 ms (1ms accuracy, total 2 ms)
+    All queries together required ≈2 ms (1ms accuracy, total 2 ms)
     ```
     
     
@@ -368,7 +379,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!">101.1 ms</span></i> (as of Feb 28, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
+  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), 
   _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).
 
@@ -404,7 +415,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.13, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.10.0, R grammar v14 (tree-sitter engine)
     R> :dataflow* test/testfiles/example.R
     ```
     
@@ -430,7 +441,7 @@ It offers a wide variety of features, for example:
           *1.8*`"}}
        %% No edges found for 1
         0["`#91;RSymbol#93; sum
-          (0)
+          (0, sources: [1])
           *1.1-3*`"]
         2[["`#91;RBinaryOp#93; #60;#45;
           (2)
@@ -444,7 +455,7 @@ It offers a wide variety of features, for example:
           *2.12*`"}}
        %% No edges found for 4
         3["`#91;RSymbol#93; product
-          (3)
+          (3, sources: [4])
           *2.1-7*`"]
         5[["`#91;RBinaryOp#93; #60;#45;
           (5)
@@ -455,7 +466,7 @@ It offers a wide variety of features, for example:
           *3.6*`"}}
        %% No edges found for 7
         6["`#91;RSymbol#93; w
-          (6)
+          (6, sources: [7])
           *3.1*`"]
         8[["`#91;RBinaryOp#93; #60;#45;
           (8)
@@ -466,14 +477,14 @@ It offers a wide variety of features, for example:
           *4.6-7*`"}}
        %% No edges found for 10
         9["`#91;RSymbol#93; N
-          (9)
+          (9, sources: [10])
           *4.1*`"]
         11[["`#91;RBinaryOp#93; #60;#45;
           (11)
           *4.1-7*
         (9, 10)`"]]
         12["`#91;RSymbol#93; i
-          (12)
+          (12, sources: [20])
           *6.6*`"]
         13{{"`#91;RNumber#93; 1
           (13)
@@ -525,7 +536,7 @@ It offers a wide variety of features, for example:
           *7.10-20*
         (26, 27)`"]]
         23["`#91;RSymbol#93; sum
-          (23, :may:36+)
+          (23, :may:36+, sources: [28])
           *7.3-5*`"]
         29[["`#91;RBinaryOp#93; #60;#45;
           (29, :may:36+)
@@ -542,7 +553,7 @@ It offers a wide variety of features, for example:
           *8.14-24*
         (31, 32)`"]]
         30["`#91;RSymbol#93; product
-          (30, :may:36+)
+          (30, :may:36+, sources: [33])
           *8.3-9*`"]
         34[["`#91;RBinaryOp#93; #60;#45;
           (34, :may:36+)
@@ -889,7 +900,8 @@ We welcome every contribution! Please check out the [developer onboarding](https
 
 *flowr* is actively developed by [Florian Sihler](https://eagleoutice.github.io/portfolio/) and (since October 1st 2025) [Oliver Gerstl](https://www.linkedin.com/in/oliver-gerstl) under the
 [GPLv3 License](LICENSE).\
-It is partially supported by the German Research Foundation (DFG) under the grant [504226141](https://gepris.dfg.de/gepris/projekt/504226141) ("CodeInspector").
+It is partially supported by the German Research Foundation (DFG) under the grant [504226141](https://gepris.dfg.de/gepris/projekt/504226141) ("CodeInspector")
+and received an unrestricted gift from [Posit](https://posit.co/), the open-source data science company. 
 
 ----
 

package/benchmark/stats/stats.d.ts

@@ -1,4 +1,4 @@
-import type { SingleSlicingCriterion, SlicingCriteria } from '../../slicing/criterion/parse';
+import type { SlicingCriterion, SlicingCriteria } from '../../slicing/criterion/parse';
 import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
 import type { ReconstructionResult } from '../../reconstruct/reconstruct';
 import type { RParseRequestFromFile, RParseRequestFromText } from '../../r-bridge/retriever';
@@ -15,7 +15,7 @@ export type ElapsedTime = bigint;
 export interface PerSliceStats {
     measurements: Map<PerSliceMeasurements, ElapsedTime>;
     slicingCriteria: {
-        criterion: SingleSlicingCriterion;
+        criterion: SlicingCriterion;
         id: NodeId;
     }[];
     reconstructedCode: ReconstructionResult;

package/cli/repl/parser/slice-query-parser.d.ts

@@ -1,4 +1,4 @@
-import type { SingleSlicingCriterion, SlicingCriteria } from '../../../slicing/criterion/parse';
+import type { SlicingCriterion, SlicingCriteria } from '../../../slicing/criterion/parse';
 import { SliceDirection } from '../../../util/slice-direction';
 /**
  * Checks whether the given argument represents a slicing direction with an `f` suffix.
@@ -7,7 +7,7 @@ export declare function sliceDirectionParser(argument: string): SliceDirection;
 /**
  * Parses a single slicing criterion from the given argument.
  */
-export declare function sliceCriterionParser(argument: string | undefined): SingleSlicingCriterion | undefined;
+export declare function sliceCriterionParser(argument: string | undefined): SlicingCriterion | undefined;
 /**
  * Parses multiple slicing criteria from the given argument.
  */

package/config.d.ts

@@ -159,6 +159,10 @@ export interface FlowrConfig extends MergeableRecord {
              * The maximum number of iterations to perform on a single function call during slicing
              */
             readonly threshold?: number;
+            /**
+             * If set, the slicer will gain an additional post-pass
+             */
+            readonly autoExtend?: boolean;
         };
     };
     /**

package/config.js

@@ -93,7 +93,8 @@ exports.FlowrConfig = {
                     dataflowExtractors: undefined
                 },
                 slicer: {
-                    threshold: 50
+                    threshold: 50,
+                    autoExtend: false
                 }
             },
             abstractInterpretation: {
@@ -153,7 +154,8 @@ exports.FlowrConfig = {
                 applyReplacements: joi_1.default.array().items(joi_1.default.object()).description('Provide name replacements for loaded files')
             }).optional().description('If lax source calls are active, flowR searches for sourced files much more freely, based on the configurations you give it. This option is only in effect if `ignoreSourceCalls` is set to false.'),
             slicer: joi_1.default.object({
-                threshold: joi_1.default.number().optional().description('The maximum number of iterations to perform on a single function call during slicing.')
+                threshold: joi_1.default.number().optional().description('The maximum number of iterations to perform on a single function call during slicing.'),
+                autoExtend: joi_1.default.boolean().optional().description('If set, the slicer will gain an additional post-pass.')
             }).optional().description('The configuration for the slicer.')
         }).description('How to resolve constants, constraints, cells, ...'),
         abstractInterpretation: joi_1.default.object({
@@ -250,7 +252,7 @@ exports.FlowrConfig = {
      */
     setInConfigInPlace(config, key, value) {
         object_path_1.default.set(config, key, value);
-    }
+    },
 };
 function loadConfigFromFile(configFile, workingDirectory) {
     if (configFile !== undefined) {

package/dataflow/environments/identifier.d.ts

@@ -39,6 +39,10 @@ export declare const Identifier: {
      * Please note that for `internal` to count, a namespace must be provided!
      */
     readonly make: (this: void, name: BrandedIdentifier, namespace?: BrandedNamespace, internal?: boolean) => Identifier;
+    /**
+     * Verify whether an unknown element has a valid identifier shape!
+     */
+    readonly is: (this: void, id: unknown) => id is Identifier;
     /**
      * Parse an identifier from its string representation,
      * Please note, that in R if one writes `"pkg::a"` this refers to a symbol named `pkg::a` and NOT to the namespaced identifier `a` in package `pkg`.

package/dataflow/environments/identifier.js

@@ -33,6 +33,23 @@ exports.Identifier = {
             return name;
         }
     },
+    /**
+     * Verify whether an unknown element has a valid identifier shape!
+     */
+    is(id) {
+        if (typeof id === 'string') {
+            return true;
+        }
+        if (Array.isArray(id)) {
+            if (id.length === 2) {
+                return typeof id[0] === 'string' && typeof id[1] === 'string';
+            }
+            else if (id.length === 3) {
+                return typeof id[0] === 'string' && typeof id[1] === 'string' && typeof id[2] === 'boolean';
+            }
+        }
+        return false;
+    },
     /**
      * Parse an identifier from its string representation,
      * Please note, that in R if one writes `"pkg::a"` this refers to a symbol named `pkg::a` and NOT to the namespaced identifier `a` in package `pkg`.

package/dataflow/graph/call-graph.d.ts

@@ -24,10 +24,6 @@ export declare const CallGraph: {
      * Extracts the sub call graph from the given call graph, starting from the given entry points.
      */
     readonly computeSubCallGraph: (this: void, graph: CallGraph, entryPoints: Set<NodeId>) => CallGraph;
-    /**
-     * Determines whether there is a path from `from` to `to` in the given graph (via any edge type, only respecting direction)
-     */
-    readonly reaches: (this: void, from: NodeId, to: NodeId, graph: DataflowGraph, knownReachability?: DefaultMap<NodeId, Set<NodeId>>) => boolean;
     /**
      * Reduces the call graph by dropping all transitive edges.
      */
@@ -53,8 +49,9 @@ export declare const CallGraph: {
             readonly convert: typeof import("./quads").df2quads;
         };
     };
-    readonly diffGraphs: (this: void, left: import("../../util/diff-graph").NamedGraph, right: import("../../util/diff-graph").NamedGraph, config?: Partial<import("../../util/diff").GenericDiffConfiguration>) => import("../../util/diff-graph").GraphDifferenceReport;
-    readonly invertGraph: (this: void, graph: DataflowGraph, cleanEnv: REnvironmentInformation) => DataflowGraph;
-    readonly resolveGraphCriteria: (graph: DataflowGraph, ctx: import("../../project/context/flowr-analyzer-context").ReadOnlyFlowrAnalyzerContext, idMap?: import("../../r-bridge/lang-4.x/ast/model/processing/decorate").AstIdMap) => DataflowGraph;
+    readonly diffGraphs: <G extends DataflowGraph>(this: void, left: import("../../util/diff-graph").NamedGraph<G>, right: import("../../util/diff-graph").NamedGraph<G>, config?: Partial<import("../../util/diff").GenericDiffConfiguration>) => import("../../util/diff-graph").GraphDifferenceReport;
+    readonly invertGraph: <G extends DataflowGraph>(this: void, graph: G, cleanEnv: REnvironmentInformation) => G;
+    readonly resolveGraphCriteria: <G extends DataflowGraph>(graph: G, ctx: import("../../project/context/flowr-analyzer-context").ReadOnlyFlowrAnalyzerContext, idMap?: import("../../r-bridge/lang-4.x/ast/model/processing/decorate").AstIdMap) => G;
+    readonly reaches: <G extends DataflowGraph>(this: void, from: NodeId, to: NodeId, graph: G, knownReachability?: DefaultMap<NodeId, Set<NodeId>>) => boolean;
     readonly name: "CallGraph";
 };

package/dataflow/graph/call-graph.js

@@ -189,28 +189,6 @@ exports.CallGraph = {
         }
         return result;
     },
-    /**
-     * Determines whether there is a path from `from` to `to` in the given graph (via any edge type, only respecting direction)
-     */
-    reaches(from, to, graph, knownReachability = new defaultmap_1.DefaultMap(() => new Set())) {
-        const visited = new Set();
-        const toVisit = [from];
-        while (toVisit.length > 0) {
-            const currentId = toVisit.pop();
-            if (visited.has(currentId)) {
-                continue;
-            }
-            if (currentId === to || knownReachability.get(currentId).has(to)) {
-                knownReachability.get(from).add(to);
-                return true;
-            }
-            visited.add(currentId);
-            for (const [tar] of graph.outgoingEdges(currentId) ?? []) {
-                toVisit.push(tar);
-            }
-        }
-        return false;
-    },
     /**
      * Reduces the call graph by dropping all transitive edges.
      */

package/dataflow/graph/df-helper.d.ts

@@ -41,7 +41,6 @@ export declare const Dataflow: {
          */
         readonly callGraph: {
             readonly computeSubCallGraph: (this: void, graph: CallGraph, entryPoints: Set<NodeId>) => CallGraph;
-            readonly reaches: (this: void, from: NodeId, to: NodeId, graph: DataflowGraph, knownReachability?: import("../../util/collections/defaultmap").DefaultMap<NodeId, Set<NodeId>>) => boolean;
             readonly dropTransitiveEdges: (this: void, graph: CallGraph) => CallGraph;
             readonly compute: (this: void, graph: DataflowGraph) => CallGraph;
             readonly visualize: {
@@ -58,9 +57,10 @@ export declare const Dataflow: {
                     readonly convert: typeof import("./quads").df2quads;
                 };
             };
-            readonly diffGraphs: (this: void, left: import("../../util/diff-graph").NamedGraph, right: import("../../util/diff-graph").NamedGraph, config?: Partial<import("../../util/diff").GenericDiffConfiguration>) => import("../../util/diff-graph").GraphDifferenceReport;
-            readonly invertGraph: (this: void, graph: DataflowGraph, cleanEnv: REnvironmentInformation) => DataflowGraph;
-            readonly resolveGraphCriteria: (graph: DataflowGraph, ctx: import("../../project/context/flowr-analyzer-context").ReadOnlyFlowrAnalyzerContext, idMap?: import("../../r-bridge/lang-4.x/ast/model/processing/decorate").AstIdMap) => DataflowGraph;
+            readonly diffGraphs: <G extends DataflowGraph>(this: void, left: import("../../util/diff-graph").NamedGraph<G>, right: import("../../util/diff-graph").NamedGraph<G>, config?: Partial<import("../../util/diff").GenericDiffConfiguration>) => import("../../util/diff-graph").GraphDifferenceReport;
+            readonly invertGraph: <G extends DataflowGraph>(this: void, graph: G, cleanEnv: REnvironmentInformation) => G;
+            readonly resolveGraphCriteria: <G extends DataflowGraph>(graph: G, ctx: import("../../project/context/flowr-analyzer-context").ReadOnlyFlowrAnalyzerContext, idMap?: import("../../r-bridge/lang-4.x/ast/model/processing/decorate").AstIdMap) => G;
+            readonly reaches: <G extends DataflowGraph>(this: void, from: NodeId, to: NodeId, graph: G, knownReachability?: import("../../util/collections/defaultmap").DefaultMap<NodeId, Set<NodeId>>) => boolean;
             readonly name: "CallGraph";
         };
     };
@@ -87,7 +87,7 @@ export declare const Dataflow: {
      * @param select                - the ids to select in the reduced graph
      * @param includeMissingTargets - if set to true, this will include edges which target vertices that are not selected!
      */
-    readonly reduceGraph: (this: void, graph: DataflowGraph, select: ReadonlySet<NodeId>, includeMissingTargets?: boolean) => DataflowGraph;
+    readonly reduceGraph: <G extends DataflowGraph>(this: void, graph: G, select: ReadonlySet<NodeId>, includeMissingTargets?: boolean) => G;
     /**
      * Given the id of a vertex (usually a variable use),
      * this returns a reachable provenance set by calculating a non-interprocedural and non-context sensitive backward slice, but stopping at the given ids!
@@ -120,9 +120,10 @@ export declare const Dataflow: {
             readonly convert: typeof import("./quads").df2quads;
         };
     };
-    readonly diffGraphs: (this: void, left: import("../../util/diff-graph").NamedGraph, right: import("../../util/diff-graph").NamedGraph, config?: Partial<import("../../util/diff").GenericDiffConfiguration>) => import("../../util/diff-graph").GraphDifferenceReport;
-    readonly invertGraph: (this: void, graph: DataflowGraph, cleanEnv: REnvironmentInformation) => DataflowGraph;
-    readonly resolveGraphCriteria: (graph: DataflowGraph, ctx: import("../../project/context/flowr-analyzer-context").ReadOnlyFlowrAnalyzerContext, idMap?: import("../../r-bridge/lang-4.x/ast/model/processing/decorate").AstIdMap) => DataflowGraph;
+    readonly diffGraphs: <G extends DataflowGraph>(this: void, left: import("../../util/diff-graph").NamedGraph<G>, right: import("../../util/diff-graph").NamedGraph<G>, config?: Partial<import("../../util/diff").GenericDiffConfiguration>) => import("../../util/diff-graph").GraphDifferenceReport;
+    readonly invertGraph: <G extends DataflowGraph>(this: void, graph: G, cleanEnv: REnvironmentInformation) => G;
+    readonly resolveGraphCriteria: <G extends DataflowGraph>(graph: G, ctx: import("../../project/context/flowr-analyzer-context").ReadOnlyFlowrAnalyzerContext, idMap?: import("../../r-bridge/lang-4.x/ast/model/processing/decorate").AstIdMap) => G;
+    readonly reaches: <G extends DataflowGraph>(this: void, from: NodeId, to: NodeId, graph: G, knownReachability?: import("../../util/collections/defaultmap").DefaultMap<NodeId, Set<NodeId>>) => boolean;
     readonly name: "Dataflow";
     /**
      * Maps to flowR's main graph object to store and manipulate the dataflow graph

package/dataflow/graph/df-helper.js

@@ -102,18 +102,25 @@ exports.Dataflow = {
     provenance(id, graph, consider) {
         const queue = [id];
         const visited = new Set();
-        const followEdges = edge_1.EdgeType.Calls | edge_1.EdgeType.Reads | edge_1.EdgeType.Returns | edge_1.EdgeType.DefinedBy | edge_1.EdgeType.DefinedByOnCall;
+        const followEdges = edge_1.EdgeType.Calls | edge_1.EdgeType.Reads | edge_1.EdgeType.Returns | edge_1.EdgeType.Argument | edge_1.EdgeType.DefinedBy | edge_1.EdgeType.DefinedByOnCall;
         while (queue.length > 0) {
             const nodeId = queue.pop();
             if (nodeId === undefined || visited.has(nodeId) || (consider && !consider.has(nodeId))) {
                 continue;
             }
             visited.add(nodeId);
-            for (const [to, types] of graph.outgoingEdges(nodeId) ?? []) {
+            const vtx = graph.get(nodeId);
+            if (vtx === undefined) {
+                continue;
+            }
+            for (const [to, types] of vtx[1]) {
                 if (edge_1.DfEdge.includesType(types, followEdges)) {
                     queue.push(to);
                 }
             }
+            for (const cd of vtx[0].cds ?? []) {
+                queue.push(cd.id);
+            }
         }
         return visited;
     },

package/dataflow/graph/graph-helper.d.ts

@@ -7,6 +7,7 @@ import type { REnvironmentInformation } from '../environments/environment';
 import type { ReadOnlyFlowrAnalyzerContext } from '../../project/context/flowr-analyzer-context';
 import type { AstIdMap } from '../../r-bridge/lang-4.x/ast/model/processing/decorate';
 import type { NodeId } from '../../r-bridge/lang-4.x/ast/model/processing/node-id';
+import { DefaultMap } from '../../util/collections/defaultmap';
 /**
  * The underlying functions which work for any graph* like view
  * **Please do not use this object directly but use the helpers**
@@ -19,7 +20,7 @@ export declare const GraphHelper: {
         /**
          * Mermaid rendering helper for dataflow graphs
          * - {@link DataflowMermaid.url}, {@link DataflowMermaid.raw} - to render the graph as a mermaid graph (e.g., in markdown or the mermaid live editor)
-         * - {@link DataflowMermaid.convert} - for the underyling transformation
+         * - {@link DataflowMermaid.convert} - for the underlying transformation
          * @see {@link DataflowMermaid}
          */
         readonly mermaid: {
@@ -40,16 +41,20 @@ export declare const GraphHelper: {
      * If you simply want to check whether they equal, use {@link GraphDifferenceReport#isEqual|`<result>.isEqual()`}.
      * @see {@link diffOfControlFlowGraphs} - for control flow graphs
      */
-    readonly diffGraphs: (this: void, left: NamedGraph, right: NamedGraph, config?: Partial<GenericDiffConfiguration>) => GraphDifferenceReport;
+    readonly diffGraphs: <G extends DataflowGraph>(this: void, left: NamedGraph<G>, right: NamedGraph<G>, config?: Partial<GenericDiffConfiguration>) => GraphDifferenceReport;
     /**
      * Inverts the given dataflow graph by reversing all edges.
      */
-    readonly invertGraph: (this: void, graph: DataflowGraph, cleanEnv: REnvironmentInformation) => DataflowGraph;
+    readonly invertGraph: <G extends DataflowGraph>(this: void, graph: G, cleanEnv: REnvironmentInformation) => G;
     /**
      * Resolves the dataflow graph ids from slicing criterion form to ids.
      * This returns a **new** graph with the resolved ids.
      * The main use-case for this is testing - if you do not know/want to fix the specific id,
      * you can use, e.g. `2@x` as a placeholder for the first x in the second line!
      */
-    readonly resolveGraphCriteria: (graph: DataflowGraph, ctx: ReadOnlyFlowrAnalyzerContext, idMap?: AstIdMap) => DataflowGraph;
+    readonly resolveGraphCriteria: <G extends DataflowGraph>(graph: G, ctx: ReadOnlyFlowrAnalyzerContext, idMap?: AstIdMap) => G;
+    /**
+     * Determines whether there is a path from `from` to `to` in the given graph (via any edge type, only respecting direction)
+     */
+    readonly reaches: <G extends DataflowGraph>(this: void, from: NodeId, to: NodeId, graph: G, knownReachability?: DefaultMap<NodeId, Set<NodeId>>) => boolean;
 };

package/dataflow/graph/graph-helper.js

@@ -9,6 +9,7 @@ const graph_1 = require("./graph");
 const assert_1 = require("../../util/assert");
 const parse_1 = require("../../slicing/criterion/parse");
 const edge_1 = require("./edge");
+const defaultmap_1 = require("../../util/collections/defaultmap");
 /**
  * The underlying functions which work for any graph* like view
  * **Please do not use this object directly but use the helpers**
@@ -21,7 +22,7 @@ exports.GraphHelper = {
         /**
          * Mermaid rendering helper for dataflow graphs
          * - {@link DataflowMermaid.url}, {@link DataflowMermaid.raw} - to render the graph as a mermaid graph (e.g., in markdown or the mermaid live editor)
-         * - {@link DataflowMermaid.convert} - for the underyling transformation
+         * - {@link DataflowMermaid.convert} - for the underlying transformation
          * @see {@link DataflowMermaid}
          */
         mermaid: dfg_1.DataflowMermaid,
@@ -70,7 +71,7 @@ exports.GraphHelper = {
             if (cached !== undefined) {
                 return cached;
             }
-            const resolved = parse_1.SingleSlicingCriterion.tryParse(id, resolveMap) ?? id;
+            const resolved = parse_1.SlicingCriterion.tryParse(id, resolveMap) ?? id;
             cache.set(id, resolved);
             return resolved;
         };
@@ -100,6 +101,28 @@ exports.GraphHelper = {
             }
         }
         return resultGraph;
-    }
+    },
+    /**
+     * Determines whether there is a path from `from` to `to` in the given graph (via any edge type, only respecting direction)
+     */
+    reaches(from, to, graph, knownReachability = new defaultmap_1.DefaultMap(() => new Set())) {
+        const visited = new Set();
+        const toVisit = [from];
+        while (toVisit.length > 0) {
+            const currentId = toVisit.pop();
+            if (visited.has(currentId)) {
+                continue;
+            }
+            if (currentId === to || knownReachability.get(currentId).has(to)) {
+                knownReachability.get(from).add(to);
+                return true;
+            }
+            visited.add(currentId);
+            for (const [tar] of graph.outgoingEdges(currentId) ?? []) {
+                toVisit.push(tar);
+            }
+        }
+        return false;
+    },
 };
 //# sourceMappingURL=graph-helper.js.map

package/dataflow/graph/graph.d.ts

@@ -25,6 +25,7 @@ export type DataflowFunctionFlowInformation = Omit<DataflowInformation, 'graph'
  */
 export interface NamedFunctionArgument extends IdentifierReference {
     readonly name: string;
+    readonly valueId: NodeId | undefined;
 }
 /**
  * A reference which does not have a name, like the references to the arguments `3` and `2` in the following:
@@ -32,7 +33,6 @@ export interface NamedFunctionArgument extends IdentifierReference {
  * ```r
  * foo(3, 2)
  * ```
- * @see #isPositionalArgument
  * @see NamedFunctionArgument
  */
 export interface PositionalFunctionArgument extends Omit<IdentifierReference, 'name'> {
@@ -95,12 +95,22 @@ export declare const FunctionArgument: {
      * @see {@link FunctionArgument.isEmpty}
      */
     readonly isNotEmpty: <T>(this: void, arg: T) => arg is Exclude<T, typeof EmptyArgument>;
+    /**
+     * Returns the id of a non-empty argument.
+     * @example
+     * ```r
+     * foo(a=3, 2) # returns the node id of either `a` or `2`
+     * ```
+     * @see {@link FunctionArgument.getReference}
+     */
+    readonly getId: (this: void, arg: FunctionArgument) => NodeId | undefined;
     /**
      * Returns the reference of a non-empty argument.
      * @example
      * ```r
      * foo(a=3, 2) # returns the node id of either `3` or `2`, but skips a
      * ```
+     * @see {@link FunctionArgument.getId}
      */
     readonly getReference: (this: void, arg: FunctionArgument) => NodeId | undefined;
     /**
@@ -259,8 +269,9 @@ export declare class DataflowGraph<Vertex extends DataflowGraphVertexInfo = Data
     /**
      * Marks a vertex in the graph to be a definition
      * @param reference - The reference to the vertex to mark as definition
+     * @param sourceIds - The id of the source vertex of the def, if available
      */
-    setDefinitionOfVertex(reference: IdentifierReference): void;
+    setDefinitionOfVertex(reference: IdentifierReference, sourceIds: readonly NodeId[] | undefined): void;
     /**
      * Marks a vertex in the graph to be a function call with the new information
      * @param info - The information about the new function call node