4940 search results - page 231 / 988 » On the Complexity of Universal Programs |
142
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This position paper explores the issues related to the feasibility of having a primarily digital research library support the teaching and research needs of a university. The Asia...
265
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
153
click to vote
JAPLL
2006
15 years 6 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
148
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
195
click to vote
ALC
1997
15 years 7 months ago
1997
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting components, new dimensions and new problems arise in the ca...