Sciweavers

1763 search results - page 19 / 353
» A Formalization of Polytime Functions
Sort
View
CORR
1998
Springer
142views Education» more  CORR 1998»
13 years 9 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker
ICSE
1997
IEEE-ACM
14 years 2 months ago
A Theory of Probabilistic Functional Testing
We propose a framework for “probabilistic functional testing.” The success of a test data set generated according to our method guarantees a certain level of confidence into ...
Gilles Bernot, Laurent Bouaziz, Pascale Le Gall
CCS
2005
ACM
14 years 3 months ago
The framework of selective interleaving functions and the modular assembly kit
The Framework of Selective Interleaving Functions and the Modular Assembly Kit for Security Properties both provide a basis for the uniform representation and formal analysis of n...
Heiko Mantel
COLING
2008
13 years 11 months ago
Almost Flat Functional Semantics for Speech Translation
We introduce a novel semantic representation formalism, Almost Flat Functional semantics (AFF), which is designed as an intelligent compromise between linguistically motivated pre...
Manny Rayner, Pierrette Bouillon, Beth Ann Hockey,...
TYPES
2004
Springer
14 years 3 months ago
Tactic-Based Optimized Compilation of Functional Programs
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Thomas Meyer, Burkhart Wolff