Sciweavers

4940 search results - page 134 / 988
» On the Complexity of Universal Programs
Sort
View
ATAL
2006
Springer
15 years 8 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
CGO
2004
IEEE
15 years 8 months ago
VHC: Quickly Building an Optimizer for Complex Embedded Architectures
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
Michael Dupré, Nathalie Drach, Olivier Tema...
ESOP
2010
Springer
16 years 2 months ago
A Grammar-based Approach to Invertible Programs
Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by man...
Kazutaka Matsuda, Shin-Cheng Mu, Zhenjiang Hu and ...
KGC
1997
Springer
15 years 8 months ago
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
Bernd Borchert, Frank Stephan
CAINE
2006
15 years 6 months ago
Complexity issues in control software design: A practical perspective
There is a tendency to overlook or play down software issues in industrial systems design. However the very best hardware will only be as effective as the programs that control it...
Vic Grout, Stuart Cunningham