Sciweavers

6167 search results - page 1065 / 1234
» Can Refinement be Automated
Sort
View
ISSRE
2010
IEEE
13 years 8 months ago
DoDOM: Leveraging DOM Invariants for Web 2.0 Application Robustness Testing
—Web 2.0 applications are increasing in popularity. However, they are also prone to errors because of their dynamic nature. This paper presents DoDOM, an automated system for tes...
Karthik Pattabiraman, Benjamin G. Zorn
SMA
2008
ACM
192views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Identification of sections from engineering drawings based on evidence theory
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
Jie-Hui Gong, Hui Zhang, Bin Jiang, Jia-Guang Sun
JBCB
2010
86views more  JBCB 2010»
13 years 8 months ago
Calbc Silver Standard Corpus
The production of gold standard corpora is time-consuming and costly. We propose an alternative: the ‚silver standard corpus‗ (SSC), a corpus that has been generated by the ha...
Dietrich Rebholz-Schuhmann, Antonio Jimeno-Yepes, ...
JOT
2010
108views more  JOT 2010»
13 years 8 months ago
Dynamic adaptability with .NET service components
In self-adaptive systems components are dynamically modified according to the execution environment requirement, where each component is a probable point of failure. Existing appr...
Arun Mishra, A. K. Misra
JSC
2010
106views more  JSC 2010»
13 years 8 months ago
Verifying pointer safety for programs with unknown calls
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
Chenguang Luo, Florin Craciun, Shengchao Qin, Guan...
« Prev « First page 1065 / 1234 Last » Next »