142 search results - page 19 / 29 » Proving Termination by Invariance Relations |
FASE
2009
Springer
14 years 1 months ago
2009
Springer
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
LICS
2006
IEEE
14 years 3 months ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
COLT
2008
Springer
13 years 11 months ago
2008
Springer
We design and analyze interacting online algorithms for multitask classification that perform better than independent learners whenever the tasks are related in a certain sense. W...
ACTA
2007
13 years 10 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
COMBINATORICS
2000
13 years 9 months ago
2000
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...