Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
The Task Computing framework is designed to operate in dynamic ubiquitous environments in which a mobile computing user dynamically discovers the current set of available semantic...
Zhexuan Song, Ryusuke Masuoka, Jonathan R. Agre, Y...
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two con...