Sciweavers

192 search results - page 26 / 39
» Considerations on Updates of Logic Programs
Sort
View
WCRE
2007
IEEE
14 years 2 months ago
Parametric Process Model Inference
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
Saurabh Sinha, G. Ramalingam, Raghavan Komondoor
LPNMR
1990
Springer
14 years 19 days ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
POPL
1998
ACM
14 years 25 days ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
SIGSOFT
2002
ACM
14 years 9 months ago
Improving program slicing with dynamic points-to data
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...
LPNMR
2009
Springer
14 years 1 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