The Experts below are selected from a list of 37620 Experts worldwide ranked by ideXlab platform
Ulyana Tikhonova - One of the best experts on this subject based on the ideXlab platform.
-
Reusable specification templates for defining Dynamic Semantics of DSLs
Software & Systems Modeling, 2019Co-Authors: Ulyana TikhonovaAbstract:In the context of model-driven engineering, the Dynamic (execution) Semantics of domain-specific languages (DSLs) is usually not specified explicitly and stays (hard)coded in model transformations and code generation. This poses challenges such as learning, debugging, understanding, maintaining, and updating a DSL. Facing the lack of supporting tools for specifying the Dynamic Semantics of DSLs (or programming languages in general), we propose to specify the architecture and the detailed design of the software that implements the DSL, rather than requirements for the behavior expected from DSL programs. To compose such a specification, we use specification templates that capture software design solutions typical for the (application) domain of the DSL. As a result, on the one hand, our approach allows for an explicit and clear definition of the Dynamic Semantics of a DSL, supports separation of concerns and reuse of typical design solutions. On the other hand, we do not introduce (yet another) specification formalism, but we base our approach on an existing formalism and apply its extensive tool support for verification and validation to the Dynamic Semantics of a DSL.
-
MoDELS - Reusable specification templates for defining Dynamic Semantics of DSLs
2017 ACM IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS), 2017Co-Authors: Ulyana TikhonovaAbstract:In the context of Model Driven Engineering (MDE), the Dynamic (execution) Semantics of domain specific languages (DSLs) is usually not specified explicitly and stays (hard)coded in model transformations and code generation. This poses challenges such as learning, debugging, understanding, maintaining, and updating a DSL. Facing the lack of supporting tools for specifying the Dynamic Semantics of DSLs (or programming languages in general), we propose to specify the architecture and the detailed design of the software that implements the DSL, rather than requirements for the behavior expected from DSL programs. To compose such a specification we use specification templates that capture software design solutions typical for the (application) domain of the DSL. As a result, on the one hand, our approach allows for an explicit and clear definition of the Dynamic Semantics of a DSL, supports separation of concerns and reuse of typical design solutions. On the other hand, we do not introduce (yet another) specification formalism, but we base our approach on an existing formalism and apply its extensive tool support for verification and validation to the Dynamic Semantics of a DSL.
-
ESEC/SIGSOFT FSE - A framework for defining the Dynamic Semantics of DSLs
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering - ESEC FSE 2013, 2013Co-Authors: Ulyana TikhonovaAbstract:In this research abstract we describe our project on a common reference framework for defining domain specific languages (DSLs). The framework is meant for defining the Dynamic Semantics of DSLs and allows for mapping the DSL definition to the various platforms, such as verification, validation and simulation. The objectives of the project are to make a DSL Dynamic Semantics definition explicit and to use this definition for bridging technological diversity of various platforms, used in the DSLs development.
Eelco Visser - One of the best experts on this subject based on the ideXlab platform.
-
scopes describe frames a uniform model for memory layout in Dynamic Semantics
European Conference on Object-Oriented Programming, 2016Co-Authors: Casper Bach Poulsen, Pierre Neron, Andrew Tolmach, Eelco VisserAbstract:Semantic specifications do not make a systematic connection between the names and scopes in the static structure of a program and memory layout, and access during its execution. In this paper, we introduce a systematic approach to the alignment of names in static Semantics and memory in Dynamic Semantics, building on the scope graph framework for name resolution. We develop a uniform memory model consisting of frames that instantiate the scopes in the scope graph of a program. This provides a language-independent correspondence between static scopes and run-time memory layout, and between static resolution paths and run-time memory access paths. The approach scales to a range of binding features, supports straightforward type soundness proofs, and provides the basis for a language-independent specification of sound reachability-based garbage collection.
-
ECOOP - Scopes describe frames : A uniform model for memory layout in Dynamic Semantics
2016Co-Authors: Casper Bach Poulsen, Pierre Neron, Andrew Tolmach, Eelco VisserAbstract:Semantic specifications do not make a systematic connection between the names and scopes in the static structure of a program and memory layout, and access during its execution. In this paper, we introduce a systematic approach to the alignment of names in static Semantics and memory in Dynamic Semantics, building on the scope graph framework for name resolution. We develop a uniform memory model consisting of frames that instantiate the scopes in the scope graph of a program. This provides a language-independent correspondence between static scopes and run-time memory layout, and between static resolution paths and run-time memory access paths. The approach scales to a range of binding features, supports straightforward type soundness proofs, and provides the basis for a language-independent specification of sound reachability-based garbage collection.
-
scopes describe frames a uniform model for memory layout in Dynamic Semantics artifact
European Conference on Object-Oriented Programming, 2016Co-Authors: Casper Bach Poulsen, Pierre Neron, Andrew Tolmach, Eelco VisserAbstract:Our paper introduces a systematic approach to the alignment of names in the static structure of a program, and memory layout and access during its execution. We develop a uniform memory model consisting of frames that instantiate the scopes in the scope graph of a program. This provides a language-independent correspondence between static scopes and run-time memory layout, and between static resolution paths and run-time memory access paths. The approach scales to a range of binding features, supports straightforward type soundness proofs, and provides the basis for a language-independent specification of sound reachability-based garbage collection. This Coq artifact showcases how our uniform model for memory layout in Dynamic Semantics provides structure to type soundness proofs. The artifact contains type soundness proofs mechanized in Coq for (supersets of) all languages in the paper. The type soundness proofs rely on a language-independent framework formalizing scope graphs and frame heaps.
-
Dynsem: A DSL for Dynamic Semantics specification
2015Co-Authors: Vlad Vergu, Pierre Neron, Eelco VisserAbstract:The formal definition the Semantics of a programming language and its implementation are typically separately defined, with the risk of divergence such that properties of the formal Semantics are not properties of the implementation. In this paper, we present DynSem, a domain-specific language for the specification of the Dynamic Semantics of programming languages that aims at supporting both formal reasoning and efficient interpretation. DynSem supports the specification of the operational Semantics of a language by means of statically typed conditional term reduction rules. DynSem supports concise specification of reduction rules by providing implicit build and match coercions based on reduction arrows and implicit term constructors. DynSem supports modular specification by adopting implicit propagation of semantic components from I-MSOS, which allows omitting propagation of components such as environments and stores from rules that do not affect those. DynSem supports the declaration of native operators for delegation of aspects of the Semantics to an external definition or implementation. DynSem supports the definition of auxiliary meta-functions, which can be expressed using regular reduction rules and are subject to semantic component propagation. DynSem specifications are executable through automatic generation of a Java-based AST interpreter.
-
dynsem a dsl for Dynamic Semantics specification
Rewriting Techniques and Applications, 2015Co-Authors: Vlad Vergu, Pierre Neron, Eelco VisserAbstract:The formal Semantics of a programming language and its implementation are typically separately defined, with the risk of divergence such that properties of the formal Semantics are not properties of the implementation. In this paper, we present DynSem, a domain-specific language for the specification of the Dynamic Semantics of programming languages that aims at supporting both formal reasoning and efficient interpretation. DynSem supports the specification of the operational Semantics of a language by means of statically typed conditional term reduction rules. DynSem supports concise specification of reduction rules by providing implicit build and match coercions based on reduction arrows and implicit term constructors. DynSem supports modular specification by adopting implicit propagation of semantic components from I-MSOS, which allows omitting propagation of components such as environments and stores from rules that do not affect those. DynSem supports the declaration of native operators for delegation of aspects of the Semantics to an external definition or implementation. DynSem supports the definition of auxiliary meta-functions, which can be expressed using regular reduction rules and are subject to semantic component propagation. DynSem specifications are executable through automatic generation of a Java-based AST interpreter.
James K. Huggins - One of the best experts on this subject based on the ideXlab platform.
-
Abstract State Machines - An ASM Dynamic Semantics for Standard ML
Lecture Notes in Computer Science, 2000Co-Authors: Steven C. Cater, James K. HugginsAbstract:The Abstract State Machines (ASM) methodology is a methodology for formally specifying computing systems. We use the ASM methodology to give the Dynamic Semantics of the functional programming language Standard ML. We give an operational Semantics for Standard ML by means of an interpreter for (appropriately pre-processed) Standard ML programs; the effect of a Standard ML instruction can be seen in terms of the corresponding actions performed by the ASM.
Lewis Bott - One of the best experts on this subject based on the ideXlab platform.
-
Processing presuppositions: Dynamic Semantics vs pragmatic enrichment
Language and Cognitive Processes, 2013Co-Authors: Emmanuel Chemla, Lewis BottAbstract:One defining and yet puzzling feature of linguistic presuppositions is the way they interact with linguistic operators. For instance, when a presupposition trigger (e.g., realise) occurs under negation (e.g., Zoologists do not realise that elephants are mammals), the sentence is most commonly interpreted with the same global presupposition (elephants are mammals) as if negation was not present. Alternatively, the presupposition may be locally accommodated, i.e., the presupposition may become part of what is negated. In this paper, we develop and test two processing accounts of presupposition projection, the global-first model and the local-first model, inspired by Dynamic Semantics and pragmatic theories respectively. We tested these predictions using a verification task similar to Bott and Noveck's test of default models of scalar implicature. Across two experiments, using different materials and instructions, participants were faster to derive the global interpretation than the local interpretation, in contrast to the local-first model. We discuss the results in terms of Dynamic Semantics vs pragmatic models of presupposition projection.
Norihiro Ogata - One of the best experts on this subject based on the ideXlab platform.
-
a Dynamic Semantics of modal subordination
Lecture Notes in Computer Science, 2006Co-Authors: Norihiro OgataAbstract:This paper will propose a Dynamic Semantics of quantified modal logic based on the theory of System Transition Systems, which are abstract objects modeling “Kripke models of Kripke models” or graph rewriting systems, by exlpoiting the theory of coalgebras in order to treat modal subordination as a Kripke model change, which requires no ad-hoc informal treatment such as accomodation as in [1] or extra-ontology introduced in [2] [3].
-
JSAI Workshops - A Dynamic Semantics of modal subordination
New Frontiers in Artificial Intelligence, 2006Co-Authors: Norihiro OgataAbstract:This paper will propose a Dynamic Semantics of quantified modal logic based on the theory of System Transition Systems, which are abstract objects modeling “Kripke models of Kripke models” or graph rewriting systems, by exlpoiting the theory of coalgebras in order to treat modal subordination as a Kripke model change, which requires no ad-hoc informal treatment such as accomodation as in [1] or extra-ontology introduced in [2] [3].
-
Dynamic Semantics of Plurals DPLQ
Electronic Notes in Theoretical Computer Science, 2002Co-Authors: Norihiro OgataAbstract:Abstract This paper proposes a Dynamic Semantics of plurals, DPL ⊛ Q , that is an extension of DPL [8] by adding binary generalized quantifiers, plural terms with join-operators as in Link [17]'s semilattice Semantics of plurals, Dynamic selectors, Dynamic distributors and division functions. DPL ⊛ Q provides a formalism for handling dependent plurals, bound plurals, generic plurals, and ambiguity of collective/distributive/cumulative interpretation of plurals.
-
LACL - A Revision System of Circular Objects and Its Applications to Dynamic Semantics of Dialogues
Logical Aspects of Computational Linguistics, 2001Co-Authors: Norihiro OgataAbstract:Since Peter Aczel's theory[1] of hypersets, many applications to formalizations of a circular object such as a mutual belief has been proposed [3,2,5]. This paper will propose Membership Description Systems (MDSs), a partial revision system of circular objects and their applications to a Dynamic Semantics of a dialogue in the sense that a dialogue can be considered as a revision process of mutual beliefs between its agents. Although usual Dynamic Semantics [10] updates a variable assignment or a set of information states, our proposal of a Semantics of dialogues directly updates situations, which is specified by MDSs, as Dynamic Semantics of circular propositions [11] directly updates situations. Furthermore, using MDSs as updated objects in the Semantics makes a partial and direct update of circular situations themselves possible. As a result, a Dynamic Semantics of a language with the ↓-operator, which is introduced by [3] to describe circular propositions, can be provided.
-
What Do You Mean by "What Do You Mean"? A Formal Representation and Its Dynamic Semantics of Meta-expressions in Conversations
2000Co-Authors: Norihiro OgataAbstract:This paper investigates Dynamic Semantics of conversations from the point of view of semantical closedness, presuppositions and shared belief/common knowledge updates, by analysing the meta-expression what do you mean (by X)? into three major usages: semantic repair initiation, intentional repair initiation, and inferential repair initiation, since these three usages are deeply related to three types of semantical closedness: closedness of denotations, closedness of intention and closedness of inference of conversations. As a result, the proposed Dynamic Semantics of conversations is semantically closed in terms of shared beliefs of the conversants.
