2911 search results - page 480 / 583 » A Logic of Graph Constraints |
SIGSOFT
2006
ACM
16 years 1 months ago
2006
ACM
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
97
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...
102
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
We present the key ideas in the design and implementation of Beaver, an SMT solver for quantifier-free finite-precision bit-vector logic (QF BV). Beaver uses an eager approach, enc...
125
Voted
CADE
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
80
Voted
ICFP
2005
ACM
16 years 17 days ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...