213 search results - page 37 / 43 » Automated Termination Analysis for Logic Programs with Cut |
CADE
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
OSDI
2008
ACM
15 years 10 months ago
2008
ACM
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
ACSC
2006
IEEE
15 years 3 months ago
2006
IEEE
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
The number and the importance of web applications have increased rapidly over the last years. At the same time, the quantity and impact of security vulnerabilities in such applica...
102
click to vote
JELIA
2010
Springer
14 years 7 months ago
2010
Springer
Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the t...