Sciweavers

265 search results - page 44 / 53
» entcs 2007
Sort
View
ENTCS
2007
114views more  ENTCS 2007»
14 years 10 months ago
Reporting Failures in Functional Logic Programs
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
Michael Hanus
106
Voted
ENTCS
2007
190views more  ENTCS 2007»
14 years 9 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
ENTCS
2007
132views more  ENTCS 2007»
14 years 10 months ago
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
Martin Hyland, John Power
ENTCS
2007
129views more  ENTCS 2007»
14 years 10 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...
ENTCS
2007
103views more  ENTCS 2007»
14 years 10 months ago
Static Slicing of Rewrite Systems
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
Diego Cheda, Josep Silva, Germán Vidal