Sciweavers

949 search results - page 138 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
AISC
2008
Springer
13 years 10 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...
CONCUR
2009
Springer
14 years 3 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...

Source Code
579views
14 years 4 months ago
The CImg Library
The CImg Library is an open source, C++ toolkit for image processing, designed with these properties in mind : Usefulness CImg defines classes and methods to manage images in y...
David Tschumperlé
FOCS
2009
IEEE
14 years 3 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
EUROMICRO
2009
IEEE
14 years 3 months ago
Dynamic Software Architecture Development: Towards an Automated Process
—We propose a software engineering process to aid the development of Dynamic Software Architectures (DSAs). This process is based on the sequential application of a number of for...
Maurice H. ter Beek, Antonio Bucchiarone, Stefania...