Sciweavers

336 search results - page 9 / 68
» Program Speedups in Theory and Practice
Sort
View
POPL
2008
ACM
14 years 7 months ago
A theory of contracts for web services
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
Giuseppe Castagna, Nils Gesbert, Luca Padovani
IPPS
2000
IEEE
13 years 11 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
AOSD
2009
ACM
13 years 11 months ago
The dataflow pointcut: a formal and practical framework
Some security concerns are sensitive to flow of information in a program execution. The dataflow pointcut has been proposed by Masuhara and Kawauchi in order to easily implement s...
Dima Alhadidi, Amine Boukhtouta, Nadia Belblidia, ...
DATE
2004
IEEE
92views Hardware» more  DATE 2004»
13 years 11 months ago
Optimization of Integrated Spiral Inductors Using Sequential Quadratic Programming
The optimization of integrated spiral inductors has great practical importance. Previous optimization methods used in this field are either too slow or depend on very simplified a...
Yong Zhan, Sachin S. Sapatnekar
TAGT
1994
Springer
154views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Issues in the Practical Use of Graph Rewriting
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
Dorothea Blostein, Hoda Fahmy, Ann Grbavec