Sciweavers

NJC
2006
125views more  NJC 2006»
13 years 3 months ago
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms
Abstract. We present a new parallel computation model called the Parallel ResourceOptimal computation model. PRO is a framework being proposed to enable the design of efficient and...
Assefaw Hadish Gebremedhin, Mohamed Essaïdi, ...
NJC
2006
59views more  NJC 2006»
13 years 3 months ago
On the Expressive Power of the Loop Language
Tristan Crolard, Samuel Lacas, Pierre Valarcher
NJC
2006
57views more  NJC 2006»
13 years 3 months ago
Towards Unambiguous Model Fragments
In model based design model fragments are used in everyday work. Concurrent operations on separate parts of a model and communication between stakeholders are some examples. Howeve...
Mika Siikarla, Jari Peltonen, Johannes Koskinen
NJC
2006
102views more  NJC 2006»
13 years 3 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
NJC
2006
119views more  NJC 2006»
13 years 3 months ago
A Model-Driven Approach to Variability Management in Product-Line Engineering
Object-oriented frameworks play an essential role in the implementation of product-line architectures (PLAs) for product families. However, recent case studies reveal that deriving...
André L. Santos, Kai Koskimies, Antó...
NJC
2006
86views more  NJC 2006»
13 years 3 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
NJC
2006
88views more  NJC 2006»
13 years 3 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...
NJC
2006
86views more  NJC 2006»
13 years 3 months ago
Axiomatizing Binding Bigraphs
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove tha...
Troels Christoffer Damgaard, Lars Birkedal