Sciweavers

50 search results - page 7 / 10
» The Second Contest on Multi-Agent Systems Based on Computati...
Sort
View
85
Voted
CSL
2007
Springer
15 years 3 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
98
Voted
FM
2003
Springer
115views Formal Methods» more  FM 2003»
15 years 2 months ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn
89
Voted
IJCAI
2003
14 years 11 months ago
Automated Reasoning: Past Story and New Trends
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
Andrei Voronkov
DSN
2009
IEEE
15 years 4 months ago
Low overhead Soft Error Mitigation techniques for high-performance and aggressive systems
The threat of soft error induced system failure in high performance computing systems has become more prominent, as we adopt ultra-deep submicron process technologies. In this pap...
Naga Durga Prasad Avirneni, Viswanathan Subramania...
TES
2005
Springer
15 years 3 months ago
A Lightweight Model-Driven Orchestration Engine for e-Services
Service-oriented Computing (SoC) in general, and e-service orchestrations in particular have the potential to increase reuse and to ease maintainability. Typically, interoperating ...
Johann Oberleitner, Florian Rosenberg, Schahram Du...