Making Formal Verification Scalable and Useable

Chennai Mathematical Institute

January 9–10, 2013


Speakers

  • Jason Baumgartner, IBM, Formal Verification at IBM: Applications and Algorithms
  • Supratik Chakraborty, IIT Bombay, Practical Quantifier Elimination for Linear Bit-vector Inequalities
  • Pallab Dasgupta, IIT Kharagpur, Formal verification in informal worlds
  • Manoj Dixit, Mathworks, Early time-budgeting in Distributed Embedded Control Systems
  • Deepak D'Souza, IISc, Verification of Free-RTOS
  • Ambar Gadkari, IBM, Formal Verification at IBM: Applications and Algorithms
  • A Kirankumar, Intel, Symbolic Trajectory Evaluation: The Prime Validation Vehicle for Intel's Next Generation Processor Graphics FPU
  • N V Krishna, IIT Madras, Correctness Issues in Transforming Task Parallel Programs
  • Daniel Kroening, Oxford Reasoning about floating-point arithmetic with abstract conflict-driven clause learning
  • Pradeep Kumar Nalla, IBM, Formal Verification at IBM: Applications and Algorithms
  • Aditya Nori, MSR, Program Verification via Machine Learning
  • Madhusudan Parthasarathy, UIUC/MSR, Natural Proofs for Verification of Dynamic Heaps
  • K V Raghavan, IISc, Precise, on-demand null-dereference verification for Java
  • Prahlad Sampath, Mathworks Translation Validation for Stateflow Code Generation
  • Nishant Sinha, IBM, Big-step Bounded Model Checking for Software
  • R Venkatesh, TRDDC, Challenges in applying formal verification to industry applications

Pěstujeme web | Letenky
  • Motivation
  • Speakers
  • Talks
  • Schedule
  • Logistics