Sciweavers

226 search results - page 27 / 46
» Extensional Theories and Rewriting
Sort
View
117
Voted
TAGT
1998
Springer
156views Graph Theory» more  TAGT 1998»
15 years 4 months ago
Graph-Based Models for Managing Development Processes, Resources, and Products
Abstract. Management of development processes in di erent engineering disciplines is a challenging task. We present an integrated approach which covers not only the activities to b...
Carl-Arndt Krapp, Sven Krüppel, Ansgar Schlei...
89
Voted
ENTCS
2006
103views more  ENTCS 2006»
15 years 14 days ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
CSL
2006
Springer
15 years 4 months ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
137
Voted
RTA
2005
Springer
15 years 6 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
94
Voted
TPLP
2008
89views more  TPLP 2008»
15 years 11 days ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...