1894 search results - page 153 / 379 » A TLA Proof System |
140
click to vote
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
140
Voted
WSC
2007
15 years 6 months ago
2007
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
151
click to vote
TNC
2004
15 years 5 months ago
2004
The bandwidth broker architectures introduced to manage diffserv still have scalability flaws in the mean of large volumes of end-to-end tunnels and workload they have to handle. ...
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms fo...
134
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...