Sciweavers

555 search results - page 48 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
WOLLIC
2010
Springer
14 years 21 days ago
Modal Logics with Counting
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
Carlos Areces, Guillaume Hoffmann, Alexandre Denis
ECOOP
2000
Springer
13 years 12 months ago
Copying and Comparing: Problems and Solutions
In object oriented programming, it is sometimes necessary to copy objects and to compare them for equality or inequality. We discuss some of the issues involved in copying and comp...
Peter Grogono, Markku Sakkinen
PLDI
2006
ACM
14 years 1 months ago
Context-sensitive domain-independent algorithm composition and selection
Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but ...
Troy A. Johnson, Rudolf Eigenmann
CSR
2007
Springer
14 years 1 months ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
GCSE
1999
Springer
13 years 12 months ago
Scoping Constructs for Software Generators
Abstract. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators mu...
Yannis Smaragdakis, Don S. Batory