1711 search results - page 10 / 343 » Completing pseudojump operators |
MODELS
2009
Springer
14 years 10 days ago
2009
Springer
Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rule...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
PLDI
2010
ACM
14 years 25 days ago
2010
ACM
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
DM
2000
13 years 7 months ago
2000
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...