14 search results - page 2 / 3 » Automation for Exception Freedom Proofs |
CSL
2001
Springer
13 years 10 months ago
2001
Springer
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
DC
2010
13 years 5 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address a fundamental mismatch between the combinations of dynamics that occur in complex physical systems and the limited kinds of dynamics supported in analysis. Mod...
LPKR
1997
Springer
13 years 10 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
DAC
2002
ACM
14 years 6 months ago
2002
ACM
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...