2756 search results - page 194 / 552 » Computation-Centric Memory Models |
123
Voted
LCTRTS
2004
Springer
15 years 10 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
134
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
134
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
129
click to vote
SSS
2009
Springer
15 years 9 months ago
2009
Springer
Consider a fully connected network where up to t processes may crash, and all processes start in an arbitrary memory state. The self-stabilizing firing squad problem consists of e...
148
Voted
ISSS
2000
IEEE
15 years 9 months ago
2000
IEEE
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...