Sciweavers

116 search results - page 11 / 24
» Heap-Dependent Expressions in Separation Logic
Sort
View
ISSTA
2004
ACM
14 years 29 days ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
WISE
2002
Springer
14 years 13 days ago
Towards Declarative XML Querying
How to extract data from XML documents is an important issue for XML research and development. However, how to view XML documents determines how they can be queried. In this paper...
Mengchi Liu, Tok Wang Ling
SGP
2003
13 years 9 months ago
A geometric database for gene expression data
As the logical next step after sequencing the mouse genome, biologists have developed laboratory methods for rapidly determining where each of the 30K genes in the mouse genome is...
Joe D. Warren, Tao Ju, Gregor Eichele, Christina T...
ICLP
1999
Springer
13 years 11 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
14 years 8 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...