218 search results - page 30 / 44 » Verifying Safety Properties with the TLA Proof System |
126
click to vote
CADE
1992
Springer
15 years 3 months ago
1992
Springer
Abstract. We exhibit a methodology for formulating and verifying metatheorems about deductive systems in the Elf language, an implementation of the LF Logical Framework with an ope...
156
click to vote
PLPV
2011
ACM
14 years 2 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
106
click to vote
DC
2010
14 years 11 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
117
click to vote
CSFW
2007
IEEE
15 years 3 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
100
click to vote
ENTCS
2006
14 years 11 months ago
2006
Component based development is a promising approach for embedded systems. Typical for embedded software is the presence of resource constraints in multiple dimensions. An essentia...