1000 search results - page 75 / 200 » Nominal rewriting systems |
RTA
1997
Springer
13 years 12 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
RTA
2004
Springer
14 years 1 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
ENTCS
2000
13 years 7 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
ICSE
2001
IEEE-ACM
14 years 4 days ago
2001
IEEE-ACM
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...
ADBIS
2000
Springer
14 years 1 days ago
2000
Springer
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...