Sciweavers

1445 search results - page 207 / 289
» Abstract Interpretation of Logic Programs
Sort
View
ICPP
1993
IEEE
15 years 2 months ago
Meta-State Conversion
Abstract — In MIMD (Multiple Instruction stream, Multiple Data stream) execution, each processor has its own state. Although these states are generally considered to be independe...
Henry G. Dietz, G. Krishnamurthy
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 2 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
FMOODS
2008
14 years 11 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
WCET
2003
14 years 11 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
ENTCS
2006
154views more  ENTCS 2006»
14 years 10 months ago
Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card
We present a semantics-based technique for modeling and analysing resource usage behaviour of programs written in a simple object oriented language like Java e code. The approach ...
Pascal Sotin, David Cachera, Thomas P. Jensen