Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Madhusudan Parthasarathy"'
We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theorem: every natural number > 686 is the sum of at most 4 natural number
Externí odkaz:
http://arxiv.org/abs/1710.04247
We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theorem: every natural number > 686 is the sum of at most 4 natural number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ea405179e89e5c792c18ba963fdca17
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 202
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb629249e9afea9e8f69515053195a74
https://doi.org/10.4204/eptcs.202.0
https://doi.org/10.4204/eptcs.202.0
Autor:
Madhusudan Parthasarathy
Publikováno v:
Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84782d05debf8190f43a16462786e452
https://doi.org/10.1145/3251077
https://doi.org/10.1145/3251077
Autor:
Srinath Bala, Rajesh Kumar, Andrew W. Cross, Naren Datha, Deepika Sharma, Sriram K. Rajamani, Viraj Kumar, Madhusudan Parthasarathy, Balasubramanyan Ashok, Satish Sangameswaran, Siddharth Prakash, William Thies, Edward Cutrell
Publikováno v:
L@S
Due to the recent emergence of massive open online courses (MOOCs), students and teachers are gaining unprecedented access to high-quality educational content. However, many questions remain on how best to utilize that content in a classroom environm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::314c4f31de79bc6107d076c460cf7437
https://doi.org/10.1145/2556325.2567869
https://doi.org/10.1145/2556325.2567869
This book constitutes the refereed proceedings of the 24th International Conference on Computer Aided Verification, CAV 2012, held in Berkeley, CA, USA in July 2012. The 38 regular and 20 tool papers presented were carefully reviewed and selected fro
Autor:
Madhusudan Parthasarathy, Gennaro Parlato, Anna Lisa Ferrara, Emre Uzun, Shamik Sural, Jaideep Vaidya, Vijayalakshmi Atluri
Publikováno v:
SACMAT
Today, Role Based Access Control (RBAC) is the de facto model used for advanced access control, and is widely deployed in diverse enterprises of all sizes. Several extensions to the authorization as well as the administrative models for RBAC have bee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55ce2efd16a739464a2088d4be7263f6
http://hdl.handle.net/11695/88414
http://hdl.handle.net/11695/88414
Autor:
Madhusudan Parthasarathy
Publikováno v:
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f4af9529c0891728443c294ba264786
https://doi.org/10.1145/3253003
https://doi.org/10.1145/3253003
Autor:
Madhusudan, Parthasarathy
Current theoretical solutions to the classical Church's synthesis problem are focused on synthesizing transition systems and not programs. Programs are compact and often the true aim in many synthesis problems, while the transition systems that corre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62f39cd9194ee2151264fcdcb69bd6bb
Publikováno v:
PLDI
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a fixed-point calculus. In contrast with programming in traditional language
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a19d7a2c902ec0885429c1ee86b7544
http://hdl.handle.net/11695/83779
http://hdl.handle.net/11695/83779