דלג לתוכן (מקש קיצור 's')
Logo of Technion
Logo of CS Department
אירועים

קולוקוויום וסמינרים

כדי להצטרף לרשימת תפוצה של קולוקוויום מדעי המחשב, אנא בקר בדף מנויים של הרשימה.
Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.
Academic Calendar at Technion site.

קולוקוויום וסמינרים בקרוב

  • ceClub: Demand-Aware Optimization in Offchain Networks
    event speaker icon
    Julia Khamis (EE, Technion)
    event date icon
    יום רביעי, 20.1.2021, 11:30
    event location icon
    Zoom Lecture: for link to zoom please contact sgoren@campus.technion.ac.il
    Offchain networks are dominant as a solution to the scalability problem of blockchain systems, allowing users to perform payments without their recording on the chain by relying on predefined payment channels. Users together with the offchain channels form a graph, known as the offchain network topology. A pair of users can employ a payment even without a direct channel through a path of channels involving other intermediate users. The offchain topology and payment characteristics affect network performance such as latency and fees. We study basic demand-aware problems in offchain network design: Efficiently mapping users to an offchain topology of a known structure as well as constructing a topology of a bounded number of channels that can serve well typical payments. Likewise, we suggest an approach for jointly serving multiple payments by finding an equivalent set of payments that has the same impact on user balance but can be served efficiently in a given topology. *MSc student under supervision of Prof. Ori Rottenstreich
  • Compositional Model Checking for Multi-Properties
    event speaker icon
    אוהד חאודסמיד, הרצאה סמינריונית למגיסטר
    event date icon
    יום ראשון, 24.1.2021, 15:30
    event location icon
    Zoom Lecture: for link to zoom please contact goudsmidohad@cs.technion.ac.il
    event speaker icon
    מנחה:  Prof. Orna Grumberg and Dr. Sarai Sheinvald
    Hyperproperties lift conventional trace properties in a way that describes how a system behaves in its entirety, and not just based on its individual traces. We generalize this notion to multi-properties, which describe the behavior of a set of systems, called a multi-model. We show that model-checking multi-properties is equivalent to model-checking hyperproperties. We introduce sound and complete compositional proof rules for model-checking multiproperties, based on approximations of the systems in the multi-model and describe methods of computing them. The first is abstraction-refinement based, in which a coarse initial abstraction is continually refined using counterexamples, until a suitable approximation is found. The second, tailored for models with finite traces, finds suitable approximations via the L* learning algorithm.
  • ceClub: Comprehensive Protection for Speculatively-Accessed Data
    event speaker icon
    Adam Morrison (Tel-Aviv University)
    event date icon
    יום רביעי, 27.1.2021, 11:30
    event location icon
    Zoom Lecture: for link to zoom please contact sgoren@campus.technion.ac.il
    Speculative execution attacks present an enormous security threat, capable of reading arbitrary program data under malicious speculation and later exfiltrating that data over microarchitectural covert channels. This talk will describe a comprehensive hardware protection from speculative execution attacks. We will first describe Speculative Taint Tracking (STT). STT delays the execution of instructions that create covert channels until their operands are proven to be a function of non-speculative data. STT builds on a comprehensive characterization of covert channels on speculative microarchitectures and employs a novel microarchitecture for efficiently detecting when operands become non-speculative and disabling protection at that time. We will then describe Speculative Data-Oblivious Execution (SDO), which improves STT's performance by executing covert-channel creating instructions in a data-oblivious manner, i.e., so that their execution does not leak their operands. Data-oblivious execution usually implies doing the worst-case work all the time. SDO sidesteps this problem by using safe prediction to predict the work needed to satisfy the common case and subsequently perform it---all without leaking privacy.