2137 search results - page 50 / 428 » Proving Abstract Non-interference |
116
Voted
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
131
Voted
BIRTHDAY
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
132
Voted
ICFEM
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Coinduction is a major technique employed to prove behavioral properties of systems, such as behavioral equivalence. Its automation is highly desirable, despite the fact ...
109
Voted
VMCAI
2009
Springer
15 years 9 months ago
2009
Springer
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
158
Voted
ESAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we propose a framework for the security analysis of on-demand, distance vector routing protocols for ad hoc networks, such as AODV, SAODV, and ARAN. The pr...