884 search results - page 52 / 177 » A Proof Theory for DL-Lite |
186
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
180
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
284
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
159
click to vote
LICS
2008
IEEE
16 years 15 days ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
206
click to vote
HASKELL
2009
ACM
16 years 19 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...