814 search results - page 40 / 163 » Analysis of Modular Arithmetic |
PRDC
2007
IEEE
15 years 4 months ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
ALENEX
2004
14 years 11 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
COLING
1996
14 years 11 months ago
1996
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
PLDI
2011
ACM
14 years 24 days ago
2011
ACM
We present a strictly bottom-up, summary-based, and precise heap analysis targeted for program verification that performs strong updates to heap locations at call sites. We firs...
TACS
1991
Springer
15 years 1 months ago
1991
Springer
We aim at a unified and coherent presentation of net models for concurrency like Petri nets and dataflow networks from the perspective of modularity and substitutivity. The major ...