Sciweavers

118 search results - page 22 / 24
» Verifying Correctness of Transactional Memories
Sort
View
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 4 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
TACAS
1998
Springer
81views Algorithms» more  TACAS 1998»
13 years 11 months ago
Formal Design and Analysis of a Gear Controller
In this paper, we report on an application of the validation and veri cation tool kit Uppaal in the design and analysis of a prototype gear controller, carried out in a joint proje...
Magnus Lindahl, Paul Pettersson, Wang Yi
SCAM
2008
IEEE
14 years 1 months ago
Automated Detection of Code Vulnerabilities Based on Program Analysis and Model Checking
Ensuring the correctness and reliability of software systems is one of the main problems in software development. Model checking, a static analysis method, is preponderant in impr...
Lei Wang, Qiang Zhang, PengChao Zhao
ISCAS
2007
IEEE
95views Hardware» more  ISCAS 2007»
14 years 1 months ago
An Incomplete Settling Technique for Pipelined Analog-to-Digital Converters
—This paper presents an incomplete settling design technique for switched-capacitor pipelined analog-to-digital converters (ADCs) to improve conversion rate. An improved multiply...
Fule Li, Zhihua Wang, Dongmei Li
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 24 days ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...