Results 21 to 30 of about 112,498 (311)
IEEE Access, 2022 Alvis is a formal modelling language developed primarily for modelling concurrent systems including real-time systems. The prepared model is compiled, and the resulting runnable model allows, e.g., to generate the state space and to verify the model ...
Marcin Szpyrka +2 more
doaj +1 more source
Formal Semantics for Metamodel-Based Domain Specific Languages [PDF]
, 2013 Domain Specific Languages (DSLs) are often defined in terms of metamodels capturing the abstract syntax of the language. For a complete definition of a DSL, both syntactic and semantic aspects of the language have to be specified.
SCANDURRA, Patrizia (ORCID:0000-0002-9209-3624) +3 more
core +1 more source
Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees
Современные информационные технологии и IT-образование, 2021 In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source
Formal Design, Implementation and Verification of Blockchain Languages Using K (Invited Talk) [PDF]
, 2020 The usual post-mortem approach to formal language semantics and verification, where the language is firstly implemented and used in production for many years before a need for formal semantics and verification tools naturally arises, simply does not work
Rosu, Grigore
core +1 more source
Formal Verification of Security Protocol Implementations: A Survey [PDF]
, 2014 Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages.
Pironti, Alfredo +3 more
core +1 more source
The dynamic complexity of formal languages [PDF]
ACM Transactions on Computational Logic, 2012 The article investigates the power of the dynamic complexity classes D yn FO, D yn QF, and D yn PROP over string languages. The latter two classes contain problems that can be maintained using quantifier-free first-order updates, with and without auxiliary functions ...
Gelade, Wouter +2 more
openaire +5 more sources
Computation of distances for regular and context-free probabilistic languages [PDF]
, 2008 Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syntactic pattern matching and machine learning.
Satta, Giorgio +5 more
core +1 more source
Factorization in Formal Languages [PDF]
, 2015 We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L).
Paul C. Bell +2 more
openaire +2 more sources
, 2018 Almost one-quarter of the world's languages are (or were) spoken in the Pacific, making it linguistically the most complex region in the world. Although numerous technical books on groups of Pacific or Australian languages have been published, and ...
Lynch, John
core +1 more source
Model‐based validation of diagnostic software with application in automotive systems
IET Cyber-systems and Robotics, 2021 Software validation aims to ensure that a particular software product fulfils its intended purpose, and needs to be performed against both software requirement as well as its implementation (i.e. product). However, for diagnostic software (i.e.
Jun Chen, Ramesh S
doaj +1 more source