Suchergebnisse - "Theory of computation → Models of computation"

A distributed operational view of Reversible Prime Event Structures von Melgratti, Hernan, Mezzina, Claudio Antares, Michele Pinna, G.

“… Reversible prime event structures extend the well-known model of prime event structures to represent reversible computational processes. Essentially, they give …”
Volltext

Quantitative Algebraic Reasoning von Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“… We develop a quantitative analogue of equational reasoning which we call quantitative algebra. We define an equality relation indexed by rationals: a = ε b …”
Volltext

In search of lost time: Axiomatising parallel composition in process algebras von Aceto, Luca, Anastasiadi, Elli, Castiglioni, Valentina, Ingolfsdottir, Anna, Luttik, Bas

“… This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus …”
Volltext

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory von Carette, Titouan, de Visme, Marc, Perdrix, Simon

“… Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite …”
Volltext

Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs von Wang, Pengyu, Li, Chao, Wang, Jing, Wang, Taolei, Zhang, Lu, Leng, Jingwen, Chen, Quan, Guo, Minyi

“… Graph sampling and random walk operations, capturing the structural properties of graphs, are playing an important role today as we cannot directly adopt …”
Volltext

Normalization for Cubical Type Theory von Sterling, Jonathan, Angiuli, Carlo

“… We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory …”
Volltext

Compositional Semantics for Probabilistic Programs with Exact Conditioning von Stein, Dario, Staton, Sam

“… We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational …”
Volltext

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom von Glabbeek, Rob van, Hofner, Peter, Horne, Ross

“… We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix …”
Volltext

Guaranteed inference for probabilistic programs: a parallelisable, small-step operational approach von Boreale, Michele, Collodi, Luisa

“… In the context of probabilistic programming languages, we put forward an approach to formal semantics and sampling-based inference with guarantees, centered on …”
Volltext

Commutative Monads for Probabilistic Programming Languages von Jia, Xiaodong, Lindenhovius, Bert, Mislove, Michael, Zamdzhiev, Vladimir

“… A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the …”
Volltext

Comonadic semantics for guarded fragments von Abramsky, Samson, Marsden, Dan

“… In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including …”
Volltext

Asynchronous Template Games and the Gray Tensor Product of 2-Categories von Mellies, Paul-Andre

“… In his recent and exploratory work on template games and linear logic, Melliès defines sequential and concurrent games as categories with positions as objects …”
Volltext

Strong Call-by-Value is Reasonable, Implosively von Accattoli, Beniamino, Condoluci, Andrea, Coen, Claudio Sacerdoti

“… Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model (that is, polynomially related to the one of Turing machines) is …”
Volltext

Towards Training Robustness Against Dynamic Errors in Quantum Machine Learning von Duan, Shijin, Liu, Gaowen, Fleming, Charles, Kompella, Ramana, Xu, Xiaolin, Ren, Shaolei

“… Quantum machine learning, crucial in the noisy intermediate-scale quantum (NISQ) era, confronts challenges in error mitigation. Current noise-aware training …”
Volltext

EnQode: Fast Amplitude Embedding for Quantum Machine Learning Using Classical Data von Han, Jason, DiBrita, Nicholas S., Cho, Younghyun, Luo, Hengrui, Patel, Tirthak

“… Amplitude embedding (AE) is essential in quantum machine learning (QML) for encoding classical data onto quantum circuits. However, conventional AE methods …”
Volltext

Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics von Dathathri, Roshan, Gill, Gurbinder, Hoang, Loc, Jatala, Vishwesh, Pingali, Keshav, Nandivada, V. Krishna, Dang, Hoang-Vu, Snir, Marc

“… Distributed graph analytics systems for CPUs, like D-Galois and Gemini, and for GPUs, like D-IrGL and Lux, use a bulk-synchronous parallel (BSP) programming …”
Volltext

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von Jung, Jean Christoph, Wolter, Frank

“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In …”
Volltext

CUDA Quantum: The Platform for Integrated Quantum-Classical Computing von Kim, Jin-Sung, McCaskey, Alex, Heim, Bettina, Modani, Manish, Stanwyck, Sam, Costa, Timothy

“… A critical challenge to making quantum computers work in practice is effectively combining them with classical computing resources. From the classical side of …”
Volltext

A Bunched Logic for Conditional Independence von Bao, Jialu, Docherty, Simon, Hsu, Justin, Silva, Alexandra

“… Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification …”
Volltext

WDD: Weighted Delta Debugging von Zhou, Xintong, Xu, Zhenyang, Zhang, Mengxiao, Tian, Yongqiang, Sun, Chengnian

“… Delta Debugging is a widely used family of algorithms (e.g., ddmin and ProbDD) to automatically minimize bug-triggering test inputs, thus to facilitate …”
Volltext