1418 search results - page 179 / 284 » The Dynamic Complexity of Formal Languages |
152
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
132
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
138
click to vote
SCAM
2006
IEEE
15 years 10 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
112
click to vote
MODELS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Models addressing both structure and behaviour of a system are usually quite complex. Much of the complexity is caused by the necessity to distinguish between different c...
146
click to vote
SIGSOFT
2002
ACM
16 years 5 months ago
2002
ACM
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...