Sciweavers

3690 search results - page 358 / 738
» Computation with classical sequents
Sort
View
VISUALIZATION
1993
IEEE
15 years 11 months ago
An Environment for Telecollaborative Data Exploration
This paper presents an environment for telecollaborative data exploration. It provides the following capabilities essential to data exploration: (1) Users can probe the data, deļ¬...
Gudrun Klinker
ICCL
1992
IEEE
15 years 11 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
KI
1992
Springer
15 years 11 months ago
How to Construct a Logic for Your Application
Abstract. The purpose of this note is to present and evaluate the options available to a researcher wishing to use logic for representation, reasoning and computation in his applic...
Dov M. Gabbay
PQCRYPTO
2010
187views Cryptology» more  PQCRYPTO 2010»
15 years 10 months ago
Information-Set Decoding for Linear Codes over Fq
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...
Christiane Peters
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 10 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé