In this project, we have attempted to develop a retargetable compiler for "ASIP Meister" processor synthesis system, which have been developed at Osaka University, and to design new algorithms for code scheduling, with a view to establish an efficient retargetable compilation method.We examined the processor specification language and the underlying VLIW processor model of the ASIP-Meister system, so as to design a data structure called an operation table which summarizes the processor information necessary for retargetable code generation. One of the major technical contributions is a method of generating a set of the instruction patterns from behavioral description of the instruction set, in which instruction patterns that are necessary for compilers but are not explicitly described in the specification are automatically generated. Another contribution is extraction of the operation latencies from processor specifications. We have developed a method of computing operation latencies in the presence of pipeline forwarding, for all the RAW, WAR, and WAW dependencies. This is based on a way of specifying forwarding using forwarding units and formalization of correct and complete forwarding.As for a code scheduling algorithm, we focused on exact methods based on symbolic state traversal and Boolean satisfiability. As well as extending those methods so that multicycle and pipelined computation units can be handled, we have developed a framework of using a pseudo-Boolean satisfiability solver. It can directly deal with pseudo-Boolean constraints, i.e.linear inequalities, and thus contributes to speeding up of code generation.