1000 search results - page 79 / 200 » Nominal rewriting systems |
WADT
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. We consider the verification of a simple pipelined microprocessor in Maude, by implementing an equational theoretical model of systems. Maude is an equationally-based la...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
FCT
1999
Springer
13 years 12 months ago
1999
Springer
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and coalgebras. Tiles are rewrite rules with side e ects which a...