Sciweavers

846 search results - page 146 / 170
» Rewrite-Based Decision Procedures
Sort
View
ENTCS
2008
89views more  ENTCS 2008»
15 years 5 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...
EOR
2008
86views more  EOR 2008»
15 years 5 months ago
Fuzzy inference to assess manufacturing process capability with imprecise data
Process capability indices provide numerical measures on whether a process conforms to the defined manufacturing capability prerequisite. These have been successfully applied by c...
Bi-Min Hsu, Ming-Hung Shu
155
Voted
IANDC
2008
150views more  IANDC 2008»
15 years 5 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
114
Voted
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 5 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
141
Voted
ENTCS
2007
141views more  ENTCS 2007»
15 years 5 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere