4722 search results - page 475 / 945 » Encoding Program Executions |
168
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
159
click to vote
LICS
2009
IEEE
16 years 26 days ago
2009
IEEE
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
161
click to vote
ISSTA
2009
ACM
16 years 22 days ago
2009
ACM
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for...
127
click to vote
CEC
2007
IEEE
16 years 17 days ago
2007
IEEE
— This paper proposes a self-adaptation method to control not only the mutation strength parameter, but also the mutation distribution for evolutionary algorithms. For this purpo...
173
click to vote
IFM
2007
Springer
16 years 11 days ago
2007
Springer
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...