Sciweavers

2137 search results - page 159 / 428
» Proving Abstract Non-interference
Sort
View
ICFP
2001
ACM
16 years 3 months ago
A New Notation for Arrows
The categorical notion of monad, used by Moggi to structure denotational descriptions, has proved to be a powerful tool for structuring combinator libraries. Moreover, the monadic...
Ross Paterson
ESOP
2010
Springer
16 years 15 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
FOSSACS
2009
Springer
15 years 10 months ago
Synthesis from Component Libraries
Abstract. Synthesis is the automatic construction of a system from its specification. In the classical synthesis algorithms it is always assumed the system is “constructed from ...
Yoad Lustig, Moshe Y. Vardi
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 9 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
TLCA
2009
Springer
15 years 9 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann