Sciweavers

212 search results - page 25 / 43
» Completeness and Complexity of Bounded Model Checking
Sort
View
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
14 years 1 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
BIS
2008
92views Business» more  BIS 2008»
13 years 11 months ago
Structural Detection of Deadlocks in Business Process Models
Abstract. A common task in business process modelling is the verification of process models regarding syntactical and structural errors. While the former might be checked with low ...
Ahmed Awad, Frank Puhlmann
TSE
2011
214views more  TSE 2011»
13 years 4 months ago
A Comparative Study of Software Model Checkers as Unit Testing Tools: An Industrial Case Study
—Conventional testing methods often fail to detect hidden flaws in complex embedded software such as device drivers or file systems. This deficiency incurs significant developmen...
Moonzoo Kim, Yunho Kim, Hotae Kim
DEBS
2008
ACM
13 years 11 months ago
A framework for performance evaluation of complex event processing systems
Several new Complex Event Processing (CEP) engines have been recently released, many of which are intended to be used in performance sensitive scenarios - like fraud detection, tr...
Marcelo R. N. Mendes, Pedro Bizarro, Paulo Marques
DNA
2006
Springer
126views Bioinformatics» more  DNA 2006»
14 years 1 months ago
On the Complexity of Graph Self-assembly in Accretive Systems
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
Stanislav Angelov, Sanjeev Khanna, Mirkó Vi...