Výsledky vyhľadávania - Theory of computation Logic Modal and temporal logics
-
1
Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…A modal logic that is strong enough to fully characterize the behavior of a system is called expressive…”
Získať plný text
Konferenčný príspevok.. -
2
Asynchronous Extensions of HyperLTL
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… Temporal logics for hyperproperties studied in the literature, including HyperLTL, assume a synchronous semantics and enjoy a decidable model checking problem…”
Získať plný text
Konferenčný príspevok.. -
3
Comonadic semantics for guarded fragments
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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 Ehrenfeucht-Fraïssé…”
Získať plný text
Konferenčný príspevok.. -
4
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states…”
Získať plný text
Konferenčný príspevok.. -
5
Some constructive variants of S4 with the finite model property
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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 long-standing open problem…”
Získať plný text
Konferenčný príspevok.. -
6
Finite Model Theory of the Triguarded Fragment and Related Logics
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality…”
Získať plný text
Konferenčný príspevok.. -
7
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication…”
Získať plný text
Konferenčný príspevok.. -
8
Behavioural Preorders via Graded Monads
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… Often, such behavioural preorders are characterized in terms of theory inclusion in dedicated characteristic logics; e.g…”
Získať plný text
Konferenčný príspevok.. -
9
On Logics and Homomorphism Closure
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Predicate logic is the premier choice for specifying classes of relational structures…”
Získať plný text
Konferenčný príspevok.. -
10
Constrained LTL Specification Learning from Examples
ISSN: 1558-1225Vydavateľské údaje: IEEE 26.04.2025Vydané v Proceedings / International Conference on Software Engineering (26.04.2025)“…Temporal logic specifications play an important role in a wide range of software analysis tasks, such as model checking, automated synthesis, program comprehension, and runtime monitoring…”
Získať plný text
Konferenčný príspevok.. -
11
A temporal permission analysis and enforcement framework for Android
ISBN: 9781450356381, 1450356389ISSN: 1558-1225Vydavateľské údaje: New York, NY, USA ACM 27.05.2018Vydané v 2018 IEEE/ACM 40th International Conference on Software Engineering (ICSE) (27.05.2018)“… Leveraging temporal logic model checking,Terminator's analyzer identifies permission-induced threats with respect to dynamic permission states of the apps…”
Získať plný text
Konferenčný príspevok.. -
12
Asynchronous Template Games and the Gray Tensor Product of 2-Categories
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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 and trajectories as morphisms, labelled by a specific synchronization template…”
Získať plný text
Konferenčný príspevok.. -
13
Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… For modal logics, limit behavior for models and frames may differ. Halpern and Kapron proved zero-one laws for classes of models corresponding to the modal logics K, T, S4, and S5…”
Získať plný text
Konferenčný príspevok.. -
14
Evidenced Frames: A Unifying Framework Broadening Realizability Models
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Constructive foundations have for decades been built upon realizability models for higher-order logic and type theory…”
Získať plný text
Konferenčný príspevok.. -
15
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes…”
Získať plný text
Konferenčný príspevok.. -
16
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FL ew (i.e. IMALLW…”
Získať plný text
Konferenčný príspevok.. -
17
ITG: Trace Generation via Iterative Interaction between LLM Query and Trace Checking
ISSN: 2832-7632Vydavateľské údaje: ACM 14.04.2024Vydané v IEEE/ACM International Conference on Software Engineering: New Ideas and Emerging Technologies Results (Online) (14.04.2024)“…Due to the complexity of linear temporal logic (LTL) trace generation (PSPACE-Complete), existing neural network-based approaches will fail as the formula sizes increase…”
Získať plný text
Konferenčný príspevok.. -
18
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… in classical modal logics. Variants of this logic are surprisingly widespread: they appear as Curry-Howard correspondents…”
Získať plný text
Konferenčný príspevok.. -
19
Compositional relational reasoning via operational game semantics
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We show how to use operational game semantics as a guide to develop relational techniques for establishing contextual equivalences with respect to contexts…”
Získať plný text
Konferenčný príspevok.. -
20
Multi-Structural Games and Number of Quantifiers
Vydavateľské údaje: IEEE 29.06.2021Vydané v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We study multi-structural games, played on two sets {\mathcal{A}} and {\mathcal{B}} of structures. These games generalize Ehrenfeucht-Fraïssé games. Whereas…”
Získať plný text
Konferenčný príspevok..

