Course details

Binary Code Analysis

IAN Acad. year 2022/2023 Summer semester 4 credits

This course deepens the knowledge and skill obtained in the course of Machine level programming (ISU) and in the course of Operating systems (IOS) with the main goal of allowing the students to understand the image of a crashed system (the so-called crash dump). Knowledge of programming on the level of assembler and application binary interfaces (ABI) is applied on a real Unix operating system. Within the course, various binary files used in the system are discussed, including their structure and their disassembled contents. The course involves a detailed study of compiler output from the point of view of linkage and run of system code as well as a discussion of differences and relations among various processor architectures, compilers, and application binary interfaces. Next, the course presents selected concepts typical for kernel-level programming whose deep knowledge is necessary for analysing the functionality of an operating system kernel. These concepts include, among others, details of interrupt processing, task queues, process/thread synchronisation and memory management inside the kernel, i.e., the so-called SLAB allocator. Knowledge obtained in this way is used as a basis for presenting possibilities of monitoring the behaviour of an operating system on the binary level during its run as well as analysis of images of system memory after a system crash (crash dump analysis). In both cases, usage of tools shipped within common Unix distributions is accented.

Guarantor

Course coordinator

Language of instruction

Czech, English

Completion

Classified Credit

Time span

  • 14 hrs lectures
  • 12 hrs pc labs
  • 13 hrs projects

Assessment points

  • 40 pts mid-term test
  • 60 pts projects

Department

Lecturer

Instructor

Subject specific learning outcomes and competences

Practical experience with analysing the image of system memory after a system crash (crash dump analysis). Knowledge of the structure of binary files used in Unix systems (ELF). Understanding differences and relations between processors architectures, compilers, and ABI standards. Students who successfully pass the course will further be able to monitor the run of an operating system on a binary level during its runtime too. Improved knowledge in the areas of operating systems, machine languages, and debugging and analysis.

Learning objectives

The goal is to acquaint students with the operation of modern Unix operating systems on a level close to the binary code and with available tools for observing the behaviour of such systems, including, in particular, their post-mortem analysis.

Why is the course taught

The course teaches students more details about the functioning of the Linux kernel, ways of analysing its state after a crash, as well as ways of monitoring its functioning during its run time.

Prerequisites

Prerequisite knowledge and skills

Proficiency in C language, x86 assembly code, understanding of operating system principles, practical experience with Unix systems.

Study literature

  • Course slides: https://github.com/skozina/cda-slides
  • Intel Corporation: Intel 64 and IA-32 Architectures Software Developer Manuals, 2015.
  • Matz, M., Hubicka, J., Mitchell, M.: System V Application Binary Interface, AMD64 Architecture Processor Supplement, 2013.

Fundamental literature

  • Ljubuncic, I.: Linux Kernel Crash Book, 2011.
  • Drake, C., Brown, K.: Panic! UNIX System Crash Dump Analysis, Prentice Hall, 1995.

  • Platforms, Crashdump Analysis, Operating System Internals, 2005.Hofmann, F.: The Solaris Operating System on x86

Syllabus of lectures

  1. Introduction. Code compilation and linking. Understanding the ELF file format.
  2. Dynamic linking and running code. Dynamic relocations and interpreter. PIC, ASLR, PIE, linker script. DWARF debug symbols.
  3. Computer architectures in general, registers, stack operations. Memory segmentation, paging.
  4. The x86 and x86_64 architectures. System V ABI. Compiler and stack optimizations. The ARM architecture.
  5. Live kernel tracing: strace, ltrace, SystemTap, ftrace, perf.
  6. BPF (Berkeley Packet Filter), eBPF and its usage in kernel tracing. BCC, bpftrace.

Syllabus of computer exercises

  1. Decomposition of an ELF binary file, decoding its sections, and code disassembling.
  2. Program execution tracing using strace, ltrace, gdb.
  3. Using the crash(1) tool on Linux.
  4. Crash dump analysis of a Linux system.
  5. System tracing using SystemTap and ftrace.
  6. Tracing and analysis of system deadlocks.

Syllabus - others, projects and individual work of students

  1. ELF file analysis.
  2. Analysis of a crash dump.
  3. Analysis of a crash dump.
  4. Monitoring of a running system using SystemTap.

Progress assessment

  • Individual project assignments (4x 15 points)
  • Final test (40 points)

Controlled instruction

The obtained knowledge of students is examined through four projects focused on low-level programming and on discovering the roots causing problems in an operating system from a provided crash dump (4x 15 points) and through a final written test (40 points). 

Exam prerequisites

To successfully pass the course, a student needs to get at least 50 points in total out of which at least 24 points must be obtained from the projects and at least 16 points from the final test.

Schedule

DayTypeWeeksRoomStartEndCapacityLect.grpGroupsInfo
Wed lecture lectures G202 09:0010:509999 2BIA 2BIB 3BIT xx

Course inclusion in study plans

  • Programme BIT, 2nd year of study, Elective
  • Programme BIT (in English), 2nd year of study, Elective
  • Programme IT-BC-3, field BIT, 2nd year of study, Elective
Back to top