Sciweavers

2584 search results - page 219 / 517
» On the Forward Checking Algorithm
Sort
View
ICLP
1994
Springer
15 years 6 months ago
Entailment of Finite Domain Constraints
Using a glass-box theory of finite domain constraints, FD, we show how the entailment of user-defined constraints can be expressed by antimonotone FD constraints. We also provide a...
Björn Carlson, Mats Carlsson, Daniel Diaz
ESOP
2009
Springer
15 years 6 months ago
Type-Based Automated Verification of Authenticity in Cryptographic Protocols
Gordon and Jeffrey have proposed a type and effect system for checking authenticity in cryptographic protocols. The type system reduces the protocol verification problem to the typ...
Daisuke Kikuchi, Naoki Kobayashi
DAC
2005
ACM
15 years 4 months ago
Normalization at the arithmetic bit level
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
Markus Wedler, Dominik Stoffel, Wolfgang Kunz
ATVA
2010
Springer
163views Hardware» more  ATVA 2010»
15 years 2 months ago
Automatic Generation of History-Based Access Control from Information Flow Specification
This paper proposes a method for automatically inserting check statements for access control into a given recursive program according to a given security specification. A history-b...
Yoshiaki Takata, Hiroyuki Seki
NAACL
2007
15 years 3 months ago
Relationship between Non-Projective Edges, Their Level Types, and Well-Nestedness
Dependency analysis of natural language gives rise to non-projective structures. The constraint of well-nestedness on dependency trees has been recently shown to give a good fit ...
Jirí Havelka