Results 61 to 70 of about 120 (96)

The Question of Referentiality

Philosophy and Phenomenological Research, Volume 113, Issue 3, Page 657-669, November 2026.
ABSTRACT Most theorists have offered different accounts of reference fixing for names, demonstratives, and indexicals. Indeed, this variety can seem an inevitable response to a certain class of hard cases. Here, I will offer a unified account of reference fixing equally capable of handling these cases.
Eliot Michaelson
wiley   +1 more source

Leveraging Symbolic Artificial Intelligence and Fuzzy Logic for Materials Science: A Review of Methods, Challenges, and Applications to Scarce and Imperfect Experimental Data

Advanced Engineering Materials, Volume 28, Issue 20, 21 October 2026.
This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani, Mohamed‐Ali Belloum, Laurence Boudet, Valentin Fouillard, Edwin Friedmann, Guillaume Lacharme, Ali Mahmoud, Jean‐Philippe Poli   +7 more
wiley   +1 more source

A Heuristic Approach to Detect Opaque Predicates that Disrupt Static Disassembly

Proceedings 2020 Workshop on Binary Analysis Research, 2020
Yu-Jye Tung, Ian G. Harris
openaire   +1 more source

Dyn-Phi: A Trace-Informed Join Node for Triaging Opaque Predicates and Dead Branches in Binary Code

Opaque predicates inflate a binary's control-flow graph, and the symbolic execution that can prove them infeasible scales poorly, so analysts must decide where to spend it. Dyn-Phi is a triage formulation for that decision. At each use where several definitions of a location may arrive, it annotates the static reaching set with how often each was ...
openaire   +3 more sources

Dyn-Phi: A Trace-Based Dynamic Phi-Node Frameworkfor Opaque Predicate and Dead Code Detection in Binary Analysis

This repository contains the preprint and evaluation artifacts for Dyn-Phi, a lightweight triage layer that augments classical Static Single Assignment (SSA) join nodes with observed execution frequencies. Classical SSA places phi nodes purely on dominance frontiers; Dyn-Phi extends this by tagging join points with empirical register definition ...
openaire   +2 more sources

An N-State Opaque Predicate Obfuscation Algorithm Based on Henon Map

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
CHEN, Yindong, CHEN, Wandong, HUANG, Dancheng   +2 more
openaire   +2 more sources

Oracle-guided Efficient Opaque Predicate Detection with Mixed Boolean Arithmetic Deobfuscation

KIISE Transactions on Computing Practices
Hyeongchang Jeon, Seoyeon Kang, Seoksu Lee, Eun-Sun Cho   +3 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Zero Footprint Opaque Predicates: Synthesizing Opaque Predicates From Naturally Occurring Invariants

Lecture Notes in Computer Science, 2021
A popular control-flow obfuscation approach used to protect software is inserting opaque predicates. However, recent research has questioned the usefulness of opaque predicates with the realization that simple heuristic attacks can effectively detect them.
Ian R Harris
exaly   +2 more sources

When Are Opaque Predicates Useful?

2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE), 2019
Opaque predicates are a commonly used technique in program obfuscation, intended to add complexity to control flow and to insert dummy code or watermarks. However, there are many attacks known to detect opaque predicates and remove dummy code. We survey these attacks and argue that many types of programs cannot be securely obfuscated using opaque ...
Giovanni Russello, Steven Galbraith, Lukas Zobernig   +2 more
exaly   +2 more sources

Constructing Opaque Predicates for Java Programs

2006 International Conference on Computational Intelligence and Security, 2006
This paper proposes a new method to construct a family of opaque predicates for Java programs by combining indeterminate equation and cryptography. In our construction, cryptography is first exploited for manufacturing opaque predicates. Our opaque predicates are more resilient, stealthier and cheaper.
Ming Mao
exaly   +2 more sources