Sciweavers

1058 search results - page 43 / 212
» It's Doomed; We Can Prove It
Sort
View
LICS
2010
IEEE
13 years 7 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
ICGI
2010
Springer
13 years 7 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
SIGMOD
2011
ACM
295views Database» more  SIGMOD 2011»
13 years 22 days ago
Attribute domain discovery for hidden web databases
Many web databases are hidden behind restrictive form-like interfaces which may or may not provide domain information for an attribute. When attribute domains are not available, d...
Xin Jin, Nan Zhang 0004, Gautam Das
EMSOFT
2011
Springer
12 years 9 months ago
Synthesis of optimal switching logic for hybrid systems
Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system...
Susmit Jha, Sanjit A. Seshia, Ashish Tiwari
ESOP
2012
Springer
12 years 5 months ago
Concurrent Library Correctness on the TSO Memory Model
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
Sebastian Burckhardt, Alexey Gotsman, Madanlal Mus...