The development tools like compilers, debuggers and integrated development environments (IDE) are getting slicker and glossier. The "Development Tools for Dummies" concept are important as talented labor is ...
详细信息
The development tools like compilers, debuggers and integrated development environments (IDE) are getting slicker and glossier. The "Development Tools for Dummies" concept are important as talented labor is not always handy and also these tools are good enough. More paint-by-the-numbers compilers, automatic code generators, colorful IDEs and snap-together developjment boards are going to be available in the market. This is a sign of a maturing industry, when innovation slows down a bit and companies start to rely on marketing, service, style and reputation to sell.
Haskell programmers often use a multi-parameter type class in which one or more type parameters are functionally dependent on the first. Although such functional dependencies have proved quite popular in practice, the...
详细信息
This paper presents an approach for the automatic generation of shortest Distinguishing Sequences (DS) with the Uppaal model checker. The presented method is applicable to a large number of extended finite state machi...
详细信息
ISBN:
(纸本)1595931155
This paper presents an approach for the automatic generation of shortest Distinguishing Sequences (DS) with the Uppaal model checker. The presented method is applicable to a large number of extended finite state machines and it will find an optimal result, if a DS sequence exists for the considered automaton. Our approach is situated in an integrated testing environment that is used to generate checking sequences. The generation method is based on a DS model, which is derived from the same test model that is used for generating test cover sets. The problem of generating DS is reduced to the definition of a DS model and for this reason the complexity of our approach depends mainly on the used model checking algorithm. This means, that the presented method is automatically improved, when the model checking algorithm is improved. This includes the generation of optimal DS depending on the ability of the model checker to produce optimal results. Copyright 2005 ACM.
In this paper we present the LearnLib, a library for automata learning and experimentation. Its modular structure allows users to configure their tailored learning scenarios, which exploit specific properties of the e...
详细信息
ISBN:
(纸本)1595931481
In this paper we present the LearnLib, a library for automata learning and experimentation. Its modular structure allows users to configure their tailored learning scenarios, which exploit specific properties of the envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios. Copyright 2005 ACM.
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, the completely annotated forms are alm...
详细信息
ISBN:
(纸本)1581139993
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, the completely annotated forms are almost never used in practice, since partially annotated forms can be defined which still allow syntax directed type checking. An additional optimization that is used in some proof and type systems is to take advantage of the context of occurrence of terms to further elide type information using bidirectional type checking rules. While this technique is generally effective, we show that there exist bidirectional terms which exhibit asymptotic increases in the size of their type decorations when sequentialized into a named-form calculus (a common first step in compilation). In this paper, we introduce a refinement of the bidirectional type system based on strict logic which allows additional type decorations to be eliminated, and show that it is well-behaved under sequentialization. Copyright 2005 ACM.
With MaTRICS, we describe an architecture for pervasive management of distributed systems. It allows remotely connected users (e.g., system administrators) to modify the configuration of any service provided by a spec...
详细信息
With MaTRICS, we describe an architecture for pervasive management of distributed systems. It allows remotely connected users (e.g., system administrators) to modify the configuration of any service provided by a specific (application) server, like email-, news- or Web-servers. Novel to our approach is that the system can manage configuration processes on heterogeneous software- and hardware- platforms, which are performed from a variety of peripherals unmatched in today's practice. In this sense, we realize a sort of pervasive system management, where devices like mobile phones, faxes, PDAs are enabled to be used by system managers as remote system configuration and management tools.
We propose a framework for top-down Web service interoperation based on an aggressive version of model-driven development (AMDD). The point here is to govern the construction and customization of complex Web applicati...
详细信息
We propose a framework for top-down Web service interoperation based on an aggressive version of model-driven development (AMDD). The point here is to govern the construction and customization of complex Web applications at the model level in a framework that allows application experts to directly formulate their desires in an adequate way. Adequate means in this context that applications can be automatically validated, executed, tested, and deployed by the application experts, inside a framework that takes care also of second-order concerns. Our approach, which focuses on functionalities as the basic entities of the design space is tailored to make second order issues like interoperation, distribution, and compatibility simple for the many, difficult for the few: simple for the many, as the advocated approach hides most of the intricate second-order issues from the application designer, and difficult for the few, as these issues must be dealt with by means of complex compilation, synthesis or technology mappings. Our experience indicates that this approach has the potential to cover and thereby drastically simplify the bulk of modern Web application development and customization
Business process modeling (BPM) is one of the key factors in defining service-oriented solutions for business collaborations. Like in traditional software engineering there is a need for adaptable methodologies to dev...
详细信息
Business process modeling (BPM) is one of the key factors in defining service-oriented solutions for business collaborations. Like in traditional software engineering there is a need for adaptable methodologies to develop information and communication technology (ICT) systems supporting collaborative business processes. In this work we introduce a categorization for the classification of modeling languages and approaches used to model collaborative business processes. Considering an example, we show how the classification of modeling languages and approaches facilitates the development of methodologies for collaborative business processes.
With the industry trend towards multi-core chip, we need to understand the practical issues faced by users who are porting large existing sequential software to a parallel platform. There is much literature on inventi...
详细信息
ISBN:
(纸本)1932415602
With the industry trend towards multi-core chip, we need to understand the practical issues faced by users who are porting large existing sequential software to a parallel platform. There is much literature on inventing, implementing and optimizing parallel algorithms. We study what a user needs in order to come up with an efficient parallel program, starting from a sequential application. We parallelized, debugged and optimized a large, public-domain ray-tracing code (POV-Ray). We built a performance tool to predict parallel POV-Ray's scalability on different platforms. The performance prediction tool and modeling was an important part of the optimization methodology because it guides the user's expectations on the potential benefits of more efforts to identify performance bottlenecks. We describe the steps in our POV-Ray work, and summarize potential relevant research issues. Even for a sequential algorithm which can be "embarrassingly parallelized", there is still much scope for further research to simplify the user's parallelization and optimization efforts.
The semantics of the core features of XML Schema in terms of XQuery 1.0 and XPath 2.0 data model algebraically defined is given. The database state is represented as a many sorted algebra whose sorts are sets of data ...
详细信息
暂无评论