Sciweavers

783 search results - page 55 / 157
» Compositional Reasoning in Model Checking
Sort
View
AAAI
2000
13 years 10 months ago
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
Chu Min Li
LPAR
2010
Springer
13 years 7 months ago
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
Konstantin Korovin, Christoph Sticksel
JUCS
2007
108views more  JUCS 2007»
13 years 9 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
ICTAC
2005
Springer
14 years 2 months ago
Representation and Reasoning on RBAC: A Description Logic Approach
Abstract. Role-based access control (RBAC) is recognized as an excellent model for access control in large-scale networked applications. Formalization of RBAC in a logical approach...
Chen Zhao, NuerMaimaiti Heilili, Shengping Liu, Zu...
HASKELL
2009
ACM
14 years 3 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...