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

Orna Kupferman*

*Corresponding author for this work

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

4 Scopus citations

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 languageAmerican English
Title of host publicationSTOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
EditorsPierre McKenzie, Valerie King, Hamed Hatami
PublisherAssociation for Computing Machinery
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
ISSN (Print)0737-8017

Conference

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

Bibliographical note

Publisher Copyright:
© 2017 ACM.

Keywords

  • Formal verification
  • Graph algorithms

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