Sciweavers

JSW
2007
66views more  JSW 2007»
13 years 11 months ago
Implementing Model-Based Data Structures using Transient Model Extensions
— Software is often constructed using a layered approach to encapsulate various functionality in corresponding layers. Individual requirements of each layer demand layer specifi...
Michael Thonhauser, Gernot Schmoelzer, Christian K...
JSS
2007
126views more  JSS 2007»
13 years 11 months ago
Fine-grain analysis of common coupling and its application to a Linux case study
Common coupling (sharing global variables across modules) is widely accepted as a measure of software quality and maintainability; a low level of common coupling is necessary (but...
Dror G. Feitelson, Tokunbo O. S. Adeshiyan, Daniel...
RSA
2006
144views more  RSA 2006»
13 years 11 months ago
Data structures with dynamical random transitions
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
Clément Dombry, Nadine Guillotin-Plantard, ...
PPL
2008
99views more  PPL 2008»
13 years 11 months ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava
JGTOOLS
2006
80views more  JGTOOLS 2006»
13 years 11 months ago
A Fast Method for Local Penetration Depth Computation
In this appendix, we provide some details on the data structures used to cluster the intersection segments. Although the data structures are fairly classical (a heap, a grid and a...
Stephane Redon, Ming C. Lin
JSAT
2008
79views more  JSAT 2008»
13 years 11 months ago
PicoSAT Essentials
In this article we describe and evaluate optimized compact data structures for watching literals. Experiments with our SAT solver PicoSAT show that this low-level optimization not...
Armin Biere
JAR
2006
236views more  JAR 2006»
13 years 11 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
FGCS
2006
125views more  FGCS 2006»
13 years 11 months ago
Compressible memory data structures for event-based trace analysis
The article presents a new compressible memory data structure for trace events. Its primary intention is to aid the analysis of huge traces by reducing the memory requirements sig...
Andreas Knüpfer, Wolfgang E. Nagel
ENTCS
2006
109views more  ENTCS 2006»
13 years 11 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
CORR
2006
Springer
98views Education» more  CORR 2006»
13 years 11 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters