504 search results - page 23 / 101 » Complexity Properties of Restricted Abstract Argument System... |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
AUTONOMICS
2008
ACM
13 years 9 months ago
2008
ACM
Ubiquitous computing and communication environments connect systems and people in unprecedented ways, but also fundamentally challenge the mindset of traditional systems engineeri...
ESORICS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract We propose an approach to certify the information flow security of multi-threaded programs independently from the scheduling algorithm. A scheduler-independent verificatio...
POPL
2005
ACM
14 years 8 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
JOT
2007
13 years 7 months ago
2007
ome this restriction, we develop so-called loose domains which abstract over several precise domains. Similar to the relation between supertypes and subtypes, we get a relation bet...