YAPA: A generic tool for computing intruder knowledge [PDF]
, 2009 Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages based on equational logics, knowledge is typically expressed by two ...
B. Blanchet +12 more
core +5 more sources
Typy ekwiwalencji i ich relewancja dla relacji pomiędzy językiem wyjściowym a językiem docelowym w kontekście tłumaczenia tekstów (fachowych) [PDF]
, 2018 In the article there are introduced several types of lingual equivalence and their relevance for the relations between source language and target language. Different types of equivalence, e.g. denotative, connotative, text-normative, pragmatic and formal
Maras, Tomasz
core +1 more source
Algebraic Structure of Combined Traces [PDF]
, 2012 Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are able to capture
Mikulski, Lukasz
core +1 more source
Problem Solving of Non-equivalence Problems in English Into Indonesian Text [PDF]
, 2016 In the process of transferring one message of Source Language (SL) to Target Language (TL) in a translation must be careful by a translator, because one word may have more than one meaning.
Ninsiana, W. (Widhiya)
core +2 more sources
Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study [PDF]
, 2017 Widely used complex code refactoring tools lack a solid reasoning about the correctness of the transformations they implement, whilst interest in proven correct refactoring is ever increasing as only formal verification can provide true confidence in ...
Horpácsi, Dániel +2 more
core +2 more sources
Modular Composition of Language Features through Extensions of Semantic Language Models [PDF]
, 1999 Today, programming or specification languages are often extended in order to customize them for a particular application domain or to refine the language definition. The extension of a semantic model is often at the centre of such an extension.
Pahl, Claus
core +1 more source
A Computational Approach to Reflective Meta-Reasoning about Languages with Bindings [PDF]
, 2005 We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to reason abstractly about operators, languages, open-ended languages ...
Hickey, Jason +3 more
core +4 more sources
, 2016 We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computational complexities of p-equivalence problems for regular languages and ...
Nakamura, Yoshiki
core +4 more sources
A multi-set extended relational algebra: a formal approach to a practical issue [PDF]
, 1993 The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples an a relation. Many database languages and systems do require multi-set semantics though, either because of functional requirements or because of the high costs
de By, R.A. +2 more
core +8 more sources
Bisimulation of Labelled State-to-Function Transition Systems Coalgebraically [PDF]
, 2015 Labeled state-to-function transition systems, FuTS for short, are characterized by transitions which relate states to functions of states over general semirings, equipped with a rich set of higher-order operators.
De Vink, Erik P +2 more
core +3 more sources