POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Context-sensitive rewriting strategies
Information and Computation
Formal analysis of Suzuki & Kasami distributed mutual exclusion algorithm
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
Flaw and modification of the iKP electronic payment protocols
Information Processing Letters
Formally Modeling and Verifying Ricart & Agrawala Distributed Mutual Exclusion Algorithm
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
The specification and application to programming of abstract data types.
The specification and application to programming of abstract data types.
Ground reducibility is EXPTIME-complete
Information and Computation
On the completeness of context-sensitive order-sorted specifications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Advanced Topics in Term Rewriting
Advanced Topics in Term Rewriting
| Hi-index | 0.00 |
In this paper, we propose the notion of reducibility of symbols in term rewriting systems (TRSs). For a given algebraic specification, operation symbols can be classified on the basis of their denotations: the operation symbols for functions and those for constructors. In a model, each term constructed by using only constructors should denote an element, and functions are defined on sets formed by these elements. A term rewriting system provides operational semantics to an algebraic specification. Given a TRS, a term is called reducible if some rewrite rule can be applied to it. An irreducible term can be regarded as an answer in a sense. In this paper, we define the reducibility of operation symbols as follows: an operation symbol is reducible if any term containing the operation symbol is reducible. Non-trivial properties of context-sensitive rewriting, which is a simple restriction of rewriting, can be obtained by restricting the terms on the basis of variable occurrences, its sort, etc. We confirm the usefulness of the reducibility of operation symbols by applying them to behavioral specifications for proving the behavioral coherence property.