JavaScript Dead Code Identification, Elimination, and Empirical Assessment

Analysis and Identification of Malicious JavaScript Code

Analysis and Identification of Malicious JavaScript Code Mohammad Fraiwan a , Rami Al-Salman a , Natheer Khasawneh b & Stefan Conrad c a Department of Computer Engineering, Jordan University of Science and Technology, Irbid, Jordan b Department of Software Engineering, Jordan University of Science and Technology, Irbid, Jordan c Institute of Computer Science, Heinrich-Heine University, Düesseld...

Dead Code Elimination through Dependent Types

Pattern matching is an important feature in various functional programming languages such as SML, Caml, Haskell, etc. In these languages, unreachable or redundant matching clauses, which can be regarded as a special form of dead code, are a rich source for program errors. Therefore, eliminating unreachable matching clauses at compile-time can signiicantly enhance program error detection. Furthe...

Dead Code Elimination in Formal Synthesis

Region-Based Partial Dead Code Elimination on Predicated Code

This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in an existing compiler framework. Our algorithm processes PDE candidates using a worklist and reasons about their partial deadness using predicate partition graphs. It operates uniformly on hyperblocks and regions comprising bas...

Partial dead code elimination on predicated code regions

This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in the ORC compiler framework. Existing PDE algorithms are not applicable on predicated code due to the existence of if-converted branches in the program. The proposed algorithm processes all PDE candidates in a worklist and reas...