Sciweavers

3562 search results - page 461 / 713
» Introduction to Logic Programming
Sort
View
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
16 years 7 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...
ICFP
2008
ACM
16 years 6 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
POPL
2010
ACM
16 years 4 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
FROCOS
2009
Springer
16 years 1 months ago
Combining Nonmonotonic Knowledge Bases with External Sources
The developments in information technology during the last decade have been rapidly changing the possibilities for data and knowledge access. To respect this, several declarative k...
Thomas Eiter, Gerhard Brewka, Minh Dao-Tran, Micha...
ICSE
1997
IEEE-ACM
15 years 10 months ago
Analyzing Partially-Implemented Real-Time Systems
—Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, ...
George S. Avrunin, James C. Corbett, Laura K. Dill...