Unification and combination of a class of traversal strategies made with pattern matching and fixed-points

DOI10.1016/j.jlamp.2021.100746OpenAlexW4200355015MaRDI QIDQ2669251

Duc Duy Nguyen, Walid Belkhir, Nicolas Ratier, Michel Lenczner

Publication date: 9 March 2022

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.07668

zbMATH Keywords

fixed-pointunificationcombination\( \mu \)-calculustraversal strategies

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• MEMSALab
• CoReS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reduction of event structures under history preserving bisimulation
• The variable hierarchy for the games \(\mu \)-calculus
• The solutions of two star-height problems for regular trees
• Fundamental properties of infinite trees
• Partial predicate abstraction and counter-example guided refinement
• Tests and proofs. 9th international conference, TAP 2015, held as part of STAF 2015, L'Aquila, Italy, July 22--24, 2015. Proceedings
• Model checking and synthesis for branching multi-weighted logics
• A symbolic transformation language and its application to a multiscale method
• A two-scale model for an array of AFM's cantilever in the static case
• Transition graphs and the star-height of regular events
• A lattice-theoretical fixpoint theorem and its applications
• On-the-Fly Branching Bisimulation Minimization for Compositional Analysis
• Infinite terms and infinite rewritings
• Formal Methods at the Crossroads. From Panacea to Foundational Support
• CoReS: a tool for computing core graphs via SAT/SMT solvers
• Rudiments of \(\mu\)-calculus

This page was built for publication: Unification and combination of a class of traversal strategies made with pattern matching and fixed-points