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

Orna Kupferman

doi:10.1145/3055399.3079075

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

Orna Kupferman^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 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 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	https://doi.org/10.1145/3055399.3079075
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

Access to Document

10.1145/3055399.3079075

Cite this

Kupferman, O. (2017). Examining classical graph-theory problems from the viewpoint of formal-verification methods. In P. McKenzie, V. King, & H. Hatami (Eds.), STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (pp. 6). (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F128415). Association for Computing Machinery. https://doi.org/10.1145/3055399.3079075

Kupferman, Orna. / Examining classical graph-theory problems from the viewpoint of formal-verification methods. STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. editor / Pierre McKenzie ; Valerie King ; Hamed Hatami. Association for Computing Machinery, 2017. pp. 6 (Proceedings of the Annual ACM Symposium on Theory of Computing).

@inproceedings{633f3bb0ae0143c9874512f1a5f6a0ca,

title = "Examining classical graph-theory problems from the viewpoint of formal-verification methods",

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.",

keywords = "Formal verification, Graph algorithms",

author = "Orna Kupferman",

note = "Publisher Copyright: {\textcopyright} 2017 ACM.; 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017 ; Conference date: 19-06-2017 Through 23-06-2017",

year = "2017",

month = jun,

day = "19",

doi = "10.1145/3055399.3079075",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "6",

editor = "Pierre McKenzie and Valerie King and Hamed Hatami",

booktitle = "STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing",

}

Kupferman, O 2017, Examining classical graph-theory problems from the viewpoint of formal-verification methods. in P McKenzie, V King & H Hatami (eds), STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F128415, Association for Computing Machinery, pp. 6, 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, Canada, 19/06/17. https://doi.org/10.1145/3055399.3079075

Examining classical graph-theory problems from the viewpoint of formal-verification methods. / Kupferman, Orna.
STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ed. / Pierre McKenzie; Valerie King; Hamed Hatami. Association for Computing Machinery, 2017. p. 6 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F128415).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Kupferman, Orna

PY - 2017/6/19

Y1 - 2017/6/19

N2 - 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.

AB - 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.

KW - Formal verification

KW - Graph algorithms

UR - https://www.scopus.com/pages/publications/85024364438

U2 - 10.1145/3055399.3079075

DO - 10.1145/3055399.3079075

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85024364438

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 6

BT - STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing

A2 - McKenzie, Pierre

A2 - King, Valerie

A2 - Hatami, Hamed

PB - Association for Computing Machinery

T2 - 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017

Y2 - 19 June 2017 through 23 June 2017

ER -

Kupferman O. Examining classical graph-theory problems from the viewpoint of formal-verification methods. In McKenzie P, King V, Hatami H, editors, STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery. 2017. p. 6. (Proceedings of the Annual ACM Symposium on Theory of Computing). doi: 10.1145/3055399.3079075

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

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this