1204 search results - page 102 / 241 » Termination of Polynomial Programs |
119
Voted
ESOP
2008
Springer
15 years 2 months ago
2008
Springer
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...
FSTTCS
2008
Springer
15 years 1 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
141
Voted
ENTCS
2006
15 years 22 days ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
CORR
2007
Springer
15 years 21 days ago
2007
Springer
A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Supinterpretations have shown their interest to deal with...
102
click to vote
QEST
2008
IEEE
15 years 7 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...