1615 search results - page 153 / 323 » Distributed Forward Checking |
110
Voted
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
ARTS
1997
Springer
15 years 6 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
107
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
152
click to vote
CL
2002
Springer
15 years 2 months ago
2002
Springer
We introduce a typed variant of Safe Ambients, named Secure Safe Ambients (SSA), whose type system allows behavioral invariants of ambients to be expressed and verified. The most ...
128
click to vote
IPPS
2010
IEEE
15 years 12 days ago
2010
IEEE
Dynamic memory management is one of the most expensive but ubiquitous operations in many C/C++ applications. Additional features such as security checks, while desirable, further w...