142 search results - page 22 / 29 » Proving Termination by Invariance Relations |
POPL
2011
ACM
13 years 18 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
TPHOL
2008
IEEE
14 years 4 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
IWSOS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper, we have investigated the feasibility of a selforganized evacuation process when compared with a centralized control. The evacuation strategy is based on ...
TLCA
2007
Springer
14 years 3 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
FUIN
2007
13 years 9 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...