4 citations · 14 across the 13 of their papers we have counts for
13 papers
Unification and combination of iterative insertion strategies with rudimentary traversals and failure
Walid Belkhir, Nicolas Ratier, Duy Duc Nguyen Michel Lenczner
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is as…
Unification and combination of a class of traversal strategies made with pattern matching and fixed-points
Walid Belkhir, Nicolas Ratier, Duy Duc Nguyen +1
Motivated by an ongoing project on computer aided derivation of asymptotic models governed by partial differential equations, we introduce a class of term transformations that cons…
Fresh-Variable Automata for Service Composition
Walid Belkhir, Yannick Chevalier, Michael Rusinowitch
To model Web services handling data from an infinite domain, or with multiple sessions, we introduce fresh-variable automata, a simple extension of finite-state automata in which s…
Guarded Variable Automata over Infinite Alphabets
Walid Belkhir, Yannick Chevalier, Michael Rusinowitch
We define guarded variable automata (GVAs), a simple extension of finite automata over infinite alphabets. In this model the transitions are labelled by letters or variables rangin…
Computer-Aided Derivation of Multi-scale Models: A Rewriting Framework
Bin Yang, Walid Belkhir, Michel Lenczner
We introduce a framework for computer-aided derivation of multi-scale models. It relies on a combination of an asymptotic method used in the field of partial differential equations…
Lazy AC-Pattern Matching for Rewriting
Walid Belkhir, Alain Giorgetti
We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substi…