In particular, we shall examine how several groups are attempting to port the success that finite-state analysis as well as automated reasoning have had in the realm of hardware systems to the realm of software. The lion's share of tomorrow's software is expected to be in safety-critical embedded devices. Much of this software will be concurrent, reactive, and often real-time constrained. In particular, a lot of work happening in program analysis and compiler optimization is directly applicable to software verification. We shall examine both theoretical and practical issues of Formal Software Verification during this semester.
Academic credit is available.
For new visitors, here's how to get to MEB . Turn left onto the first corridor entering from the left. The conference room is immediately on the right, opposite the rest rooms. References Papers on using Mona for software verification Maintained by Ganesh Gopalakrishnan.