Sciweavers

39 search results - page 5 / 8
» Ordering Constraints over Feature Trees Expressed in Second-...
Sort
View
82
Voted
ML
2007
ACM
130views Machine Learning» more  ML 2007»
14 years 9 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
108
Voted
POPL
1993
ACM
15 years 2 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
96
Voted
DIAGRAMS
2008
Springer
15 years 1 days ago
Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...
Aidan Delaney, John Taylor, Simon J. Thompson
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 10 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CSL
2010
Springer
14 years 11 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter