While the fields of security and of formal methods/programming languages are thriving areas of computer science, the communities are mostly disjoint, and though there are several formal techniques used for ensuring security, there is no systematic use of emerging powerful formal techniques in security.

The goal of this workshop is to bring together researchers from both communities in order to have them learn about the important problems and relevant techniques in each field, to foster collaboration leading to applying “cutting edge” formal techniques in security. We will have no refereed papers, but have invited talks from people who have successfully bridged these fields and on topics that highlight important problems in security (systems security, information security, malware, etc.) that could benefit from formal techniques (programming language paradigms, verification, model-checking, efficient constraint solving, synthesis, etc.).

The workshop will consist of mainly invited talks, discussion sections on specialized topics, and panel discussions.

Confirmed invited speakers: (incomplete)

  • Scalable Security Analysis of Android Apps
    Gogul Balakrishnan, Google
  • Report on the NSF Workshop on Formal Methods for Security
    Stephen Chong, Harvard University and Joshua Guttman
  • Privacy and Algorithmic Accountability
    Anupam Dutta, CMU
  • Verifying Constant-Time Implementations
    Michael Emmi, Bell Labs
  • Ironclad: Full Verification of Complex Systems
    Bryan Parno, Microsoft Research, Redmond
  • You're viewing the program in a time zone which is different from your device's time zone - change time zone

    Mon 13 Jun
    Times are displayed in time zone: Tijuana, Baja California change

    09:00 - 10:00: Invited Talks Session IFMS at Santa Rosa East
    09:00 - 09:15
    Day opening
    Opening remarks
    FMS
    09:15 - 10:00
    Talk
    Privacy and Algorithmic Accountability
    FMS
    Anupam DuttaCarnegie Mellon University
    10:30 - 12:00: Invited Talks Session IIFMS at Santa Rosa East
    10:30 - 11:15
    Talk
    Report on the NSF Workshop on Formal Methods for Security
    FMS
    Stephen ChongHarvard University, Joshua GuttmanWorcester Polytechnic Institute
    11:15 - 12:00
    Talk
    Ironclad: Full Verification of Complex Systems
    FMS
    13:30 - 15:00: Invited Talks Session IIIFMS at Santa Rosa East
    13:30 - 14:15
    Talk
    Scalable Security Analysis of Android Apps
    FMS
    14:15 - 15:00
    Talk
    Verifying Constant-Time Implementations
    FMS
    Michael EmmiIMDEA Software Institute
    15:30 - 17:00: Breakout sessions and Panel DiscussionsFMS at Santa Rosa East
    15:30 - 16:15
    Other
    Breakout Sessions
    FMS
    16:15 - 17:00
    Other
    Panel Discussion
    FMS

    About FMS

    While the fields of security and of formal methods/programming languages are thriving areas of computer science, the communities are mostly disjoint, and though there are several formal techniques used for ensuring security, there is no systematic use of emerging powerful formal techniques in security.

    The goal of this workshop is to bring together researchers from both communities in order to have them learn about the important problems and relevant techniques in each field, to foster collaboration leading to applying “cutting edge” formal techniques in security. We will have no refereed papers, but have invited talks from people who have successfully bridged these fields and on topics that highlight important problems in security (systems security, information security, malware, etc.) that could benefit from formal techniques (programming language paradigms, verification, model-checking, efficient constraint solving, synthesis, etc.).

    The workshop will consist of mainly invited talks, discussion sections on specialized topics, and panel discussions.

    Confirmed invited speakers: (incomplete)

  • Scalable Security Analysis of Android Apps
    Gogul Balakrishnan, Google
  • Report on the NSF Workshop on Formal Methods for Security
    Stephen Chong, Harvard University and Joshua Guttman
  • Privacy and Algorithmic Accountability
    Anupam Dutta, CMU
  • Verifying Constant-Time Implementations
    Michael Emmi, Bell Labs
  • Ironclad: Full Verification of Complex Systems
    Bryan Parno, Microsoft Research, Redmond