Sciweavers

1894 search results - page 355 / 379
» A TLA Proof System
Sort
View
ICCBR
2001
Springer
14 years 2 months ago
Case-Based Reasoning in the Care of Alzheimer's Disease Patients
Abstract. Planning the ongoing care of Alzheimer's Disease (AD) patients is a complex task, marked by cases that change over time, multiple perspectives, and ethical issues. G...
Cynthia R. Marling, Peter Whitehouse
PLDI
1997
ACM
14 years 1 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 1 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
POPL
1992
ACM
14 years 1 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori
FASE
2007
Springer
14 years 1 months ago
A Family of Distributed Deadlock Avoidance Protocols and Their Reachable State Spaces
Abstract. We study resource management in distributed systems. Incorrect handling of resources may lead to deadlocks, missed deadlines, priority inversions, and other forms of inco...
César Sánchez, Henny B. Sipma, Zohar...