We will situate the concept of an avatar (a working simulacrum of part of a system separated from it in space or time) with respect to traditional concepts of programming language and systems design. Whilst much theor...
详细信息
作者：
Polito, GuillermoDucasse, StéphaneFabresse, LucRMoD
Univ. Lille CNRS Centrale Lille Inria UMR 9189 CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille LilleF-59000 France Inria Lille-Nord Europe
40 Avenue Halley Villeneuve d’Ascq France IMT Lille Douai
Univ. Lille Unit de Recherche Informatique Automatique LilleF- 59000 France
Loading code inside a Pharo image is a daily concern for a Pharo developer. Nevertheless, several problems may arise at loading time that can prevent the code to load or even worse let the system in an inconsistent st...
详细信息
The proceedings contain 14 papers. The topics discussed include: solidity parsing using SmaCC: challenges and irregularities;towards modularity in live visual modeling: a case-study with OpenPonk and Kendrick;usage of...
ISBN:
(纸本)9781450355544
The proceedings contain 14 papers. The topics discussed include: solidity parsing using SmaCC: challenges and irregularities;towards modularity in live visual modeling: a case-study with OpenPonk and Kendrick;usage of tests in an open-source community;analysis and exploration for new generation debuggers;a detailed VM profiler for the cog VM;ad-hoc runtime object structure visualizations with metalinks;debugging cyber physical systems with Pharo: an experience report;first-class undefined classes for Pharo;Pragmatic insights: live uis for agent-based modeling in Pharo;Pharo git thermite: a visual tool for deciding to weld a pull request;towards exploratory data analysis for Pharo;and Renraku - the one static analysis model to rule them all.
Brzozowski derivatives, well known in the context of regular expressions, have recently been rediscovered to give a simplified explanation to parsers of context-free languages. We add derivatives as a novel first-clas...
详细信息
ISBN:
(纸本)9781450344449
Brzozowski derivatives, well known in the context of regular expressions, have recently been rediscovered to give a simplified explanation to parsers of context-free languages. We add derivatives as a novel first-class feature to a standard parser combinator language. First-class derivatives enable an inversion of the control flow, allowing to implement modular parsers for languages that previously required separate preprocessing steps or cross-cutting modifications of the parsers. We show that our framework offers new opportunities for reuse and supports a modular definition of interesting use cases of layout-sensitive parsing.
Reasoning about object-oriented applications requires developers to answer contextual questions about their domain objects. Tailored development tools can support developers in this activity by providing relevant doma...
详细信息
ISBN:
(纸本)9781450344371
Reasoning about object-oriented applications requires developers to answer contextual questions about their domain objects. Tailored development tools can support developers in this activity by providing relevant domain-specific information. Nonetheless, a high effort for extending development tools to handle domain-specific objects, together with diverging mechanisms for creating, sharing and discovering extensions, discourage developers to adapt their tools. To address this, we propose to enable contextual behavior in development tools by allowing domain objects to decide how they are handled in development tools. We show that combining this idea with mechanisms for specifying extensions using internal DSLs can significantly reduce the cost of tailoring development tools to specific domains.
We present short programs that demonstrate the unsoundness of Java and Scala's current type systems. In particular, these programs provide parametrically polymorphic functions that can turn any type into any type ...
详细信息
The interoperability of applications depends on a successful mapping between their domain models. Nowadays, common file formats serve as a mediator between the different domain models but cause friction losses during ...
详细信息
ISBN:
(纸本)9781450344371
The interoperability of applications depends on a successful mapping between their domain models. Nowadays, common file formats serve as a mediator between the different domain models but cause friction losses during the conversion of data. These loses could be mitigated whenever the models are already working on the same concepts but are only using different representations for them. We propose the concept of deducing classes which interpret existing object structures and detect instances of themselves in this existing data. Further, we introduce a planning algorithm which combines deducing classes to allow unanticipated interactions between applications. We discuss some of the implications of this approach and illustrate upcoming research challenges.
The majority of modern programminglanguages provide concurrency and object-orientation in some form. However, object-oriented concurrency remains cumbersome in many situations. We introduce the language OrcO, Orc wit...
详细信息
We present a language-independent verification framework that can be instantiated with an operational semantics to automatically generate a program verifier. The framework treats both the operational semantics and the...
详细信息
ISBN:
(纸本)9781450344449
We present a language-independent verification framework that can be instantiated with an operational semantics to automatically generate a program verifier. The framework treats both the operational semantics and the program correctness specifications as reachability rules between matching logic patterns, and uses the sound and relatively complete reachability logic proof system to prove the specifications using the semantics. We instantiate the framework with the semantics of one academic language, KERNELC, as well as with three recent semantics of real-world languages, C, JAVA, and JAVASCRIPT, developed independently of our verification infrastructure. We evaluate our approach empirically and show that the generated program verifiers can check automatically the full functional correctness of challenging heap-manipulating programs implementing operations on list and tree data structures, like AVL trees. This is the first approach that can turn the operational semantics of real-world languages into correct-by-construction automatic verifiers.
The proceedings contain 52 papers. The topics discussed include: automatic parallelization of pure method calls via conditional future synthesis;portable inter-workgroup barrier synchronisation for GPUs;semantics-base...
ISBN:
(纸本)9781450344449
The proceedings contain 52 papers. The topics discussed include: automatic parallelization of pure method calls via conditional future synthesis;portable inter-workgroup barrier synchronisation for GPUs;semantics-based program verifiers for all languages;hoare-style specifications as correctness conditions for non-linearizable concurrent objects;modeling and analysis of remote memory access programming;deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations;speeding up machine-code synthesis;extensible access control with authorization contracts;and gentrification gone too far? affordable 2nd-class values for fun and (co)effect.
暂无评论