Cryptol: high assurance, retargetable crypto development and validation

Lewis, J.R.; Martin, B.

doi:10.1109/milcom.2003.1290218

Cited by 30 publications

(31 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This seems to be already the approach in Cryptol [46], a Haskell based DSL for cryptography, where array dimensions are inferred using a strong type-system based on Hindley-Milner style polymorphism extended with arithmetic size constraints.…”

Section: Discussionmentioning

confidence: 99%

Typing linear algebra: A biproduct-oriented approach

Macedo

Oliveira²

2013

Science of Computer Programming

View full text Add to dashboard Cite

Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the central operation of matrix algebra, ranging from its divide-and-conquer version to its vectorization implementation.From errant attempts to learn how particular products and coproducts emerge from biproducts, not only blocked matrix algebra is rediscovered but also a way of extending other operations (e.g. Gaussian elimination) blockwise, in a calculational style, is found.The prospect of building biproduct-based type checkers for computer algebra systems such as MATLAB™ is also considered.Keywords: Linear algebra, categories of matrices, algebra of programming

show abstract

Section: Discussionmentioning

confidence: 99%

Typing linear algebra: A biproduct-oriented approach

Macedo

Oliveira²

2013

Science of Computer Programming

View full text Add to dashboard Cite

show abstract

“…However, the currently published and employed domain-specific verification algorithms for such applications ( [14]) do not have the capability to verify critical components, such as memory blocks, of existing and future hardware designs in the NW space. The verification algorithms developed by this work support the analysis of such critical digital components with mathematical reasoning from automated theorem proving and model checking.…”

Section: Commonly Used Fv Techniques Includementioning

confidence: 99%

“…Lewis, Hoffman, and Browning [14] published a design and verification flow for implementing a single FPGA-based cryptographic system. This flow leverages a Domain Specific Language (DSL) named Cryptol and tools to support it.…”

Section: Cryptographic Applicationsmentioning

confidence: 99%

Exploring formal verification methodology for FPGA-based digital systems.

Hu¹

2012

View full text Add to dashboard Cite

With the Life Extension Programs (LEPs), many nuclear weapon (NW) analog electronic components are being replaced by modern digital devices, increasing system complexities dramatically. Ensuring the reliability, security, and robustness of these upgraded systems is critically important. Many custom hardware systems throughout the NW operations space rely on Field-Programmable Gate Arrays (FPGAs) to implement sophisticated logic. Effective verification, while increasing confidence, can reduce the overall effort in system debugging and testing. This work explored Formal Verification (FV) of trusted FPGA-based hardware designs through the use of novel algorithms. The algorithms developed support the analysis of critical digital components, such as memory, with mathematical reasoning from automated theorem proving and model checking. Such verification will detect race conditions and corner cases at an early stage, eliminating system failure and instability during operation.

show abstract

“…Outside the DSP domain, examples of DSLs with similar aims to ours include Cryptol (a DSL for cryptography from Galois, [17]) and Microsoft's Accelerator for programming various platforms, including GPUs and multicores [24]. In both Cryptol and Accelerator, all loops are unrolled during code generation.…”

Section: Domain Specific Languagesmentioning

confidence: 99%

Feldspar: A domain specific language for digital signal processing algorithms

Axelsson

Claessen

Dévai

et al. 2010

Eighth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2010)

View full text Add to dashboard Cite

Abstract-A new language, Feldspar, is presented, enabling high-level and platform-independent description of digital signal processing (DSP) algorithms. Feldspar is a pure functional language embedded in Haskell. It offers a high-level dataflow style of programming, as well as a more mathematical style based on vector indices. The key to generating efficient code from such descriptions is a high-level optimization technique called vector fusion. Feldspar is based on a low-level, functional core language which has a relatively small semantic gap to machine-oriented languages like C. The core language serves as the interface to the back-end code generator, which produces C. For very small examples, the generated code performs comparably to hand-written C code when run on a DSP target. While initial results are promising, to achieve good performance on larger examples, issues related to memory access patterns and array copying will have to be addressed.

show abstract

Cryptol: high assurance, retargetable crypto development and validation

Cited by 30 publications

References 0 publications

Typing linear algebra: A biproduct-oriented approach

Typing linear algebra: A biproduct-oriented approach

Exploring formal verification methodology for FPGA-based digital systems.

Feldspar: A domain specific language for digital signal processing algorithms

Contact Info

Product

Resources

About