Developing adaptable mobile application software is very difficult. An adaptability in multilingual mobile software becomes inevitable numerous changes. this paper presents not only perimeter reusability, but also mak...
详细信息
ISBN:
(纸本)9781510812277
Developing adaptable mobile application software is very difficult. An adaptability in multilingual mobile software becomes inevitable numerous changes. this paper presents not only perimeter reusability, but also makes modification invasive changes to meet new requirements for the mobile software design of multilingual mobile application software. the multilingual mobile software has to reengineer, in order to meet the new language requirements. A misunderstanding that an object-oriented approach generally endorses adaptability, as none of these problems is routinely imposed. Software designers and developers have to specifically considered software making adaptability stress-free. We present a mobile application framework which is a better supporting adaptability. In the framework, functional components and nonfunctional components are relatively separated. this technique makes multilingual mobile software developing much better adaptability. A framework enables manageable reusability and adaptability for building of multilingual mobile software. Our research focuses on a decomposition of an interaction in a multilingual mobile software development and our goal is to demonstrate a better model of multilingual mobile software design and development.
Sketch-based synthesis, epitomized by the SKETCH tool, lets developers synthesize software starting from a partial program., also called a,sketch or template. this paper presents JSKETCH, a tool that brings sketcli-ba...
详细信息
ISBN:
(纸本)9781450336758
Sketch-based synthesis, epitomized by the SKETCH tool, lets developers synthesize software starting from a partial program., also called a,sketch or template. this paper presents JSKETCH, a tool that brings sketcli-based synthesis to Java. JSKETCH'S input is a partial Java program that may include holes, which are unknown constants, expression generators, which range over sets of expressions, and class generators, which are partial classes. JSKETCH then translates the synthesis problem into a SKETCH problem;this translation is complex because SKETCH is not objectoriented. Finally, JSKETCH synthesizes an executable Java program by interpreting the output of SKETCH.
Easily programming behaviors is one major issue of a large and reconfigurable deployment in the Internet of things. Such kind of devices often requires to externalize part of their behavior such as the sensing, the da...
详细信息
ISBN:
(纸本)9781450336543
Easily programming behaviors is one major issue of a large and reconfigurable deployment in the Internet of things. Such kind of devices often requires to externalize part of their behavior such as the sensing, the data aggregation or the code offloading. Most existing context-orientedprogramming languages integrate in the same class or close layers the whole behavior. We propose to abstract and separate the context tracking from the decision process, and to use event-based handlers to interconnect them. We keep a very easy declarative and non-layered programming model. We illustrate by defining an extension to Golo - a JVM-based dynamic language.
Over the past 20 years, programmers have embraced dynamically-typed programming languages. By now, they have also come to realize that programs in these languages lack reliable type information for software engineerin...
详细信息
In this paper, we introduce a new Eclipse-based IDE for teaching Java following the object-later approach. In particular, this IDE allows the programmer to write code in Java-, a smaller version of the Java language t...
详细信息
Context sensitivity is a technique to improve program analysis precision by distinguishing between function calls. A specific context-sensitive analysis is usually designed to accommodate the programming paradigm of a...
详细信息
the proceedings contain 35 papers. the special focus in this conference is on programming Languages and Systems. the topics include: Static analysis of spreadsheet applications for type-unsafe operations detection;run...
ISBN:
(纸本)9783662466681
the proceedings contain 35 papers. the special focus in this conference is on programming Languages and Systems. the topics include: Static analysis of spreadsheet applications for type-unsafe operations detection;running probabilistic programs backwards;a verified compiler for probability density functions;segment abstraction for worst-case execution time analysis;automatic static cost analysis for parallel programs;sound, modular and compositional verification of the input/output behavior of programs;unrestricted termination and non-termination arguments for bit-vector programs;combining navigational and pattern matching approaches;the problem of PL concurrency semantics;trading efficiency and optimality in fence insertion for TSO;specifying and verifying concurrent algorithms with histories and subjectivity;automatically generating well-typed terms from the definition of a type-system;refinement types for incremental computational complexity;monotonic references for efficient gradual typing;inter-procedural two-variable herbrand equalities;desynchronized multi-state abstractions for open programs in dynamic languages;fine-grained detection of privilege escalation attacks on browser extensions;analysis of asynchronous programs with event-based synchronization;a new approach to practical complete predicate refinement;propositional reasoning about safety and termination of heap-manipulating programs;concurrent local subjective logic;a separation logic for fictional sequential consistency;binding structures as an abstract data type and type-based allocation analysis for co-recursion in lazy functional languages.
Streaming libraries have become ubiquitous in object-oriented languages, with recent offerings in Java, C#, and Scala. All such libraries, however, suffer in terms of extensibility: there is no way to change the seman...
详细信息
We present Saul, a new probabilistic programming language designed to address some of the shortcomings of programming languages that aim at advancing and simplifying the development of AI systems. Such languages need ...
详细信息
ISBN:
(纸本)9781577357384
We present Saul, a new probabilistic programming language designed to address some of the shortcomings of programming languages that aim at advancing and simplifying the development of AI systems. Such languages need to interact with messy, naturally occurring data, to allow a programmer to specify what needs to be done at an appropriate level of abstraction rather than at the data level, to be developed on a solid theory that supports moving to and reasoning at this level of abstraction and, finally, to support flexible integration of these learning and inference models within an application program. Saul is an object-functional programming language written in Scala that facilitates these by (1) allowing a programmer to learn, name and manipulate named abstractions over relational data;(2) supporting seamless incorporation of trainable (probabilistic or discriminative) components into the program, and (3) providing a level of inference over trainable models to support composition and make decisions that respect domain and application constraints. Saul is developed over a declaratively defined relational data model, can use piecewise learned factor graphs with declaratively specified learning and inference objectives, and it supports inference over probabilistic models augmented with declarative knowledge-based constraints. We describe the key constructs of Saul and exemplify its use in developing applications that require relational feature engineering and structured output prediction.
All current implementations of Java Virtual Machines allow the creation of one-dimensional arrays of length smaller than 2(31) elements. In addition, since Java lacks true multidimensional arrays, most of numerical li...
详细信息
ISBN:
(纸本)9781467378130
All current implementations of Java Virtual Machines allow the creation of one-dimensional arrays of length smaller than 2(31) elements. In addition, since Java lacks true multidimensional arrays, most of numerical libraries use one-dimensional arrays to store multidimensional data. Withthe current limitation, it is not possible to store volumes of size larger than 1290(3). On the other hand, the data from scientific simulations or medical scanners continuously grow in size and it is not uncommon to go beyond that limit. this work addresses the problem of maximal size of one-dimensional Java arrays. JLargeArrays is a Java library of one-dimensional arrays that can store up to 2(63) elements. Performance comparison with native Java arrays and Fastutil library shows that JLargeArrays is the fastest solution overall. Possible applications in Java collections as well as numerical and visualization frameworks are also discussed.
暂无评论