Sciweavers

378 search results - page 42 / 76
» From Natural Semantics to Abstract Machines
Sort
View
ICCL
1992
IEEE
13 years 11 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
RTAS
2003
IEEE
14 years 27 days ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee
FTDB
2008
82views more  FTDB 2008»
13 years 7 months ago
Information Extraction
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
Sunita Sarawagi
NLDB
2007
Springer
14 years 1 months ago
DLSITE-1: Lexical Analysis for Solving Textual Entailment Recognition
This paper discusses the recognition of textual entailment in a text-hypothesis pair by applying a wide variety of lexical measures. We consider that the entailment phenomenon can ...
Óscar Ferrández, Daniel Micol, Rafae...
ACTA
2000
82views more  ACTA 2000»
13 years 7 months ago
Semantics analysis through elementary meanings
Thesaurus is a collection of words classified according to some relatedness measures among them. In this paper, we lay the theoretical foundations of thesaurus construction through...
Youichi Kobuchi, Takashi Saito, Hidenobu Nunome