150 search results - page 1 / 30 » Counting Results in Weak Formalisms |
DAGSTUHL
2006
13 years 7 months ago
2006
PODC
1993
ACM
13 years 9 months ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
FORMATS
2006
Springer
13 years 9 months ago
2006
Springer
Timed and weak timed simulation relations are often used to show that operations on hybrid systems result in equivalent behavior or in conservative overapproximations. Given that s...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
POPL
2004
ACM
14 years 5 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...