Sciweavers

2022 search results - page 101 / 405
» Complexity of Non-Monotonic Logics
Sort
View
106
Voted
ESOP
2000
Springer
15 years 4 months ago
A Kleene Analysis of Mobile Ambients
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
TVLSI
2002
366views more  TVLSI 2002»
15 years 11 days ago
Gate-diffusion input (GDI): a power-efficient method for digital combinatorial circuits
Gate diffusion input (GDI)--a new technique of low-power digital combinatorial circuit design--is described. This technique allows reducing power consumption, propagation delay, an...
Arkadiy Morgenshtein, Alexander Fish, Israel A. Wa...
IANDC
2011
127views more  IANDC 2011»
14 years 7 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
IWSEC
2010
Springer
14 years 10 months ago
Efficient Secure Auction Protocols Based on the Boneh-Goh-Nissim Encryption
This paper presents efficient secure auction protocols for first price auction and second price auction. Previous auction protocols are based on a generally secure multi-party prot...
Takuho Mitsunaga, Yoshifumi Manabe, Tatsuaki Okamo...
101
Voted
CORR
2011
Springer
173views Education» more  CORR 2011»
14 years 7 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi