Sciweavers

382 search results - page 44 / 77
» Generalized Multitext Grammars
Sort
View
ICSE
2009
IEEE-ACM
14 years 11 months ago
FEATUREHOUSE: Language-independent, automated software composition
Superimposition is a composition technique that has been applied successfully in many areas of software development. Although superimposition is a general-purpose concept, it has ...
Christian Kästner, Christian Lengauer, Sven A...
WWW
2007
ACM
14 years 11 months ago
The use of XML to express a historical knowledge base
Since conventional historical records have been written assuming human readers, they are not well-suited for computers to collect and process automatically. If computers could und...
Katsuko T. Nakahira, Masashi Matsui, Yoshiki Mikam...
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
14 years 11 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
CALCO
2005
Springer
126views Mathematics» more  CALCO 2005»
14 years 4 months ago
Context-Free Languages via Coalgebraic Trace Semantics
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
Ichiro Hasuo, Bart Jacobs
CCS
2005
ACM
14 years 4 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet