An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most 1 from x. The problem of finding an identifying code of minimum possible size turned out to be a challenging problem. It was proved by N. Bertrand, I. Charon, O. Hudry and A. Lobstein that if a graph on n vertices with...

New updated! The latest book from a very famous author finally comes out. Book of identifying malicious code through reverse engineering, as an amazing reference becomes what you need to get. What's for is this book? Are you still thinking for what the book is? Well, this is what you probably will get. You should have made proper choices for your better life. Book, as a source that may involve ...

1Department of Computer Science, Federal University ofMinas Gerais, Belo Horizonte, Brazil 2Department of Computer Science, DCC Pleiad Lab, University of Chile, Santiago, Chile 3RMod Project Team, INRIA Lille Nord Europe, France Correspondence Leonardo Humberto Silva, Department of Informatics, Federal Institute of Northern Minas Gerais, Salinas, Brazil. Email: [email protected] Fundi...

We present an approach to identify similar code in programs based on finding similar subgraphs in attributed directed graphs. This approach is used on program dependence graphs and therefore considers not only the syntactic structure of programs but also the data flow within (as an abstraction of the semantics). As a result, there is no tradeoff between precision and recall—our approach is very...

Best practices have evolved within the forensic industry over the past few years to address an emerging need for organizations to properly handle malicious code incidents. While this area of forensics is increasingly strong, the industry at large struggles with how to approac...

Code generators are a crucial part of the model-driven development (MDD) approach. They systematically transform abstract models to concrete executable source code. Typically, a generator developer determines the code parts that should be generated and separates them from handwritten code. Since performed manually, this task often is timeconsuming, labor-intensive, difficult to maintain and may...

Many of the existing approaches in Software Comprehension focus on program program structure or external documentation. However, by analyzing formal information the informal semantics contained in the vocabulary of source code are overlooked. To understand software as a whole, we need to enrich software analysis with the developer knowledge hidden in the code naming. This paper proposes the use...

Appendix A.1 A Snippet of Data Types Type/Sub-Property Type Definition IncidentSpecificsType extends u:ActivityType A structure that describes the specific characteristics of the incident IncidentCategory nfirs:FireIncidentCodeSimpleType A code identifying the fire incident type such as "structure fire" AlarmDate u:DateType A code identifying the date when fire is first reported AlarmTime niem-...

An r-identifying code in a graph G = (V,E) is a subset C ⊆ V such that for each u ∈ V the intersection of C and the ball of radius r centered at u is non-empty and unique. Previously, r-identifying codes have been studied in various grids. In particular, it has been shown that there exists a 2-identifying code in the hexagonal grid with density 4/19 and that there are no 2-identifying codes wit...