756 search results - page 123 / 152 » Using Logic Programs to Reason about Infinite Sets |
POPL
1993
ACM
14 years 16 days ago
1993
ACM
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...
PEPM
2011
ACM
12 years 11 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
ICSE
2005
IEEE-ACM
14 years 8 months ago
2005
IEEE-ACM
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotati...