Results 21 to 30 of about 24,570,426 (223)
The expressive power of modal logic with inclusion atoms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Lauri Hella, Johanna Stumpf
doaj +1 more source
On Irrelevance and Algorithmic Equality in Predicative Type Theory [PDF]
Logical Methods in Computer Science, 2012 Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To separate static and dynamic code, several static analyses and type systems have been put forward.
Andreas Abel, Gabriel Scherer
doaj +1 more source
Faithful Modeling of Product Lines with Kripke Structures and Modal Logic [PDF]
Scientific Annals of Computer Science, 2016 Software product lines are now an established framework for software design. They are specified by special diagrams called feature models. For formal analysis, the latter are usually encoded by Boolean propositional theories.
Z. Diskin +3 more
doaj +1 more source
Formalizing the use case model: A model-based approach.
PLoS ONE, 2020 In general, requirements expressed in natural language are the first step in the software development process and are documented in the form of use cases. These requirements can be specified formally using some precise mathematical notation (e.g.
Qamar Uz Zaman +2 more
doaj +1 more source
Conditional Belief, Knowledge and Probability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 A natural way to represent beliefs and the process of updating beliefs is presented by Bayesian probability theory, where belief of an agent a in P can be interpreted as a considering that P is more probable than not P. This paper attempts to get at the
Jan van Eijck, Kai Li
doaj +1 more source
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like ...
Benoît Boyer, Thomas Genet
doaj +1 more source
Step-Indexed Kripke Model of Separation Logic for Storable Locks
Mathematical Foundations of Programming Semantics, 2011 We present a version of separation logic for modular reasoning about concurrent programs with dynamically allocated storable locks and dynamic thread creation. The assertions of the program logic are modelled by a Kripke model over a recursively de.
Alexandre Buisse +2 more
semanticscholar +1 more source
Bisimulation for Secure Information Flow Analysis of Multi-Threaded Programs
Mathematical and Computational Applications, 2019 Preserving the confidentiality of information is a growing concern in software development. Secure information flow is intended to maintain the confidentiality of sensitive information by preventing them from flowing to attackers.
Ali A. Noroozi +2 more
doaj +1 more source
Satisfiability Problem in Interval FP-logic
Известия Иркутского государственного университета: Серия "Математика", 2023 The article investigates the interval modal logic, in which an action of the modal operator $\Diamond$ is limited by the boundaries of an interval. In addition, the language of modal logic is extended by the operator $D (\alpha, \beta)$, the truth of ...
N.A. Protsenko +2 more
doaj +1 more source
Power Kripke-Platek set theory and the axiom of choice [PDF]
Journal of Logic and Computation, 2018 While power Kripke–Platek set theory, ${\textbf{KP}}({\mathcal{P}})$, shares many properties with ordinary Kripke–Platek set theory, ${\textbf{KP}}$, in several ways it behaves quite differently from ${\textbf{KP}}$.
M. Rathjen
semanticscholar +1 more source