Sciweavers

4211 search results - page 170 / 843
» Types as Abstract Interpretations
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
15 years 6 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 5 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ENTCS
2007
174views more  ENTCS 2007»
15 years 4 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix
ICITS
2009
15 years 1 months ago
Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
Peter Gazi, Ueli Maurer
POPL
2009
ACM
16 years 4 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi