Sciweavers

861 search results - page 60 / 173
» Symbolic Program Analysis Using Term Rewriting and Generaliz...
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ESOP
2007
Springer
15 years 9 months ago
Anti-pattern Matching
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. In a previous work, we hav...
Claude Kirchner, Radu Kopetz, Pierre-Etienne Morea...
SAC
2009
ACM
15 years 10 months ago
Points-to analysis for JavaScript
JavaScript is widely used by web developers and the complexity of JavaScript programs has increased over the last year. Therefore, the need for program analysis for JavaScript is ...
Dongseok Jang, Kwang-Moo Choe
SIGSOFT
2005
ACM
16 years 3 months ago
CUTE: a concolic unit testing engine for C
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry fu...
Koushik Sen, Darko Marinov, Gul Agha
SAC
2006
ACM
15 years 9 months ago
Making tuple spaces physical with RFID tags
In this paper, we describe the design and implementation of a tuple-based distributed memory realized with the use of RFID technology. The key idea – rooted in a more general sc...
Marco Mamei, Renzo Quaglieri, Franco Zambonelli