Kartik Nagar

References

Mon, 29 Jul 2024 00:00:00 +0000

The lecture slides (jupyter notebooks) will be shared before each lecture. These can be accessed at this github page.

Here are some additional references:

Ocaml

Functional Programming in OCaml, Cornell CS3100 textbook. Freely available here
Real World OCaml by Yaron Minsky, Anil Madhavapeddy and Jason Hickey. The book is freely available here.
OCaml Manual - available here.
For practicing programming in OCaml - see 99 Problems in OCaml

Lambda Calculus

Types and Programming Languages by Benjamin Pierce.
Lecture notes on Lambda Calculus by Peter Seliner, available here.

Prolog

Programming Languages, Concepts and Constructs, 2nd edition, by Ravi Sethi. Chapter 11.
The Art of Prolog, 2nd edition, by Leon Sterling and Ehud Y. Shapiro.

Software

Mon, 29 Jul 2024 00:00:00 +0000

A docker image is setup for the course. It contains the necessary software to run OCaml, SWI-Prolog and the Jupyter notebooks. Instructions for setting this up in your computers are available at this link. Please follow these instructions precisely. The docker image is also available here. Please contact the instructor or TAs if you are facing any issues with this. The lectures and the assignment submission require this setup, and in fact assignment 0 is meant just for ensuring that you have set it up.

OCaml

It is not necessary to install OCaml on your computers. You can run and experiment with OCaml programs through juypter notebooks or utop on the Docker image. However, if you still want to install Ocaml, follow the instructions here. It is recommended to also install utop.

SWI-Prolog

Installation instructions are available here. Again, it is not necessary to install SWI-Prolog on your computers.

Schedule

Tue, 15 Aug 2023 00:00:00 +0000

Paper ID	Paper Title	Main Presentation	Related Work Presentation	Future Work Presentation
1	When threads meet events: efficient and precise static race detection with origins. Bozhen Liu et al. PLDI 2021	Aug 23: Yuvraj Talukdar, Venkata Naga Sai Rohit Kanteti	Aug 25: Chathur Bommineni, Dhruv Maroo	Aug 25: Narsimha Naidu, Nayani Chetana
2	Finding the dwarf: recovering precise types from WebAssembly binaries. Daniel Lehmann, Michael Pradel. PLDI 2022	Aug 30: Abdun Nihaal, Robert K Samuel	Sep 1: Narsimha Naidu, Nayani Chetana	Sep 1: Chathur Bommineni, Dhruv Maroo
3	A study of real-world data races in Golang. Milind Chabbi, Murali Krishna Ramanathan. PLDI 2022	Sep 6: Chinmay Badjatya, Rudrik Shah	Sep 8: Divya Rathore, Omkar Dilip Dhawal	Sep 8: Sudeep Chowdhary, Divyanshu Upadhyay
4	RacerD: compositional static race detection. Sam Blackshear, Nikos Gorogiannis, Peter W. O’Hearn, Ilya Sergey. OOPSLA 2018	Sep 13: Mohammed Rizan Farooqui	Sep 15: Sudeep Chowdhary, Divyanshu Upadhyay	Sep 15: Divya Rathore, Omkar Dilip Dhawal
5	Compiler-assisted object inlining with value fields. Rodrigo Bruno, Vojin Jovanovic, Christian Wimmer, Gustavo Alonso. PLDI 2021	Sep 20: Divya Rathore, Omkar Dilip Dhawal	Sep 22: Abdun Nihaal, Robert K Samuel	Sep 22: Mohammed Rizan Farooqui
6	Using Lightweight Formal Methods to Validate a Key-Value Storage Node in Amazon S3. James Bornholt,Rajeev Joshi et al. SOSP 2021	Sep 27: Bommineni Chathur, Dhruv Sanjaykumar Maroo	Sep 29: Yuvraj Talukdar, Venkata Naga Sai Rohit Kanteti	Sep 29: Chinmay Badjatya, Rudrik Shah
7	Synthesizing highly expressive SQL queries from input-output examples. Chenglong Wang, Alvin Cheung, Ratislav Bodik. PLDI 2017	Oct 4: Sudeep Chowdhary, Divyanshu Upadhyay	Oct 6: Mohammed Rizan Farooqui	Oct 6: Yuvraj Talukdar, Venkata Naga Sai Rohit Kanteti
8	A fast in-place interpreter for WebAssembly. Ben L. Titzer. OOPSLA 2022	Oct 11: Narasimha Naidu, Nayani Chetana	Oct 13: Chinmay Badjatya, Rudrik Shah	Oct 13: Abdun Nihaal, Robert K Samuel

Lectures

Tue, 01 Aug 2023 00:00:00 +0000

Topic	Date(s)	References/Additional Reading
Introduction	1/8	Set up the course jupyter notebooks
Why Functional Programming?	2/8
Expressions in OCaml	2/8,3/8	Chapter 2.3 in Cornell CS3110 textbook
Functions in OCaml	3/8,8/8	Chapter 2.4 in Cornell CS3110 textbook
Datatypes in OCaml	8/8,9/8	Chapter 3 in Cornell CS3110 textbook
Pattern Matching in OCaml	10/8,16/8	Chapter 3.1 in Cornell 3110 textbook
Higher-order programming in OCaml	17/8	Chapter 4 in Cornell 3110 textbook
Lambda Calculus: Syntax	22/8,23/8	Peter Selinger’s lecture notes on lambda calculus Chapter 2, Types and Programming Languages Chapter 5.
Lambda Calculus: Semantics	30/8,31/8,5/9	Peter Selinger’s lecture notes on lambda calculus Chapter 2, Types and Programming Languages Chapter 5.
Lambda Calculus: Encodings	5/9,6/9,7/9,12/9	Peter Selinger’s lecture notes on lambda calculus Chapter 6, Types and Programming Languages Chapter 5.
Lambda Calculus: STLC	12/9, 13/9	Peter Selinger’s lecture notes on lambda calculus Chapter 6
Side effects in OCaml	13/9, 14/9	Chapter 7 in Cornell CS3110 textbook, Chapter on Imperative programming in Real World OCaml
Modular Programming in OCaml	15/9, 20/9	Chapter 5 in Cornell CS3110 textbook, Chapter on Modules, Chapter on Functors in Real World Ocaml.
Streams, Laziness and Memoization in OCaml	20/9,21/9,26/9	Chapter 8.4,8.5 in Cornell CS3110 textbook, Laziness & Memoization in Real World Ocaml.
Prolog Basics	27/9,3/10	Chapter 11 in Programming Languages: Concepts and Constructs by Ravi Sethi.
Prolog: Logical Foundations	3/10,4/10,10/10	Chapter 1,2,3.1 in Logic, Programming and Prolog.
Lists in Prolog	10/10,11/10,12/10	Chapter 11 in PLCC, Chapter 3 in The Art of Prolog
Control in Prolog	12/10, 16/10, 17/10	Chapter 11 in PLCC, Chapter 4 in The Art of Prolog
Generate and Test	18/10, 19/10	Chapter 11 in PLCC, Chapter 14.1 in The Art of Prolog
Solving a Logic Puzzle	19/10, 25/10
Cuts and Negation	25/10,26/10,31/10	Chapter 11 in PLCC, Chapter 11 in The Art of Prolog
Type Inference and Program Synthesis using Prolog	31/10, 1/11
Mutable Data Structures and Difference Lists in Prolog	2/11, 7/11	Chapter 15 in The Art of Prolog

Paper List

Tue, 01 Aug 2023 00:00:00 +0000

Please mention your group’s selection for the main presentation on the course moodle site. The page for adding your selection will be made available from Monday, Aug 14, 10 AM. Note that papers will be assigned on FCFS basis.

Sound, complete, and tractable linearizability monitoring for concurrent collections. Michael Emmi and Constantin Enea. POPL 2018
Finding the dwarf: recovering precise types from WebAssembly binaries. Daniel Lehmann, Michael Pradel. PLDI 2022
A Tree Clock Data Structure for Causal Orderings in Concurrent Executions. Umang Mathur, Andreas Pavlogiannis, Hunkar Can Tunc, Mahesh Viswanathan. ASPLOS 2022
A study of real-world data races in Golang. Milind Chabbi, Murali Krishna Ramanathan. PLDI 2022
Using Lightweight Formal Methods to Validate a Key-Value Storage Node in Amazon S3. James Bornholt,Rajeev Joshi et al. SOSP 2021
Compiler-assisted object inlining with value fields. Rodrigo Bruno, Vojin Jovanovic, Christian Wimmer, Gustavo Alonso. PLDI 2021
Finding Real Bugs in Big Programs with Incorrectness Logic. Quang Loc Le, Azalea Raad et al. OOPSLA 2022
When threads meet events: efficient and precise static race detection with origins. Bozhen Liu, Peiming Liu, Yanze Li, Chia-Che Tsai, Dilma Da Silva, Jeff Huang. PLDI 2021
Bounding data races in space and time. Stephen Dolan, KC Sivaramakrishnan, Anil Madhavapeddy. PLDI 2018
From folklore to fact: comparing implementations of stacks and continuations. Kavon Farvardin, John H. Reppy. PLDI 2020
Persistency semantics of the Intel-x86 architecture. Azalea Raad, John Wickerson, Gil Neiger, and Viktor Vafeiadis. POPL 2020.
On-stack replacement, distilled. Daniele Cono D’Elia, Camil Demetrescu. PLDI 2018
Verdi: A framework for implementing and formally verifying distributed systems. James R. Wilcox, Doug Woos, et al. PLDI 2015
Active learning of points-to specifications. Osbert Bastani, Rahul Sharma, Alex Aiken, Percy Liang. PLDI 2018
Mirror: Making Lock-free data structures persistent. Michal Friedman, Erez Petrank, Pefro Ramalhete. PLDI 2021
Pinpoint: fast and precise sparse value flow analysis for million lines of code. Qingkai Shi, Xiao Xiao, Rongxin Wu, Jinguo Zhou, Gang Fan, Charles Zhang. PLDI 2018
Synthesizing highly expressive SQL queries from input-output examples. Chenglong Wang, Alvin Cheung, Ratislav Bodik. PLDI 2017
BigFoot: static check placement for dynamic race detection. Dustin Rhodes, Cormac Flanagan, Stephen N. Freund. PLDI 2017
FlashMeta: a framework for inductive program synthesis. Oleksandr Polozov, Sumit Gulwani. OOPSLA 2015
Efficient and precise points-to analysis: modeling the heap by merging equivalent automata. Tian Tan, Yue Li, Jingling Xue. PLDI 2017
RacerD: compositional static race detection. Sam Blackshear, Nikos Gorogiannis, Peter W. O’Hearn, Ilya Sergey. OOPSLA 2018
Provably correct peephole optimizations with alive. Nuno P. Lopes, David Menendez, Santosh Nagarakatte, John Regehr. PLDI 2016
Sound Sequentialisation for concurrent program verification. Azadeh Farzan, Dominik Klumpp, Andreas Podelski. PLDI 2022
A fast in-place interpreter for WebAssembly. Ben L. Titzer. OOPSLA 2022
Optimal dynamic partial order reduction. Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson. Konstantinos Sagonos. POPL 2014.
Type stability in Julia: avoiding performance pathologies in JIT compilation. Artem Pelenitsyn, Julia Belyakova, Benjamin Chung, Ross Tate, Jan Vitek. OOPSLA 2021
Efficient scalable thread-safety-violation detection: finding thousands of concurrency bugs during testing. Guangpu Li, Shan Lu, Madanlal Musuvathi, Suman Nath, Rohan Padhye. SOSP 19
Dynamic dispatch of context-sensitive optimizations. Gabriel Poesia, Fernando Magno Quintão Pereira. OOPSLA 2020
Precision-guided context sensitivity for pointer analysis. Yue Li, Tian Tan, Anders Møller, Yannis Smaragdakis. OOPSLA 2018
Type Inference for C: Applications to the Static Analysis of Incomplete Programs. Leandro T. C. Melo, Rodrigo Geraldo Ribeiro, Breno Campos Ferreira Guimarães, Fernando Magno Quintão Pereira. TOPLAS 2020
Rethinking Incremental and Parallel Pointer Analysis. Bozhen Liu, Jeff Huang, Lawrence Rauchwerger. TOPLAS 2019

References

Sun, 30 Jul 2023 00:00:00 +0000

The lecture slides (jupyter notebooks) will be shared after each lecture. These can be accessed at this github page.

Here are some additional references:

Ocaml

Functional Programming in OCaml, Cornell CS3100 textbook. Freely available here
Real World OCaml by Yaron Minsky, Anil Madhavapeddy and Jason Hickey. The book is freely available here.
OCaml Manual - available here.
For practicing programming in OCaml - see 99 Problems in OCaml

Lambda Calculus

Types and Programming Languages by Benjamin Pierce.
Lecture notes on Lambda Calculus by Peter Seliner, available here.

Prolog

Programming Languages, Concepts and Constructs, 2nd edition, by Ravi Sethi. Chapter 11.
The Art of Prolog, 2nd edition, by Leon Sterling and Ehud Y. Shapiro.

Software

Sun, 30 Jul 2023 00:00:00 +0000

OCaml

SWI-Prolog

Installation instructions are available here. Again, it is not necessary to install SWI-Prolog on your computers.

Lectures

Fri, 29 Jan 2021 00:00:00 +0000

Lectures will be uploaded on the course Moodle page: https://courses.iitm.ac.in/course/view.php?id=405

Video Lectures

Link to Google Drive Folder containing all videos: Compiler Design Lectures

Lectures

Fri, 29 Jan 2021 00:00:00 +0000

Lectures will be uploaded on the course Moodle page: https://courses.iitm.ac.in/course/view.php?id=7129

Video Lectures

Link to Google Drive Folder containing all videos: LMC Lectures

Lectures

Mon, 07 Sep 2020 00:00:00 +0000

Lecture slides will be uploaded on the course moodle page: https://coursesnew.iitm.ac.in/course/view.php?id=1267.

Lectures

Mon, 07 Sep 2020 00:00:00 +0000

Topic	Date(s)	References/Additional Reading
Introduction	18/1	Hoare’s Paper. Intro Slides of Rajeev Alur’s Course on Computer Aided Verification
Propositional Logic	19/1,20/1,21/1,27/1	BM Chapter 1
First Order Logic	28/1,1/2	BM Chapter 2
Satisfiability Modulo Theories	2/2,3/2,4/2,8/2	BM Chapter 3
SMT:Application to BMC + Z3	9/2
Operational Semantics and Verification	10/2,11/2,16/2,17/2
Strongest Post Condition	17/2,18/2,22/2,23/2
Weakest Pre Condition	24/2,25/2,1/3
Hoare Logic	2/3,3/3,4/3,9/3,10/3,15/3
Dafny
Abstract Interpretation: Soundness	16/3,17/3,22/3,23/3,24/3,25/3,29/3,30/3,1/4
Abstract Interpretation: Kildall’s Algorithm	5/4,6/4,7/4,8/4,12/4,13/4,19/4
Model Checking	19/4,20/4,21/4,22/4	Software Model Checking Survey Paper

Video Lectures

~~Link to Google Drive Folder containing all videos: APV-Jan-2022 Lectures~~ Lectures upto 28/1 are available on the above link; rest of the lecture recordings will be directly shared through e-mail.

Lectures

Mon, 07 Sep 2020 00:00:00 +0000

Topic	Date(s)	References/Additional Reading
Introduction	7/9	Hoare’s Paper. Intro Slides of Rajeev Alur’s Course on Computer Aided Verification
Propositional Logic: Introduction	8/9	BM Section 1.1-1.4
Propositional Logic: DPLL	9/9, 11/9	BM Section 1.6-1.7. Slides on CDCL-based SAT Solvers from Isil Dillig’s Course
First Order Logic: Introduction	11/9	BM Section 2.1-2.2
First Order Logic: Validity	14/9	BM Section 2.3,2.5
Satisfiability Modulo Theories: Introduction	15/9	BM Section 3.1,3.3
Satisfiability Modulo Theories: Theories	16/9,18/9	BM Section 3.2,3.3,3.6,3.8
First Order Logic: Compactness	21/9	BM Section 2.7.4
Satisfiability Modulo Theories: Bounded Model Checking	22/9
Z3 + Deductive Verification: Introduction	23/9
Operational Semantics	28/9	Ashutosh Gupta’s Lecture
Operational Semantics in FOL	29/9
Strongest Post-Condition	30/9,6/10,7/10	BM Section 12.1
Weakest Pre-Condition	9/10,12/10,13/10,14/10,16/10
Hoare Logic	16/10,19/10
Hoare Logic: VC Generation	20/10,21/10,27/10,28/10	BM Chapters 5,6
Dafny	28/10,2/11
Abstract Interpretation: Introduction and Lattice Theory	2/11,3/11,4/11,9/11,10/11	BM Section 12.1
Abstract Interpretation: Soundness	10/11,11/11,16/11
Abstract Interpretation: Kildall’s Algorithm	16/11,17/11,18/11
Abstract Interpretation: Abstract Domains	18/11,23/11
Model Checking	24/11,25/11,27/11	Software Model Checking Survey Paper

Video Lectures

Link to Google Drive Folder containing all videos: APV Lectures

Verifying Smart Contract Security Against Re-entrancy Attacks through Relational Value Analysis

Sat, 10 Jan 2026 14:24:05 +0530

A Mechanically Verified Garbage Collector for OCaml

Fri, 28 Feb 2025 19:01:13 +0530

Automatically Verifying Replication-aware Linearizability

Fri, 28 Feb 2025 18:48:25 +0530

Automated Robustness Verification of Concurrent Data Structure Libraries against Relaxed Memory Models

Tue, 03 Sep 2024 19:13:24 +0530

Automating Cutoff-based Verification of Distributed Protocols

Wed, 26 Jul 2023 18:25:16 +0530

Certified Mergeable Replicated Data Types

Wed, 06 Apr 2022 00:00:00 +0000

Brief Announcement: Automating and Mechanising Cutoff Proofs for Parameterized Verification of Distributed Protocols

Tue, 27 Jul 2021 10:42:38 +0530

Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring

Thu, 15 Apr 2021 00:00:00 +0000

Certified Mergeable Replicated Data Types

Wed, 14 Apr 2021 16:56:47 +0530

Alumni

Tue, 28 Jul 2020 00:00:00 +0000

B.Tech. (including dual degree students)

Shreesha Bhat (Next position: PhD student at UIUC)
- Automating cutoff-based verification of distributed protocols

M.Tech.

Rhythm Jain (2022-23) (Next position: Embedded Software Engineer, Enphase Energy)
- Superoptimization of Smart Contracts on Ethereum Blockchain using ILP
Jude Anil (2022-23) (Next position: PhD student at Stevens Institute of Technology, USA)
- Exploring Concurrent Program Verification Through Iris
Vivek Kumar (2021-22) (Next position: Software Engineer, Microsoft India)
- Verifying Robustness of Transactional Applications under Weak Consistency
Aanchal Jawere (2021-22) (Next position: Software Engineer, Oracle India)
- Parallelizing Transaction Validation for Smart Contracts in Blockchain

Personal

Tue, 28 Jul 2020 00:00:00 +0000

I am an avid reader (mostly fiction). I diligently keep track of all of my books at my Goodreads Account.

Automated Reasoning for Replicated Systems

Wed, 08 Jul 2020 00:00:00 +0000

For global-scale applications such as Amazon, Twitter, Facebook, etc. with users distributed across the world, in order to provide a uniform low-latency and always available service, the application data needs to replicated at multiple servers across the world. Such replicated systems also facilitate other useful properties such as better scalability and fault tolerance, but they are very hard to program since they offer a completely different memory model to the programmers. Since the same data at different replicas can be concurrently updated and the updates can be applied in different orders at different replicas, this can result in subtle concurrency bugs for the applications running on top of replicated systems which can be hard to find through testing-based approaches. In this project, we proposed a number of automated verification techniques to reason about correctness of programs running on top of replicated systems.

Representative Publications:

Semantics, Specification and Automated Verification of Concurrent Libraries in Replicated Systems. Kartik Nagar, Prasita Mukherjee and Suresh Jagannathan. CAV 20
CLOTHO : Directed Test Generation for Weakly Consistent Database Systems. Kia Rahmani, Kartik Nagar, Benjamin Delaware and Suresh Jagannathan. OOPSLA 19.
Automated Parameterized Verification of CRDTs. Kartik Nagar and Suresh Jagannathan. CAV 19.
Automated Detection of Serializability Violations under Weak Consistency. Kartik Nagar and Suresh Jagannathan. CONCUR 18.
Alone Together: Compositional Reasoning and Inference for Weak Isolation. Gowtham Kaki, Kartik Nagar, Mahsa Najafzadeh and Suresh Jagannathan. POPL 18.

Semantics, Specification and Bounded Verification of Concurrent Libraries in Replicated Systems

Tue, 07 Apr 2020 00:00:00 +0000

CLOTHO : Directed Test Generation for Weakly Consistent Database Systems

Tue, 01 Oct 2019 00:00:00 +0000

Automated Parametrized Verification of CRDTs

Mon, 01 Jul 2019 00:00:00 +0000

Automated Detection of Serializability Violations under Weak Consistency

Wed, 01 Aug 2018 00:00:00 +0000

Alone together: Compositional Reasoning and Inference for Weak Isolation

Mon, 01 Jan 2018 00:00:00 +0000

Refining Cache Behaviour Prediction using Cache Miss Paths

Tue, 01 Aug 2017 00:00:00 +0000

Fast and Precise Worst Case Interference Placement for Shared Cache Analysis

Fri, 01 Jul 2016 00:00:00 +0000

Timing Analysis for Real-time Systems

Wed, 01 Jun 2016 00:00:00 +0000

In Real-time systems, e.g. automobiles, aircrafts, space shuttles, robots, etc. programs are executed in response to external stimuli and must finish their execution before fixed deadlines to ensure correct behavior. Hence, Worst Case Execution Time (WCET) becomes a very important correctness criterion for programs running on real-time systems. In this project, we proposed static analysis techniques to determine the WCET of programs, chiefly focusing on the impact of caches on timing of programs.

Representative Publications

Refining Cache Behaviour Prediction using Cache Miss Paths. Kartik Nagar and YN Srikant. TECS 17
Fast and Precise Worst Case Interference Placement for Shared Cache Analysis. Kartik Nagar and YN Srikant. TECS 16
Path-sensitive Cache Analysis using Cache Miss Paths. Kartik Nagar and YN Srikant. VMCAI 15
Precise Shared Cache Analysis using Optimal Interference Placement. Kartik Nagar and YN Srikant. RTAS 14
Interdependent Cache Analyses for better Precision and Safety. Kartik Nagar and YN Srikant. MEMOCODE 12

Path-sensitive Cache Analysis using Cache Miss Paths

Thu, 01 Jan 2015 00:00:00 +0000

Precise Shared Cache Analysis using Optimal Interference Placement

Tue, 01 Apr 2014 00:00:00 +0000

Interdependent Cache Analyses for better precision and safety

Sun, 01 Jul 2012 00:00:00 +0000