Search Results - "Theory of computation → Models of computation"

A distributed operational view of Reversible Prime Event Structures by 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…”
Get full text

Quantitative Algebraic Reasoning by 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…”
Get full text

In search of lost time: Axiomatising parallel composition in process algebras by 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…”
Get full text

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory by 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…”
Get full text

Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs by 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…”
Get full text

Normalization for Cubical Type Theory by 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…”
Get full text

Compositional Semantics for Probabilistic Programs with Exact Conditioning by 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…”
Get full text

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom by 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…”
Get full text

Guaranteed inference for probabilistic programs: a parallelisable, small-step operational approach by 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…”
Get full text

Commutative Monads for Probabilistic Programming Languages by 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…”
Get full text

Comonadic semantics for guarded fragments by 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…”
Get full text

Asynchronous Template Games and the Gray Tensor Product of 2-Categories by 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…”
Get full text

Strong Call-by-Value is Reasonable, Implosively by 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…”
Get full text

Towards Training Robustness Against Dynamic Errors in Quantum Machine Learning by 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…”
Get full text

EnQode: Fast Amplitude Embedding for Quantum Machine Learning Using Classical Data by 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…”
Get full text

Gluon-Async: A Bulk-Asynchronous System for Distributed and Heterogeneous Graph Analytics by 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…”
Get full text

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments by 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…”
Get full text

CUDA Quantum: The Platform for Integrated Quantum-Classical Computing by 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…”
Get full text

A Bunched Logic for Conditional Independence by 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…”
Get full text

WDD: Weighted Delta Debugging by 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…”
Get full text