Software vulnerability mitigation as a proper subset of software maintenance

2005 ◽  
Vol 17 (6) ◽  
pp. 379-400 ◽  
Author(s):  
Nadine Hanebutte ◽  
Paul W. Oman
Keyword(s):  
Software Maintenance ◽  
Proper Subset ◽  
Software Vulnerability ◽  
Vulnerability Mitigation

Survey of software vulnerability taxonomies

2009 ◽  
Vol 28 (9) ◽  
pp. 2244-2248
Author(s):  
Yi-sha LU ◽  
Qing-kai ZENG
Keyword(s):  
Software Vulnerability

scholarly journals ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA
Keyword(s):  
Permutation Group ◽  
Model Theory ◽  
Independent Set ◽  
Maximum Size ◽  
Proper Subset ◽  
Permutation Groups ◽  
Finite Permutation Group ◽  
Pointwise Stabilizer ◽  
Relational Complexity

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).

A RAkEL-based methodology to estimate software vulnerability characteristics & score - an application to EU project ECHO

2021 ◽  
Author(s):  
Georgios Aivatoglou ◽  
Mike Anastasiadis ◽  
Georgios Spanos ◽  
Antonis Voulgaridis ◽  
Konstantinos Votis ◽  
...  
Keyword(s):  
Software Vulnerability ◽  
Project Echo ◽  
Eu Project

Sudoku Ripeto

ICGA Journal ◽  
2021 ◽  
pp. 1-24
Author(s):  
Miguel G. Palomo
Keyword(s):  
Sufficient Conditions ◽  
Proper Subset ◽  
Repetition Pattern

We present a variant of Sudoku called Sudoku Ripeto. It seems to be the first to admit any combination of repeated symbols, and includes Sudoku as a proper subset. We present other Sudoku Ripeto families, each with a different repetition pattern. We define Sudoku Ripeto squares and puzzles, prove several solving rules that generalize those for Sudoku, and give sufficient conditions to flexibly solve puzzles with rules only, without search.

Sign in / Sign up

Export Citation Format

Share Document