535 search results - page 19 / 107 » Termination of Abstract Reduction Systems |
DAC
2005
ACM
14 years 10 months ago
2005
ACM
eriodically time-varying (LPTV) abstractions are useful for a variety of communication and computer subsystems. In this paper, we present a novel operator-based model-order reduct...
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
CAV
2004
Springer
14 years 3 months ago
2004
Springer
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, TomĀ“aĖs Voj...
FROCOS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with veriļ¬cation issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
Graph-reduction speciļ¬cations (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...