Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Fady Copty

dblp:45/1990 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 4 · 2 first-authorTheory of computation · 3 · 1 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program verification · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program verification › model checking
bounded model checking
0.012001
Benefits of Bounded Model Checking at an Industrial Setting · CAV 2001

Methods — techniques the papers use, named apart from their topics

bounded model checking · 0.0
YearPublicationVenuePosition
2018 Accurate Malware Detection by Extreme Abstraction
abstract
Modern malware applies a rich arsenal of evasion techniques to render dynamic analysis ineffective. In turn, dynamic analysis tools take great pains to hide themselves from malware; typically this entails trying to be as faithful as possible to the behavior of a real run. We present a novel approach to malware analysis that turns this idea on its head, using an extreme abstraction of the operating system that intentionally strays from real behavior. The key insight is that the presence of malicious behavior is sufficient evidence of malicious intent, even if the path taken is not one that could occur during a real run of the sample. By exploring multiple paths in a system that only approximates the behavior of a real system, we can discover behavior that would often be hard to elicit otherwise. We aggregate features from multiple paths and use a funnel-like configuration of machine learning classifiers to achieve high accuracy without incurring too much of a performance penalty. We describe our system, TAMALES (The Abstract Malware Analysis LEarning System), in detail and present machine learning results using a 330K sample set showing an FPR (False Positive Rate) of 0.10% with a TPR (True Positive Rate) of 99.11%, demonstrating that extreme abstraction can be extraordinarily effective in providing data that allows a classifier to accurately detect malware.
Fady Copty, Matan Danos, Orit Edelstein, Cindy Eisner, Dov Murik, Benjamin Zeltser
ACSAC1
2015 Vacuity in practice: temporal antecedent failure
Shoham Ben-David, Fady Copty, Dana Fisman, Sitvanit Ruah
Formal Methods Syst. Des.2
2010 Formal verification of arbiters using property strengthening and underapproximations
Gadiel Auerbach, Fady Copty, Viresh Paruthi
FMCAD2
2004 Test sequence generation and model checking using dynamic transition relations
Sérgio Vale Aguiar Campos, Orna Grumberg, Karen Yorav, Fady Copty
Int. J. Softw. Tools Technol. Transf.4
2003 Efficient debugging in a formal verification environment
Fady Copty, Amitai Irron, Osnat Weissberg, Nathan P. Kropp, Gila Kamhi
Int. J. Softw. Tools Technol. Transf.1
2001 Benefits of Bounded Model Checking at an Industrial Setting
Fady Copty, Limor Fix, Ranan Fraer, Enrico Giunchiglia, Gila Kamhi, Armando Tacchella, Moshe Y. Vardi
CAV1