388 search results - page 8 / 78 » Program Analysis Using Symbolic Ranges |
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
101
click to vote
DAC
1999
ACM
15 years 2 months ago
1999
ACM
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
ESOP
1994
Springer
15 years 1 months ago
1994
Springer
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...
CONCUR
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
87
Voted
RTSS
1998
IEEE
15 years 1 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....