1716 search results - page 191 / 344 » Proving Conditional Termination |
130
Voted
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
122
click to vote
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
126
Voted
CSFW
2004
IEEE
15 years 6 months ago
2004
IEEE
Information flow security properties such as noninterference ensure the protection of confidential data by strongly limiting the flow of sensitive information. However, to deal wi...
106
Voted
CHARME
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refine...
151
Voted
DLOG
2007
15 years 5 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...