4666 search results - page 165 / 934 » Equations on Timed Languages |
155
click to vote
JCSS
2010
15 years 5 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
218
click to vote
TGC
2010
Springer
15 years 4 months ago
2010
Springer
We define an algebraic theory of hierarchical graphs, whose axioms characterise graph isomorphism: two terms are equated exactly when they represent the same graph. Our algebra can...
169
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Timed concurrent systems are widely used in concurrent and distributed real-time software, modeling of hybrid systems, design of hardware systems (using hardware description langua...
286
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
199
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...