Zobrazeno 1 - 10
of 161
pro vyhledávání: '"Natarajan, Shankar"'
Publikováno v:
Journal of Automated Reasoning. 66:43-91
Search-based satisfiability procedures try to build a model of the input formula by simultaneously proposing candidate models and deriving new formulae implied by the input. Conflict-driven procedures perform non-trivial inferences only when resolvin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e35bdc75085c114ab1650207775fff92
https://doi.org/10.1007/s10817-021-09606-y
https://doi.org/10.1007/s10817-021-09606-y
Autor:
Vijay H. Kothari, Prashant Anantharaman, Sean W. Smith, Briland Hitaj, Prashanth Mundkur, Natarajan Shankar, Letitia W. Li, Iavor Diatchki, William Harris
Publikováno v:
2022 IEEE Security and Privacy Workshops (SPW).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3be69fb0ce1221b4e0f5dfad0c9b1b4
https://doi.org/10.1109/spw54247.2022.9833859
https://doi.org/10.1109/spw54247.2022.9833859
Autor:
Devesh Bhatt, Hao Ren, Anitha Murugesan, Jason Biatek, Srivatsan Varadarajan, Natarajan Shankar
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031067723
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b77df9eb035f921f5b8aba62f962de2
https://doi.org/10.1007/978-3-031-06773-0_31
https://doi.org/10.1007/978-3-031-06773-0_31
Autor:
Peter Müller, Natarajan Shankar
Publikováno v:
Theories of Programming ISBN: 9781450387286
Theories of Programming
Theories of Programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12d8611143de9ccf057c7d421edbbc6a
https://doi.org/10.1145/3477355.3477362
https://doi.org/10.1145/3477355.3477362
Publikováno v:
Theories of Programming ISBN: 9781450387286
Theories of Programming
Theories of Programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b59dc5e11c06c851d83c82dfb81e6d1f
https://doi.org/10.1145/3477355.3477361
https://doi.org/10.1145/3477355.3477361
Publikováno v:
Formal Methods in System Design. 57:116-117
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4519d8971ece9f32d4eb017ed484867e
https://doi.org/10.1007/s10703-021-00375-3
https://doi.org/10.1007/s10703-021-00375-3
Autor:
Sean W. Smith, Linda Briesemeister, Prashanth Mundkur, Sameed Ali, Natarajan Shankar, Zephyr Lucas, Prashant Anantharaman
Publikováno v:
SP Workshops
Any program that reads formatted input relies on parsing software to check the input for validity and transform it into a representation suitable for further processing. Many security vulnerabilities can be attributed to poorly defined grammars, inco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3070d75846b7b3ff3798233cbf9a0445
https://doi.org/10.1109/spw50608.2020.00064
https://doi.org/10.1109/spw50608.2020.00064
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030545482
SAFECOMP
SAFECOMP
The functions of an autonomous system can generally be partitioned into those concerned with perception and those concerned with action. Perception builds and maintains an internal model of the world (i.e., the system’s environment) that is used to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcbe4251cc3169fc9a94d98ada9a2e30
https://doi.org/10.1007/978-3-030-54549-9_15
https://doi.org/10.1007/978-3-030-54549-9_15
Autor:
Natarajan Shankar, Clement Blaudeau
Publikováno v:
CPP
Parsing expression grammars (PEGs) offer a natural opportunity for building verified parser interpreters based on higher-order parsing combinators. PEGs are expressive, unambiguous, and efficient to parse in a top-down recursive descent style. We use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d76910967cdedc88fff527e0bbd066ba