9,299 Hits in 5.7 sec

Refinement strategies for verification methods based on datapath abstraction

Zaher S. Andraus, Mark H. Liffiton, Karem A. Sakallah
2006 Proceedings of the 2006 conference on Asia South Pacific design automation - ASP-DAC '06  
The data suggest that localization, generalization, and MUS extraction from both the abstract and concrete models are essential for effective verification.  ...  We introduce several refinement strategies and empirically evaluate their effectiveness on a set of microprocessor benchmarks.  ...  ACKNOWLEDGMENTS This work was funded in part by the DARPA/MARCO Gigascale Systems Research Center, and in part by the National Science Foundation under ITR grant No. 0205288.  ... 
doi:10.1145/1118299.1118306 fatcat:jfb3jleuxjebzcnxtlhnibkl7m

Multi-scale and snakes for automatic road extraction [chapter]

Helmut Mayer, Ivan Laptev, Albert Baumgartner
1998 Lecture Notes in Computer Science  
The approach not only has few parameters to be adjusted, but for the first time allows for a bridging of shadows and partially occluded areas using the heavily disturbed evidence in the image.  ...  This paper proposes an approach for automatic road extraction in aerial imagery which exploits the scale-space behavior of roads in combination with geometric constrained snake-based edge extraction.  ...  Acknowledgments We would like to thank Wolfgang Eckstein, Tony Lindeberg, Carsten Steger, and Christian Wiedemann for many fruitful discussions.  ... 
doi:10.1007/bfb0055700 fatcat:nynboaw2gfcfvi2ju4ynxi46he

Speeding Up Model Checking of Timed-Models by Combining Scenario Specialization and Live Component Analysis [chapter]

Víctor Braberman, Diego Garbervestky, Nicolás Kicillof, Daniel Monteverde, Alfredo Olivero
2009 Lecture Notes in Computer Science  
Live Component Analysis is a "cone of influence" abstraction technique aiming at mitigating state explosion by detecting, at each observer location, which components are actually relevant for model checking  ...  That is, we present a sound and complete method of property manipulation based on specializing and complementing scenarios.  ...  They are actually generalizations obtained from negative scenarios generated by the tool (line 9) by eliminating the timing constraint.  ... 
doi:10.1007/978-3-642-04368-0_7 fatcat:lryuip6nt5at7c2xtwilrcigci

Efficient Set Similarity Joins Using Min-prefixes [chapter]

Leonardo A. Ribeiro, Theo Härder
2009 Lecture Notes in Computer Science  
measure to the candidates and returning the correct answer.  ...  We drastically decrease the computational cost of candidate generation by dynamically reducing the number of indexed objects at the expense of increasing the workload of the verification phase.  ...  Further Optimizations Verification Phase A side-effect of the index-minimization strategy is the growth of candidate sets.  ... 
doi:10.1007/978-3-642-03973-7_8 fatcat:6j2avoiuwveebjkt5j3l73cz2m

More Than Two Decades of Research on Verification of UML Class Models: A Systematic Literature Review

Asadullah Shaikh, Abdul Hafeez, Asif Ali Wagan, Mesfer Alrizq, Abdullah Alghamdi, Mana Saleh Al Reshan
2021 IEEE Access  
ACKNOWLEDGMENT The authors would like to express their gratitude to the ministry of education and the deanship of scientific research Najran University Kingdom of Saudi Arabia for their  ...  The proposed algorithms use the ontology graph and ontology constraints to find the optimal solution.  ...  Second, there is a need for an optimized technique that reduces the verification time. V. THREAD TO VALIDITY It is very important for every SLR to identify all relevant studies.  ... 
doi:10.1109/access.2021.3121222 fatcat:j6sritznorajtayufj67blumae

ObsSlice: A Timed Automata Slicer Based on Observers [chapter]

Víctor Braberman, Diego Garbervetsky, Alfredo Olivero
2004 Lecture Notes in Computer Science  
ObsSlice is an optimization tool suited for the verification of timed automata using virtual observers.  ...  Preliminary results have proven that eliminating irrelevant activity mitigates state space explosion and has a positive -and sometimes dramatic-impact on the performance of verification tools in terms  ...  Eliminating irrelevant activity seems to mitigate state space explosion and have a positive impact on the performance of verification tools in terms of time, size and length of counterexamples.  ... 
doi:10.1007/978-3-540-27813-9_39 fatcat:fu4hkhrjhffdvid5ps5z5tedpa

Flexible speech understanding based on combined key-phrase detection and verification

T. Kawahara, Chin-Hui Lee, Biing-Hwang Juang
1998 IEEE Transactions on Speech and Audio Processing  
We propose a novel speech understanding strategy based on combined detection and verification of semantically tagged key-phrases in spontaneous spoken utterances.  ...  A phrase network realizes both a wide coverage and a reasonable constraint for detection.  ...  ACKNOWLEDGMENT The authors wish to thank D. Brown of AT&T Labs and J.  ... 
doi:10.1109/89.725322 fatcat:rwc27z3kgffhhkzttopnaqdyhu

Automating software feature verification

Gerard J. Holzmann, Margaret H. Smith
2002 Bell Labs technical journal  
The verifications are performed by the system with the help of a standard logic model checker that runs in the background, invisibly to the user.  ...  The main strength of the system is in the detection of undesired feature interactions at an early stage of systems design, the type of problem that is notoriously difficult to detect with traditional testing  ...  The authors are also grateful to Rob Pike and Jim McKie for their invaluable help with the setup of the compute-servers for the feature verification system.  ... 
doi:10.1002/bltj.2223 fatcat:s3yxnf5id5a57keecmwevaha4y

Slicing ATL model transformations for scalable deductive verification and fault localization

Zheng Cheng, Massimo Tisi
2018 International Journal on Software Tools for Technology Transfer (STTT)  
In MDE, software models are manipulated, evolved and translated by model transformations (MT), up to code generation.  ...  We implement both these algorithms as extensions of the VeriATL verification system, and we show by experimentation that they increase its industry-readiness.  ...  Sánchez Cuadrado et al. present a static approach to uncover various typing errors in ATL MTs [17] , and use the USE constraint solver to compute an input model as a witness for each error.  ... 
doi:10.1007/s10009-018-0491-8 fatcat:nrzwxvnfdzcdxhuj75tuz6xury

Bounded Verification of Software Models: Challenges and Opportunities

Robert Clarisó
2015 IN3 Working Paper Series  
To this end, it is necessary to formalize the features of each verification technique (e.g. in an ontology) in order to be classify each method, analyze each input model and check whether a particular  ...  The outcome is a set of model slices that (i) abstract features of the model that are irrelevant to this property and (ii) partition the original model into smaller submodels where the property can be  ...  Així doncs, l'anàlisi de models pot incrementar la qualitat final del software i reduir els costos de desenvolupament.  ... 
doi:10.7238/in3wps.v0i0.2490 fatcat:vw4xu5447nginjh5bbzk345tji

A study of the robustness of raw waveform based speaker embeddings under mismatched conditions [article]

Ge Zhu, Frank Cwitkowitz, Zhiyao Duan
2021 arXiv   pre-print
The second strategy is to apply variational dropout to non-parametric filters to prevent them from overfitting irrelevant nuance features.  ...  In this paper, we conduct a cross-dataset study on parametric and non-parametric raw-waveform based speaker embeddings through speaker verification experiments.  ...  In order to eliminate the influence of back-end scoring systems on the final verification results, we simply used cosine similarity for scoring.  ... 
arXiv:2110.04265v2 fatcat:5nh43lfalrffxislmtlgsmaxca

Pairwise geometric matching for large-scale object retrieval

Xinchao Li, Martha Larson, Alan Hanjalic
2015 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)  
It serves to eliminate unreliable correspondences between salient points in a given pair of images, and is typically performed by analyzing the consistency of spatial transformations between the image  ...  In this paper, we consider the pairwise geometric relations between correspondences and propose a strategy to incorporate these relations at significantly reduced computational cost, which makes it suitable  ...  Geometric matching can be done either explicitly, by iteratively building an optimized transformation model and fitting it to the initial correspondences (e.g., RANSAC-based model fitting ap-proaches  ... 
doi:10.1109/cvpr.2015.7299151 dblp:conf/cvpr/LiLH15 fatcat:enjbpf25rzb6xewusogiwxn4mm


2003 International journal of pattern recognition and artificial intelligence  
Since SVMs show good generalization performance on many real-life data and the approach is properly motivated theoretically, it has been applied to wide range of applications.  ...  This paper describes a brief introduction of SVMs and summarizes its various pattern recognition applications.  ...  Acknowledgments This research was supported by the Brain Neuroinfomatics Research Program and the Creative Research Initiative Program of the Ministry of Science and Technology, Korea.  ... 
doi:10.1142/s0218001403002460 fatcat:6zuelkdkf5bgjatnfebfmka7wi

Applications of Support Vector Machines for Pattern Recognition: A Survey [chapter]

Hyeran Byun, Seong-Whan Lee
2002 Lecture Notes in Computer Science  
Since SVMs show good generalization performance on many real-life data and the approach is properly motivated theoretically, it has been applied to wide range of applications.  ...  This paper describes a brief introduction of SVMs and summarizes its numerous applications.  ...  This research was supported by the Brain Neuroinfomatics Research Program and the Creative Research Initiative Program of the Ministry of Science and Technology, Korea.  ... 
doi:10.1007/3-540-45665-1_17 fatcat:umfkn5bl35bath5onrutdyshtq

Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation [chapter]

Marcelo Glusman, Gila Kamhi, Sela Mador-Haim, Ranan Fraer, Moshe Y. Vardi
2003 Lecture Notes in Computer Science  
In our framework, the initial abstraction is chosen relative to the property under verification. The abstraction is model checked by Forecast; in case of failure, a counterexample is returned.  ...  Our framework includes an abstract counterexample analyzer module that applies techniques for bounded model checking to check whether the abstract counterexample holds in the concrete model.  ...  and, hopefully, retains the essential features of the concrete model [11] .  ... 
doi:10.1007/3-540-36577-x_13 fatcat:q3snd3s3vreanewibixreg5skq
« Previous Showing results 1 — 15 out of 9,299 results