Sciweavers

1226 search results - page 72 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
15 years 8 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
ESOP
2010
Springer
16 years 18 days ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
CIE
2009
Springer
15 years 9 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée
KBSE
2000
IEEE
15 years 7 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
DAGSTUHL
2006
15 years 4 months ago
New Algebraic Tools for Constraint Satisfaction
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
Henning Schnoor, Ilka Schnoor