222 search results - page 29 / 45 » Subject Reduction of Logic Programs as Proof-Theoretic Prope... |
POPL
2007
ACM
14 years 7 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
We introduce transactors, a fault-tolerant programming model for composing loosely-coupled distributed components running in an unreliable environment such as the internet into sy...
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
PEPM
2011
ACM
12 years 10 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...