Abstract
The talk surveys a series of works that lift the rich semantics and structure of graphs, and the experience of the formal-verification community in reasoning about them, to classical graph-theoretical problems.
Original language | English |
---|---|
Title of host publication | STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing |
Editors | Pierre McKenzie, Valerie King, Hamed Hatami |
Publisher | Association for Computing Machinery |
Pages | 6 |
Number of pages | 1 |
ISBN (Electronic) | 9781450345286 |
DOIs | |
State | Published - 19 Jun 2017 |
Event | 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 - Montreal, Canada Duration: 19 Jun 2017 → 23 Jun 2017 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
Volume | Part F128415 |
ISSN (Print) | 0737-8017 |
Conference
Conference | 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 |
---|---|
Country/Territory | Canada |
City | Montreal |
Period | 19/06/17 → 23/06/17 |
Bibliographical note
Publisher Copyright:© 2017 ACM.
Keywords
- Formal verification
- Graph algorithms