A
Arie Gurfinkel
Researcher at Carnegie Mellon University
Publications - 17
Citations - 362
Arie Gurfinkel is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Model checking & Predicate abstraction. The author has an hindex of 13, co-authored 17 publications receiving 336 citations. Previous affiliations of Arie Gurfinkel include SEI Investments Company & Software Engineering Institute.
Papers
More filters
Proceedings ArticleDOI
Binary Function Clustering Using Semantic Hashes
Wesley Jin,Sagar Chaki,Cory Cohen,Arie Gurfinkel,Jeffrey Havrilla,Charles Hines,Priya Narasimhan +6 more
TL;DR: This paper proposes a scheme that captures the semantics of functions as semantic hashes, each of which represent the input-output behavior of a basic block, and uses a form of locality-sensitive hashing known as Min Hashing, functions with many common features can be quickly identified, and the complexity of clustering is reduced to O(N).
Proceedings ArticleDOI
Recovering C++ Objects From Binaries Using Inter-Procedural Data-Flow Analysis
Wesley Jin,Cory Cohen,Jeffrey Gennari,Charles Hines,Sagar Chaki,Arie Gurfinkel,Jeffrey Havrilla,Priya Narasimhan +7 more
TL;DR: A static approach that uses symbolic execution and inter-procedural data flow analysis to discover object instances, data members, and methods of a common class and helps malware reverse engineers to understand how classes are laid out and to identify their methods.
Journal ArticleDOI
Exploiting resolution proofs to speed up LTL vacuity detection for BMC
TL;DR: The vacuity detection tool, VaqTree, uses a characteristic of resolution proofs— peripherality—and proves that if a variable is a source of vacuity, then there exists a resolution proof in which this variable is peripheral.
ReportDOI
Reliability Validation and Improvement Framework
TL;DR: A framework for reliability validation and improvement is proposed that integrates several recommended technology solutions and provides the basis for a set of metrics for cost-effective reliability improvement that overcome the challenges of existing software complexity, reliability, and cost metrics.
Proceedings ArticleDOI
Time-bounded analysis of real-time systems
TL;DR: This work construct (and verify) a sequential program S that over-approximates all executions of C up to time W, while respecting priorities and bounds on the number of preemptions implied by RMS.