Sciweavers

1472 search results - page 146 / 295
» On Model Checking Infinite-State Systems
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
15 years 4 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
ATC
2008
Springer
15 years 6 months ago
Scheduling for Reliable Execution in Autonomic Systems
Abstract. Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic...
Terry Tidwell, Robert Glaubius, Christopher D. Gil...
ICRE
2000
IEEE
15 years 7 months ago
A Lightweight Approach to Consistency of Scenarios and Class Models
Today, object-oriented requirements specifications typically combine a scenario (or use case) model and a class model for expressing functional requirements. With any such combina...
Martin Glinz
ISSTA
2004
ACM
15 years 9 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
SOSP
1997
ACM
15 years 5 months ago
A Decentralized Model for Information Flow Control
This paper presents a new model for controlling information flow in systems with mutual distrust and decentralized authority. The model allows users to share information with dis...
Andrew C. Myers, Barbara Liskov