Results 31 to 40 of about 14,300 (195)
Nested Hoare Triples and Frame Rules for Higher-order Store [PDF]
Logical Methods in Computer Science, 2011 Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the ...
Jan Schwinghammer +3 more
doaj +1 more source
Bisimulation in Inquisitive Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are ...
Ivano Ciardelli, Martin Otto
doaj +1 more source
From Quantified CTL to QBF [PDF]
, 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
Expressiveness and Completeness in Abstraction [PDF]
, 2012 We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according to the most widely used notion, the class of Kripke Modal Transition ...
Bas Luttik +22 more
core +6 more sources
Completeness by Modal Deļ¬nitions. Application to the Epistemic Logic With Hypotheses
Inteligencia Artificial, 2020 We investigate the variant of epistemic logic S5 for reasoning about knowledge under hypotheses. The logic is equipped with a modal operator of necessity that can be parameterized with a hypothesis representing background assumptions.
Levan Uridia, Dirk Walther
doaj +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
Equivalences for fair Kripke structures [PDF]
, 1994 We extend the notion of bisimulation to Kripke structures with fairness. We define equivalences that preserve fairness and are akin to bisimulation. Specifically we define an equivalence and show that it is complete in the sense that it is the coarsest equivalence that preserves the logic CTL* interpreted with respect to the fair paths.
Adnan Aziz +4 more
openaire +1 more source
LTL Model Checking Based on Binary Classification of Machine Learning
IEEE Access, 2019 Linear Temporal Logic (LTL) Model Checking (MC) has been applied to many fields. However, the state explosion problem and the exponentially computational complexity restrict the further applications of LTL model checking.
Weijun Zhu, Huanmei Wu, Miaolei Deng
doaj +1 more source
Stone-Type Dualities for Separation Logics [PDF]
Logical Methods in Computer Science, 2019 Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence, yielding a ...
Simon Docherty, David Pym
doaj +1 more source
Efficient Synthesis of Network Updates [PDF]
, 2015 Software-defined networking (SDN) is revolutionizing the networking industry, but current SDN programming platforms do not provide automated mechanisms for updating global configurations on the fly.
Cerny, Pavol +3 more
core +2 more sources