Related articles |
---|
ASN.1 Compilers timm@iconz.co.nz (Tim Mew) (1996-10-20) |
Re: ASN.1 Compilers Christian.Rinderknecht@inria.fr (Christian Rinderknecht) (1996-10-24) |
Re: ASN.1 Compilers etxmow@eua.ericsson.se (1996-10-30) |
From: | Christian Rinderknecht <Christian.Rinderknecht@inria.fr> |
Newsgroups: | comp.compilers |
Date: | 24 Oct 1996 22:21:03 -0400 |
Organization: | INRIA-Rocquencourt |
References: | 96-10-105 |
Keywords: | tools |
Tim Mew wrote:
> Has anyone had experience with ASN.1 compilers? I'm aware that there are 2
> out there, called SNACC and MAVROS.
> Can anyone comment as to the more reliable of the two in terms of memory
> leaks and other bugs? I'm looking at using ASN.1 BER encoding in a mission
> critical, "for(;;)" type of system, so memory leaks need to be avoided at
> all costs!
I am finishing a PhD about the formalisation of ASN.1, so I don't
directly use ASN.1 compilers (their back-ends are no concern of me)
but I use to be interested in the way they accept or reject correct
specifications. The main point is that they are in general not
robust. This is mainly due to the difficult interpretation of the
normative documents (ISO and ITU-T). You should have a look at
<a href="http://www.inria.fr/rodeo/personnel/hoschka/asn1.html">ASN.1 Homepage</a>
You'll find a lot of fruitful pointers.
You should also post to the comp.protocols.iso newsgroup.
Their are two interesting mailing-list:
asn1@oss.com (subscribe at asn1-request@oss.com)
which is the Open System Solution Inc. mailing list
(BTW they sell a well-known compiler)
snacc@cs.ubc.ca (subscribe at snacc-request@cs.ubc.ca)
which is the SNACC mailing-list.
Hope this helps,
Christian
----------------------------------------------------------------------------
INRIA Rocquencourt E-mail: Christian.Rinderknecht@inria.fr
(Domaine de Voluceau) Web : http://pauillac.inria.fr/~rinderkn
BP 105 Phone : +33 (1) 39 63 53 16
F-78153 Le Chesnay Cedex Fax : +33 (1) 39 63 53 30
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.