691 search results - page 62 / 139 » Automatically Proving Linearizability |
RTA
2005
Springer
14 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
FM
2003
Springer
14 years 3 months ago
2003
Springer
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
DATE
2000
IEEE
14 years 2 months ago
2000
IEEE
Pass Transistor Logic has attracted more and more interest during last years, since it has proved to be an attractive alternative to static CMOS designs with respect to area, perf...
KBSE
1999
IEEE
14 years 2 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
ICS
1993
Tsinghua U.
14 years 2 months ago
1993
Tsinghua U.
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...