Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Ryzhyk, Leonid"'
Incremental view maintenance has been for a long time a central problem in database theory. Many solutions have been proposed for restricted classes of database languages, such as the relational algebra, or Datalog. These techniques do not naturally
Externí odkaz:
http://arxiv.org/abs/2203.16684
Autor:
Suresh, Lalith, Loff, Joao, Kalim, Faria, Narodytska, Nina, Ryzhyk, Leonid, Gamage, Sahan, Oki, Brian, Lokhandwala, Zeeshan, Hira, Mukesh, Sagiv, Mooly
Modern cluster management systems like Kubernetes and Openstack grapple with hard combinatorial optimization problems: load balancing, placement, scheduling, and configuration. Currently, developers tackle these problems by designing custom applicati
Externí odkaz:
http://arxiv.org/abs/1909.03130
Autor:
Alpernas, Kalev, Flanagan, Cormac, Fouladi, Sadjad, Ryzhyk, Leonid, Sagiv, Mooly, Schmitz, Thomas, Winstein, Keith
The rise of serverless computing provides an opportunity to rethink cloud security. We present an approach for securing serverless systems using a novel form of dynamic information flow control (IFC). We show that in serverless applications, the term
Externí odkaz:
http://arxiv.org/abs/1802.08984
Understanding properties of deep neural networks is an important challenge in deep learning. In this paper, we take a step in this direction by proposing a rigorous way of verifying properties of a popular class of neural networks, Binarized Neural N
Externí odkaz:
http://arxiv.org/abs/1709.06662
Autor:
Ryzhyk, Leonid, Walker, Adam
Publikováno v:
EPTCS 229, 2016, pp. 84-99
We summarise our experience developing and using Termite, the first reactive synthesis tool intended for use by software development practitioners. We identify the main barriers to making reactive synthesis accessible to software developers and descr
Externí odkaz:
http://arxiv.org/abs/1611.07624
Autor:
Jacobs, Swen, Bloem, Roderick, Brenguier, Romain, Khalimov, Ayrat, Klein, Felix, Könighofer, Robert, Kreber, Jens, Legg, Alexander, Narodytska, Nina, Pérez, Guillermo A., Raskin, Jean-François, Ryzhyk, Leonid, Sankur, Ocan, Seidl, Martina, Tentrup, Leander, Walker, Adam
Publikováno v:
EPTCS 229, 2016, pp. 149-177
We report on the benchmarks, participants and results of the third reactive synthesis competition(SYNTCOMP 2016). The benchmark library of SYNTCOMP 2016 has been extended to benchmarks in the new LTL-based temporal logic synthesis format (TLSF), and
Externí odkaz:
http://arxiv.org/abs/1609.00507
Autor:
Jacobs, Swen, Bloem, Roderick, Brenguier, Romain, Könighofer, Robert, Pérez, Guillermo A., Raskin, Jean-François, Ryzhyk, Leonid, Sankur, Ocan, Seidl, Martina, Tentrup, Leander, Walker, Adam
Publikováno v:
EPTCS 202, 2016, pp. 27-57
We report on the design and results of the second reactive synthesis competition (SYNTCOMP 2015). We describe our extended benchmark library, with 6 completely new sets of benchmarks, and additional challenging instances for 4 of the benchmark sets t
Externí odkaz:
http://arxiv.org/abs/1602.01171
Autor:
Černý, Pavol, Clarke, Edmund M., Henzinger, Thomas A., Radhakrishna, Arjun, Ryzhyk, Leonid, Samanta, Roopsha, Tarrach, Thorsten
Given a multithreaded program written assuming a friendly, non-preemptive scheduler, the goal of synchronization synthesis is to automatically insert synchronization primitives to ensure that the modified program behaves correctly, even with a preemp
Externí odkaz:
http://arxiv.org/abs/1511.07163
Autor:
Jacobs, Swen, Bloem, Roderick, Brenguier, Romain, Ehlers, Rüdiger, Hell, Timotheus, Könighofer, Robert, Pérez, Guillermo A., Raskin, Jean-François, Ryzhyk, Leonid, Sankur, Ocan, Seidl, Martina, Tentrup, Leander, Walker, Adam
Publikováno v:
International Journal on Software Tools for Technology Transfer, Online First, 2016, pp 1-24
We introduce the reactive synthesis competition (SYNTCOMP), a long-term effort intended to stimulate and guide advances in the design and application of synthesis procedures for reactive systems. The first iteration of SYNTCOMP is based on the contro
Externí odkaz:
http://arxiv.org/abs/1506.08726
Autor:
Černý, Pavol, Clarke, Edmund M., Henzinger, Thomas A., Radhakrishna, Arjun, Ryzhyk, Leonid, Samanta, Roopsha, Tarrach, Thorsten
We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even
Externí odkaz:
http://arxiv.org/abs/1505.04533