Sciweavers

889 search results - page 39 / 178
» Problems in Rewriting III
Sort
View
LPAR
2010
Springer
13 years 7 months ago
Satisfiability of Non-linear (Ir)rational Arithmetic
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
Harald Zankl, Aart Middeldorp
ER
2008
Springer
140views Database» more  ER 2008»
13 years 11 months ago
Managing the History of Metadata in Support for DB Archiving and Schema Evolution
Modern information systems, and web information systems in particular, are faced with frequent database schema changes, which generate the necessity to manage them and preserve the...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
COMPSAC
2002
IEEE
14 years 2 months ago
Expanding an Extended Finite State Machine to aid Testability
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
Robert M. Hierons, T.-H. Kim, Hasan Ural
LISA
2007
14 years 7 days ago
PDA: A Tool for Automated Problem Determination
Problem determination remains one of the most expensive and time-consuming functions in system management due to the difficulty in automating what is essentially a highly experien...
Hai Huang, Raymond B. Jennings III, Yaoping Ruan, ...
IFIP
2004
Springer
14 years 3 months ago
Truthful Mechanisms for Generalized Utilitarian Problems
In this paper we investigate extensions of the well-known Vickrey-Clarke-Groves (VCG) mechanisms to problems whose objective function is not utilitarian and whose agents’ utiliti...
Giovanna Melideo, Paolo Penna, Guido Proietti, Rog...