Results 11 to 20 of about 1,456,568 (303)
Computational Soundness of Formal Indistinguishability and Static Equivalence [PDF]
, 2007 In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryptographic pi calculi as a notion of formal indistinguishability. Previous work [10,1] has shown that this yields the soundness of natural interpretations of some interesting ...
Gergei Bana +2 more
core +5 more sources
Formal Game Grammar and Equivalence [PDF]
2020 IEEE Conference on Games (CoG), 2020 We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe finite discrete games without hidden information, allowing for randomness, and mixed sequential and simultaneous ...
Paul Riggins, David McPherson
openaire +4 more sources
Morita Equivalence of Formal Poisson Structures [PDF]
International Mathematics Research Notices, 2021 Abstract We extend the notion of Morita equivalence of Poisson manifolds to the setting of formal Poisson structures, that is, formal power series of bivector fields $\pi =\pi _0 + \lambda \pi _1 +\cdots $ satisfying the Poisson integrability condition $[\pi ,\pi ]=0$.
Bursztyn, Henrique +2 more
openaire +2 more sources
On the Commutative Equivalence of Algebraic Formal Series and Languages [PDF]
International Journal of Foundations of Computer Science, 2021 The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.
Carpi A., D'Alessandro F.
openaire +4 more sources
*-IDEALS AND FORMAL MORITA EQUIVALENCE OF *-ALGEBRAS [PDF]
International Journal of Mathematics, 2001 Motivated by deformation quantization, we introduced in an earlier work the notion of formal Morita equivalence in the category of *-algebras over a ring [Formula: see text] which is the quadratic extension by i of an ordered ring [Formula: see text]. The goal of the present paper is twofold.
Bursztyn, Henrique, Waldmann, Stefan
openaire +3 more sources
Model-Checking Process Equivalences [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Process equivalences are formal methods that relate programs and system which, informally, behave in the same way. Since there is no unique notion of what it means for two dynamic systems to display the same behaviour there are a multitude of formal ...
Martin Lange +2 more
doaj +1 more source
Complexity, 2021 Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean functions, is often desired when reliable and correct hardware components are required.
Wilayat Khan +3 more
doaj +1 more source
Lite: Jurnal Bahasa, Sastra, dan Budaya, 2022 This research examines idiomatic expressions found in the translation of Twain’s ‘The Adventures of Huckleberry Finn’ from English into Indonesian; identifies the characteristics of idiomatic expressions; and investigates translator’s decision to apply ...
Lutfia Hanim
doaj +1 more source
On the semantic equivalence of language syntax formalisms
Theoretical Computer Science, 2020 There are various approaches to describing the syntax of a language [\textit{E. Visser}, Syntax definition for language prototyping. Amsterdam: Univ. Amsterdam (1997; Zbl 0900.68290)]. Formal grammar [\textit{N. Chomsky}, Three models for the description of language. IRE Trans. Inf. Theory 2, No. 3, 113-124 (1956; Zbl 0156.25401)], [\textit{J. Earley},
Samuele Buro, Isabella Mastroeni
openaire +6 more sources
Deciding equivalence-based properties using constraint solving [PDF]
, 2013 Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy or authentication.
Véronique Cortier +5 more
core +1 more source