Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Sabina Petride"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 2 (2011)
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written
Externí odkaz:
https://doaj.org/article/d29a40a47aeb42dc803fdee631ef42e2
Autor:
Sabina Petride, Joseph Y. Halpern
Publikováno v:
Distributed Computing. 23:197-224
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventually comput
Autor:
Balasubramanyam Sthanikam, Vijay Medi, Sabina Petride, Sam Idicula, Sivasankaran Chandrasekar, Nipun Agarwal, Ning Zhang
Publikováno v:
Proceedings of the VLDB Endowment. 2:1354-1365
Oracle RDBMS has supported XML data management for more than six years since version 9i. Prior to 11g, text-centric XML documents can be stored as-is in a CLOB column and schema-based data-centric documents can be shredded and stored in object-relati
Autor:
Sabina Petride
Publikováno v:
ACM SIGACT News. 35:4-12
Autor:
Sabina Petride, Riccardo Pucella
Publikováno v:
TARK
We propose a principled approach to model secrecy in multiagent systems, by defining a set of possible observations and providing agents with algorithms used to distinguish the possible states of the system. Our approach fits naturally within a knowl
Autor:
Sabina Petride, Joseph Y. Halpern
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540446248
DISC
DISC
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends on the whole network, the goal is for every agent to eventually comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1442494c8620277a030dbedb0b33a217
https://doi.org/10.1007/11864219_10
https://doi.org/10.1007/11864219_10
Publikováno v:
Logic for Programming, Artificial Intelligence, and Reasoning ISBN: 9783540252368
LPAR
LPAR
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7554b23428d105939414c074cbc3b24
https://doi.org/10.1007/978-3-540-32275-7_30
https://doi.org/10.1007/978-3-540-32275-7_30