503 search results - page 53 / 101 » Verifying Quantitative Properties Using Bound Functions |
114
click to vote
JHSN
2006
14 years 9 months ago
2006
It has been recognized for some time that software alone does not provide an adequate foundation for building a high-assurance trusted platform. The emergence of industry-standard ...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
HYBRID
1999
Springer
15 years 2 months ago
1999
Springer
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...