WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7150
Browse
3 results
Search Results
Now showing 1 - 3 of 3
Article Citation - WoS: 1Reading Cs Classics(Association for Computing Machinery (ACM), 2012) Tekir, SelmaKnowledge of the theories of computer science (CS) helps in understanding the limitations of the field by providing users with new perspectives and insights. It can be a good practice for CS professionals to compile their own list of classics that highlights some key scientific concepts of the field. 'An Axiomatic Basis for Computer Programming,' by C.A.R. Hoare is a CS classic, which tells about the computing industry of the 1960s and 1970s in Britain. Hoare provides a foundation for the formal proofs of programs by an algebraic assertions-based approach. 'Computing Machinery and Intelligence,' by A.M. Turing tells about the computer numbering systems that provide unique representation to every programming construct. Dijkstra' s realization of the high intellectual challenge of programming and his encouragement made him one of the greatest minds of computer programming. Donald Knuth is extraordinary with his perspective on computer programming.Conference Object Citation - WoS: 22Multi-Party Off-The Messaging(Association for Computing Machinery (ACM), 2009) Goldberg, Ian; Ustaoğlu, Berkant; Van Gundy, Matthew D.; Chen, HaoMost cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation is no less important than secrecy and authenticity. For whistleblowers, informants, political dissidents and journalists - to name a few - it is most important to have means for deniable conversation, where electronic communication must mimic face-to-face private meetings. Off-the-Record Messaging, proposed in 2004 by Borisov, Goldberg and Brewer, and its subsequent improvements, simulate private two-party meetings. Despite some attempts, the multi-party scenario remains unresolved. In this paper, we first identify the properties of multi-party private meetings. We illustrate the differences not only between the physical and electronic medium but also between two- and multi-party scenarios, which have important implications for the design of private chatrooms. We then propose a solution to multi-party off-the-record instant messaging that satisfies the above properties. Our solution is also composable with extensions that provide other properties, such as anonymity. Copyright 2009 ACM.Article Citation - WoS: 6Citation - Scopus: 9Implementing Fault-Tolerance in Real-Time Programs by Automatic Program Transformations(Association for Computing Machinery (ACM), 2008) Ayav, Tolga; Fradet, Pascal; Girault, AlainWe present a formal approach to implement fault-tolerance in real-time embedded systems. The initial fault-intolerant system consists of a set of independent periodic tasks scheduled onto a set of fail-silent processors connected by a reliable communication network. We transform the tasks such that, assuming the availability of an additional spare processor, the system tolerates one failure at a time (transient or permanent). Failure detection is implemented using heartbeating, and failure masking using checkpointing and rollback. These techniques are described and implemented by automatic program transformations on the tasks' programs. The proposed formal approach to fault-tolerance by program transformations highlights the benefits of separation of concerns. It allows us to establish correctness properties and to compute optimal values of parameters to minimize fault-tolerance overhead. We also present an implementation of our method, to demonstrate its feasibility and its efficiency.