235 search results - page 4 / 47 » A General Framework for Sound and Complete Floyd-Hoare Logic... |
IFM
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...
ICDT
1990
ACM
13 years 11 months ago
1990
ACM
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
CSL
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
APAL
1999
13 years 7 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
LOGCOM
2002
13 years 7 months ago
2002
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...