159 search results - page 30 / 32 » Verifying the Equivalence of Logic Programs in the Disjuncti... |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
DOCENG
2006
ACM
14 years 1 months ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
ISSTA
2009
ACM
14 years 1 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...