We report the results of a search for the flavor-changing neutral-current decays $D^{+}\to {\pi }^{+}{\mu }^{+}{\mu }^{-}$ and $D^{+}\to {\pi }^{+}{e}^{+}{e}^{-}$ in data from Fermilab charm hadroproduction experiment E791. No signal above background is found, and we obtain upper limits on branching fractions, $B(D^{+}\to {\pi }^{+}{\mu }^{+}{\mu }^{-})<1.8\mathrm{}\times {10}^{-5\mathrm{}}$ and $B(D^{+}\to {\pi }^{+}{e}^{+}{e}^{-})<6.6\mathrm{}\times {10}^{-5\mathrm{}}$, at the 90% confidence level.

A method for context-sensitive analysis of binaries that may have obfuscated procedure call and return operations is presented. Such binaries may use operators to directly manipulate stack instead of using native call and ret instructions to achieve equivalent behavior. Since definition of context-sensitivity and algorithms for context-sensitive analysis have thus far been based on the specific semantics associated to procedure call and return operations, classic interprocedural analyses cannot be used reliably for analyzing programs in which these operations cannot be discerned. A new notion of context-sensitivity is introduced that is based on the state of the stack at any instruction. While changes in `calling'-context are associated with transfer of control, and hence can be reasoned in terms of paths in an interprocedural control flow graph (ICFG), the same is not true of changes in 'stack'-context. An abstract interpretation based framework is developed to reason about stack-contexts and to derive analogues of call-strings based methods for the context-sensitive analysis using stack-context. The method presented is used to create a context-sensitive version of Venable et al.'s algorithm for detecting obfuscated calls. Experimental results show that the context-sensitive version of the algorithm generates more precise results and is also computationally more efficient than its context-insensitive counterpart.