534 search results - page 97 / 107 » Proving Termination of Rewrite Systems Using Bounds |
105
Voted
PLDI
2006
ACM
15 years 5 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
102
Voted
TLCA
2005
Springer
15 years 5 months ago
2005
Springer
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
-- High performance packet switches frequently use a centralized scheduler (also known as an arbiter) to determine the configuration of a non-blocking crossbar. The scheduler often...
85
Voted
ICDCS
1997
IEEE
15 years 3 months ago
1997
IEEE
Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applicati...
74
Voted
JSYML
2007
14 years 11 months ago
2007
Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...