Ion Emilian Radoi

33 papers A 1B 3C 3Journal 16Unranked 10
YearRankTypeTitle / Venue / Authors
2024 J jnl
CoRR
Radu Chivereanu, Adrian Cosma, Andy Catruna, Razvan Rughinis, Ion Emilian Radoi
2024 J jnl
CoRR
Andy Catruna, Adrian Cosma, Ion Emilian Radoi
2024 J jnl
CoRR
Andrei Niculae, Andy Catruna, Adrian Cosma, Daniel Rosner, Ion Emilian Radoi
2024 A conf
WACV
Adrian Cosma, Ion Emilian Radoi
2024 J jnl
CoRR
Andy Catruna, Adrian Cosma, Ion Emilian Radoi
2023 J jnl
Sensors
Adrian Cosma, Andy Catruna, Ion Emilian Radoi
2023 J jnl
CoRR
Adrian Cosma, Ion Emilian Radoi
2023 B conf
IJCB
Adrian Cosma, Ion Emilian Radoi
2023 J jnl
CoRR
Adrian Cosma, Ion Emilian Radoi
2023 J jnl
CoRR
Andy Catruna, Adrian Cosma, Ion Emilian Radoi
2023 J jnl
CoRR
Adrian Cosma, Ion Emilian Radoi
2023 J jnl
CoRR
Adrian Cosma, Ion Emilian Radoi
2022 conf
RoEduNet
Costin Rachieru, Adrian Cosma, Ion Emilian Radoi
2022 conf
RoEduNet
Alexandru Marin, Ion Emilian Radoi
2022 J jnl
Sensors
Adrian Cosma, Ion Emilian Radoi
2022 conf
RoEduNet
Catalin Patrascu, Adrian Cosma, Ion Emilian Radoi
2021 B conf
FG
Andy Catruna, Adrian Cosma, Ion Emilian Radoi
2021 J jnl
CoRR
Andy Catruna, Adrian Cosma, Ion Emilian Radoi
2021 J jnl
CoRR
Adrian Cosma, Ion Emilian Radoi
2021 J jnl
Sensors
Adrian Cosma, Ion Emilian Radoi
2020 J jnl
Sensors
Anca Morar, Alin Moldoveanu, Irina Mocanu, Florica Moldoveanu, Ion Emilian Radoi, Victor Asavei, Alexandru Gradinaru, Alexandru Butean
2020 conf
RoEduNet
Vlad Adrian Stefanescu, Ion Emilian Radoi
2020 conf
RoEduNet
Nicoleta-Denisa Bortanoiu, Ion Emilian Radoi
2020 conf
RoEduNet
Adrian Cosma, Ion Emilian Radoi
2019 C conf
IPIN
Adrian Cosma, Ion Emilian Radoi, Valentin Radu
2019 C conf
IPIN
Ion Emilian Radoi, Dumitru Cirimpei, Valentin Radu
2019 conf
RoEduNet
Vlad Pelin, Ion Emilian Radoi
2019 conf
RoEduNet
Vlad Adrian Stefanescu, Ion Emilian Radoi
2018 J jnl
CoRR
Adrian Cosma, Ion Emilian Radoi, Valentin Radu
2015 conf
Q2SWinet@MSWiM
Ion Emilian Radoi, Janek Mann, D. K. Arvind
2015 B conf
WiMob
Ion Emilian Radoi, Janek Mann, D. K. Arvind
2014 C conf
DSD
Janek Mann, Ion Emilian Radoi, D. K. Arvind
2013 conf
SIGSIM-PADS
Diana Alexandra Crisan, Ion Emilian Radoi, D. K. Arvind
tests/unit/test_decompile_strings.py
← Index tests/unit/test_decompile_strings.py python
"""Unit tests for bninja/analysis/strings.py — StringAnalysis."""
import pytest
import math
from unittest.mock import MagicMock


# StringAnalysis has no binaryninja imports, just collections and math
from redb.extractors.decompiler.bninja.analysis.strings import StringAnalysis


# ============================================================================
# Helper mocks
# ============================================================================

class MockStringEntry:
    """Mock for a Binary Ninja string reference."""
    def __init__(self, value, raw=None, start=0, length=0, type_name="Utf8String"):
        self.value = value
        self.raw = raw if raw is not None else (value.encode("utf-8") if isinstance(value, str) else value)
        self.start = start
        self.length = length if length else len(self.raw)
        self.type = MagicMock()
        self.type.name = type_name


class MockBinaryView:
    """Mock binary view with a strings list."""
    def __init__(self, strings=None):
        self.strings = strings or []


# ============================================================================
# 6a. StringAnalysis
# ============================================================================


class TestStringAnalysisEntropy:
    def setup_method(self):
        self.sa = StringAnalysis(bv=MockBinaryView(), functions=[])

    def test_entropy_empty_string(self):
        assert self.sa.entropy("") == 0.0

    def test_entropy_single_char(self):
        assert self.sa.entropy("aaaa") == 0.0

    def test_entropy_uniform_distribution(self):
        # "abcd" -> 4 unique chars, each p=1/4, entropy = log2(4) = 2.0
        result = self.sa.entropy("abcd")
        assert result == pytest.approx(2.0)

    def test_entropy_binary_string(self):
        # "ab" -> 2 unique chars, each p=1/2, entropy = log2(2) = 1.0
        result = self.sa.entropy("ab")
        assert result == pytest.approx(1.0)


class TestStringAnalysisAnalyze:
    def test_analyze_deduplication(self):
        """Duplicate (string, encoding) pairs -> only first kept."""
        entries = [
            MockStringEntry("hello", start=100, type_name="Utf8String"),
            MockStringEntry("hello", start=200, type_name="Utf8String"),
        ]
        bv = MockBinaryView(strings=entries)
        sa = StringAnalysis(bv=bv, functions=[])
        result = sa.analyze()
        assert len(result) == 1
        assert result[0]["string_offset"] == 100

    def test_analyze_sorted_by_address(self):
        """First occurrence (lowest offset) is the one kept."""
        entries = [
            MockStringEntry("world", start=500, type_name="Utf8String"),
            MockStringEntry("world", start=100, type_name="Utf8String"),
        ]
        bv = MockBinaryView(strings=entries)
        sa = StringAnalysis(bv=bv, functions=[])
        result = sa.analyze()
        assert len(result) == 1
        # The analyze() sorts by start, so 100 comes first
        assert result[0]["string_offset"] == 100

    def test_analyze_empty_bv(self):
        bv = MockBinaryView(strings=[])
        sa = StringAnalysis(bv=bv, functions=[])
        result = sa.analyze()
        assert result == []

    def test_analyze_output_schema(self):
        entries = [MockStringEntry("test_string", start=0, type_name="Utf8String")]
        bv = MockBinaryView(strings=entries)
        sa = StringAnalysis(bv=bv, functions=[])
        result = sa.analyze()
        assert len(result) == 1
        r = result[0]
        required_keys = [
            "string",
            "string_raw",
            "string_encoding",
            "string_offset",
            "string_length",
            "string_raw_length",
            "string_entropy",
        ]
        for key in required_keys:
            assert key in r, f"Missing key: {key}"