Sciweavers

65 search results - page 8 / 13
» Some Results on Top-Context-Free Tree Languages
Sort
View
CORR
2006
Springer
77views Education» more  CORR 2006»
13 years 7 months ago
Deductive Object Programming
We propose some slight additions to O-O languages to implement the necessary features for using Deductive Object Programming (DOP). This way of programming based upon the manipula...
François Colonna
DAGSTUHL
2006
13 years 8 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
ECOOP
2000
Springer
13 years 11 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
ACL
1992
13 years 8 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 1 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...