104 search results - page 9 / 21 » Proving Termination Properties with mu-term |
CHARME
2003
Springer
15 years 5 months ago
2003
Springer
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
108
Voted
CORR
2004
Springer
15 years 9 days ago
2004
Springer
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
111
Voted
ESOP
2010
Springer
15 years 9 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
103
Voted
TCS
1998
15 years 3 days ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
84
Voted
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can b...