1715 search results - page 300 / 343 » Domain-Specific Program Checking |
SLE
2009
Springer
14 years 2 months ago
2009
Springer
One of the most ubiquitous elements of modern computing is the relational database. Very few modern applications are created without some sort of database backend. Unfortunately, r...
DOCENG
2009
ACM
14 years 2 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
This paper presents techniques for analyzing channel contract specifications in Microsoft Research’s Singularity operating system. A channel contract is a state machine that sp...
CP
2007
Springer
14 years 1 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive sin...