Sciweavers

330 search results - page 12 / 66
» On Modular Termination Proofs of General Logic Programs
Sort
View
TPHOL
2003
IEEE
14 years 1 months ago
MetaPRL - A Modular Logical Environment
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
Jason Hickey, Aleksey Nogin, Robert L. Constable, ...
CCS
2005
ACM
14 years 1 months ago
A modular correctness proof of IEEE 802.11i and TLS
The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of s...
Changhua He, Mukund Sundararajan, Anupam Datta, An...
CTCS
1997
Springer
14 years 4 days ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani
EUROSYS
2007
ACM
13 years 12 months ago
Dynamic updates: another middleware service?
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...
Susanne Cech Previtali
NJC
2006
86views more  NJC 2006»
13 years 8 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...