5084 search results - page 135 / 1017 » Proving Possibility Properties |
141
click to vote
LISP
2002
15 years 5 months ago
2002
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
156
Voted
TCS
1998
15 years 5 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
166
click to vote
FSTTCS
2010
Springer
15 years 3 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
167
click to vote
CONCUR
2009
Springer
15 years 3 months ago
2009
Springer
Convergence is often the key liveness property for distributed systems that interact with physical processes. Techniques for proving convergence (asymptotic stability) have been ex...
180
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...