Sciweavers

1445 search results - page 88 / 289
» Uniformly Hard Languages
Sort
View
PLDI
2009
ACM
14 years 5 months ago
Catch me if you can: permissive yet secure error handling
Program errors are a source of information leaks. Tracking these leaks is hard because error propagation breaks out of program structure. Programming languages often feature excep...
Aslan Askarov, Andrei Sabelfeld
ACL
1996
13 years 11 months ago
Chart Generation
Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...
Martin Kay
ICALP
2010
Springer
14 years 3 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin
ICALP
2007
Springer
14 years 4 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
DAGSTUHL
2004
13 years 11 months ago
Bus Scheduling for TDL Components
This paper describes a solution for bus scheduling of distributed multi-mode TDL (Timing Definition Language) components. The TDL component model is based on the concept of Logical...
Emilia Farcas, Wolfgang Pree, Josef Templ