691 search results - page 10 / 139 » Automatically Proving Linearizability |
RTA
2004
Springer
14 years 3 months ago
2004
Springer
Restrictions of rewriting can eventually achieve termination by pruning all infinite rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of su...
ICFP
2005
ACM
14 years 9 months ago
2005
ACM
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
AISC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
CONCUR
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
FM
1999
Springer
14 years 2 months ago
1999
Springer
Support for system speci cation in terms of modelling and simulation environments has become a common practice in safety-critical applications. Also, a current trend is the automat...