Sciweavers

9626 search results - page 332 / 1926
» Invariant Based Programming
Sort
View
DRMTICS
2005
Springer
16 years 5 days ago
Call Tree Transformation for Program Obfuscation and Copy Protection
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
Valery Pryamikov
LPNMR
2004
Springer
16 years 12 hour ago
Using Criticalities as a Heuristic for Answer Set Programming
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman
NMR
2004
Springer
16 years 9 hour ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
226
Voted
SCAM
2002
IEEE
15 years 11 months ago
Dynamic Slicing Object-Oriented Programs for Debugging
Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains...
Baowen Xu, Zhenqiang Chen, Hongji Yang
EOR
2006
65views more  EOR 2006»
15 years 6 months ago
Dynamic programming and minimum risk paths
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
Paolo Serafini