Sciweavers

3394 search results - page 359 / 679
» A Modal Model of Memory
Sort
View
DCOSS
2005
Springer
16 years 8 days ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...
PATMOS
2005
Springer
16 years 6 days ago
A Power-Efficient and Scalable Load-Store Queue Design
Abstract. The load-store queue (LQ-SQ) of modern superscalar processors is responsible for keeping the order of memory operations. As the performance gap between processing speed a...
Fernando Castro, Daniel Chaver, Luis Piñuel...
DEXA
2004
Springer
126views Database» more  DEXA 2004»
16 years 4 days ago
Detecting Content Changes on Ordered XML Documents Using Relational Databases
Abstract. Previous works in change detection on XML focused on detecting changes to text file using ordered and unordered tree model. These approaches are not suitable for detecti...
Erwin Leonardi, Sourav S. Bhowmick, T. S. Dharma, ...
LCTRTS
2004
Springer
16 years 3 days ago
Flattening statecharts without explosions
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...
Andrzej Wasowski
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
16 years 2 days ago
A Tool for Checking ANSI-C Programs
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...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda