Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Nigel Horspool"'
Publikováno v:
Computers & Security. 48:212-233
Metamorphism is a technique that mutates the binary code using different obfuscations. It is difficult to write a new metamorphic malware and in general malware writers reuse old malware. To hide detection the malware writers change the obfuscations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::435ca80b2df497882bd22c3fe0c959f6
https://doi.org/10.1016/j.cose.2014.10.011
https://doi.org/10.1016/j.cose.2014.10.011
Publikováno v:
Journal of Computer Virology and Hacking Techniques. 11:75-88
The latest stealth techniques, such as metamorphism, allow malware to evade detection by today’s signature-based anti-malware programs. Current techniques for detecting malware are compute intensive and unsuitable for real-time detection. Technique
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6048fa1e03d7042f1e6d963ea787a0c6
https://doi.org/10.1007/s11416-014-0222-y
https://doi.org/10.1007/s11416-014-0222-y
Publikováno v:
Journal of Systems Architecture. 53:501-510
Emulation of one architecture on another is useful when the architecture is under design, when software must be ported to a new platform or is being developed for systems which are still under development, or for embedded systems that insufficient re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db5572a382baaa1a5103274e89985c24
https://doi.org/10.1016/j.sysarc.2006.11.003
https://doi.org/10.1016/j.sysarc.2006.11.003
Publikováno v:
CHESE@ISSTA
Puzzles are the basic building block of Code Hunt contests. Creating puzzles and choosing suitable puzzles from the puzzle bank turns out to be a complex operation requiring skill and experience. Constructing a varied and interesting mix of puzzles i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba6e2ed5c93763991ddf72d05c1a99e4
https://doi.org/10.1145/2792404.2792405
https://doi.org/10.1145/2792404.2792405
Publikováno v:
2015 IEEE/ACM 2nd International Workshop on CrowdSourcing in Software Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67e75745843c929d09400033af45c84a
https://doi.org/10.1109/csi-se.2015.10
https://doi.org/10.1109/csi-se.2015.10
Publikováno v:
2015 IEEE/ACM 37th IEEE International Conference on Software Engineering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4c937362a6a9a2a155ee95f1ea0d647
https://doi.org/10.1109/icse.2015.172
https://doi.org/10.1109/icse.2015.172
Publikováno v:
Software: Practice and Experience. 37:93-113
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b75440629c61fb088226e4e2ae78f61d
https://doi.org/10.1002/spe.751
https://doi.org/10.1002/spe.751
Publikováno v:
Concurrency and Computation: Practice and Experience. 17:663-680
SUMMARY Java programmers cannot but be aware of the advent of C#, the .NET network environment, and a host of new supporting technologies, such as web services. Before taking the big step of moving all development to a new environment, programmers wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45aa035df49a78c695f6ede740d807c6
https://doi.org/10.1002/cpe.858
https://doi.org/10.1002/cpe.858
Publikováno v:
Parallel Processing Letters. 13:525-536
Partial redundancy elimination (PRE) is a key technology for modern compilers. However traditional approaches are conservative and fail to exploit many opportunities for optimization. New PRE approaches which greatly increase the number of eliminated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::075311c1ba82797acf86a23587d829f9
https://doi.org/10.1142/s0129626403001483
https://doi.org/10.1142/s0129626403001483
Autor:
R. Nigel Horspool, John Aycock
Publikováno v:
The Computer Journal. 45:620-630
Earley’s parsing algorithm isa general algorithm, ableto handleany context-free grammar. As with most parsing algorithms, however, the presence of grammar rules having empty right-hand sides complicates matters. By analyzing why Earley’s algorith
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30ea94b1a62258418de8fb457df14e63
https://doi.org/10.1093/comjnl/45.6.620
https://doi.org/10.1093/comjnl/45.6.620