4401 search results - page 194 / 881 » Computing with Default Logic |
113
click to vote
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
140
click to vote
ISMVL
2008
IEEE
15 years 10 months ago
2008
IEEE
The mathematical property of inheritance for certain unary fixed point operations has recently been exploited to enable the efficient formulation of arithmetic algorithms and circ...
130
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
156
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
131
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...