39 search results - page 5 / 8 » Nondeterministic Instance Complexity and Proof Systems with ... |
101
Voted
IANDC
2007
14 years 11 months ago
2007
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
181
Voted
POPL
2001
ACM
15 years 12 months ago
2001
ACM
We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
174
click to vote
CP
2009
Springer
16 years 7 days ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
106
click to vote
FSTTCS
2008
Springer
15 years 21 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...