Modern Formal Methods and Applications
Course Name:
Modern Formal Methods and Applications (CS360)
Programme:
B.Tech (CSE)
Semester:
Eighth
Category:
Programme Specific Electives (PSE)
Credits (L-T-P):
04(3-1-0)
Content:
Basics of Discrete mathematics- Set Theory and Functions, Basic Set Definitions, Propositional Logic, and Predicate
Logic. Fundamentals of Formal Methods- Formal methods in computing specification; Formal description techniques
in communication, software, and hardware systems. Behavioral Specifications- Unity, Transition Systems.
Verification Tools- Verification by model checking, LTL, CTL, SAT. Deduction Systems- Proof methods and
techniques, Applications to Automated Theorem Proving, Abstract Data Types and Algebraic Specification. Type
Systems and Constructive Logics- Binary decision diagrams, Algorithms for reduced OBDDs, Symbolic model
checking. Case Studies of Selected Applications.
References:
Formal Methods in Computer Science, Jiacun Wang and William Tepfenhart, Chapman and Hall/CRC, 1st Edn.,
2019.
Formal Methods, Flemming Nielson and Hanne Riis Nielson, Springer, 2019.
Theory and Practice of Formal Methods, Erika Ábrahám, Marcello Bonsangue, and Einar Broch Johnsen, Springer,
1st Edn., 2016.
Formal Methods: Industrial Use from Model to the Code, Jean-Louis Boulanger, Wiley-ISTE, 2012.
Logic in Computer Science- Modelling and Reasoning About Systems, Michael Huth and Mark Ryan, Cambridge
University Press, 2005.