Opaque Predicates, Veiled Sets and Their Logic
نویسندگان
چکیده
Motivated by considerations in the foundations of quantum mechanics and inspired by the literature on vague predicates, we introduce the concept of an opaque predicate. While in the case of vague predicates there is a kind of indeterminacy with respect to the predicate, in the sense that the vagueness concerns whether a well-determined object satisfies it or not, in the case of opaque predicates the indeterminacy is with regard to the objects which should satisfy them. In other words, their extensions are not well-defined, despite the fact that the conditions for an object to satisfy the predicates are well-known. We suggest that such opaque predicates (and more generally, what we call opaque relations) can be characterized by a logic which encompasses a semantics founded in quasi-set theory, and call their extensions veiled sets. 1. Vagueness and Opacity " Vagueness is a feature of scientific as of other discourse. " Max Black (1966) Peirce famously characterised vagueness in the following terms: " A proposition is vague when there are possible states of things concerning which it is intrinsically uncertain whether, had they been contemplated by the speaker, he would have regarded them as excluded or allowed by the proposition. By intrinsically uncertain we mean not uncertain in consequence of any ignorance of the interpreter, but because the speaker's habits of language were indeterminate " [29]. In this context, two issues immediately arise: (i) whether vagueness can be dismissed as merely a feature of 'natural' language which will effectively evaporate with the introduction of some formal system, and (ii) given a negative answer to (i), whether vagueness requires the use of some form of non-classical logic. These are the issues with which standard discussions of vagueness have been concerned. Thus Wright, for example, emphasises that vague predicates lack 'sharp boundaries' and argues forcefully that " ... the utility and point of the classifications expressed The authors would like very much to thank the two anonymous referees for their suggestions.
منابع مشابه
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfuscation is to make the logic embedded in code incomprehensible to automated program analysis tools used by adversaries. Opaque predicates act as tool for obfuscating control flow logic embedded within code. In this posi...
متن کاملSOFT TOPOLOGY AND SOFT PROXIMITY AS FUZZY PREDICATES BY FORMULAE OF LUKASIEWICZ LOGIC
In this paper, based in the L ukasiewicz logic, the definition offuzzifying soft neighborhood structure and fuzzifying soft continuity areintroduced. Also, the fuzzifying soft proximity spaces which are ageneralizations of the classical soft proximity spaces are given. Severaltheorems on classical soft proximities are special cases of the theorems weprove in this paper.
متن کاملOpaque Predicates Detection by Abstract Interpretation
Code obfuscation and software watermarking are well known techniques designed to prevent the illegal reuse of software. Code obfuscation prevents malicious reverse engineering, while software watermarking protects code from piracy. An interesting class of algorithms for code obfuscation and software watermarking relies on the insertion of opaque predicates. It turns out that attackers based on ...
متن کاملGeneralized Dynamic Opaque Predicates: A New Control Flow Obfuscation Method
Opaque predicate obfuscation, a low-cost and stealthy control flow obfuscation method to introduce superfluous branches, has been demonstrated to be effective to impede reverse engineering efforts and broadly used in various areas of software security. Conventional opaque predicates typically rely on the invariant property of well-known number theoretic theorems, making them easy to be detected...
متن کاملIndistinguishable Predicates: A New Tool for Obfuscation
Opaque predicates are a commonly used technique in program obfuscation, intended to add complexity to control flow and to insert dummy code or watermarks. We survey a number of methods to remove opaque predicates from obfuscated programs, hence defeating the intentions of the obfuscator. Our main contribution is an obfuscation technique that introduces opaque constant predicates that are provab...
متن کامل