Sciweavers

1760 search results - page 86 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
ESOP
1994
Springer
15 years 4 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
101
Voted
SPIN
2009
Springer
15 years 7 months ago
Symbolic Analysis via Semantic Reinterpretation
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
Junghee Lim, Akash Lal, Thomas W. Reps
107
Voted
HPCN
1995
Springer
15 years 4 months ago
Using optimistic execution techniques as a parallelisation tool for general purpose computing
Abstract. Optimistic execution techniques are widely used in the field of parallel discrete event simulation. In this paper we discuss the use of optimism as a technique for paral...
Adam Back, Stephen Turner
APLAS
2010
ACM
15 years 23 days ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann
114
Voted
PAMI
2011
14 years 3 months ago
Meta-Recognition: The Theory and Practice of Recognition Score Analysis
Abstract—In this paper, we define meta-recognition, a performance prediction method for recognition algorithms, and examine the theoretical basis for its post-recognition score ...
Walter J. Scheirer, Anderson Rocha, Ross J. Michea...