• Publications
  • Influence
Identifying syntactic differences between two programs
  • Wuu Yang
  • Computer Science
    Softw. Pract. Exp.
  • 1 June 1991
A comparison algorithm is developed that can point out the differences between two programs more accurately than previous text comparison tools and is based on a dynamic programming scheme.
An Improved Dynamic User Authentication Scheme for Wireless Sensor Networks
It is shown that Wong et al.'s scheme is vulnerable to the replay and forgery attacks, and a lightweight dynamic user authentication scheme for WSNs is proposed that retains all the advantages but enhances its security by withstanding the security weaknesses and allows legitimate users to change their passwords freely.
Advanced obfuscation techniques for Java bytecode
Although the basic approach is to scramble the identifiers in Java bytecode, the scrambled bytecode produced with the techniques is much harder to crack than that produced with other identifier scrambling techniques and the run-time efficiency of the obfuscated bytecode is improved because the size of the bytecode becomes smaller after obfuscation.
The Semantics of Program Slicing and Program Integration
Slices can be extracted particularly easily from a program representation called a program dependence graph, originally introduced as an intermediate program representation for performing optimizing, vectorizing, and parallelizing transformations.
The Semantics of Program Slicing
On Preventing Type Flaw Attacks on Security Protocols With a Simplified Tagging Scheme
Heather et al.'s tagging scheme is simplified by combining all the tags inside each encrypted component into a single tag and by omitting the tags on the outmost level, which reduces the sizes of messages in the security protocol.
A Chaotic Maps-Based Key Agreement Protocol that Preserves User Anonymity
This work proposes a novel key agreement protocol that achieves mutual authentication without verification tables, but also allows users to anonymously interact with the server and is modelled and analyzed with Petri nets.
Detecting Program Components With Equivalent Behaviors
An efficient algorithm for detecting program components − in one or more programs − that exhibit identical execution behaviors that is applicable to programs written in a language that includes scalar variables and constants, assignment statements, conditional statements, and while-loops is presented.
A multiple power-level approach for wireless sensor network positioning
The simulation results show that the proposed algorithm exhibits better accuracy than do traditional single power-level methods, and in critical situations such as reference node failure, unstable radio transmission range and beacon collision, it performs well.
A program integration algorithm that accommodates semantics-preserving transformations
This paper describes a new integration algorithm that is able to accommodate semantics-preserving transformations and causes the algorithm to be overly conservative in its definition of interference.