Search Results - Theory of computation Semantics and reasoning Program semantics

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

“… We give operational, denotational and equational semantics for this language, establishing convenient properties like exchangeability of conditions…”
Get full text

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning by Mio, Matteo, Sarkis, Ralph, Vignudelli, Valeria

“…We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in program semantics…”
Get full text

On Generalized Metric Spaces for the Simply Typed Lambda-Calculus by Pistone, Paolo

“…Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave…”
Get full text

Enhancing Code Safety in Quantum Intermediate Representation by Luo, Junjie, Zhao, Jianjun

“…Quantum Intermediate Representation (QIR) is an LLVM-based intermediate representation developed by Microsoft for quantum program compilers…”
Get full text

An Algebraic Characterisation of First-Order Logic with Neighbour by Manuel, Amaldev, Nevatia, Dhruv

“…We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over…”
Get full text

From Multisets over Distributions to Distributions over Multisets by Jacobs, Bart

“…A well-known challenge in the semantics of programming languages is how to combine non-determinism and probability…”
Get full text

A Logic for Locally Complete Abstract Interpretations by Bruni, Roberto, Giacobazzi, Roberto, Gori, Roberta, Ranzato, Francesco

“…We introduce the notion of local completeness in abstract interpretation and define a logic for proving both the correctness and incorrectness of some program specification…”
Get full text

On sequentiality and well-bracketing in the π-calculus by Hirschkoff, Daniel, Prebet, Enguerrand, Sangiorgi, Davide

“… are expected.In this paper we focus on two such common disciplines: sequentiality, meaning that at any time there is a single thread of computation, and well-bracketing, meaning that calls to external services obey a stack-like discipline…”
Get full text

Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation by Komorida, Yuichi, Katsumata, Shin-ya, Kupke, Clemens, Rot, Jurriaan, Hasuo, Ichiro

“…A modal logic that is strong enough to fully characterize the behavior of a system is called expressive. Recently, with the growing diversity of systems to be…”
Get full text

Behavioural Preorders via Graded Monads by Ford, Chase, Milius, Stefan, Schroder, Lutz

“… Often, such behavioural preorders are characterized in terms of theory inclusion in dedicated characteristic logics; e.g…”
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 category DCPO…”
Get full text

Universal Semantics for the Stochastic λ-Calculus by Azevedo de Amorim, Pedro H., Kozen, Dexter, Mardare, Radu, Panangaden, Prakash, Roberts, Michael

“… These two semantic approaches build on previous work that used an explicit source of randomness to reason about higher-order probabilistic programs…”
Get full text

Supermartingales, Ranking Functions and Probabilistic Lambda Calculus by Kenyon-Roberts, Andrew, Ong, C.-H. Luke

“… This result is extended in three ways. Antitone ranking functions have weaker restrictions on how fast they must decrease, and are applicable to a wider range of programs…”
Get full text

Fixed-Points for Quantitative Equational Logics by Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“…We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras…”
Get full text

A Relational Theory of Monadic Rewriting Systems, Part I by Gavazzo, Francesco, Faggian, Claudia

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems…”
Get full text

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

“…) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting…”
Get full text

Static Analysis of Remote Procedure Call in Java Programs by Cui, Baoquan, Qu, Rong, Tang, Zhen, Zhang, Jian

“…The Remote Procedure Call (RPC) is commonly used for inter-process communications over network, allowing a program to invoke a procedure in another address space, even in another machine as if it were a local call…”
Get full text

Module-Aware Context Sensitive Pointer Analysis by Li, Haofeng, Shi, Chenghang, Lu, Jie, Li, Lian, Zhao, Zixuan

“… However, existing pointer analyses fail to leverage the semantics of JPMS. This paper presents a novel module-aware approach to improving the performance of pointer analysis…”
Get full text

Context Debloating for Object-Sensitive Pointer Analysis by He, Dongjie, Lu, Jingbo, Xue, Jingling

“… (in terms of the number of statements in the program) that are almost always necessary for real-world object-oriented applications, based on three key observations regarding context-dependability for their objects used…”
Get full text

Machine-Learning-Guided Selectively Unsound Static Analysis by Kihong Heo, Oh, Hakjoo, Kwangkeun Yi

“…We present a machine-learning-based technique for selectively applying unsoundness in static analysis. Existing bug-finding static analyzers are unsound in…”
Get full text