1894 search results - page 254 / 379 » A TLA Proof System |
135
click to vote
ECOOP
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
142
click to vote
CCS
2006
ACM
15 years 8 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
164
click to vote
FORMATS
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
119
click to vote
APAL
2010
15 years 4 months ago
2010
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...
136
click to vote
FUIN
2006
15 years 4 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...