Sciweavers

3573 search results - page 168 / 715
» Reasoning about Codata
Sort
View
127
Voted
FLAIRS
2000
15 years 4 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
CSL
2010
Springer
15 years 4 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
DLOG
2009
15 years 4 months ago
Which Kind of Module Should I Extract?
Abstract There are various techniques for specifying a module of an ontology that covers all knowledge about a given set of terms. These differ with respect to the size of the modu...
Ulrike Sattler, Thomas Schneider 0002, Michael Zak...
DLOG
2009
15 years 4 months ago
Using Description Logics in Relation Based Access Control
Relation Based Access Control (RelBAC) is an access control model designed for the new scenarios of access control on Web 2.0. Under this model, we discuss in this paper how to for...
Rui Zhang, Alessandro Artale, Fausto Giunchiglia, ...
132
Voted
JANCL
2006
112views more  JANCL 2006»
15 years 3 months ago
KAT-ML: an interactive theorem prover for Kleene algebra with tests
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
Kamal Aboul-Hosn, Dexter Kozen