434 search results - page 53 / 87 » Logical Analysis of Hash Functions |
CONCUR
1990
Springer
15 years 4 months ago
1990
Springer
In this paper we describe the calculus TCCS, an extension of the process algebra CCS with temporal constructs. The calculus is useful for the formal analysis of the timing aspects...
121
Voted
CADE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
137
Voted
FLOPS
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
131
Voted
OOPSLA
2007
Springer
15 years 6 months ago
2007
Springer
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
105
Voted
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...