arxiv: 2604.06876 · v1 · submitted 2026-04-08 · 💻 cs.DC · cs.MA· cs.RO

Recognition: 2 theorem links

· Lean Theorem

Exploiting Aggregate Programming in a Multi-Robot Service Prototype

Giorgio Audrito (Dipartimento di Informatica , Universita' di Torino) , Andrea Basso (MITO Technology) , Daniele Bortoluzzi (Dipartimento di Informatica , Ferruccio Damiani (Dipartimento di Informatica , Giordano Scarso (Dipartimento di Informatica , Gianluca Torta (Dipartimento di Informatica

Authors on Pith no claims yet

Pith reviewed 2026-05-10 18:13 UTC · model grok-4.3

classification 💻 cs.DC cs.MAcs.RO

keywords multi-robot systemsaggregate programmingcoordination softwareservice prototypedistributed systemsproximity-based communicationsimulationsphysical validation

0 comments

The pith

A multi-robot service prototype uses Aggregate Programming to design and run its coordination software.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a working prototype of a multi-robot service system whose coordination layer is built with Aggregate Programming. The authors show that this approach can be applied to a concrete service task and that the resulting system passes both simulated tests and physical trials inside a university library. A reader would care because multi-robot systems combine the usual difficulties of distributed coordination with the added messiness of real physical robots and spaces, and a high-level programming method that handles both at once could simplify construction of such applications.

Core claim

The prototype adopts Aggregate Programming for the design and implementation of its coordination software and has been validated both with simulations and with tests in a University library.

What carries the argument

Aggregate Programming (AP), an approach to engineering resilient distributed systems that uses proximity-based communication and is supported by practical frameworks.

If this is right

Coordination logic for multi-robot services can be written at the aggregate level rather than with low-level robot-specific code.
The same AP framework can move from simulation to physical deployment in a real indoor environment.
Multi-robot systems become easier to program when proximity-based communication abstractions are used for coordination.
Validation in a library setting demonstrates feasibility for other service domains such as healthcare or exploration.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The approach could be tested on outdoor or dynamic environments where robot movement and sensing are less predictable.
Similar AP-based coordination might apply to other distributed physical systems beyond robots, such as sensor networks or drone swarms.
If the prototype scales, it suggests a path toward reusable aggregate programs for entire classes of service robots rather than one-off implementations.

Load-bearing premise

Aggregate Programming can manage the physical complexities of robots and their environments sufficiently for a service application without additional low-level mechanisms.

What would settle it

The prototype fails to complete its service tasks reliably during the university library tests because of physical robot or environment issues that AP does not handle.

Figures

Figures reproduced from arXiv: 2604.06876 by Andrea Basso (MITO Technology), Daniele Bortoluzzi (Dipartimento di Informatica, Ferruccio Damiani (Dipartimento di Informatica, Gianluca Torta (Dipartimento di Informatica, Giordano Scarso (Dipartimento di Informatica, Giorgio Audrito (Dipartimento di Informatica, Universita' di Torino).

**Figure 2.** Figure 2: Architecture of the developed platform, integrating Aggregate Programming and ROS2. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

**Figure 3.** Figure 3: Distributed Task Assignment with AP. Parameters [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗

**Figure 4.** Figure 4: Library world simulated with Gazebo. 5 Validation 5.1 Simulation Scenario. The simulated environment is a near-identical replica of a portion of the [removed for double-blind review], as shown in [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗

**Figure 5.** Figure 5: Network partition between robots (left): groups {1,2,3} and {4,5} (we show both the FCPP [PITH_FULL_IMAGE:figures/full_fig_p009_5.png] view at source ↗

**Figure 6.** Figure 6: Multiple robots in action. unique ROS domain ID. A single ROS domain ID is reserved for registering feedback from all the robots, and communication between the robots is handled using AP’s communication scheme. This setup was necessary because discovery between nodes on the network would overflow the Create3 RAM, causing the robots to continuously restart. The physical experimentation replicated the config… view at source ↗

read the original abstract

Multi-robot systems are becoming increasingly relevant within diverse application domains, such as healthcare, exploration, and rescue missions. However, building such systems is still a significant challenge, since it adds the complexities of the physical nature of robots and their environments to those inherent in coordinating any distributed (multi-agent) system. Aggregate Programming (AP) has recently emerged as a promising approach to engineering resilient, distributed systems with proximity-based communication, and is notably supported by practical frameworks. In this paper we present a prototype of a multi-robot service system, which adopts AP for the design and implementation of its coordination software. The prototype has been validated both with simulations, and with tests in a University library.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

A solid prototype paper showing Aggregate Programming working for multi-robot coordination in a library service setting, but the validation stays high-level with no metrics or architecture details.

read the letter

The main takeaway is that this is a working demonstration of Aggregate Programming applied to a multi-robot service prototype, with both simulation runs and physical tests in a university library. It takes an existing technique for resilient distributed systems and puts it into a concrete robotics scenario involving physical movement and environment interaction. That application itself is the new piece; there are no new theoretical results or first-principles derivations here, just an implementation example built on prior AP frameworks. The authors do a reasonable job laying out the coordination challenges in multi-robot services and showing that AP can handle the high-level logic without reinventing everything from scratch. The real-world library tests add some credibility beyond pure simulation, which is worth noting for anyone thinking about deploying these ideas on hardware. The soft spots sit in the evaluation and architecture description. The paper states that validation happened but supplies no success rates, timing data, scalability numbers, error analysis, or direct comparisons to baselines like standard ROS setups. This makes it hard to judge how well AP actually copes with physical complexities such as navigation, collision avoidance, or sensor noise on its own. The stress-test point about whether low-level middleware is doing most of the work is fair; without diagrams or code snippets showing the mapping from AP fields to actuators, the claim that AP suffices remains more asserted than demonstrated. Minor gaps like these are common in prototype papers, but they limit how much a reader can take away about robustness. This work is mainly for people already interested in aggregate or field calculus approaches who want a practical robotics example to build on. It is not aimed at readers seeking strong empirical claims or novel algorithms. The paper shows clear engagement with the AP literature and honest description of a system, so it deserves a serious referee at a systems or robotics venue to get feedback on the implementation and to encourage more quantitative results in a revision.

Referee Report

2 major / 1 minor

Summary. The manuscript presents a prototype of a multi-robot service system that adopts Aggregate Programming (AP) for the design and implementation of its coordination software. The prototype is validated both with simulations and with tests in a university library.

Significance. If the validation were supported by detailed quantitative evidence and architecture details, the work would demonstrate a concrete application of AP to multi-robot coordination in a service domain, providing evidence that high-level aggregate abstractions can address physical robot and environment complexities in practice. This could strengthen the case for AP as a practical tool for resilient distributed systems beyond abstract models.

major comments (2)

[Validation] The validation description (both simulations and library tests) supplies no quantitative metrics, error analysis, baselines, success rates, or detailed results. This directly prevents evaluation of whether the data support the central claim that the AP-based prototype suffices for a real service application.
[Prototype description] The prototype description provides no architecture diagram, code snippet, or explicit mapping showing how AP interfaces with low-level robot functions such as navigation, collision avoidance, sensing, or actuation (or whether middleware such as ROS is used). Without this or an ablation study, the claim that AP manages physical complexities without additional mechanisms cannot be assessed.

minor comments (1)

Consider adding a short related-work subsection contrasting this prototype with prior AP applications in robotics or multi-agent systems to clarify the incremental contribution.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive feedback. We agree that additional quantitative details and architectural clarifications will strengthen the manuscript and will revise accordingly to address the concerns raised.

read point-by-point responses

Referee: The validation description (both simulations and library tests) supplies no quantitative metrics, error analysis, baselines, success rates, or detailed results. This directly prevents evaluation of whether the data support the central claim that the AP-based prototype suffices for a real service application.

Authors: We acknowledge that the current version presents the validation at a high level without sufficient quantitative support. In the revised manuscript we will add specific metrics from the simulations, including task completion rates, coordination latency under different robot counts, and failure modes observed. For the library tests we will report the number of trials, success rates for service tasks such as item retrieval and delivery, any physical interaction issues encountered, and basic error analysis. These additions will allow direct assessment of whether the results support the prototype's suitability for service applications. revision: yes
Referee: The prototype description provides no architecture diagram, code snippet, or explicit mapping showing how AP interfaces with low-level robot functions such as navigation, collision avoidance, sensing, or actuation (or whether middleware such as ROS is used). Without this or an ablation study, the claim that AP manages physical complexities without additional mechanisms cannot be assessed.

Authors: We agree that the prototype architecture requires more explicit description. The revised version will include a layered architecture diagram, a short code snippet illustrating an aggregate program calling robot primitives, and a clear mapping of AP constructs to low-level operations. The implementation uses ROS for navigation, collision avoidance, sensing, and actuation, with AP providing the coordination layer on top; this separation will be stated explicitly. A full ablation study comparing AP against non-AP baselines is outside the scope of this prototype paper, but we will expand the discussion to explain how the aggregate abstractions handle many physical and environmental complexities through field-based resilience without requiring additional per-robot coordination logic. revision: partial

Circularity Check

0 steps flagged

No significant circularity; paper is a descriptive prototype report without derivations or predictions.

full rationale

The paper presents a multi-robot service prototype using Aggregate Programming (AP) for coordination software, validated via simulations and library tests. No equations, fitted parameters, predictions, or mathematical derivations exist. No self-citations are load-bearing for any central claim, and the work contains no self-definitional structures, ansatzes smuggled via citation, or renamed known results. The central claim is an empirical system description whose validity rests on the reported tests rather than any reduction to its own inputs by construction. This is the expected outcome for a non-mathematical prototype paper.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No mathematical content, free parameters, axioms, or invented entities appear in the abstract.

pith-pipeline@v0.9.0 · 5467 in / 982 out tokens · 50105 ms · 2026-05-10T18:13:21.386445+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/SelfBootstrapDistinguishability.lean selfBootstrapCert echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

the self-stabilizing nature and resilience to changes of AP operators, has made it possible to deal naturally with several dynamic/failure scenarios

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

35 extracted references · 23 canonical work pages

[1]

In Cinzia Di Giusto & António Ravara, editors: Coordination Models and Languages , Springer Nature Switzerland, Cham, pp

Gianluca Aguzzi, Lorenzo Bacchini, Martina Baiardi, Roberto Casadei, Angela Cortecchia, Davide Do- mini, Nicolas Farabegoli, Danilo Pianini & Mirko Viroli (2025): A Demonstrator for Self-organizing Robot Teams. In Cinzia Di Giusto & António Ravara, editors: Coordination Models and Languages , Springer Nature Switzerland, Cham, pp. 230–244

2025
[2]

In: Interna- tional Conference on Autonomic Computing and Self-Organizing Systems (ACSOS) , IEEE, pp

Giorgio Audrito (2020): FCPP: an efficient and extensible Field Calculus framework . In: Interna- tional Conference on Autonomic Computing and Self-Organizing Systems (ACSOS) , IEEE, pp. 153–159, doi:10.1109/ACSOS49614.2020.00037

work page doi:10.1109/acsos49614.2020.00037 2020
[3]

Giorgio Audrito, Gianluca Aguzzi, Roberto Casadei, Ferruccio Damiani, Gianluca Torta & Mirko Viroli (2023): Swarm Intell. 17, p. 27–62, doi:10.1007/s11721-022-00215-y

work page doi:10.1007/s11721-022-00215-y 2023
[4]

Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Guido Salvaneschi & Mirko Viroli (2022):Functional Programming for Distributed Systems with XC. In Karim Ali & Jan Vitek, editors:36th European Conference on Object-Oriented Programming, ECOOP 2022, June 6-10, 2022, Berlin, Germany , LIPIcs 222, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 20:...

work page doi:10.4230/lipics.ecoop.2022.20 2022
[5]

Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Guido Salvaneschi & Mirko Viroli (2024): The eX- change Calculus (XC): A functional programming language design for distributed collective systems. J. Syst. Softw. 210, p. 111976, doi:10.1016/J.JSS.2024.111976

work page doi:10.1016/j.jss.2024.111976 2024
[6]

Future Gener

Giorgio Audrito, Roberto Casadei & Gianluca Torta (2024): A general framework and decentralised algorithms for collective computational processes . Future Gener. Comput. Syst. 158, pp. 11–27, doi:10.1016/J.FUTURE.2024.04.020

work page doi:10.1016/j.future.2024.04.020 2024
[7]

In Tiziana Margaria & Bernhard Steffen, editors: Leveraging Applications of Formal Methods, Verification and Validation

Giorgio Audrito, Ferruccio Damiani & Gianluca Torta (2022): Bringing Aggregate Programming Towards the Cloud. In Tiziana Margaria & Bernhard Steffen, editors: Leveraging Applications of Formal Methods, Verification and Validation. Adaptation and Learning - 11th International Symposium, ISoLA 2022, Rhodes, Greece, October 22-30, 2022, Proceedings, Part III...

work page doi:10.1007/978-3-031-19759-8_19 2022
[8]

In Maurice H

Giorgio Audrito, Luigi Rapetta & Gianluca Torta (2022): Extensible 3D Simulation of Aggregated Systems with FCPP . In Maurice H. ter Beek & Marjan Sirjani, editors: Coordination Models and Languages - 24th IFIP WG 6.1 International Conference, COORDINATION 2022, Held as Part of the 17th International Federated Conference on Distributed Computing Technique...

work page doi:10.1007/978-3-031-08143- 2022
[9]

Giorgio Audrito & Gianluca Torta (2024): FCPP to aggregate them all . Sci. Comput. Program. 231, p. 103026, doi:10.1016/J.SCICO.2023.103026

work page doi:10.1016/j.scico.2023.103026 2024
[10]

In: Formal and Practical Aspects of Domain-Specific Languages: Recent Developments, chapter 16, IGI Global, pp

Jacob Beal, Stefan Dulman, Kyle Usbeck, Mirko Viroli & Nikolaus Correll (2013): Organizing the Aggre- gate: Languages for Spatial Computing . In: Formal and Practical Aspects of Domain-Specific Languages: Recent Developments, chapter 16, IGI Global, pp. 436–501, doi:10.4018/978-1-4666-2092-6.ch016

work page doi:10.4018/978-1-4666-2092-6.ch016 2013
[11]

IEEE Computer 48(9), pp

Jacob Beal, Danilo Pianini & Mirko Viroli (2015): Aggregate Programming for the Internet of Things. IEEE Computer 48(9), pp. 22–30, doi:10.1109/MC.2015.261

work page doi:10.1109/mc.2015.261 2015
[12]

In: 2015 10th System of Systems Engineering Conference (SoSE), pp

Patrick Benavidez, Mohan Kumar, Sos Agaian & Mo Jamshidi (2015): Design of a home multi-robot system for the elderly and disabled. In: 2015 10th System of Systems Engineering Conference (SoSE), pp. 392–397, doi:10.1109/SYSOSE.2015.7151907

work page doi:10.1109/sysose.2015.7151907 2015
[13]

In: IEEE International Conference on Autonomic Computing and Self-Organizing Systems, ACSOS 2023 - Companion, Toronto, ON, Canada, September 25-29, 2023 , IEEE, pp

Roberto Casadei, Gianluca Aguzzi, Danilo Pianini & Mirko Viroli (2023): Programming (and Learn- ing) Self-Adaptive & Self-Organising Behaviour with ScaFi: for Swarms, Edge-Cloud Ecosystems, and More. In: IEEE International Conference on Autonomic Computing and Self-Organizing Systems, ACSOS 2023 - Companion, Toronto, ON, Canada, September 25-29, 2023 , IE...

work page doi:10.1109/acsos- 2023
[14]

In: First Work- shop on Programming Models and Languages for Distributed Computing , PMLDC ’16, ACM, pp

Roberto Casadei & Mirko Viroli (2016): Towards Aggregate Programming in Scala . In: First Work- shop on Programming Models and Languages for Distributed Computing , PMLDC ’16, ACM, pp. 5:1–5:7, doi:10.1145/2957319.2957372

work page doi:10.1145/2957319.2957372 2016
[15]

SoftwareX 20, p

Roberto Casadei, Mirko Viroli, Gianluca Aguzzi & Danilo Pianini (2022): ScaFi: A Scala DSL and Toolkit for Aggregate Programming. SoftwareX 20, p. 101248, doi:10.1016/J.SOFTX.2022.101248

work page doi:10.1016/j.softx.2022.101248 2022
[16]

Roberto Casadei, Mirko Viroli, Giorgio Audrito, Danilo Pianini & Ferruccio Damiani (2021): Engineering collective intelligence at the edge with aggregate processes. Eng. Appl. Artif. Intell. 97, p. 104081

2021
[17]

Robotics and Autonomous Systems 168, p

Hamza Chakraa, François Guérin, Edouard Leclercq & Dimitri Lefebvre (2023): Optimization techniques for Multi-Robot Task Allocation problems: Review on the state-of-the-art . Robotics and Autonomous Systems 168, p. 104492, doi:10.1016/j.robot.2023.104492

work page doi:10.1016/j.robot.2023.104492 2023
[18]

(2011): LUNARES: Lunar crater exploration with heterogeneous multi robot systems

Florian Cordes, Ingo Ahrns, Sebastian Bartsch, Timo Birnschein, Alexander Dettmann, Stéphane Estable, Stefan Haase, Jens Hilljegerdes, David Koebel, Steffen Planthaber et al. (2011): LUNARES: Lunar crater exploration with heterogeneous multi robot systems. Intelligent Service Robotics 4, pp. 61–89

2011
[19]

https://iroboteducation.github.io/ create3_docs/

iRobot Corporation (2021): Create 3 Educational Robot. https://iroboteducation.github.io/ create3_docs/

2021
[20]

Intelligent Service Robotics 11, pp

Alessandro Di Nuovo, Frank Broz, Ning Wang, Tony Belpaeme, Angelo Cangelosi, Ray Jones, Raffaele Esposito, Filippo Cavallo & Paolo Dario (2018):The multi-modal interface of Robot-Era multi-robot services tailored for the elderly. Intelligent Service Robotics 11, pp. 109–126

2018
[21]

Gerkey & Maja J

Brian P. Gerkey & Maja J. Matari ´c (2004): A Formal Analysis and Taxonomy of Task Alloca- tion in Multi-Robot Systems . The International Journal of Robotics Research 23(9), pp. 939–954, doi:10.1177/0278364904045564

work page doi:10.1177/0278364904045564 2004
[22]

In: 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp

Lydia Habib, Marie-Pierre Pacaux-Lemoine & Patrick Millot (2018): Human-Robots Team Cooperation in Crisis Management Mission . In: 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 3219–3224, doi:10.1109/SMC.2018.00545

work page doi:10.1109/smc.2018.00545 2018
[23]

Leslie Lamport (1978): Time, Clocks, and the Ordering of Events in a Distributed System . Commun. ACM 21(7), pp. 558–565

1978
[24]

Shaghil (2023): Consensus-based fast and energy-efficient multi-robot task allocation

Prabhat Mahato, Sudipta Saha, Chayan Sarkar & Md. Shaghil (2023): Consensus-based fast and energy-efficient multi-robot task allocation . Robotics and Autonomous Systems 159, p. 104270, doi:10.1016/j.robot.2022.104270

work page doi:10.1016/j.robot.2022.104270 2023
[25]

Automatica 146, p

Yuanqiu Mo, Giorgio Audrito, Soura Dasgupta & Jacob Beal (2022): Near-optimal knowledge-free resilient leader election. Automatica 146, p. 110583, doi:10.1016/j.automatica.2022.110583. Available at https: //www.sciencedirect.com/science/article/pii/S0005109822004459

work page doi:10.1016/j.automatica.2022.110583 2022
[26]

Journal of the Australian Library and Information Association 69(2), pp

Linh Cuong Nguyen (2020): The impact of humanoid robots on Australian public libraries . Journal of the Australian Library and Information Association 69(2), pp. 130–148

2020
[27]

In: 1st International Workshop on Human-Drone Interaction

Max Pascher, Annalies Baumeister, Barbara Klein, Stefan Schneegass & Jens Gerken (2019): Little helper: a multi-robot system in home health care environments . In: 1st International Workshop on Human-Drone Interaction

2019
[28]

(2024): Collektive

Danilo Pianini et al. (2024): Collektive. https://collektive.github.io/

2024
[29]

Rocha (2013): Scalable, fault-tolerant and distributed multi-robot patrol in real world environments

David Portugal & Rui P. Rocha (2013): Scalable, fault-tolerant and distributed multi-robot patrol in real world environments. In: 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems , pp. 4759–4764, doi:10.1109/IROS.2013.6697042

work page doi:10.1109/iros.2013.6697042 2013
[30]

IEEE Access 8, pp

Jorge Peña Queralta, Jussi Taipalmaa, Bilge Can Pullinen, Victor Kathan Sarker, Tuan Nguyen Gia, Hannu Tenhunen, Moncef Gabbouj, Jenni Raitoharju & Tomi Westerlund (2020):Collaborative Multi-Robot Search and Rescue: Planning, Coordination, Perception, and Active Vision . IEEE Access 8, pp. 191617–191643, doi:10.1109/ACCESS.2020.3030190. G. Audrito et al. 57

work page doi:10.1109/access.2020.3030190 2020
[31]

In: Proceedings of the land warfare conference (LWC)

Pradeep Ranganathan, Ryan Morton, Andrew Richardson, Johannes Strom, Robert Goeddel, Mihai Bulic & Edwin Olson (2010): Coordinating a team of robots for urban reconnaisance . In: Proceedings of the land warfare conference (LWC)

2010
[32]

Library Hi Tech News 39(7), pp

Adeyinka Tella & Yusuf Ayodeji Ajani (2022): Robots and public libraries . Library Hi Tech News 39(7), pp. 15–18

2022
[33]

ACM Trans

Mirko Viroli, Giorgio Audrito, Jacob Beal, Ferruccio Damiani & Danilo Pianini (2018): Engineering Re- silient Collective Adaptive Systems by Self-Stabilisation . ACM Trans. Model. Comput. Simul. 28(2), pp. 1–16

2018
[34]

Itô-Wentzell-Lions Formula for Mea- sure Dependent Random Fields under Full and Conditional Measure Flows

Mirko Viroli, Jacob Beal, Ferruccio Damiani, Giorgio Audrito, Roberto Casadei & Danilo Pianini (2018): From Field-Based Coordination to Aggregate Computing . In: Coordination Models and Languages (CO- ORDINATION), Lecture Notes in Computer Science 10852, Springer, pp. 252–279, doi:10.1007/978-3-319- 92408-3_12

work page doi:10.1007/978-3-319- 2018
[35]

Mirko Viroli, Jacob Beal, Ferruccio Damiani, Giorgio Audrito, Roberto Casadei & Danilo Pianini (2019): From distributed coordination to field calculus and aggregate computing . J. Log. Algebraic Methods Pro- gram. 109, doi:10.1016/j.jlamp.2019.100486

work page doi:10.1016/j.jlamp.2019.100486 2019