5900 search results - page 39 / 1180 » Dependable Systems |
CADE
2001
Springer
15 years 2 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
78
Voted
ECSA
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a dependency constraint language that allows software architects to restrict the spectrum of dependencies that can be presented in a given software system. The ...
73
Voted
UCS
2004
Springer
15 years 2 months ago
2004
Springer
Fiducial tags can be recognised successfully and decoded by computer vision systems in order to produce location information. We term a system dependable if its observable results ...
RE
2010
Springer
14 years 4 months ago
2010
Springer
An approach is suggested for arguing that a system is dependable. The key idea is to structure the system so that critical requirements are localized in small, reliable subsets of ...
HICSS
2009
IEEE
15 years 4 months ago
2009
IEEE