Sciweavers

1581 search results - page 50 / 317
» Mechanizing Inductive Reasoning
Sort
View
118
Voted
FLAIRS
2000
15 years 3 months ago
A Case Study in the Mechanical Verification of Fault Tolerance
To date, there is little evidence that modular reasoning about fault-tolerant systems can simplify the verification process in practice. We study this question using a prominent e...
Heiko Mantel, Felix C. Gärtner
ATVA
2010
Springer
284views Hardware» more  ATVA 2010»
15 years 3 months ago
YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
Ukachukwu Ndukwu, A. K. McIver
97
Voted
JUCS
2007
108views more  JUCS 2007»
15 years 2 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani
122
Voted
ESOP
2011
Springer
14 years 6 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
Christian Urban, Cezary Kaliszyk
122
Voted
SEMWEB
2010
Springer
15 years 14 days ago
OWL-POLAR: Semantic Policies for Agent Reasoning
Abstract. Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few ...
Murat Sensoy, Timothy J. Norman, Wamberto Weber Va...