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...
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 ...
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 ...
Andrew C. Rice, Christopher B. Cain, John K. Fawce...
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 ...