Results 1 to 10 of about 131,761 (282)
A dependent nominal type theory
, 2012 Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and
A. Avron, F. Honsell, I. A. Mason, and R +17 more
core +1 more source
Convergence behaviour of structural FSM traversal [PDF]
, 2006 We present a theoretical analysis of structural FSM traversal, which is the basis for the sequential equivalence checking algorithm Record & Play presented earlier.
Kunz, Wolfgang, Stoffel, Dominik
core
Modeling and analysis of the behavior of successive reactive programs
Труды Института системного программирования РАН, 2018 Finite state transducers extend the finite state automata to model functions on strings or lists. They may be used also as simple models of sequential reactive programs. These programs operate in the interaction with the environment permanently receiving
V. A. Zakharov
doaj +1 more source
On the equivalence-checking problem for polysemantic models of sequential programs.
Труды Института системного программирования РАН, 2004 We introduce a new propositional model of computation for sequential computer programs. A distinctive feature of this model is that program runs and the results of computations are defined by means of two independent operational semantics.
I.M. Zakharyaschev, V.A. Zakharov
doaj
Verification of parallelising transformations of KPN models
IET Cyber-Physical Systems, 2019 Parallelising transformations of Kahn process networks (KPNs) are important mechanisms for achieving speedup for deployment on heterogeneous multiprocessor systems particularly in the domain of signal processing applications.
Chandan Karfa +2 more
doaj +1 more source
Formal Verification of Transcompiled Mobile Applications Using First-Order Logic
TechnologiesThe increasing interest in automated code conversion and transcompilation—driven by the need to support multiple platforms efficiently—has raised new challenges in verifying that translated codes preserve the intended behaviors of the originals. Although
Ahmad Ahmad Muhammad +8 more
doaj +1 more source
Using algebraic models of programs for detecting metamorphic malwares
Труды Института системного программирования РАН, 2007 Polymorphic and metamorphic viruses are the most sophisticated malicious programs that give a lot of trouble to virus scanners. Each time when these viruses infect new executables or replicate themselves they completely modify (obfuscate) their signature
N.N. Kuzjurin +3 more
doaj
Publisher Correction: Equivalence checking of quantum circuits by nonlocality
npj Quantum Information, 2022 Weixiao Sun, Zhaohui Wei
doaj +1 more source
Generalizing the Paige-Tarjan Algorithm by Abstract Interpretation
, 2006 The Paige and Tarjan algorithm (PT) for computing the coarsest refinement of a state partition which is a bisimulation on some Kripke structure is well known.
Ranzato, Francesco, Tapparo, Francesco
core +1 more source
Opting for predicating a theme in translation – a dilemma
Bucharest Working Papers in Linguistics, 2009 Predicating the theme in a sentence/text regards the organization of information structure (balance between given and new information units) according to the author’s intention and textual (writing) skills; to transpose this balance in translation is the
Daniela Corina Ionescu
doaj