Sciweavers

692 search results - page 44 / 139
» Understanding Finiteness Analysis Using Abstract Interpretat...
Sort
View
POPL
2007
ACM
16 years 4 days ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
AMAST
1998
Springer
15 years 4 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
GFKL
2007
Springer
184views Data Mining» more  GFKL 2007»
15 years 6 months ago
A Probabilistic Relational Model for Characterizing Situations in Dynamic Multi-Agent Systems
Abstract. Artificial systems with a high degree of autonomy require reliable semantic information about the context they operate in. State interpretation, however, is a difficult ...
Daniel Meyer-Delius, Christian Plagemann, Georg vo...
EP
1998
Springer
15 years 4 months ago
Spotting Topics with the Singular Value Decomposition
Abstract. The singular value decomposition, or SVD , has been studied in the past as a tool for detecting and understanding patterns in a collection of documents. We show how the m...
Charles K. Nicholas, Randall Dahlberg
CAV
2008
Springer
122views Hardware» more  CAV 2008»
15 years 1 months ago
Thread Quantification for Concurrent Shape Analysis
In this paper we address the problem of shape analysis for concurrent programs. We present new algorithms, based on abstract interpretation, for automatically verifying properties ...
Josh Berdine, Tal Lev-Ami, Roman Manevich, G. Rama...