436 search results - page 65 / 88 » Lightweight Rule Induction |
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
TLCA
1997
Springer
14 years 2 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
TPHOL
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
IFM
2007
Springer
14 years 4 months 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...