W. Belkhir, A. Giorgetti & M. Lenczner (December 2010):
Rewriting and Symbolic Transformations for Multi-scale Methods.
Url: http://arxiv.org/abs/1101.3218v1. Submitted..
D. Benanav, D. Kapur & P. Narendran (1985):
Complexity of matching problems.
In: Proc. of the 1st Int. Conf. on Rewriting Techniques and Applications,
LNCS 202.
Springer,
pp. 417–429,
doi:10.1007/3-540-15976-2_22.
P. Borovanský, C. Kirchner, H. Kirchner & C. Ringeissen (2001):
Rewriting with strategies in ELAN: a functional semantics.
International Journal of Foundations of Computer Science 12(1),
pp. 69–98,
doi:10.1142/S0129054101000412.
H. Cirstea, G. Faure & C. Kirchner (2007):
A ρ-calculus of explicit constraint application.
Higher-Order and Symbolic Computation 20,
pp. 37–72,
doi:10.1007/s10990-007-9004-2.
H. Cirstea & C. Kirchner (2001):
The rewriting calculus — Part I and II.
Logic Journal of the Interest Group in Pure and Applied Logics 9(3),
pp. 427–498.
M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Mart\'ı-Oliet, J. Meseguer & C. L. Talcott (2007):
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic.
LNCS 4350.
Springer.
N. Dershowitz (1982):
Ordering for Term-Rewriting Systems.
Theoretical Computer Science 17,
pp. 279–300,
doi:10.1016/0304-3975(82)90026-3.
S. Eker (1995):
AC-Matching Via Bipartite Graph Matching.
Comput. J. 38(5),
pp. 381–399,
doi:10.1093/comjnl/38.5.381.
S. Eker (1996):
Fast matching in combinations of regular equational theories.
ENTCS 4,
pp. 90–109.
S. Eker (2002):
Single Elementary AC-Matching.
J. Autom. Reasoning 28(1),
pp. 35–51,
doi:10.1023/A:1020122610698.
B. Gramlich (1988):
Efficient AC-Matching using Constraint Propagation.
In: Proc. 2nd Int. Workshop on Unification, Internal Report 89 R 38, CRIN,
Val d'Ajol, France.
H. Kirchner & P.-E. Moreau (2001):
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in AC-theories.
J. Funct. Program. 11,
pp. 207–251.
N. Mart\'ı-Oliet, J. Meseguer & A. Verdejo (2005):
Towards a Strategy Language for Maude.
Electr. Notes Theor. Comput. Sci. 117,
pp. 417–441,
doi:10.1016/j.entcs.2004.06.020.
Terese (2003):
Term Rewriting Systems.
Cambridge Tracts in Theor. Comp. Sci. 55.
Cambridge Univ. Press.
E. Visser (2001):
Stratego: A Language for Program Transformation based on Rewriting Strategies. System Description of Stratego 0.5.
In: Proc. of RTA'01,
Lecture Notes in Computer Science 2051.
Springer-Verlag,
pp. 357–361,
doi:10.1007/3-540-45127-7_27.
B. Yang, W. Belkhir, R.N. Dhara, M. Lenczner & A. Giorgetti (2011):
Computer–Aided Multiscale Model Derivation for MEMS Arrays.
In: EuroSimE 2011, 13-th Int. Conf. on Thermal, Mechanical and Multi-Physics Simulation and Experiments in Microelectronics and Microsystems.
IEEE Computer Society,
Linz, Austria.
6 pages,
doi:10.1109/ESIME.2011.5765784.
B. Yang, R.N. Dhara, W. Belkhir, M. Lenczner & A. Giorgetti (2011):
Formal Methods for Multiscale Models Derivation.
In: CFM 2011, 20th Congrès Français de Mécanique.
5 pages.
eptcs@eptcs.org