97 search results - page 17 / 20 » Verifying Multi-Agent Systems by Model Checking Three-valued... |
TACAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
121
Voted
ATC
2008
Springer
15 years 8 days ago
2008
Springer
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...
94
Voted
ICCAD
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
94
Voted
STTT
2010
14 years 5 months ago
2010
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...