4666 search results - page 746 / 934 » Equations on Timed Languages |
156
click to vote
FATES
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Writing specifications using Java Modeling Language has been accepted for a long time as a practical approach to increasing the correctness and quality of Java programs. ...
159
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
176
click to vote
ICALP
1998
Springer
15 years 8 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
181
click to vote
PODS
1994
ACM
15 years 8 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
141
click to vote
ASPLOS
2009
ACM
15 years 8 months ago
2009
ACM
Software systems are constantly changing. Patches to fix bugs and patches to add features are all too common. Every change risks breaking a previously working system. Hence admini...