Sciweavers

1911 search results - page 358 / 383
» Program analysis for code duplication in logic programs
Sort
View
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 7 days ago
Tight Upper Bounds for Streett and Parity Complementation
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Yang Cai, Ting Zhang
DBPL
1991
Springer
66views Database» more  DBPL 1991»
13 years 12 months ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
MSR
2006
ACM
14 years 2 months ago
Using software birthmarks to identify similar classes and major functionalities
Software birthmarks are unique and native characteristics of every software component. Two components having similar birthmarks indicate that they are similar in functionality, st...
Takeshi Kakimoto, Akito Monden, Yasutaka Kamei, Ha...
PERCOM
2003
ACM
14 years 8 months ago
Self-Routing in Pervasive Computing Environments Using Smart Messages
Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive...
Cristian Borcea, Chalermek Intanagonwiwat, Akhiles...
PDP
2009
IEEE
14 years 3 months ago
PsycoTrace: Virtual and Transparent Monitoring of a Process Self
PsycoTrace is a set of tools to protect a process P from attacks that alter P self as specified by its source code. P self is specified in terms of legal traces of system calls ...
Fabrizio Baiardi, Dario Maggiari, Daniele Sgandurr...