4767 search results - page 324 / 954 » Structures for Abstract Rewriting |
194
click to vote
ENTCS
2002
15 years 6 months ago
2002
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
151
click to vote
ICFEM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data ...
211
click to vote
CONCUR
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
169
click to vote
ACL
1998
15 years 8 months ago
1998
This paper presents a semantic interpretation of adjectival modification in terms of the Generative Lexicon. It highlights the elements which can be borrowed from the GL and devel...
290
click to vote
VLDB
2005
ACM
16 years 6 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...