( en | de | ru )

 

Disambiguation of "Kupferman, Orna"

Author of the publication

copydeleteadd this publication to your clipboard
Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk).

. STOC, page 6. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Orna Ehling

Orna Rosen

Magdalena Ornatowska

Frederik Ornau

Adam S Ornatek

 

Other publications of authors with the same name

Relating linear and branching model checking., and . PROCOMET, volume 125 of IFIP Conference Proceedings, page 304-326. Chapman & Hall, (1998)Tightening the Exchange Rates Between Automata.. CSL, volume 4646 of Lecture Notes in Computer Science, page 7-22. Springer, (2007)Good-Enough Synthesis., and . CAV (2), volume 12225 of Lecture Notes in Computer Science, page 541-563. Springer, (2020)On the universal and existential fragments of the mu-calculus., , and . Theor. Comput. Sci., 354 (2): 173-186 (2006)Once and for all., , and . J. Comput. Syst. Sci., 78 (3): 981-996 (2012)Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction., and . CONCUR, volume 7454 of Lecture Notes in Computer Science, page 84-99. Springer, (2012)A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking., , and . CONCUR, volume 1119 of Lecture Notes in Computer Science, page 514-529. Springer, (1996)Sensing as a Complexity Measure., , and . DCFS, volume 10316 of Lecture Notes in Computer Science, page 3-15. Springer, (2017)An Abstraction-Refinement Framework for Trigger Querying., and . SAS, volume 6887 of Lecture Notes in Computer Science, page 263-279. Springer, (2011)Lattice Automata., and . VMCAI, volume 4349 of Lecture Notes in Computer Science, page 199-213. Springer, (2007)