Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Amorim, Pedro P."'
Autor:
de Amorim, Pedro H. Azevedo
Reasoning about resources used during the execution of programs, such as time, is one of the fundamental questions in computer science. When programming with probabilistic primitives, however, different samples may result in different resource usage,
Externí odkaz:
http://arxiv.org/abs/2402.01009
Modular design is a key challenge for enabling large-scale reuse of hardware modules. Unlike software, however, hardware designs correspond to physical circuits and inherit constraints from them. Timing constraints -- which cycle a signal arrives, wh
Externí odkaz:
http://arxiv.org/abs/2304.10646
Effectful programs interact in ways that go beyond simple input-output, making compositional reasoning challenging. Existing work has shown that when such programs are ``separate'', i.e., when programs do not interfere with each other, it can be easi
Externí odkaz:
http://arxiv.org/abs/2303.01616
Autor:
Neves-Moreira, Fábio, Amorim, Pedro
The evolution of the retail business presents new challenges and raises pivotal questions on how to reinvent stores and supply chains to meet the growing demand of the online channel. One of the recent measures adopted by omnichannel retailers is to
Externí odkaz:
http://arxiv.org/abs/2301.02142
With the wide spread of deep learning and gradient descent inspired optimization algorithms, differentiable programming has gained traction. Nowadays it has found applications in many different areas as well, such as scientific computing, robotics, c
Externí odkaz:
http://arxiv.org/abs/2207.05946
Autor:
de Amorim, Pedro H. Azevedo
Much work has been done to give semantics to probabilistic programming languages. In recent years, most of the semantics used to reason about probabilistic programs fall in two categories: semantics based on Markov kernels and semantics based on line
Externí odkaz:
http://arxiv.org/abs/2202.00142
The emergence of Industry 4.0 is making production systems more flexible and also more dynamic. In these settings, schedules often need to be adapted in real-time by dispatching rules. Although substantial progress was made until the '90s, the perfor
Externí odkaz:
http://arxiv.org/abs/2109.03323
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs, but for the
Externí odkaz:
http://arxiv.org/abs/2011.13171
We present the Flow-Limited Authorization First-Order Logic (FLAFOL), a logic for reasoning about authorization decisions in the presence of information-flow policies. We formalize the FLAFOL proof system, characterize its proof-theoretic properties,
Externí odkaz:
http://arxiv.org/abs/2001.10630
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.