4940 search results - page 54 / 988 » On the Complexity of Universal Programs |
100
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
108
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
WSC
2004
15 years 3 months ago
2004
This paper presents a research project being developed at the Industrial and Systems Engineering Graduate Program at the Catholic University of Paran
109
click to vote
ICLP
2001
Springer
15 years 6 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
108
click to vote
HICSS
2002
IEEE
15 years 7 months ago
2002
IEEE
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...