Sciweavers

5451 search results - page 430 / 1091
» Typed Operational Semantics
Sort
View
ICFP
2004
ACM
16 years 6 months ago
A sound (and complete) model of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
Matthias Blume, David A. McAllester
BMCBI
2008
140views more  BMCBI 2008»
15 years 6 months ago
Corpus annotation for mining biomedical events from literature
Background: Advanced Text Mining (TM) such as semantic enrichment of papers, event or relation extraction, and intelligent Question Answering have increasingly attracted attention...
Jin-Dong Kim, Tomoko Ohta, Jun-ichi Tsujii
SIGSOFT
2002
ACM
16 years 7 months ago
Using redundancies to find errors
This paper explores the idea that redundant operations, like type errors, commonly flag correctness errors. We experimentally test this idea by writing and applying four redundanc...
Yichen Xie, Dawson R. Engler
156
Voted
EDBT
2009
ACM
85views Database» more  EDBT 2009»
16 years 1 months ago
Recursion in XQuery: put your distributivity safety belt on
We introduce a controlled form of recursion in XQuery, an inflationary fixed point operator, familiar from the context of relational databases. This operator imposes restriction...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
16 years 1 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema