January 2003 - Haskell

Final CfP First International Conference on Security in Pervasive Computing (SPC2003)
by Dieter Hutter 29 Jan '03

29 Jan '03

-------------------------------------------- We are sorry if you receive multiple copies! -------------------------------------------- Call for Participation ---------------------- First International Conference on Security in Pervasive Computing (SPC-2003) March 12 - 14, 2003 in Boppard, Germany http://www.dfki.de/SPC2003 (online registration) The ongoing compression of computing facilities into small and mobile devices like handhelds, portables or even wearable computers will enhance an ubiquitous information processing. The basic para- digm of such a pervasive computing is the combination of strongly decentralized and distributed computing with the help of diversified devices allowing for spontaneous connectivity via the internet. Computers will become invisible to the users awareness and exchange of information between devices will effectively defy users control. Assuming a broad usage of more powerful tools and more effective ways to use them the quality of every day life will be strongly influenced by the dependability of the new technology. Information stored, processed, and transmitted be the various devices is one of the most critical resources. Threats exploiting vulnerabilities of new kinds of user interfaces, displays, operating systems, networks, and wireless communications will cause new risks of loosing confidentiality, integrity, and availability. Can these risks be reduced by countermeasures to an acceptable level or do we have to redefine political and social demands as it is expressed by the Gartner Group from a privacy perspective: By 2010, driven by the improving capabilities of data analysis ... privacy will become a meaningless concept in Western societies. Topics of Interest: ------------------- The objective of this conference is to develop new security concepts for complex application scenarios based on systems like handhelds, phones, smartcards, and smart labels hand in hand with the emerg- ing technology of ubiquitous and pervasive computing. Particular subjects are methods and technology concerning the identification of risks, the definition of security policies, and the development of security measures that are related to the specific aspects of ubiquitous and pervasive computing like mobility, communication, and secure hardware/software platforms. Conference Schedule: -------------------- In consideration of the novel character of the conference theme it is planned to have three kinds of events: - invited talks that give an introduction into security related aspects of pervasive computing: Friedemann Mattern (ETH Zurich): The Age of Pervasive Computing - Everything Smart, Everything Connected? Hideyuki Nakashima (Cyber Assist Research Center, Japan) Cyber Assist Project and Its Security Requirements Frank Stajano (Cambridge University) Security in Pervasive Computing Markus Luidolt (Philips Semiconductors, Austria) The World of Smart Labels - applications and security aspects Paul Karger (IBM Watson Research, USA) tbd. - sessions for the presentation of the technical papers: Time Constraint Delegation for P2P Data Decryption, Tie Yan Li SAOTS: A New Efficient Server Assisted Signature Scheme for Pervasive Computing, Kemal Bicakci and Nazife Baykal Visual Crypto Displays enabling Secure Communications, P. Tuyls, T. Kevenaar, G.J. Schrijen, A.A.M. Staring, M. van Dijk Smart Devices and Software Agents: the Basics of Good Behaviour, Howard Chivers, John Clark, and Susan Stepney Enforcing Security Policies via Types, Daniele Gorla and Rosario Pugliese Trust Context Spaces: An Infrastructure for Pervasive Security, Philip Robinson, Michael Beigl Authentication in Pervasive Computing, Irfan Zakiuddin, Sadie Creese, Bill Roscoe, Michael Goldsmith Dependability Issues of Pervasive Computing in a Healthcare Environment, Juergen Bohn, Felix Gaertner, Harald Vogt End-to-end trust in pervasive computing starts with recognition, Jean-Marc Seigneur, Stephen Farrell, Christian Damsgaard Jensen, Elizabeth Gray, Chen Yong Security and Privacy Aspects of Low-Cost Radio Frequency Identification Systems, Daniel W. Engels, Ronald L. Rivest, Sanjay E. Sarma and Stephen A. Weis Embedding Distance Bounding Protocols within Intuitive Interactions Laurent Bussard, Yves Roudier Protecting Access to People Location Information Urs Hengartner, Peter Steenkiste Enlisting Hardware Architecture to Thwart Malicious Code Injection Ruby B. Lee, David K. Karig, John P. McGregor, and Zhijie Shi Protecting Security Policies in Ubiquitous Environments Using One-Way Functions Hakan Kvarnstrom, Hans Hedbom and Erland Jonsson. Implementing a Formally Verifiable Security~Protocol in Java Card, Engelbert Hubbers, Martijn Oostdijk, Erik Poll A Methodological Assessment of Location Privacy Risks in Wireless Hotspot Networks Marco Gruteser Towards Using Possibilistic Information Flow Control to Design Secure Multiagent Systems Axel Schairer Optimized Smart Card RISC Architecture for Multiple-Precision Modular Arithmetic Johann Großschaedl, Guy-Armand Kamendje - working groups that focus on particular problems areas. The results of the working groups will be presented and discussed in panel sessions. The final results will be published together with the technical papers in the Lecture Notes Series on Computer Science (LNCS). Location: --------- It will be held at an old former monastery in Boppard, Germany. Boppard is a nice small town located in the rhine valley about one hour away from Frankfurt airport. Organisation: ------------- The conference will be organised jointly by - German Information Security Agency (BSI) - German Research Center for Artificial Intelligence (DFKI) - Institute for Telematics, University of Freiburg. Program Committee ----------------- Michael Beigl (University of Karlsruhe) Joshua Guttman (MITRE) Dieter Hutter (DFKI) (co-organiser) Paul Karger (IBM Watson Research) Friedemann Mattern (ETH Zurich) Catherine Meadows (Naval Research Lab) Guenter Mueller (University of Freiburg) (co-organiser) Joachim Posegga (SAP) Kai Rannenberg (University of Frankfurt) Kurt Rothermel (University of Stuttgart) Ryoichi Sasaki (Tokyo Denki University) Frank Stajano (University of Cambridge) Werner Stephan (DFKI) (co-organiser) Moriyasu Takashi (Hitachi Ltd) Seiji Tomita (NTT Information Platform Laboratories) Markus Ullmann (BSI) (co-organiser)

1 0

ANNOUNCE: greencard, v2.05
by Sigbjorn Finne 29 Jan '03

29 Jan '03

A new release of greencard is now available from http://haskell.org/greencard/ Not much new in terms of features, but binary bundles have been brought up-to-date wrt the current version of GHC (5.04.2) --sigbjorn

2 1

announce: buddha 0.4, a declarative debugger for Haskell 98
by Bernard James POPE 28 Jan '03

28 Jan '03

Hi all, Buddha version 0.4 is now available. It is a declarative debugger for Haskell 98 programs. It supports most of the language and standard libraries. Currently it requires ghc 5.04 or greater, and has only been tested on unix-ish machines. Documentation and source code are available here: www.cs.mu.oz.au/~bjpop/buddha Cheers, Bernie.

2 1

Preliminary Release: FastIO library
by Hal Daume III 28 Jan '03

28 Jan '03

Hi all, I had intended to polish this a bit before releasing it, but there has been some traffic on the mailing list recently about how do to binary IO and this is part of the FastIO library I've been slowly putting together. It's not at all fancy and lacks docs at this point, but people who are familiar with C might find it useful. I originally wrote it because I find myself reading in files containing ints and float a *lot* and going through haskell strings is ridiculously slow. However, it also supports fwrite/fread style binary files (which are of course incompatable across different endiannesses). There is a release with a README telling you how to build it at: http://www.isi.edu/~hdaume/haskell/FastIO.tar.gz It should be pretty self-explanatory; there's even a small test program in there which should make everything very clear. Best, - Hal

1 0

Re: Binary I/O in haskell.
by Immanuel Litzroth 28 Jan '03

28 Jan '03

>If you dont want to wait for libraries in development, the easiest way >to do real binary IO is via hGetArray and hPutArray which let you get >and put raw arrays of bytes (Word8). unfortunatly, there is no way to do >binary IO in pure Haskell 98. > >http://haskell.cs.yale.edu/ghc/docs/latest/html/base/Data.Array.IO.html This is what i have been using (since yesterday). I did notice something odd. I create an array with newArray (0,1023) 0, open a file and pass the handle and the array to hGetArray. This gives me an Array with 1024 bytes, which I then cast to an array with Word16 with the castIOUArray (since my data is Word16 little endian and my machine is LE (intel)). When i get the bounds of this new array it still gives 1024 and dereferencing the new array's values gives me the correct values in the first half of the array, the second half is 0. What exactly does the castIOUArray function do? >there is some work on a standard Binary library in progress as well. Can you give me a pointer to this library? Thanks for your reply Immanuel _________________________________________________________________ Receive your Hotmail & Messenger messages on your mobile phone with MSN Mobile http://www.msn.be/gsm/smsservices

2 1

RDP'03 - Second announcement
by German Vidal 28 Jan '03

28 Jan '03

[Apologies for multiple copies of this announcement] ==================================================================== RDP'03 - Second announcement ==================================================================== Federated Conference on Rewriting, Deduction and Programming (RDP) http://www.dsic.upv.es/~rdp03 Valencia, Spain, June 8 - 14, 2003 ==================================================================== We are pleased to announce the Federated Conference on Rewriting, Deduction and Programming (RDP) to be held in Valencia, Spain, in June 2003. The conference will be hosted by the Departamento de Sistemas Informaticos y Computacion (DSIC) at the Universidad Politecnica de Valencia. ____________________________________________________________________ PARTICIPANTS * 14th International Conference on Rewriting Techniques and Applications (RTA'03), June 9-11, 2003 Important dates: Jan 15, 2003 - Deadline for electronic submission of title and short abstract Jan 22, 2003 - Deadline for electronic submission of papers Mar 15, 2003 - Notification of acceptance of papers Apr 7, 2003 - Deadline for final versions of accepted papers Program chair: Robert Nieuwenhuis (roberto(a)lsi.upc.es) * 6th International Conference on Typed Lambda Calculi and Applications (TLCA'03), June 10-12, 2003 Important dates: Dec 2, 2003 - Deadline for submission of papers Jan 30, 2003 - Notification of acceptance/rejection Mar 15, 2003 - Deadline for final versions of accepted papers Program chair: Martin Hofmann (mhofmann(a)informatik.uni-muenchen.de) * 4th International Workshop on First order Theorem Proving (FTP'03), June 12-14, 2003 Important dates: Apr 1, 2003 - Deadline for submission of papers Apr 29, 2003 - Notification of acceptance/rejection May 10, 2003 - Deadline for final versions of accepted papers Program co-chairs: Ingo Dahn (dahn(a)uni-koblenz.de) Laurent Vigneron (vigneron(a)loria.fr) * IFIP Working Group 1.6 on Term Rewriting (WG 1.6), June 12, 2003 Program chair: Claude Kirchner (Claude.Kirchner(a)loria.fr) * 4th International Workshop on Rule-Based Programming (RULE'03), June 9, 2003 Program co-chairs: Jean-Louis Giavitto (giavitto(a)lami.univ-evry.fr) Pierre-Etienne Moreau (Pierre-Etienne.Moreau(a)loria.fr) * 17th International Workshop on Unification (UNIF'03), June 8-9, 2003 Organizers: Michael Kohlhase (kohlhase%2B(a)cs.cmu.edu) Jordi Levy (levy(a)iiia.csic.es) Joachim Niehren (niehren(a)ps.uni-sb.de) Mateu Villaret (villaret(a)ima.udg.es) * 12th International Workshop on Functional and (Constraint) Logic Programming (WFLP'03), June 12-13, 2003 Important dates: Mar 23, 2003 - Deadline for submission of papers Apr 25, 2003 - Notification of acceptance/rejection May 11, 2003 - Deadline for final versions of accepted papers Program chair: German Vidal (gvidal(a)dsic.upv.es) * 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS'03), June 8, 2003 Important dates: Mar 23, 2003 - Deadline for submission of papers Apr 25, 2003 - Notification of acceptance/rejection May 11, 2003 - Deadline for final versions of accepted papers Program co-chairs: Bernhard Gramlich (gramlich(a)logic.at) Salvador Lucas (slucas(a)dsic.upv.es) * 6th International Workshop on Termination (WST'03), June 13-14, 2003 Program chair: Albert Rubio (albert(a)lsi.upc.es) ____________________________________________________________________ RDP'03 ORGANIZERS The ELP group at the Universidad Politecnica de Valencia Officials: Salvador Lucas (chair of the organizing committee) Elvira Albert (secretary) Maria Alpuente (workshops chair) Jose Hernandez (local arrangements) Javier Oliver (secretary) Maria Jose Ramirez (local arrangements chair) German Vidal (publicity chair) ____________________________________________________________________ CONTACT Salvador Lucas Departamento de Sistemas Informaticos y Computacion (DSIC) Universidad Politecnica de Valencia Camino de Vera, s/n E-46022 Valencia (Spain) phone: + 34 96 387 7353 (73531) fax: + 34 96 387 7359 e-mail: slucas(a)dsic.upv.es URL: http://www.dsic.upv.es/users/elp/slucas.html ____________________________________________________________________ FURTHER INFORMATION RDP website: http://www.dsic.upv.es/~rdp03 The ELP group: http://www.dsic.upv.es/users/elp ====================================================================

1 0

AW: Binary I/O in haskell.
by Markus.Schnell＠infineon.com 28 Jan '03

28 Jan '03

I tried this also, reading in WAV-Files as a String and then converting it into the appropriate format. That was really nearly infinitely slow. Now I'm doing all low-level sample and sound card stuff in C and use Haskell to controll it. It's a good balance, I think. I guess it would be possible purely in Haskell with the Binary module, but I never was sure which of the many was working on my Mac. So I didn't really try. (Can anybody comment on that?) Markus -----Ursprüngliche Nachricht----- Von: Immanuel Litzroth [mailto:immanuell@enfocus.be] Gesendet am: Montag, 27. Januar 2003 11:55 An: haskell(a)haskell.org Betreff: Binary I/O in haskell. I am currently writing a small sound/dsp application in haskell, and I am having some problems deciding on the best way to do I/O from soundfiles. I am currently only implementing raw data input, and I am looking for code examples that demonstrate the best way(s) to implement reading in and processing large amounts of data. Any help is welcome Immanuel *************************************************************************** His endeavours to improve these conditions by innovations in the current methods of teaching are fully described in his writings; these made him unpopular with his brethren in the order and led to his removals to the monastery of Pomposa near Ferrara, Italy. Here the same lot seems to have befallen him. About Guido of Arezzo Immanuel Litzroth Software Development Engineer Enfocus Software Kleindokkaai 3-5 B-9000 Gent Belgium Voice: +32 9 269 23 90 Fax : +32 9 269 16 91 Email: Immanuell(a)enfocus.be web : www.enfocus.be *************************************************************************** _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell

1 0

MonadIO needs catch?
by John Meacham 28 Jan '03

28 Jan '03

while genericizing my utility libraries to work within any MonadIO (http://haskell.cs.yale.edu/ghc/docs/latest/html/base/Control.Monad.Trans.ht…) I ran into a problem, 'liftIO' is not powerful enough to catch exceptions in a MonadIO. the closest one can get is > genCatch :: MonadIO m => IO a -> (Exception -> IO a) -> m a when we want.. > genCatch :: MonadIO m => m a -> (Exception -> m a) -> m a The only way i can think of to solve this is add 'catch' (perhaps 'catchIO'? 'genCatch'?) to the MonadIO class. some open questions are whether it is possible to implement catch for any MonadIO? I would think so, since you need only store the 'internal state' of your monad at the genCatch and continue with that if an exception was raised. (this might mix badly with other extensions though?) at worst a MonadIOCatchable deriving from MonadIO could be added... John -- --------------------------------------------------------------------------- John Meacham - California Institute of Technology, Alum. - john(a)foo.net ---------------------------------------------------------------------------

1 0

Binary I/O in haskell.
by Immanuel Litzroth 27 Jan '03

27 Jan '03

I am currently writing a small sound/dsp application in haskell, and I am having some problems deciding on the best way to do I/O from soundfiles. I am currently only implementing raw data input, and I am looking for code examples that demonstrate the best way(s) to implement reading in and processing large amounts of data. Any help is welcome Immanuel *************************************************************************** His endeavours to improve these conditions by innovations in the current methods of teaching are fully described in his writings; these made him unpopular with his brethren in the order and led to his removals to the monastery of Pomposa near Ferrara, Italy. Here the same lot seems to have befallen him. About Guido of Arezzo Immanuel Litzroth Software Development Engineer Enfocus Software Kleindokkaai 3-5 B-9000 Gent Belgium Voice: +32 9 269 23 90 Fax : +32 9 269 16 91 Email: Immanuell(a)enfocus.be web : www.enfocus.be ***************************************************************************

2 1

Bizarre Haskell Problem
by Matthew Donadio 27 Jan '03

27 Jan '03

Hi all, I am currently a having a bizarre Haskell problem, and was wondering if anyone had any suggestions. This is a snippet from a source file: > foo n = [ a ^* i | i <- [0..(n-2)] ] > where i ^* j = (i ^ j) `mod` n > a = generator n > rader :: Array Int (Complex Double) -> Int -> Array Int (Complex Double) > rader f n = foo a n -- DEBUG: should be f' > where h = listArray (0,n-2) [ f!(a ^* (n-(1+n'))) | n' <- [0..(n-2)] ] > g = listArray (0,n-2) [ w (a ^* n') | n' <- [0..(n-2)] ] > f' = array (0,n-1) ((0, sum [ f!i | i <- [0..(n-1)] ]) : [ (a ^* i, f!0 + sum [ h!j * g!((i-j)`mod`(n-1)) | j <- [0..(n-2)] ]) | i <- [0..(n-2)] ]) > w i = cis (-2 * pi * fromIntegral i / fromIntegral n) > i ^* j = (i ^ j) `mod` n > a = generator n Under hugs and ghc, calling 'foo' and 'rader' with the proper arguments will give me different results under certain circumtances. In rader, n is the number of elements in the array. If n is < 23, then everything is OK. If n >= 23, then rader returns the wrong result. The bizarre thing is that if I comment out the definitions of h and f' in rader, then it returns the correct results. Hugs also give different reduction counts depending on whether h and f' are commented out or not. If I add any more definitions that reference f, then rader misbehaves. What is even more bizarre is that if I copy everything into a separate file, then it work for all n. Any suggestions or hints, other than just use a separate file? Separate files isn't really an option, because the above is simplified a bit, and the final version would have mutually recursive modules, which hugs can't handle. Thanks. -- Matthew Donadio (m.p.donadio(a)ieee.org)

2 1