Sciweavers

33 search results - page 4 / 7
» Reducing Equational Theories for the Decision of Static Equi...
Sort
View
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CSFW
2009
IEEE
14 years 2 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
CADE
2003
Springer
14 years 7 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon
LCTRTS
2010
Springer
14 years 9 days ago
Cache vulnerability equations for protecting data in embedded processor caches from soft errors
Continuous technology scaling has brought us to a point, where transistors have become extremely susceptible to cosmic radiation strikes, or soft errors. Inside the processor, cac...
Aviral Shrivastava, Jongeun Lee, Reiley Jeyapaul
FSTTCS
2004
Springer
14 years 27 days ago
Decidability of MSO Theories of Tree Structures
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...
Angelo Montanari, Gabriele Puppis