WebDSL is a domain-specific language for the implementation of dynamic web applications with a rich data model. It provides developers with object-oriented data modeling concepts but abstracts over implementation deta...
详细信息
ISBN:
(纸本)9781450306898
WebDSL is a domain-specific language for the implementation of dynamic web applications with a rich data model. It provides developers with object-oriented data modeling concepts but abstracts over implementation details for persisting application data in relational databases. When the underlying data model of an application evolves, persisted application data has to be migrated. While implementing migration at the database level breaks the abstractions provided by WebDSL, an implementation at the data model level requires to intermingle migration with application code. In this paper, we present a domain-specific language for the coupled evolution of data models and application data. It allows to specify data model evolution as a separate concern at the data model level and can be compiled to migration code at the database level. Its linguistic integration with WebDSL enables static checks for evolution validity and correctness.
the proceedings contain 16 papers. the special focus in this conference is on Coordination Models and languages. the topics include: Replica-based high-performance tuple space computing;investigating fluid-flow semant...
ISBN:
(纸本)9783319192819
the proceedings contain 16 papers. the special focus in this conference is on Coordination Models and languages. the topics include: Replica-based high-performance tuple space computing;investigating fluid-flow semantics of asynchronous tuple-based process languages for collective adaptive systems;a coordination model based on logic inference;distributed logic programming for decentralized mobile ensembles;safe runtime updates of distributed applications;type reconstruction algorithms for deadlock-free and lock-free linear π-calculi;a fixpoint-based calculus for graph-shaped computational fields;take command of your constraints;a labelled semantics for soft concurrent constraint programming;parallelisation and application of AD3 as a method for solving large scale combinatorial auctions;handling agent perception in heterogeneous distributed systems;blending event-based and multi-agent systems around coordination abstractions;a modeling language for distributed database applications;open transactions on shared memory;VISIRI - distributed complex event processing system for handling large number of queries.
Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design for some time. However, their application to the development of large systems requires more em...
ISBN:
(数字)9783642358876
ISBN:
(纸本)9783642358869
Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design for some time. However, their application to the development of large systems requires more emphasis on specification, modeling, and validation techniques supporting the concepts of reusability and modifiability, and their implementation in new extensions of existing programminglanguages like *** book contains 20 revised papers submitted after the 10thsymposium on Formal Methods for Components and Objects, FMCO 2011, which was held in Turin, Italy, in October 2011. Topics covered include autonomic service-component ensembles; trustworthy eternal systems via evolving software, data, and knowledge; parallel patterns for adaptive heterogeneous multicore systems; programming for future 3D architectures with many cores; formal verification of object oriented software; and an infrastructure for reliable computer systems.
In this paper, we present an implementation of a modular synthesizer in Haskell using Yampa. A synthesizer, be it a hardware instrument or a pure software implementation, as here, is said to be modular if it provides ...
详细信息
ISBN:
(纸本)9783540774419
In this paper, we present an implementation of a modular synthesizer in Haskell using Yampa. A synthesizer, be it a hardware instrument or a pure software implementation, as here, is said to be modular if it provides sound-generating and sound-shaping components that can be interconnected in arbitrary ways. Yampa, a Haskell-embedded implementation of Functional Reactive programming, supports flexible, purely declarative construction of hybrid systems. Since music is a hybrid continuous-time and discrete-time phenomenon, Yampa is a good fit for such applications, offering some unique possibilities compared to most languages targeting music or audio applications. through the presentation of our synthesizer application, we demonstrate this point and provide insight into the Yampa approach to programming reactive, hybrid systems. We develop the synthesizer gradually, starting with fundamental synthesizer components and ending with an application that is capable of rendering a standard MIDI file as audio with respectable performance.
Many different parallel languages and paradigms have been developed, each with its own advantages. To benefit from all of them, it should be possible to link together modules written in different parallel languages in...
详细信息
Many different parallel languages and paradigms have been developed, each with its own advantages. To benefit from all of them, it should be possible to link together modules written in different parallel languages in a single application. Since the paradigms sometimes differ in fundamental ways, this is difficult to accomplish. this paper describes a framework, Converse, that supports such multi-lingual interoperability. the framework is meant to be inclusive, and has been verified to support the SPMD programming style, message-driven programming, parallel object-oriented programming, and thread-based paradigms. the framework aims at extracting the essential aspects of the runtime support into a set of core components, so that language-specific code does not have to pay overhead for features that it does not need.
Functional languages have been the backbone of Galois' business for the past eight years. they have been very good for us, but not without their own share of challenges. In this talk, we shall stand back and exami...
详细信息
Fine-grained concurrent object-oriented programming (COOP) models can simplify the programming of irregular parallel applications but are often perceived as inefficient. In this paper, we study implementation techniqu...
详细信息
Fine-grained concurrent object-oriented programming (COOP) models can simplify the programming of irregular parallel applications but are often perceived as inefficient. In this paper, we study implementation techniques to obtain efficient parallel execution of fine-grained COOP languages using a medium-sized protein dynamics program. We found that even with high data locality and good sequential code efficiency, an implementation using only thread-oriented optimizations and software multithreading fails to achieve parallel efficiency. the two major sources of overhead are the lack of processor-level data reuse and fine-grained threads for remote object accesses. Two processor-oriented optimizations, processor-level caching and communication grouping, overcome these inefficiencies and achieve performance comparable to a highly-tuned SPMD program.
Nonlinear constraint satisfaction or optimisation models need to be reduced to equivalent linear forms before they can be solved by (Integer) Linear programming solvers. A choice of linearisation methods exist. there ...
详细信息
ISBN:
(纸本)9783540774419
Nonlinear constraint satisfaction or optimisation models need to be reduced to equivalent linear forms before they can be solved by (Integer) Linear programming solvers. A choice of linearisation methods exist. there are generic linearisations and constraint-specific, user-defined linearisations. Hence a model reformulation system needs to be flexible and open to allow complex and novel linearisations to be specified. In this paper we show how the declarative model reformulation system CADMIUM can be used to effectively transform constraint problems to different linearisations, allowing easy exploration of linearisation possibilities.
Allocating data fragments in distributed database systems is an important issue in distributed database (DDB) systems. In this research work, we will show how rule based policy languages can be used to represent diffe...
详细信息
Allocating data fragments in distributed database systems is an important issue in distributed database (DDB) systems. In this research work, we will show how rule based policy languages can be used to represent different data fragment allocation techniques. Results indicate that, using rule based languages like prolog can significantly simplify the representation of such algorithms for any further developments and optimizations. Our examples show that our approach can be extended to be used in different areas of distributed systems.
the proceedings contain 31 papers. the special focus in this conference is on Static Analysis and Software Methodologies. the topics include: Logic programming and model checking;the copying approach to tabling;a mult...
ISBN:
(纸本)3540650121
the proceedings contain 31 papers. the special focus in this conference is on Static Analysis and Software Methodologies. the topics include: Logic programming and model checking;the copying approach to tabling;a multithreaded execution environment for sicstus prolog;a framework for bottom up specialisation of logic programs;termination of logic programs with block declarations running in several modes;the boolean logic of set sharing analysis;derivation of proof methods by abstract interpretation;detecting unsolvable queries for definite logic programs;staging static analyses using abstraction-based program specialization;type domains and type representations for logic programs;a methodology for language development;explicit substitutions for objects and functions;the complexity of late-binding in dynamic object-oriented languages;a compiler for rewrite programs in associative-commutative theories;solution to the problem of zantema on a persistent property of term rewriting systems;a general framework for r-unification problems;operational versus denotational methods in the semantics of higher order languages;functional implementations of continuous modeled animation;compiling erlang to scheme;compiling lazy functional programs for the java virtual machine;a game semantics foundation for logic programming;controlling search in declarative programs;encapsulating data in logic programming via categorical constraints;constructive negation using typed existence properties;optimal reduction of functional expressions;embedding multiset constraints into a lazy functional logic language;a hidden herbrand theorem and integrating constraint propagation in complete solving of linear diophantine systems.
暂无评论