Sciweavers

10899 search results - page 531 / 2180
» The GP Programming System
Sort
View
PLDI
2009
ACM
16 years 1 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
IWMM
2009
Springer
107views Hardware» more  IWMM 2009»
16 years 1 months ago
Self-recovery in server programs
It is important that long running server programs retain availability amidst software failures. However, server programs do fail and one of the important causes of failures in ser...
Vijay Nagarajan, Dennis Jeffrey, Rajiv Gupta
PLDI
2006
ACM
16 years 1 months ago
Refactoring programs to secure information flows
Adding a sound information flow security policy to an existing program is a difficult task that requires major analysis of and changes to the program. In this paper we show how ...
Scott F. Smith, Mark Thober
LPNMR
2009
Springer
15 years 11 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 7 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini