Suchergebnisse - "Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science"

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

The Logic of Graph Neural Networks von Grohe, Martin

“… Graph neural networks (GNNs) are deep learning architectures for machine learning problems on graphs. It has recently been shown that the expressiveness of …”
Volltext

Lovász-Type Theorems and Game Comonads von Dawar, Anuj, Jakl, Tomas, Reggio, Luca

“… Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the …”
Volltext

Asynchronous Extensions of HyperLTL von Bozzelli, Laura, Peron, Adriano, Sanchez, Cesar

“… Hyperproperties are a modern specification paradigm that extends trace properties to express properties of sets of traces. Temporal logics for hyperproperties …”
Volltext

A Logic for Locally Complete Abstract Interpretations von 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 …”
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

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

“… A well-known challenge in the semantics of programming languages is how to combine non-determinism and probability. At a technical level, the problem arises …”
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

The Laplace Mechanism has optimal utility for differential privacy over continuous queries von Fernandes, Natasha, McIver, Annabelle, Morgan, Carroll

“… Differential Privacy protects individuals' data when statistical queries are published from aggregated databases: applying "obfuscating" mechanisms to 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

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

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

Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation von 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 …”
Volltext

Some constructive variants of S4 with the finite model property von Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“… The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a …”
Volltext

Quantitative and Approximate Monitoring von Henzinger, Thomas A., Ege Sarac, N.

“… In runtime verification, a monitor watches a trace of a system and, if possible, decides after observing each finite prefix whether or not the unknown infinite …”
Volltext

Intersection Type Distributors von Olimpieri, Federico

“… We study a family of distributors-induced bicategorical models of λ-calculus, proving that they can be syntactically presented via intersection type systems …”
Volltext

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

“… Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation …”
Volltext

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata von Bojanczyk, Mikolaj, Klin, Bartek, Moerman, Joshua

“… We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register …”
Volltext