( en | de | ru )

 

Disambiguation of "Feldman, Yotam M. Y."

Author of the publication

copydeleteadd this publication to your clipboard
Complexity and information in invariant inference.

, , , and . Proc. ACM Program. Lang., 4 (POPL): 5:1-5:29 (2020)

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.

Jon Feldman

Aleksandar Feldman

Max Feldman

Külliki Feldman

Adam Feldman

 

Other publications of authors with the same name

Proving highly-concurrent traversals correct., , , , , , and . Proc. ACM Program. Lang., 4 (OOPSLA): 128:1-128:29 (2020)Complexity and Information in Invariant Inference., , , and . CoRR, (2019)Property-Directed Reachability as Abstract Interpretation in the Monotone Theory., , , and . CoRR, (2021)Bounded Quantifier Instantiation for Checking Inductive Invariants., , , , and . Log. Methods Comput. Sci., (2019)SAT-Based Invariant Inference and Its Relation to Concept Learning., and . RP, volume 13608 of Lecture Notes in Computer Science, page 3-27. Springer, (2022)Learning the boundary of inductive invariants., , , and . Proc. ACM Program. Lang., 5 (POPL): 1-30 (2021)Learning the Boundary of Inductive Invariants., , , and . CoRR, (2020)Towards a Theory of Learning Inductive Invariants. Tel Aviv University, Israel, (2022)Tel Aviv University Library.Bounded Quantifier Instantiation for Checking Inductive Invariants., , , , and . TACAS (1), volume 10205 of Lecture Notes in Computer Science, page 76-95. (2017)Property-directed reachability as abstract interpretation in the monotone theory., , , and . Proc. ACM Program. Lang., 6 (POPL): 1-31 (2022)