We present a first-order extension of the algebraic theory about processes known as ACP and its main models. Useful predicates on processes, such as deadlock freedom and determinism, can be added to this theory throug...
详细信息
In a previous paper, we developed an algebraic theory of threads and multi-threads based on strategic interleaving. This theory includes a number of plausible interleaving strategies on thread vectors. The strategic i...
详细信息
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined func...
详细信息
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph. Each function is compiled into an instruction sequence for an abstract graph reduction machine, called the G-machine, the code reduces a function application graph to its value. The G-machine instructions are then translated into target code. Speed improvements by almost two orders of magnitude over previous lazy evaluators have been measured;we provide some performance figures.
A case study on the simulation of a local area network (LAN) that has been used at Vrije Universiteit Brissel (VUB) and the University of Bern to illustrate evolution of object-oriented programs, is reported. The stud...
详细信息
A case study on the simulation of a local area network (LAN) that has been used at Vrije Universiteit Brissel (VUB) and the University of Bern to illustrate evolution of object-oriented programs, is reported. The study is intended to illustrate modeling support for software evolution. The case consists of an initial version of the simulation program and a series of changes in the specification that require it to evolve. The evolution of the program corresponds to a series of four consecutive requirements at the level of the LAN, which must be incorporated into the simulation program.
In the advent of ambient intelligence, introducing ubiquitous mobile systems and services in general and mobile code in particular, network latency becomes a critical factor, especially in wireless, low-bandwidth envi...
详细信息
We describe a proof dedicated meta-language, called Ltac, in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local automations. Ltac, is essentially a sm...
详细信息
We describe a proof dedicated meta-language, called L tac , in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local automations. L tac , is essentia...
We describe a proof dedicated meta-language, called
L
tac , in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local automations.
L
tac , is essentially a small functional core with recursors and powerful pattern-matching operators for Coq terms but also for proof contexts. As
L
tac , is not complete, we describe an interface between
L
tac , and the full programmable meta-language of the system (Objective CAML), which is also the implementation language. This interface is based on a quotation system where we can use
L
tac ,'s syntax in ML files, and where it is possible to insert ML code in
L
tac , scripts by means of antiquotations. In that way, the two meta-languages are not opposed and we give an example where they fairly cooperate. Thus, this shows that a LCF-like system with a two-level meta-language is completely realistic.
As concurrent software systems become larger, the interaction of their components is becoming more complex. This interaction may limit reuse, making it difficult to validate design and correctness and perhaps forcing ...
详细信息
ISBN:
(纸本)0769510809
As concurrent software systems become larger, the interaction of their components is becoming more complex. This interaction may limit reuse, making it difficult to validate design and correctness and perhaps forcing reengineering of these systems in order to meet future requirements. In order to reduce this complexity and to build stable and adaptable concurrent software systems, we present an approach that emphasizes the separation of interaction components from the functional components.
暂无评论