Sciweavers

24 search results - page 3 / 5
» Proofs About Lists Using Ellipsis
Sort
View
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
13 years 11 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
JUCS
2006
104views more  JUCS 2006»
13 years 7 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
EJC
2008
13 years 7 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
PERVASIVE
2004
Springer
14 years 10 days ago
eSeal - A System for Enhanced Electronic Assertion of Authenticity and Integrity
Ensuring authenticity and integrity are important tasks when dealing with goods. While in the past seal wax was used to ensure the integrity, electronic devices are now able to tak...
Christian Decker, Michael Beigl, Albert Krohn, Phi...
CONEXT
2008
ACM
13 years 8 months ago
High performance traffic shaping for DDoS mitigation
Distributed Denial of Service (DDoS) attack mitigation systems usually generate a list of filter rules in order to block malicious traffic. In contrast to this binary decision we ...
Markus Goldstein, Matthias Reif, Armin Stahl, Thom...