788 search results - page 142 / 158 » Symbolic Equivalence Checking |
CAV
2006
Springer
13 years 11 months ago
2006
Springer
Atomicity-checking is a powerful approach for finding subtle concurrency errors in shared-memory multithreaded code. The goal is to verify that certain code sections appear to exec...
ESORICS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
NIL
1991
13 years 11 months ago
1991
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...