We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Vehicle environment is a good testbed to investigate Internet mobility technologies. Based on testing of building, protocol implementation details and problems to deploy it will b...
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...