128 search results - page 14 / 26 » Verifying Process Algebra Proofs in Type Theory |
CADE
2008
Springer
14 years 8 months ago
2008
Springer
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
CALCO
2007
Springer
14 years 1 months ago
2007
Springer
Much current work on modelling and verifying microprocessors can accommodate pipelined and superscalar processors. However, superscalar and pipelined processors are no longer state...
FUIN
2007
13 years 7 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
ACISP
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we are interested in algebraic immunity of several well known highly-nonlinear vectorial Boolean functions (or Sboxes), designed for block and stream ciphers. Unfortu...