Sciweavers

861 search results - page 18 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
SIGSOFT
2008
ACM
15 years 10 months ago
Modular verification of web services using efficient symbolic encoding and summarization
We propose a novel method for modular verification of web service compositions. We first use symbolic fixpoint computations to derive conditions on the incoming messages and relat...
Fang Yu, Chao Wang, Aarti Gupta, Tevfik Bultan
ANCS
2007
ACM
15 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos
PPDP
2007
Springer
15 years 4 months ago
Computing with subspaces
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
Sergio Antoy, Bernd Braßel
WWW
2006
ACM
15 years 10 months ago
Using symbolic objects to cluster web documents
Web Clustering is useful for several activities in the WWW, from automatically building web directories to improve retrieval performance. Nevertheless, due to the huge size of the...
Esteban Meneses, Oldemar Rodríguez-Rojas
SIGSOFT
2004
ACM
15 years 10 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...