Sciweavers

1299 search results - page 201 / 260
» On the Correctness of Operating System Kernels
Sort
View
POPL
1998
ACM
15 years 10 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
EUROSYS
2007
ACM
15 years 10 months ago
Discrete control for safe execution of IT automation workflows
As information technology (IT) administration becomes increasingly complex, workflow technologies are gaining popularity for IT automation. Writing correct workflow programs is no...
Yin Wang, Terence Kelly, Stéphane Lafortune
EMSOFT
2006
Springer
15 years 10 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
AIPS
1996
15 years 7 months ago
Planning Experiments: Resolving Interactions between Two Planning Spaces
Learning from experimentation allows a system to acquire planning domain knowledge by correcting its knowledge when an action execution fails. Experiments are designed and planned...
Yolanda Gil
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott