13383 search results - page 149 / 2677 » Abstractions from proofs |
176
click to vote
CADE
2000
Springer
15 years 10 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 ...
163
click to vote
FORTE
1996
15 years 7 months ago
1996
In this paper we present the application of the fair testing pre-order, introduced in a previous paper, to the speci cation and analysis of distributed systems. This pre-order com...
121
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
177
Voted
ICTAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Separation kernels are key components in embedded applications. Their small size and widespread use in high-integrity environments make them good targets for formal model...
181
click to vote
VMCAI
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...