96 search results - page 18 / 20 » Analyzing recursive programs using a fixed-point calculus |
POPL
2009
ACM
14 years 6 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
NMR
2004
Springer
13 years 11 months ago
2004
Springer
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈...
AAAI
1996
13 years 7 months ago
1996
The Airport Example The Omelette Example Copyright c 1996 American Association for Artificial Intelligence. All rights reserved. Despite the existence of programs that are able to ...
ICTAC
2005
Springer
13 years 11 months ago
2005
Springer
Case studies can significantly contribute towards improving the understanding of formalisms and thereby to their applicability in practice. One such case, namely a cascade of the ...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...