@eagleoutice/flowr 2.8.14 → 2.9.0

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.8.12, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.8.15, R grammar v14 (tree-sitter engine)
     R> :query @linter "read.csv(\"/root/x.txt\")"
     ```
     
@@ -33,13 +33,13 @@ It offers a wide variety of features, for example:
     
     
     ```text
-    Query: linter (1 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):
@@ -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: 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):
            ╰ Metadata: numOfUselessLoops: 0, searchTimeMs: 0, processTimeMs: 0
-    All queries together required ≈1 ms (1ms accuracy, total 1 ms)
+    All queries together required ≈3 ms (1ms accuracy, total 3 ms)
     ```
     
     
@@ -80,19 +80,19 @@ It offers a wide variety of features, for example:
     
     _Results (prettified and summarized):_
     
-    Query: **linter** (1 ms)\
+    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;╰ **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: 0, processTimeMs: 1</code>\
+    &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;╰ **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,14 +102,14 @@ 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>\
-    _All queries together required ≈1 ms (1ms accuracy, total 2 ms)_
+    _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 _1.9 ms_ (including parsing and normalization and the query) within the generation environment.
+    The analysis required _2.8 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.
@@ -149,8 +149,8 @@ It offers a wide variety of features, for example:
               "totalUnknown": 0,
               "totalWritesBeforeAlways": 0,
               "totalValid": 0,
-              "searchTimeMs": 0,
-              "processTimeMs": 1
+              "searchTimeMs": 1,
+              "processTimeMs": 0
             }
           },
           "seeded-randomness": {
@@ -181,7 +181,7 @@ It offers a wide variety of features, for example:
             ".meta": {
               "totalConsidered": 1,
               "totalUnknown": 0,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -225,7 +225,7 @@ It offers a wide variety of features, for example:
             "results": [],
             ".meta": {
               "consideredNodes": 5,
-              "searchTimeMs": 0,
+              "searchTimeMs": 1,
               "processTimeMs": 0
             }
           },
@@ -239,11 +239,11 @@ It offers a wide variety of features, for example:
           }
         },
         ".meta": {
-          "timing": 1
+          "timing": 3
         }
       },
       ".meta": {
-        "timing": 1
+        "timing": 3
       }
     }
     ```
@@ -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.8.12, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.8.15, 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 ≈2 ms (1ms accuracy, total 3 ms)
+    All queries together required ≈3 ms (1ms accuracy, total 4 ms)
     ```
     
     
@@ -338,7 +338,7 @@ It offers a wide variety of features, for example:
         
 
 * 📚 **dependency analysis**\
-  Given your analysis project, flowR offers a plethora of so-called [queries](https://github.com/flowr-analysis/flowr/wiki/query-api) to get more information about your code.
+  Given your analysis project, flowR offers a plethora of so-called [queries](https://github.com/flowr-analysis/flowr/wiki/wiki/query-api) to get more information about your code.
   An important query is the [dependencies query](https://github.com/flowr-analysis/flowr/wiki/Query-API#dependencies-query), which shows you the library your project needs,
   the data files it reads, the scripts it sources, and the data it outputs.
   
@@ -356,9 +356,9 @@ 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!">122.5 ms</span></i> (as of Jan 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!">118.7 ms</span></i> (as of Jan 30, 2026)](https://flowr-analysis.github.io/flowr/wiki/stats/benchmark), 
   _flowR_ can analyze the data- and control-flow of the average real-world R 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 as well as call graphs.
+  and consult the [wiki pages](https://github.com/flowr-analysis/flowr/wiki/wiki/dataflow-graph) for more details on the dataflow graphs as well as call graphs.
 
     
     <details><summary>Example: Generating a dataflow graph with flowR</summary>
@@ -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.8.12, R grammar v14 (tree-sitter engine)
+    flowR repl using flowR v2.8.15, R grammar v14 (tree-sitter engine)
     R> :dataflow* test/testfiles/example.R
     ```
     
@@ -402,7 +402,6 @@ It offers a wide variety of features, for example:
     
     ```text
     https://mermaid.live/view#base64:eyJjb2RlIjoiZmxvd2NoYXJ0IEJUXG4gICAgMChbXCJgIzkxO1JTeW1ib2wjOTM7IHRlc3RcbiAgICAgICgwKVxuICAgICAgKjEuMS00KmBcIl0pXG4gICAgMShbXCJgIzkxO1JTeW1ib2wjOTM7IHRlc3RmaWxlc1xuICAgICAgKDEpXG4gICAgICAqMS42LTE0KmBcIl0pXG4gICAgMltbXCJgIzkxO1JCaW5hcnlPcCM5MzsgL1xuICAgICAgKDIpXG4gICAgICAqMS4xLTE0KlxuICAgICgwLCAxKWBcIl1dXG4gICAgYnVpbHQtaW46X1tcImBCdWlsdC1Jbjpcbi9gXCJdXG4gICAgc3R5bGUgYnVpbHQtaW46XyBzdHJva2U6Z3JheSxmaWxsOmdyYXksc3Ryb2tlLXdpZHRoOjJweCxvcGFjaXR5Oi44O1xuICAgIDMoW1wiYCM5MTtSU3ltYm9sIzkzOyBleGFtcGxlLlJcbiAgICAgICgzKVxuICAgICAgKjEuMTYtMjQqYFwiXSlcbiAgICA0W1tcImAjOTE7UkJpbmFyeU9wIzkzOyAvXG4gICAgICAoNClcbiAgICAgICoxLjEtMjQqXG4gICAgKDIsIDMpYFwiXV1cbiAgICAyIC0tPnxcInJlYWRzLCBhcmd1bWVudFwifCAwXG4gICAgMiAtLT58XCJyZWFkcywgYXJndW1lbnRcInwgMVxuICAgIDIgLS4tPnxcInJlYWRzLCBjYWxsc1wifCBidWlsdC1pbjpfXG4gICAgbGlua1N0eWxlIDIgc3Ryb2tlOmdyYXk7XG4gICAgNCAtLT58XCJyZWFkcywgYXJndW1lbnRcInwgMlxuICAgIDQgLS0+fFwicmVhZHMsIGFyZ3VtZW50XCJ8IDNcbiAgICA0IC0uLT58XCJyZWFkcywgY2FsbHNcInwgYnVpbHQtaW46X1xuICAgIGxpbmtTdHlsZSA1IHN0cm9rZTpncmF5OyIsIm1lcm1haWQiOnsiYXV0b1N5bmMiOnRydWV9fQ==
-    Copied mermaid url to clipboard (dataflow: 0ms).
     ```
     
     
@@ -698,7 +697,7 @@ It offers a wide variety of features, for example:
     ```
     
     	
-    (The analysis required _1.2 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/data-frame/mappers/access-mapper.d.ts

@@ -6,9 +6,10 @@ import type { ParentInformation } from '../../../r-bridge/lang-4.x/ast/model/pro
 import type { DataFrameOperations, DataFrameShapeInferenceVisitor } from '../shape-inference';
 /**
  * Maps a concrete data frame access operation to abstract data frame operations.
- * @param node - The R node of the access
- * @param dfg  - The data flow graph for resolving the arguments
- * @param ctx  - The current flowR analyzer context
+ * @param node      - The R node of the access
+ * @param inference - The data frame shape inference visitor
+ * @param dfg       - The data flow graph for resolving the arguments
+ * @param ctx       - The current flowR analyzer context
  * @returns The mapped abstract data frame operations for the access operation, or `undefined` if the node does not represent a data frame access operation
  */
 export declare function mapDataFrameAccess(node: RNode<ParentInformation>, inference: DataFrameShapeInferenceVisitor, dfg: DataflowGraph, ctx: ReadOnlyFlowrAnalyzerContext): DataFrameOperations;

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

@@ -16,9 +16,10 @@ const SpecialAccessArgumentsMapper = {
 };
 /**
  * Maps a concrete data frame access operation to abstract data frame operations.
- * @param node - The R node of the access
- * @param dfg  - The data flow graph for resolving the arguments
- * @param ctx  - The current flowR analyzer context
+ * @param node      - The R node of the access
+ * @param inference - The data frame shape inference visitor
+ * @param dfg       - The data flow graph for resolving the arguments
+ * @param ctx       - The current flowR analyzer context
  * @returns The mapped abstract data frame operations for the access operation, or `undefined` if the node does not represent a data frame access operation
  */
 function mapDataFrameAccess(node, inference, dfg, ctx) {

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

@@ -8,6 +8,7 @@ import type { ParentInformation } from '../../../r-bridge/lang-4.x/ast/model/pro
 import { RNull } from '../../../r-bridge/lang-4.x/convert-values';
 import type { RParseRequest } from '../../../r-bridge/retriever';
 import type { DataFrameShapeInferenceVisitor } from '../shape-inference';
+import { Identifier } from '../../../dataflow/environments/identifier';
 /**
  * The location of a function parameter for mapping function call arguments to function parameters.
  * - `pos` contains the position of the function parameter (use `-1` for non-existent or non-positional arguments)
@@ -72,7 +73,7 @@ export declare function getFunctionArguments(node: RFunctionCall<ParentInformati
  * @param dfg        - The data flow graph for checking the outgoing edges
  * @returns The name of all unresolved symbols in the expression
  */
-export declare function getUnresolvedSymbolsInExpression(expression: RNode<ParentInformation> | typeof EmptyArgument | undefined, dfg?: DataflowGraph): string[];
+export declare function getUnresolvedSymbolsInExpression(expression: RNode<ParentInformation> | typeof EmptyArgument | undefined, dfg?: DataflowGraph): Identifier[];
 /**
  * Checks whether a list of arguments contains any critical argument.
  * @param args     - The list of arguments to check

package/abstract-interpretation/data-frame/mappers/arguments.js

@@ -22,6 +22,7 @@ const convert_values_1 = require("../../../r-bridge/lang-4.x/convert-values");
 const assert_1 = require("../../../util/assert");
 const files_1 = require("../../../util/files");
 const resolve_args_1 = require("../resolve-args");
+const identifier_1 = require("../../../dataflow/environments/identifier");
 /** Regular expression representing valid columns names, e.g. for `data.frame` */
 const ColNamesRegex = /^[A-Za-z.][A-Za-z0-9_.]*$/;
 /** Regular expression representing line terminations (LF, CRLF, CR) */
@@ -136,7 +137,7 @@ function getUnresolvedSymbolsInExpression(expression, dfg) {
         if (node.type === type_1.RType.Symbol) {
             const vertex = dfg.get(node.info.id);
             if ((0, vertex_1.isUseVertex)(vertex?.[0]) && vertex[1].size === 0) {
-                unresolvedSymbols.push((0, resolve_args_1.unquoteArgument)(node.content));
+                unresolvedSymbols.push(identifier_1.Identifier.mapName(node.content, resolve_args_1.unquoteArgument));
             }
         }
     });

package/abstract-interpretation/data-frame/mappers/function-mapper.d.ts

@@ -179,9 +179,10 @@ declare const DataFrameFunctionMapper: {
 type DataFrameFunction = keyof typeof DataFrameFunctionMapper;
 /**
  * Maps a concrete data frame function call to abstract data frame operations.
- * @param node - The R node of the function call
- * @param dfg  - The data flow graph for resolving the arguments
- * @param ctx  - The current flowR analyzer context
+ * @param node      - The R node of the function call
+ * @param inference - The data frame shape inference visitor
+ * @param dfg       - The data flow graph for resolving the arguments
+ * @param ctx       - The current flowR analyzer context
  * @returns The mapped abstract data frame operations for the function call, or `undefined` if the node does not represent a data frame function call
  */
 export declare function mapDataFrameFunctionCall<Name extends DataFrameFunction>(node: RNode<ParentInformation>, inference: DataFrameShapeInferenceVisitor, dfg: DataflowGraph, ctx: ReadOnlyFlowrAnalyzerContext): DataFrameOperations;

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

@@ -11,6 +11,7 @@ const assert_1 = require("../../../util/assert");
 const dataframe_domain_1 = require("../dataframe-domain");
 const resolve_args_1 = require("../resolve-args");
 const arguments_1 = require("./arguments");
+const identifier_1 = require("../../../dataflow/environments/identifier");
 /**
  * Represents the different types of data frames in R
  */
@@ -517,9 +518,10 @@ const DataFrameFunctionParamsMapper = {
 };
 /**
  * Maps a concrete data frame function call to abstract data frame operations.
- * @param node - The R node of the function call
- * @param dfg  - The data flow graph for resolving the arguments
- * @param ctx  - The current flowR analyzer context
+ * @param node      - The R node of the function call
+ * @param inference - The data frame shape inference visitor
+ * @param dfg       - The data flow graph for resolving the arguments
+ * @param ctx       - The current flowR analyzer context
  * @returns The mapped abstract data frame operations for the function call, or `undefined` if the node does not represent a data frame function call
  */
 function mapDataFrameFunctionCall(node, inference, dfg, ctx) {
@@ -527,8 +529,9 @@ function mapDataFrameFunctionCall(node, inference, dfg, ctx) {
         return;
     }
     const resolveInfo = { graph: dfg, idMap: dfg.idMap, full: true, resolve: config_1.VariableResolve.Alias, ctx };
-    if (isDataFrameFunction(node.functionName.content)) {
-        const functionName = node.functionName.content;
+    const n = identifier_1.Identifier.getName(node.functionName.content);
+    if (isDataFrameFunction(n)) {
+        const functionName = n;
         const mapper = DataFrameFunctionMapper[functionName].mapper;
         const params = DataFrameFunctionParamsMapper[functionName];
         const args = (0, arguments_1.getFunctionArguments)(node, dfg);
@@ -540,7 +543,7 @@ function mapDataFrameFunctionCall(node, inference, dfg, ctx) {
         }
     }
     else {
-        const mapping = getOtherDataFrameFunction(node.functionName.content);
+        const mapping = getOtherDataFrameFunction(identifier_1.Identifier.getName(node.functionName.content));
         if (mapping === undefined) {
             return;
         }
@@ -841,7 +844,7 @@ function mapDataFrameFilter(args, params, inference, info) {
     const result = [];
     const filterArgs = args.filter(arg => arg !== dataFrame);
     const filterValues = filterArgs.map(arg => (0, resolve_args_1.resolveIdToArgValue)(arg, info));
-    const accessedNames = filterArgs.flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph));
+    const accessedNames = filterArgs.flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph).map(identifier_1.Identifier.getName));
     const condition = filterValues.every(value => typeof value === 'boolean') ? filterValues.every(cond => cond) : undefined;
     if (accessedNames.length > 0) {
         result.push({
@@ -929,7 +932,7 @@ function mapDataFrameMutate(args, params, inference, info) {
         .map(arg => (0, resolve_args_1.resolveIdToArgName)(arg, info));
     // only column names that are not created by mutation are preconditions on the operand
     const accessedNames = mutateArgs
-        .flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph))
+        .flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph).map(identifier_1.Identifier.toString))
         .filter(arg => !mutatedCols?.includes(arg));
     deletedCols = (0, arguments_1.filterValidNames)(deletedCols, params.checkNames, params.noDupNames, undefined, true);
     mutatedCols = (0, arguments_1.filterValidNames)(mutatedCols, params.checkNames, params.noDupNames, undefined, true);
@@ -970,7 +973,7 @@ function mapDataFrameGroupBy(args, params, inference, info) {
     }
     const result = [];
     const byArgs = args.filter(arg => arg !== dataFrame);
-    const accessedNames = byArgs.flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph));
+    const accessedNames = byArgs.flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph)).map(identifier_1.Identifier.toString);
     const byNames = byArgs.map(arg => (0, arguments_1.isNamedArgument)(arg) ? (0, resolve_args_1.resolveIdToArgName)(arg, info) : (0, resolve_args_1.resolveIdToArgValueSymbolName)(arg, info));
     const mutatedCols = byArgs.some(arguments_1.isNamedArgument) || byNames.some(assert_1.isUndefined);
     if (accessedNames.length > 0) {
@@ -999,7 +1002,7 @@ function mapDataFrameSummarize(args, params, inference, info) {
     const summarizedCols = summarizeArgs.map(arg => (0, resolve_args_1.resolveIdToArgName)(arg, info));
     // only column names that are not created by summarize are preconditions on the operand
     const accessedNames = summarizeArgs
-        .flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph))
+        .flatMap(arg => (0, arguments_1.getUnresolvedSymbolsInExpression)(arg, info.graph).map(identifier_1.Identifier.toString))
         .filter(arg => !summarizedCols.includes(arg));
     if (accessedNames.length > 0) {
         result.push({

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

@@ -11,6 +11,7 @@ const resolve_args_1 = require("../resolve-args");
 const semantics_1 = require("../semantics");
 const access_mapper_1 = require("./access-mapper");
 const arguments_1 = require("./arguments");
+const identifier_1 = require("../../../dataflow/environments/identifier");
 /** Mapper for mapping the supported data frame replacement functions to mapper functions */
 const DataFrameReplacementFunctionMapper = {
     'colnames': mapDataFrameColNamesAssignment,
@@ -42,9 +43,9 @@ function mapDataFrameReplacementFunction(node, expression, inference, dfg, ctx)
         }
     }
     else if (node.type === type_1.RType.FunctionCall && node.named && node.arguments.length === 1 && node.arguments[0] !== r_function_call_1.EmptyArgument) {
-        if (isDataFrameReplacement(node.functionName.content)) {
-            const functionName = node.functionName.content;
-            const mapper = DataFrameReplacementFunctionMapper[functionName];
+        const n = identifier_1.Identifier.getName(node.functionName.content);
+        if (isDataFrameReplacement(n)) {
+            const mapper = DataFrameReplacementFunctionMapper[n];
             return mapper(node.arguments[0], expression, inference, resolveInfo, parent);
         }
         else {
@@ -172,7 +173,7 @@ function mapDataFrameColNamesAssignment(operand, expression, inference, info, pa
             ...(parent !== undefined ? { options: { partial: true } } : {})
         }];
 }
-function mapDataFrameRowNamesAssignment(operand, expression, inference) {
+function mapDataFrameRowNamesAssignment(operand, _expression, inference) {
     if (!(0, arguments_1.isDataFrameArgument)(operand, inference)) {
         return;
     }
@@ -182,7 +183,7 @@ function mapDataFrameRowNamesAssignment(operand, expression, inference) {
             type: semantics_1.ConstraintType.OperandModification
         }];
 }
-function mapDataFrameDimNamesAssignment(operand, expression, inference) {
+function mapDataFrameDimNamesAssignment(operand, _expression, inference) {
     if (!(0, arguments_1.isDataFrameArgument)(operand, inference)) {
         return;
     }
@@ -192,7 +193,7 @@ function mapDataFrameDimNamesAssignment(operand, expression, inference) {
             colnames: undefined
         }];
 }
-function mapDataFrameUnknownAssignment(operand, expression, inference) {
+function mapDataFrameUnknownAssignment(operand, _expression, inference) {
     if (!(0, arguments_1.isDataFrameArgument)(operand, inference)) {
         return;
     }

package/abstract-interpretation/data-frame/resolve-args.js

@@ -13,6 +13,7 @@ const type_1 = require("../../r-bridge/lang-4.x/ast/model/type");
 const assert_1 = require("../../util/assert");
 const r_value_1 = require("../../util/r-value");
 const strings_1 = require("../../util/text/strings");
+const identifier_1 = require("../../dataflow/environments/identifier");
 /**
  * Returns the argument name of a function argument
  */
@@ -62,7 +63,7 @@ function resolveIdToArgStringVector(id, info) {
 function resolveIdToArgValueSymbolName(id, info) {
     const node = resolveIdToArgument(id, info);
     if (node?.value?.type === type_1.RType.Symbol) {
-        return unquoteArgument(node.value.content);
+        return unquoteArgument(identifier_1.Identifier.toString(node.value.content));
     }
     else if (node?.value?.type === type_1.RType.String) {
         return node.value.content.str;

package/benchmark/slicer.d.ts

@@ -75,22 +75,6 @@ export declare class BenchmarkSlicer {
      */
     init(request: RParseRequestFromFile | RParseRequestFromText, config: FlowrConfigOptions, autoSelectIf?: AutoSelectPredicate, threshold?: number): Promise<void>;
     private calculateStatsAfterInit;
-    /**
-     * Counts the number of stored indices in the dataflow graph created by the pointer analysis.
-     */
-    private countStoredVertexIndices;
-    /**
-     * Counts the number of stored indices in the dataflow graph created by the pointer analysis.
-     */
-    private countStoredEnvIndices;
-    /**
-     * Counts the number of stored indices in the passed definitions.
-     */
-    private countStoredIndices;
-    /**
-     * Recursively counts the number of indices and sub-indices in the given collection.
-     */
-    private countIndices;
     /**
      * Slice for the given {@link SlicingCriteria}.
      * @see SingleSlicingCriterion

package/benchmark/slicer.js

@@ -142,9 +142,6 @@ class BenchmarkSlicer {
             }
             return false;
         });
-        const storedVertexIndices = this.countStoredVertexIndices();
-        const storedEnvIndices = this.countStoredEnvIndices();
-        const overwrittenIndices = storedVertexIndices - storedEnvIndices;
         const split = loadedContent.split('\n');
         const nonWhitespace = (0, strings_1.withoutWhitespace)(loadedContent).length;
         this.stats = {
@@ -169,9 +166,6 @@ class BenchmarkSlicer {
                 numberOfCalls: numberOfCalls,
                 numberOfFunctionDefinitions: numberOfDefinitions,
                 sizeOfObject: (0, size_of_1.getSizeOfDfGraph)(this.dataflow.graph),
-                storedVertexIndices: storedVertexIndices,
-                storedEnvIndices: storedEnvIndices,
-                overwrittenIndices: overwrittenIndices,
             },
             // these are all properly initialized in finish()
             commonMeasurements: new Map(),
@@ -181,47 +175,6 @@ class BenchmarkSlicer {
             totalCommonTimePerToken: { raw: 0, normalized: 0 }
         };
     }
-    /**
-     * Counts the number of stored indices in the dataflow graph created by the pointer analysis.
-     */
-    countStoredVertexIndices() {
-        return this.countStoredIndices(this.dataflow?.out.map(ref => ref) ?? []);
-    }
-    /**
-     * Counts the number of stored indices in the dataflow graph created by the pointer analysis.
-     */
-    countStoredEnvIndices() {
-        return this.countStoredIndices(this.dataflow?.environment.current.memory.values()
-            ?.flatMap(def => def)
-            .map(def => def) ?? []);
-    }
-    /**
-     * Counts the number of stored indices in the passed definitions.
-     */
-    countStoredIndices(definitions) {
-        let numberOfIndices = 0;
-        for (const reference of definitions) {
-            if (reference.indicesCollection) {
-                numberOfIndices += this.countIndices(reference.indicesCollection);
-            }
-        }
-        return numberOfIndices;
-    }
-    /**
-     * Recursively counts the number of indices and sub-indices in the given collection.
-     */
-    countIndices(collection) {
-        let numberOfIndices = 0;
-        for (const indices of collection ?? []) {
-            for (const index of indices.indices) {
-                numberOfIndices++;
-                if ((0, vertex_1.isParentContainerIndex)(index)) {
-                    numberOfIndices += this.countIndices(index.subIndices);
-                }
-            }
-        }
-        return numberOfIndices;
-    }
     /**
      * Slice for the given {@link SlicingCriteria}.
      * @see SingleSlicingCriterion

package/benchmark/stats/print.js

@@ -159,9 +159,6 @@ Dataflow:
   Number of edges:               ${pad(stats.dataflow.numberOfEdges)}
   Number of calls:               ${pad(stats.dataflow.numberOfCalls)}
   Number of function defs:       ${pad(stats.dataflow.numberOfFunctionDefinitions)}
-  Number of stored Vtx indices:  ${pad(stats.dataflow.storedVertexIndices)}
-  Number of stored Env indices:  ${pad(stats.dataflow.storedEnvIndices)}
-  Number of overwritten indices: ${pad(stats.dataflow.overwrittenIndices)}
   Size of graph:                 ${convertNumberToNiceBytes(stats.dataflow.sizeOfObject)}`;
     if (stats.dataFrameShape !== undefined) {
         result += `
@@ -261,9 +258,6 @@ Dataflow:
   Number of edges:               ${formatSummarizedMeasure(stats.dataflow.numberOfEdges)}
   Number of calls:               ${formatSummarizedMeasure(stats.dataflow.numberOfCalls)}
   Number of function defs:       ${formatSummarizedMeasure(stats.dataflow.numberOfFunctionDefinitions)}
-  Number of stored Vtx indices:  ${formatSummarizedMeasure(stats.dataflow.storedVertexIndices)}
-  Number of stored Env indices:  ${formatSummarizedMeasure(stats.dataflow.storedEnvIndices)}
-  Number of overwritten indices: ${formatSummarizedMeasure(stats.dataflow.overwrittenIndices)}
   Size of graph:                 ${formatSummarizedMeasure(stats.dataflow.sizeOfObject, convertNumberToNiceBytes)}`;
     if (stats.dataFrameShape !== undefined) {
         result += `

package/benchmark/stats/stats.d.ts

@@ -40,9 +40,6 @@ export interface SlicerStatsDataflow<T = number> {
     numberOfCalls: T;
     numberOfFunctionDefinitions: T;
     sizeOfObject: T;
-    storedVertexIndices: T;
-    storedEnvIndices: T;
-    overwrittenIndices: T;
 }
 export interface SlicerStatsDfShape<T = number> {
     numberOfDataFrameFiles: T extends number ? 0 | 1 : number;

package/benchmark/summarizer/second-phase/process.js

@@ -105,9 +105,6 @@ function summarizeAllSummarizedStats(stats) {
             numberOfCalls: (0, summarizer_1.summarizeMeasurement)(dataflows.map(d => d.numberOfCalls)),
             numberOfEdges: (0, summarizer_1.summarizeMeasurement)(dataflows.map(d => d.numberOfEdges)),
             sizeOfObject: (0, summarizer_1.summarizeMeasurement)(dataflows.map(d => d.sizeOfObject)),
-            storedVertexIndices: (0, summarizer_1.summarizeMeasurement)(dataflows.map(d => d.storedVertexIndices)),
-            storedEnvIndices: (0, summarizer_1.summarizeMeasurement)(dataflows.map(d => d.storedEnvIndices)),
-            overwrittenIndices: (0, summarizer_1.summarizeMeasurement)(dataflows.map(d => d.overwrittenIndices)),
         },
         dataFrameShape: stats.some(s => s.dataFrameShape !== undefined) ? {
             numberOfDataFrameFiles: (0, arrays_1.arraySum)(stats.map(s => s.dataFrameShape?.numberOfDataFrameFiles).filter(assert_1.isNotUndefined)),
@@ -192,9 +189,6 @@ function summarizeAllUltimateStats(stats) {
             numberOfCalls: (0, process_1.summarizeSummarizedMeasurement)(stats.map(s => s.dataflow.numberOfCalls)),
             numberOfEdges: (0, process_1.summarizeSummarizedMeasurement)(stats.map(s => s.dataflow.numberOfEdges)),
             sizeOfObject: (0, process_1.summarizeSummarizedMeasurement)(stats.map(s => s.dataflow.sizeOfObject)),
-            storedVertexIndices: (0, process_1.summarizeSummarizedMeasurement)(stats.map(s => s.dataflow.storedVertexIndices)),
-            storedEnvIndices: (0, process_1.summarizeSummarizedMeasurement)(stats.map(s => s.dataflow.storedEnvIndices)),
-            overwrittenIndices: (0, process_1.summarizeSummarizedMeasurement)(stats.map(s => s.dataflow.overwrittenIndices)),
         },
         dataFrameShape: stats.some(s => s.dataFrameShape !== undefined) ? {
             numberOfDataFrameFiles: (0, arrays_1.arraySum)(stats.map(s => s.dataFrameShape?.numberOfDataFrameFiles).filter(assert_1.isNotUndefined)),

package/cli/benchmark-app.d.ts

@@ -11,7 +11,6 @@ export interface BenchmarkCliOptions {
     seed?: string;
     parser: KnownParserName;
     'dataframe-shape-inference': boolean;
-    'enable-pointer-tracking': boolean;
     'max-file-slices': number;
     threshold?: number;
     'per-file-time-limit'?: number;

package/cli/benchmark-app.js

@@ -70,7 +70,6 @@ async function benchmark() {
         '--slice', options.slice, ...verboseAdd,
         '--parser', options.parser,
         ...(options['dataframe-shape-inference'] ? ['--dataframe-shape-inference'] : []),
-        ...(options['enable-pointer-tracking'] ? ['--enable-pointer-tracking'] : []),
         '--max-slices', `${options['max-file-slices']}`,
         ...(options.threshold ? ['--threshold', `${options.threshold}`] : []),
         '--sampling-strategy', options['sampling-strategy'],

package/cli/benchmark-helper-app.d.ts

@@ -9,7 +9,6 @@ export interface SingleBenchmarkCliOptions {
     output?: string;
     parser: KnownParserName;
     'dataframe-shape-inference': boolean;
-    'enable-pointer-tracking': boolean;
     'max-slices': number;
     'cfg': boolean;
     threshold?: number;

package/cli/benchmark-helper-app.js

@@ -38,11 +38,7 @@ async function benchmark() {
     if (directory !== '') {
         fs_1.default.mkdirSync(directory, { recursive: true });
     }
-    // Enable pointer analysis if requested, otherwise disable it
-    const config = (0, config_1.amendConfig)((0, config_1.getConfig)(), c => {
-        c.solver.pointerTracking = options['enable-pointer-tracking'];
-        return c;
-    });
+    const config = (0, config_1.getConfig)();
     // ensure the file exists
     const fileStat = fs_1.default.statSync(options.input);
     (0, assert_1.guard)(fileStat.isFile(), `File ${options.input} does not exist or is no file`);

package/cli/common/options.d.ts

@@ -75,11 +75,6 @@ export declare const benchmarkOptions: [{
     readonly type: BooleanConstructor;
     readonly description: "Infer the shape of data frames using abstract interpretation (includes control flow graph extraction)";
     readonly defaultValue: false;
-}, {
-    readonly name: "enable-pointer-tracking";
-    readonly type: BooleanConstructor;
-    readonly description: "Run dataflow analysis with pointer tracking";
-    readonly defaultValue: false;
 }, {
     readonly name: "max-file-slices";
     readonly type: NumberConstructor;
@@ -168,11 +163,6 @@ export declare const benchmarkHelperOptions: [{
     readonly type: BooleanConstructor;
     readonly description: "Infer the shape of data frames using abstract interpretation (includes control flow graph extraction)";
     readonly defaultValue: false;
-}, {
-    readonly name: "enable-pointer-tracking";
-    readonly type: BooleanConstructor;
-    readonly description: "Run dataflow analysis with pointer tracking";
-    readonly defaultValue: false;
 }, {
     readonly name: "max-slices";
     readonly type: NumberConstructor;