Sciweavers

2008 search results - page 35 / 402
» Computing with Equations
Sort
View
MFCS
2000
Springer
14 years 18 days ago
Matching Modulo Associativity and Idempotency Is NP-Complete
We show that AI
Ondrej Klíma, Jirí Srba
ICALP
2004
Springer
14 years 2 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
SCALESPACE
2009
Springer
14 years 3 months ago
Adaptation of Eikonal Equation over Weighted Graph
Abstract. In this paper, an adaptation of the eikonal equation is proposed by considering the latter on weighted graphs of arbitrary structure. This novel approach is based on a fa...
Vinh-Thong Ta, Abderrahim Elmoataz, Olivier Lezora...
ICDCS
2005
IEEE
14 years 2 months ago
Equational Approach to Formal Analysis of TLS
TLS has been formally analyzed with the OTS/CafeOBJ method. In the method, distributed systems are modeled as transition systems, which are written in terms of equations, and it i...
Kazuhiro Ogata, Kokichi Futatsugi
CTRS
1990
14 years 1 months ago
A Maximal-Literal Unit Strategy for Horn Clauses
A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paxamodulation to potentiallymaximal sides of equations...
Nachum Dershowitz