Results 21 to 30 of about 20,953 (186)

Characteristic Formulae for Fixed-Point Semantics: A General Framework [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2009
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable
Luca Aceto   +2 more
doaj   +1 more source

An algebraic generalization of Kripke structures [PDF]

open access: yesMathematical Proceedings of the Cambridge Philosophical Society, 2008
AbstractThe Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional algebraic semantics based on lattices with unary operators, and it suggests natural interpretations of modal ...
Marcelino, Sérgio, Resende, Pedro
openaire   +3 more sources

Type Directed Partial Evaluation for Level-1 Shift and Reset [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
We present an implementation in the Coq proof assistant of type directed partial evaluation (TDPE) algorithms for call-by-name and call-by-value versions of shift and reset delimited control operators, and in presence of strong sum types.
Danko Ilik
doaj   +1 more source

Logics of Temporal-Epistemic Actions [PDF]

open access: yes, 2014
We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation.
Renne, Bryan, Sack, Joshua, Yap, Audrey
core   +3 more sources

From Quantified CTL to QBF [PDF]

open access: yes, 2019
QCTL extends the temporal logic CTL with quantifications over atomic propositions. This extension is known to be very expressive: QCTL allows us to express complex properties over Kripke structures (it is as expressive as MSO).
Hossain, Akash
core   +1 more source

VERIFICATION OF DYNAMIC MEMORY ALLOCATORS BASED ON SYMBOLIC PROGRAM EXECUTION [PDF]

open access: yesНаучно-технический вестник информационных технологий, механики и оптики, 2020
Subject of Research. The paper presents the study of vulnerability exploitation techniques in the implementation of dynamic memory allocation algorithms (glibc library allocator): Poisoned Null-byte, Overlapped Chunks, Fastbin Attack, Unsafe Unlink ...
Andrey M. Dergachev   +4 more
doaj   +1 more source

Social Choice Methods for Database Aggregation [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2019
Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of information coming from multiple sources, each source submitting a database ...
Francesco Belardinelli, Umberto Grandi
doaj   +1 more source

Strong Completeness and the Finite Model Property for Bi-Intuitionistic Stable Tense Logics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
Bi-Intuitionistic Stable Tense Logics (BIST Logics) are tense logics with a Kripke semantics where worlds in a frame are equipped with a pre-order as well as with an accessibility relation which is 'stable' with respect to this pre-order.
Katsuhiko Sano, John G. Stell
doaj   +1 more source

A Semi-Automatic Semantic Consistency-Checking Method for Learning Ontology from Relational Database

open access: yesInformation, 2021
To tackle the issues of semantic collision and inconsistencies between ontologies and the original data model while learning ontology from relational database (RDB), a semi-automatic semantic consistency checking method based on graph intermediate ...
Chuangtao Ma   +2 more
doaj   +1 more source

Characterizing Kripke Structures in Temporal Logic. [PDF]

open access: yes, 1987
Abstract : The question of whether branching-time temporal logic or linear-time temporal logic is best for reasoning about concurrent programs is one of the most controversial issues in logics of programs. Concurrent programs are usually modelled by labelled state-transition graphs in which some state is designated as the initial state.
O. Grumberg, E. M. Clarke, M. C. Browne
openaire   +2 more sources

Home - About - Disclaimer - Privacy