Results 11 to 20 of about 453,327 (300)

RepliComment: Identifying clones in code comments [PDF]

open access: yesJournal of Systems and Software, 2021
31 pages, 1 figure, 9 tables.
Arianna Blasi   +3 more
openaire   +5 more sources

Identifying Source Code File Experts [PDF]

open access: yes, 2022
Background: In software development, the identification of source code file experts is an important task. Identifying these experts helps to improve software maintenance and evolution activities, such as developing new features, code reviews, and bug ...
Cury, Otávio,   +4 more
core   +1 more source

Identifying Malicious Source Code Using LZJD [PDF]

open access: yes, 2021
This work presents a proof-of-concept of the use of Lempel-Ziv Jaccard Distance, or LZJD, as a means of detecting malicious source code by comparing the suspect source code to a library of known malicious source code.
Roca, Alexander James
core   +1 more source

Identifying Personal Data Processing for Code Review [PDF]

open access: yes, 2023
Code review is a critical step in the software development life cycle, which assesses and boosts the code's effectiveness and correctness, pinpoints security issues, and raises its quality by adhering to best practices.
Østvold, Bjarte M.   +2 more
core   +2 more sources

Identifying Codes in Line Graphs [PDF]

open access: yesJournal of Graph Theory, 2012
AbstractAn identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbors within the code. We study the edge‐identifying code problem, i.e. the identifying code problem in line graphs.
Florent Foucaud   +4 more
openaire   +3 more sources

DOMINATION NUMBER AND IDENTIFYING CODE NUMBER OF THE SUBDIVISION GRAPHS [PDF]

open access: yesJournal of Algebraic Systems
‎Let $G=(V‎, ‎E)$ be a simple graph‎. ‎A set $C$ of vertices of $G$ is an identifying code of $G$ if for every two vertices $x$ and $y$ the sets $N_{G}[x] \cap C$ and $N_{G}[y] \cap C$ are non-empty and different‎.
Somaiya Ahmadi   +2 more
doaj   +1 more source

Identifying Compiler and Optimization Level in Binary Code From Multiple Architectures

open access: yesIEEE Access, 2021
While compiling a native application, different compiler flags or optimization levels can be configured. This choice depends on the different requirements.
Davide Pizzolotto, Katsuro Inoue
doaj   +1 more source

Parent-Identifying Codes

open access: yesJournal of Combinatorial Theory, Series A, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noga Alon, Eldar Fischer, Mario Szegedy
openaire   +2 more sources

Identifying codes of cycles

open access: yesEuropean Journal of Combinatorics, 2006
We deal with identifying codes in cycles and show that for all \(r\geq 1\), any \(r\)-identifying code of the cycle \({\mathcal C}_n\) has cardinality at least \(\text{gcd}(2r+1,n)\left\lceil\frac{n}{2\text{gcd}(2r+1,n)}\right\rceil\).. This lower bound is enough to solve the case \(n\) even (which was already solved in [\textit{N. Bertrand, I. Charon,
Gravier, Sylvain   +2 more
openaire   +2 more sources

Similar Code Detection and Elimination for Erlang Programs [PDF]

open access: yes, 2010
A well-known bad code smell in refactoring and software maintenance is duplicated code, that is the existence of code clones, which are code fragments that are identical or similar to one another.
Huiqing Li   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy