Sciweavers

540 search results - page 1 / 108
» Bounded Relational Analysis of Free Data Types
Sort
View
TAP
2008
Springer
153views Hardware» more  TAP 2008»
13 years 7 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
ESOP
2009
Springer
14 years 2 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
ICITS
2009
13 years 5 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
ESOP
2006
Springer
13 years 11 months ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost
MIR
2010
ACM
167views Multimedia» more  MIR 2010»
14 years 2 months ago
Improving automatic music classification performance by extracting features from different types of data
This paper discusses two sets of automatic musical genre classification experiments. Promising research directions are then proposed based on the results of these experiments. The...
Cory McKay, Ichiro Fujinaga