Results 31 to 40 of about 13,172 (205)

Polyprograms and Polyprogram Bisimulation

open access: yesМоделирование и анализ информационных систем, 2018
A polyprogram is a generalization of a program which admits multiple definitions of a single function. Such objects arise in different transformation systems, such as the Burstall-Darlington framework or equality saturation.
Sergei Grechanik
doaj   +1 more source

On bisimulations for the spi calculus [PDF]

open access: yesMathematical Structures in Computer Science, 2002
The spi calculus [\textit{M. Abadi} and \textit{A. D. Gordon}, Inf. Comput. 148, 1--70 (1999; Zbl 0924.68073)], is a process calculus extending pi-calculus. It was designed for description and formal verification of cryptographic protocols, and correctness properties of such protocols may be expressed as may-testing equivalences between certain process
Johannes Borgström, Uwe Nestmann
openaire   +1 more source

Some Remarks on the Model Theory of Epistemic Plausibility Models [PDF]

open access: yes, 2010
Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena.
Aucher G.   +7 more
core   +1 more source

Model predictive control for voltage restoration in microgrids using temporal logic specifications

open access: yesIET Energy Systems Integration, Volume 2, Issue 3, Page 207-214, September 2020., 2020
Power system operation will encounter numerous voltage variabilities as the proliferation of renewable energy continues. Real‐time monitoring and communication technologies can potentially improve voltage stability by enabling the rapid detection of voltage deviations and the implementation of corrective actions.
Fatima Z. Taousser   +5 more
wiley   +1 more source

Bisimulations and bisimulation games between Verbrugge models

open access: yesMathematical Logic Quarterly, 2023
AbstractInterpretability logic is a modal formalization of relative interpretability between first‐order arithmetical theories. Verbrugge semantics is a generalization of Veltman semantics, the basic semantics for interpretability logic. Bisimulation is the basic equivalence between models for modal logic.
Vuković, Mladen   +2 more
openaire   +3 more sources

Multifeature‐Based Behavior of Privilege Escalation Attack Detection Method for Android Applications

open access: yesMobile Information Systems, Volume 2020, Issue 1, 2020., 2020
This study proposed an application behavior‐detection method based on multifeature and process algebra for detecting privilege escalation attacks in Android applications. The five features of application that constituted the attack were determined through an analysis of the privilege escalation attack model.
Limin Shen   +4 more
wiley   +1 more source

Approximate Bisimulation Minimisation

open access: yesCoRR, 2021
Full version of an FSTTCS'21 ...
Kiefer, S, Tang, Q
openaire   +5 more sources

On Probabilistic Applicative Bisimulation and Call-by-Value $\lambda$-Calculi (Long Version) [PDF]

open access: yes, 2014
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus.
C. Shannon   +11 more
core   +4 more sources

Improved Efficiency of Object Code Verification Using Statically Abstracted Object Code

open access: yesScientific Programming, Volume 2020, Issue 1, 2020., 2020
One of the major challenges in the formal verification of embedded system software is the complexity and substantially large size of the implementation. The problem becomes crucial when the embedded system is a complex medical device that is executing convoluted algorithms.
N. Shaukat   +4 more
wiley   +1 more source

Amortised Bisimulations [PDF]

open access: yes, 2005
We introduce a quantitative concept for bisimulations by integrating the notion of amortisation (cf. [3]). This allows us to make behavioural comparisons between nondeterministic systems that are inherently non-terminating and to analyse the relative long-term costs of deploying them.
Astrid Kiehn, S. Arun-Kumar
openaire   +1 more source

Home - About - Disclaimer - Privacy