Sciweavers

858 search results - page 141 / 172
» Abstract Interpretation Based Verification of Logic Programs
Sort
View
ICPP
1993
IEEE
15 years 1 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
WCET
2003
14 years 10 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 9 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
FOSSACS
2007
Springer
15 years 3 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ICCS
2004
Springer
15 years 2 months ago
Multiparadigm Model Oriented to Development of Grid Systems
Multiparadigm approach integrates programming language paradigms. We propose Holoparadigm (Holo) as a multiparadigm model oriented to development of grid systems. Holo uses a logi...
Jorge L. V. Barbosa, Cristiano André da Cos...