96 search results - page 18 / 20 » Analyzing recursive programs using a fixed-point calculus |
187
click to vote
POPL
2009
ACM
15 years 10 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...
112
click to vote
NMR
2004
Springer
15 years 2 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
14 years 11 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
15 years 3 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 ...
117
click to vote
RTA
2005
Springer
15 years 3 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...