Sciweavers

861 search results - page 5 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
HOA
1993
14 years 1 months ago
Strong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewri...
Steffen van Bakel, Maribel Fernández
ISSTA
2010
ACM
13 years 11 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold
EMNLP
2004
13 years 11 months ago
Automatic Analysis of Plot for Story Rewriting
A method for automatic plot analysis of narrative texts that uses components of both traditional symbolic analysis of natural language and statistical machine-learning is presente...
Harry Halpin, Johanna D. Moore, Judy Robertson
BIRTHDAY
2007
Springer
14 years 4 months ago
Orderings and Constraints: Theory and Practice of Proving Termination
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
Cristina Borralleras, Albert Rubio
ENTCS
2007
168views more  ENTCS 2007»
13 years 9 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...