725 search results - page 80 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
186
click to vote
FOSSACS
2007
Springer
16 years 9 days 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...
148
click to vote
ICALP
2005
Springer
15 years 11 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 ...
203
click to vote
PPDP
2005
Springer
15 years 11 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
156
click to vote
ACL
2009
15 years 4 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
180
click to vote
ERLANG
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...