FMCAD 2021: FORMAL METHODS IN COMPUTER-AIDED DESIGN 2021
PROGRAM

Days: Tuesday, October 19th Wednesday, October 20th Thursday, October 21st Friday, October 22nd

Tuesday, October 19th

View this program: with abstractssession overviewtalk overview

11:00-12:15 Session 1

Tutorial 1

11:00
Active Automata Learning: from L* to L# (abstract)
12:25-13:40 Session 2

Tutorial 2

12:25
Stainless Verification System Tutorial (abstract)
14:10-15:25 Session 3

Tutorial 3

14:10
Reactive Synthesis Beyond Realizability (abstract)
15:35-16:50 Session 4

Tutorial 4

15:35
Formal Methods for the Security Analysis of Smart Contracts (abstract)
Wednesday, October 20th

View this program: with abstractssession overviewtalk overview

10:55-11:00 Session 5

Welcome to FMCAD

- Welcome message by the FMCAD chairs

11:00-12:00 Session 6

Invited Talk

11:00
From Viewstamped Replication to Blockchains (abstract)
12:05-13:20 Session 7

Concurrency and Distributed Systems

12:05
Automating System Configuration (abstract)
12:20
Towards an Automatic Proof of Lamport's Paxos (abstract)
12:35
Refinement-Based Verification of Device-to-Device Information Flow (abstract)
PRESENTER: Ning Dong
12:50
Celestial: A Framework for Verified Smart Contracts (abstract)
13:05
The Civl Verifier (abstract)
13:40-14:55 Session 8

Model Checking and IC3

13:40
IC3 with Internal Signals (abstract)
13:55
Single Clause Assumption without Activation Literals to Speed-up IC3 (abstract)
14:10
Logical Characterization of Coherent Uninterpreted Programs (abstract)
14:25
Data-driven Inductive Generalization (abstract)
14:40
Model Checking AUTOSAR Components with CBMC (abstract)
15:15-16:15 Session 9

Student Forum and Sponsors' Night

Thursday, October 21st

View this program: with abstractssession overviewtalk overview

11:00-12:00 Session 10

Invited Talk

11:00
Algorithms for the People (abstract)
12:05-13:20 Session 11

SAT Solving

12:05
Exploiting Isomorphic Subgraphs in SAT (abstract)
12:20
On Decomposition of Maximal Satisfiable Subsets (abstract)
12:35
Designing Samplers is Easy: The Boon of Testers (abstract)
12:50
SAT-Inspired Eliminations for Superposition (abstract)
13:05
SAT Solving in the Serverless Cloud (abstract)
13:40-14:55 Session 12

Applied Verification and Synthesis

13:40
Pruning and Slicing Neural Networks using Formal Verification (abstract)
13:55
Towards Scalable Verification of Deep Reinforcement Learning (abstract)
PRESENTER: Guy Amir
14:10
Synthesizing Pareto-optimal Interpretations for Black-Box Models (abstract)
14:25
Dynamic Partial Order Reductions for Spinloops (abstract)
14:40
Robustness between Weak Memory Models (abstract)
15:15-16:15 Session 13

Panel: 25 years of FMCAD

Friday, October 22nd

View this program: with abstractssession overviewtalk overview

11:00-12:15 Session 14

Hardware Verification

11:00
End-to-End Formal Verification of a RISC-V Processor Extended with Capability Pointers (abstract)
11:15
Hardware Security Leak Detection by Symbolic Simulation (abstract)
11:30
Scaling Up Hardware Accelerator Verification using A-QED with Functional Decomposition (abstract)
11:45
Sound and Automated Verification of Real-World RTL Multipliers (abstract)
12:00
Coco-Alma: A Versatile Masking Verifier (abstract)
12:35-13:35 Session 15

Invited Talk

12:35
Engineering with Full-scale Formal Architecture: Morello, CHERI, Armv8-A, and RISC-V (abstract)
13:40-14:55 Session 16

SMT and FOL

13:40
Induction with Recursive Definitions in Superposition (abstract)
13:55
Fair and Adventurous Enumeration of Quantifier Instantiations (abstract)
14:10
Mathematical Programming Modulo Strings (abstract)
14:25
Lookahead in Partitioning SMT (abstract)
14:40
A Multithreaded Vampire with Shared Persistent Grounding (abstract)
15:15-16:15 Session 17

FMCAD Business Meeting