56 search results - page 5 / 12 » A Tool Proving Well-Definedness of Streams Using Termination... |
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
POPL
2009
ACM
14 years 8 months ago
2009
ACM
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
TELSYS
1998
13 years 7 months ago
1998
The Multimedia Internet Terminal (MINT)1 is a flexible multimedia tool set that allows the establishment and control of multimedia sessions across the Internet. The system archit...
RTA
2007
Springer
14 years 1 months ago
2007
Springer
The third Termination Competition took place in June 2006. We present the background, results and conclusions of this competition. 1 Motivation and history In the past decades seve...