Abstract This manuscript presents precise approaches for the general offset assignment problem that arises in the code generation phase of the address code generation of compilers for application-specific processors. First, integer programming models are defined for architecture-dependent and theoretically motivated specific problem cases. Then, these models are extended to give the first widely applicable formulation for the most general problem setting.... This manuscript presents precise approaches for the general offset assignment problem that arises in the code generation phase of the address code generation of compilers for application-specific processors. First, integer programming models are defined for architecture-dependent and theoretically motivated specific problem cases. Then, these models are extended to give the first widely applicable formulation for the most general problem setting. Processors with several address registers and complex addressing capabilities are supported. Extended heuristics are also provided. Proven practical applicability is demonstrated by experimental evaluation using a well-established and large set of benchmarks. The experiments enable us to study the effect of using more complex memory-addressing capabilities on the address calculation costs of real-world programs. We also demonstrate how to incorporate operand reordering techniques for commutative instructions into existing solution approaches. Read More Read Less