23201 search results - page 361 / 4641 » Rewriting Systems with Data |
190
click to vote
CADE
2004
Springer
16 years 7 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
207
Voted
FMCO
2004
Springer
16 years 7 days ago
2004
Springer
This paper considers an integration of asynchronous communication, virtual binding, and multiple inheritance. Object orientation is the leading paradigm for concurrent and distribu...
238
click to vote
LPAR
2004
Springer
16 years 6 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
168
click to vote
OOPSLA
2004
Springer
16 years 6 days ago
2004
Springer
This demonstration will feature overviews of the C-SAW and GenAWeave projects. The first half of the presentation will introduce the concept of two-level aspect weaving, which uni...
209
Voted
WCRE
2002
IEEE
15 years 11 months ago
2002
IEEE
Machine code disassembly routines form a fundamental component of software systems that statically analyze or modify executable programs. The task of disassembly is complicated by...