437 search results - page 53 / 88 » Proving Termination by Divergence |
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
AISC
2008
Springer
13 years 10 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
CSFW
2011
IEEE
12 years 7 months ago
2011
IEEE
—We present a Horn-clause-based framework for analysing security protocols that use platform configuration registers (PCRs), which are registers for maintaining state inside the...