Sciweavers

2917 search results - page 67 / 584
» Satisfying Interaction Constraints
Sort
View
ICEIS
2006
IEEE
14 years 2 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
CHES
2005
Springer
100views Cryptology» more  CHES 2005»
14 years 2 months ago
Masked Dual-Rail Pre-charge Logic: DPA-Resistance Without Routing Constraints
During the last years, several logic styles that counteract side-channel attacks have been proposed. They all have in common that their level of resistance heavily depends on imple...
Thomas Popp, Stefan Mangard
BPM
2006
Springer
149views Business» more  BPM 2006»
13 years 10 months ago
Verifying BPEL Workflows Under Authorisation Constraints
Abstract. Business Process Execution Language (BPEL), or Web Services BPEL (WS-BPEL), is the standard for specifying workflow process definition using web services. Research on for...
Zhao Xiangpeng, Antonio Cerone, Padmanabhan Krishn...
JUCS
2007
129views more  JUCS 2007»
13 years 8 months ago
Constraint Programming Architectures: Review and a New Proposal
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
Jacques Robin, Jairson Vitorino, Armin Wolf
CADE
2006
Springer
14 years 9 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi