1418 search results - page 170 / 284 » The Dynamic Complexity of Formal Languages |
128
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
168
click to vote
WOLLIC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how ...
183
click to vote
RV
2010
Springer
15 years 2 months ago
2010
Springer
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring portion of RV is based on the successful Monitoring O...
133
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Traditional dynamic program slicing techniques are code-centric, meaning dependences are introduced between executed statement instances, which gives rise to various problems such...
139
click to vote
AAAI
2007
15 years 7 months ago
2007
We explore a means to both model and reason about partial observability within the scope of constraintbased temporal reasoning. Prior studies of uncertainty in Temporal CSPs have ...