Sciweavers

2621 search results - page 401 / 525
» Near orders and codes
Sort
View
ICSE
2012
IEEE-ACM
13 years 8 months ago
Where should the bugs be fixed? More accurate information retrieval-based bug localization based on bug reports
—For a large and evolving software system, the project team could receive a large number of bug reports. Locating the source code files that need to be changed in order to fix th...
Jian Zhou, Hongyu Zhang, David Lo
POPL
2010
ACM
16 years 3 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
IEEEIAS
2009
IEEE
16 years 1 months ago
Modeling the Co-evololution DNS Worms and Anti-worms in IPv6 Networks
A computer worm is an autonomous malicious, selfreplicating and propagating piece of code that is able to spread fast in computer networks, exploiting the vulnerabilities it disco...
Pantelis Kammas, Thodoros Komninos, Yannis C. Stam...
CANS
2006
Springer
136views Cryptology» more  CANS 2006»
15 years 10 months ago
Watermarking Essential Data Structures for Copyright Protection
Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside...
Qutaiba Albluwi, Ibrahim Kamel
ANLP
1997
137views more  ANLP 1997»
15 years 7 months ago
Probabilistic and Rule-Based Tagger of an Inflective Language- a Comparison
We present results of probabilistic tagging of Czech texts in order to show how these techniques work for one of the highly morphologically ambiguous inflective languages. After d...
Jan Hajic, Barbora Hladká