Sciweavers

338 search results - page 56 / 68
» A Formal Approach to Heuristically Test Restorable Systems
Sort
View
DIMACS
1996
13 years 10 months ago
Model Checking and the Mu-calculus
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...
E. Allen Emerson
EKAW
2008
Springer
13 years 10 months ago
Learning Disjointness for Debugging Mappings between Lightweight Ontologies
Abstract. Dealing with heterogeneous ontologies by means of semantic mappings has become an important area of research and a number of systems for discovering mappings between onto...
Christian Meilicke, Johanna Völker, Heiner St...
FMICS
2009
Springer
14 years 3 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
SOFTVIS
2010
ACM
13 years 9 months ago
Towards anomaly comprehension: using structural compression to navigate profiling call-trees
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
Shen Lin 0003, François Taïani, Thomas...
LCTRTS
2009
Springer
14 years 3 months ago
A compiler optimization to reduce soft errors in register files
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
Jongeun Lee, Aviral Shrivastava