Sciweavers

CSFW
2005
IEEE
13 years 10 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
GLVLSI
2006
IEEE
124views VLSI» more  GLVLSI 2006»
13 years 10 months ago
Dominator-based partitioning for delay optimization
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...
David Bañeres, Jordi Cortadella, Michael Ki...
TARK
2007
Springer
13 years 10 months ago
Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
Thomas Ågotnes, Natasha Alechina
SEMWEB
2007
Springer
13 years 10 months ago
Extending Fuzzy Description Logics with a Possibilistic Layer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
Fernando Bobillo, Miguel Delgado, Juan Góme...
LPNMR
2007
Springer
13 years 10 months ago
General Default Logic
Abstract. In this paper, we present a logic R for rule bases by introducing a set of rule connectives. We define both the models and extensions of a rule base. The semantics of ex...
Yi Zhou, Fangzhen Lin, Yan Zhang
LOPSTR
2007
Springer
13 years 10 months ago
Snapshot Generation in a Constructive Object-Oriented Modeling Language
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
Mauro Ferrari, Camillo Fiorentini, Alberto Momigli...
ESOP
2007
Springer
13 years 10 months ago
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
We study the relationship between Concurrent Separation Logic (CSL) and the assume-guarantee (A-G) method (a.k.a. rely-guarantee method). We show in three steps that CSL can be tre...
Xinyu Feng, Rodrigo Ferreira, Zhong Shao
CSL
2007
Springer
13 years 10 months ago
On the Complexity of Reasoning About Dynamic Policies
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
Stefan Göller
LICS
2007
IEEE
13 years 10 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
ISMVL
2007
IEEE
245views Hardware» more  ISMVL 2007»
13 years 10 months ago
Fault Tolerant CMOS Logic Using Ternary Gates
In this paper we present fault tolerant CMOS logic using redundancy and ternary signals. The ternary gates are implemented using recharge logic which can be exploited in binary an...
Yngvar Berg, Renè Jensen, Johannes Goplen L...