Sciweavers

581 search results - page 80 / 117
» Abstract Semantics by Observable Contexts
Sort
View
SIGSOFT
2004
ACM
15 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
IWSEC
2009
Springer
15 years 4 months ago
Tamper-Tolerant Software: Modeling and Implementation
Abstract. Common software-protection systems attempt to detect malicious observation and modification of protected applications. Upon tamper detection, anti-hacking code may produ...
Mariusz H. Jakubowski, Chit Wei Saw, Ramarathnam V...
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
14 years 10 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
IANDC
2008
84views more  IANDC 2008»
14 years 9 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
GPEM
2010
89views more  GPEM 2010»
14 years 8 months ago
Variable population size and evolution acceleration: a case study with a parallel evolutionary algorithm
Abstract With current developments of parallel and distributed computing, evolutionary algorithms have benefited considerably from parallelization techniques. Besides improved com...
Ting Hu, Simon Harding, Wolfgang Banzhaf