Skip to main navigation Skip to search Skip to main content

Examining classical graph-theory problems from the viewpoint of formal-verification methods

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish GB
Title of host publicationSTOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
EditorsPierre McKenzie, Valerie King, Hamed Hatami
Pages6
Number of pages1
ISBN (Electronic)9781450345286
DOIs
StatePublished - 19 Jun 2017
Event49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 - Montreal, Canada
Duration: 19 Jun 201723 Jun 2017

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F128415

Conference

Conference49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017
Country/TerritoryCanada
CityMontreal
Period19/06/1723/06/17

Keywords

  • Formal verification
  • Graph algorithms

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Examining classical graph-theory problems from the viewpoint of formal-verification methods'. Together they form a unique fingerprint.

Cite this