Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Deligiannis, Pantazis"'
Autor:
Kamath, Adharsh, Senthilnathan, Aditya, Chakraborty, Saikat, Deligiannis, Pantazis, Lahiri, Shuvendu K., Lal, Akash, Rastogi, Aseem, Roy, Subhajit, Sharma, Rahul
Loop invariants are fundamental to reasoning about programs with loops. They establish properties about a given loop's behavior. When they additionally are inductive, they become useful for the task of formal verification that seeks to establish stro
Externí odkaz:
http://arxiv.org/abs/2311.07948
The Rust programming language, with its safety guarantees, has established itself as a viable choice for low-level systems programming language over the traditional, unsafe alternatives like C/C++. These guarantees come from a strong ownership-based
Externí odkaz:
http://arxiv.org/abs/2308.05177
Cyber attacks are increasingly becoming prevalent and causing significant damage to individuals, businesses and even countries. In particular, ransomware attacks have grown significantly over the last decade. We do the first study on mining insights
Externí odkaz:
http://arxiv.org/abs/2005.00517
Cloud services must typically be distributed across a large number of machines in order to make use of multiple compute and storage resources. This opens the programmer to several sources of complexity such as concurrency, order of message delivery,
Externí odkaz:
http://arxiv.org/abs/2002.04903
Autor:
Mukherjee, Suvam, Raj, Nitin John, Govindraj, Krishnan, Deligiannis, Pantazis, Ravichandran, Chandramouleswaran, Lal, Akash, Rastogi, Aseem, Krishnaswamy, Raja
Building reliable applications for the cloud is challenging because of unpredictable failures during a program's execution. This paper presents a programming framework called Reliable State Machines (RSMs), that offers fault-tolerance by construction
Externí odkaz:
http://arxiv.org/abs/1902.09502
Autor:
Deligiannis, Pantazis
This thesis is about scalable analysis and testing techniques for asynchronous programs. Due to their highly-concurrent nature, the number of states that such programs can reach grows exponentially (in the worst case) with program size, leading to st
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.718414
The discovery of inductive invariants lies at the heart of static program verification. Presently, many automatic solutions to inductive invariant generation are inflexible, only applicable to certain classes of programs, or unpredictable. An automat
Externí odkaz:
http://arxiv.org/abs/1612.01198
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Device drivers are notoriously hard to develop and even harder to debug. They are typically prone to many serious issues such as data races. In this paper, we present static pair-wise lock set analysis, a novel sound verification technique for provin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caae561e413d1c78107e8c354d59956a
Publikováno v:
2015 30th IEEE/ACM International Conference on Automated Software Engineering (ASE); 2015, p166-177, 12p