Omar Ismail

22 papers A* 1B 1C 10Journal 3Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
IEEE J. Solid State Circuits
Matteo Dalla Longa, Francesco Conzatti, Omar Ismail, Ahmed Abdelaal, John G. Kauffman, Maurits Ortmanns
2025 C conf
ISCAS
Mahmoud Ghoneim, Omar Ismail, John G. Kauffman, Maurits Ortmanns
2025 C conf
ISCAS
Paul Kaesser, Omar Ismail, Joachim Becker, Maurits Ortmanns
2025 C conf
ISCAS
Paul Kaesser, Omar Ismail, Joachim Becker, Maurits Ortmanns
2025 C conf
ISCAS
Omar Ismail, Paul Kaesser, Markus Sporer, John G. Kauffman, Maurits Ortmanns
2025 conf
CICC
Omar Ismail, Paul Kaesser, Maurits Ortmanns
2024 conf
VLSI Technology and Circuits
Matteo Dalla Longa, Francesco Conzatti, Omar Ismail, John G. Kauffman, Maurits Ortmanns
2024 C conf
ISCAS
Omar Ismail, Paul Kaesser, John G. Kauffman, Maurits Ortmanns
2024 C conf
ETFA
Omar Ismail, Felix Gehlhoff, Nihar H. Shah, Alexander Fay
2024 J jnl
IEEE Trans. Circuits Syst. II Express Briefs
Paul Kaesser, Johannes Wagner, Omar Ismail, Maurits Ortmanns
2024 conf
NewCAS
Omar Ismail, Paul Kaesser, John G. Kauffman, Maurits Ortmanns
2024 C conf
ISCAS
Paul Kaesser, Omar Ismail, David-Peter Wiens, Maurits Ortmanns
2024 C conf
ISCAS
Paul Kaesser, Sebastian Kaltenstadler, Joschua Conrad, Johannes Wagner, Omar Ismail, Maurits Ortmanns
2023 conf
ESSCIRC
Mohamed A. Mokhtar, Omar Ismail, Patrick Vogelmann, John G. Kauffman, Maurits Ortmanns
2023 J jnl
IEEE Trans. Circuits Syst. I Regul. Pap.
Paul Kaesser, Omar Ismail, Johannes Wagner, Robert F. H. Fischer, Maurits Ortmanns
2023 C conf
ISCAS
Paul Kaesser, Omar Ismail, Christian Rudorf, Johannes Wagner, Maurits Ortmanns
2023 C conf
INDIN
Omar Ismail, Alexander Fay
2023 conf
ICECS
Paul Kaesser, Johannes Wagner, Omar Ismail, Bjoern Driemeyer, Maurits Ortmanns
2020 conf
FNC/MobiSPC
Mahmoud Fathy, Nada Ashraf, Omar Ismail, Sarah Fouad, Lobna Shaheen, Alaa Hamdy
2019 B conf
SMC
Mingyang Shao, Silas Franco Dos Reis Alves, Omar Ismail, Xinyi Zhang, Goldie Nejat, Beno Benhabib
2017 A* conf
MobiCom
Mark D. Corner, Brian Neil Levine, Omar Ismail, Angela Upreti
2004 conf
AINA (1)
Omar Ismail, Masashi Etoh, Youki Kadobayashi, Suguru Yamaguchi
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}"