Sciweavers

5499 search results - page 53 / 1100
» Generalized Rewrite Theories
Sort
View
CSMR
2004
IEEE
13 years 11 months ago
Rewrite Systems for Symbolic Evaluation of C-like Preprocessing
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
Mario Latendresse
BDA
2007
13 years 9 months ago
Query Rewriting Based on User's Profile Knowledge
Query personalization was introduced as an advanced mechanism to allow the reformulation of database queries and adapt them to the user's domain of interest and preferences. ...
Dimitre Kostadinov, Mokrane Bouzeghoub, Sté...
ENTCS
2007
103views more  ENTCS 2007»
13 years 7 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal
CSL
2006
Springer
13 years 11 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...
RTA
2005
Springer
14 years 1 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