1418 search results - page 127 / 284 » The Dynamic Complexity of Formal Languages |
141
click to vote
ENTCS
2002
15 years 4 months ago
2002
Many tools have been constructed using different formal methods to process various parts of a language specification (e.g., scanner generators, parser generators and compiler gene...
126
click to vote
GC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
230
click to vote
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We present in this article a precise security model for data confidentiality in the framework of asynchronous and deterministic objects. Our underlying programming model is based ...
137
click to vote
TOPNOC
2008
15 years 4 months ago
2008
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
132
click to vote
ER
2007
Springer
15 years 10 months ago
2007
Springer
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...