Sciweavers

440 search results - page 60 / 88
» A challenge for atomicity verification
Sort
View
C3S2E
2010
ACM
15 years 26 days ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
DAC
2006
ACM
16 years 21 days ago
Prototyping a fault-tolerant multiprocessor SoC with run-time fault recovery
Modern integrated circuits (ICs) are becoming increasingly complex. The complexity makes it difficult to design, manufacture and integrate these high-performance ICs. The advent o...
Xinping Zhu, Wei Qin
ICSE
2008
IEEE-ACM
16 years 17 days ago
Predicting accurate and actionable static analysis warnings: an experimental approach
Static analysis tools report software defects that may or may not be detected by other verification methods. Two challenges complicating the adoption of these tools are spurious f...
Joseph R. Ruthruff, John Penix, J. David Morgentha...
AAAI
2006
15 years 1 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
TASE
2008
IEEE
14 years 11 months ago
Integrated Supervisory and Operational Control of a Warehouse With a Matrix-Based Approach
This paper considers a matrix-based discrete event control approach for a warehouse. The control system is organized in two modules: a dynamic model and a controller. The model pro...
Vincenzo Giordano, Jing Bing Zhang, David Naso, Fr...