1418 search results - page 104 / 284 » The Dynamic Complexity of Formal Languages |
172
click to vote
PLDI
2010
ACM
15 years 6 months ago
2010
ACM
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...
120
click to vote
KI
2007
Springer
15 years 10 months ago
2007
Springer
General action languages, like e.g. the Situation Calculus, use full classical logic to represent knowledge of actions and their effects in dynamic domains. Description Logics, on...
141
click to vote
DSL
1997
15 years 5 months ago
1997
In this paper we describe our experience with Teapot [7], a domain-specific language for writing cache coherence protocols. Cache coherence is of concern when parallel and distrib...
138
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
133
click to vote
LATA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...