Sciweavers

4224 search results - page 704 / 845
» Reasoning about Choice
Sort
View
98
Voted
LISP
2008
105views more  LISP 2008»
15 years 23 days ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
94
Voted
ENTCS
2007
95views more  ENTCS 2007»
15 years 23 days ago
Rijndael for Sensor Networks: Is Speed the Main Issue?
We present an implementation of Rijndael for wireless sensor networks running on Eyes sensor nodes. In previous works, Rijndael has not been considered a suitable encryption algor...
Andrea Vitaletti, Gianni Palombizio
ENTCS
2007
95views more  ENTCS 2007»
15 years 23 days ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed
105
Voted
ENTCS
2007
104views more  ENTCS 2007»
15 years 23 days ago
A Formal Framework for Web Services Coordination
Recently the term Web Services choreography has been introduced to address some issues related to Web Services composition and coordination. Several proposals for describing chore...
Claudio Guidi, Roberto Lucchi, Manuel Mazzara
121
Voted
JUCS
2006
131views more  JUCS 2006»
15 years 23 days ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita