Sciweavers

265 search results - page 10 / 53
» Weakly Algebraizable Logics
Sort
View
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 13 days ago
Probabilistic Logic: Many-valuedness and Intensionality
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
Zoran Majkic
IWPSE
2003
IEEE
14 years 1 months ago
CVS Release History Data for Detecting Logical Couplings
The dependencies and interrelations between classes and modules affect the maintainability of object-oriented systems. It is therefore important to capture weaknesses of the softw...
Harald Gall, Mehdi Jazayeri, Jacek Krajewski
FSTTCS
2007
Springer
14 years 2 months ago
Propositional Dynamic Logic for Message-Passing Systems
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
CHES
2005
Springer
117views Cryptology» more  CHES 2005»
14 years 2 months ago
DPA Leakage Models for CMOS Logic Circuits
In this paper, we propose new models for directly evaluating DPA leakage from logic information in CMOS circuits. These models are based on the transition probability for each gate...
Daisuke Suzuki, Minoru Saeki, Tetsuya Ichikawa
FCSC
2010
170views more  FCSC 2010»
13 years 6 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li