Sciweavers

1226 search results - page 16 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
ASIACRYPT
1999
Springer
15 years 4 months ago
Linear Complexity versus Pseudorandomness: On Beth and Dai's Result
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
Yongge Wang
FOSSACS
2008
Springer
15 years 1 months ago
The Implicit Calculus of Constructions as a Programming Language with Dependent Types
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
Bruno Barras, Bruno Bernardo
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
15 years 5 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
85
Voted
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 6 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
FUIN
2010
103views more  FUIN 2010»
14 years 9 months ago
Automation for Dependently Typed Functional Programming
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
Sean Wilson, Jacques D. Fleuriot, Alan Smaill