42 search results - page 6 / 9 » Automated refinement checking of concurrent systems |
DC
2010
13 years 7 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
IEICET
2006
13 years 7 months ago
2006
Concurrency is one of the most important issues in system-level design. Interleaving among parallel processes can cause an extremely large number of different behaviors, making de...
DSVIS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Stochastic model checking is a recent extension of traditional modelchecking techniques for the integrated analysis of both qualitative and quantitative system properties...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
LICS
1994
IEEE
13 years 11 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...