Results 21 to 30 of about 1,803,872 (361)

On the Succinctness of Atoms of Dependency [PDF]

open access: yesLogical Methods in Computer Science, 2019
Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj   +1 more source

A Temporal Logic for Asynchronous Hyperproperties [PDF]

open access: yesInternational Conference on Computer Aided Verification, 2021
Hyperproperties are properties of computational systems that require more than one trace to evaluate, e.g., many information-flow security and concurrency requirements. Where a trace property defines a set of traces, a hyperproperty defines a set of sets
Jan Baumeister   +4 more
semanticscholar   +1 more source

The Relationship Between Separation Logic and Implicit Dynamic Frames [PDF]

open access: yesLogical Methods in Computer Science, 2012
Separation logic is a concise method for specifying programs that manipulate dynamically allocated storage. Partially inspired by separation logic, Implicit Dynamic Frames has recently been proposed, aiming at first-order tool support.
Matthew J. Parkinson   +1 more
doaj   +1 more source

A Real-Valued Modal Logic [PDF]

open access: yesLogical Methods in Computer Science, 2018
A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers.
Denisa Diaconescu   +2 more
doaj   +1 more source

First-order Logic with Connectivity Operators [PDF]

open access: yesAnnual Conference for Computer Science Logic, 2021
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size.
Nicole Schirrmacher   +2 more
semanticscholar   +1 more source

Making first order linear logic a generating grammar [PDF]

open access: yesLogical Methods in Computer Science, 2023
It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj   +1 more source

Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic [PDF]

open access: yesInternational Conference on Verification, Model Checking and Abstract Interpretation, 2016
Separation Logic (\(\mathsf {SL}\)) is a well-known assertion language used in Hoare-style modular proof systems for programs with dynamically allocated data structures. In this paper we investigate the fragment of first-order \(\mathsf {SL}\) restricted
Andrew Reynolds   +2 more
semanticscholar   +1 more source

Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees [PDF]

open access: yesLogical Methods in Computer Science, 2017
Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible with its cut ...
Marc Bagnol
doaj   +1 more source

Relation-Changing Logics as Fragments of Hybrid Logics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add, and swap edges in the model, both locally and globally. We provide translations from these logics to
Mauricio Martel   +3 more
openaire   +5 more sources

A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions

open access: yesACM Transactions on Computational Logic, 2022
We develop a doubly exponential decision procedure for the satisfiability problem of guarded separation logic—a novel fragment of separation logic featuring user-supplied inductive predicates, Boolean connectives, and separating connectives, including ...
Christoph Matheja   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy