Sciweavers

4940 search results - page 11 / 988
» On the Complexity of Universal Programs
Sort
View
SIGSOFT
2000
ACM
13 years 11 months ago
The universe model: an approach for improving the modularity and reliability of concurrent programs
We present the universe model,a new approach to concurrencymanagement that isolates concurrency concerns and represents them in the modular interface of a component. This approach...
Reimer Behrends, Kurt Stirewalt
ICLP
2007
Springer
14 years 1 months ago
Universal Timed Concurrent Constraint Programming
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
Carlos Olarte, Catuscia Palamidessi, Frank Valenci...
JLP
2007
89views more  JLP 2007»
13 years 7 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
IEEECIT
2010
IEEE
13 years 5 months ago
The Development of Online Innovative Education Program in Our University
Grants are offered for faculty to develop technology courseware projects in universities including Hangzhou Dianzi University (HDU). One of the important factors in courseware deve...
Wei-hua Hu, Jiang-tao Du, Qi-li Zhou, Dao-ping Hon...
CIE
2009
Springer
14 years 2 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée