Change search
ReferencesLink to record
Permanent link

Direct link
Fixpoint Analysis of Type and Alias in AKL Programs
Number of Authors: 2
1994 (English)Report (Refereed)
Abstract [en]

We have defined and implemented a method for analysis of the CCP language AKL in the spirit of abstract interpretation that uses a static set of semantic equations which abstracts the concurrent execution of an AKL program. The method strictly separates the setting up of the equation system from the solving of the system with a fixpoint procedure. The computation strategies used, results for a number of test programs and the conclusions we draw from this experimental effort are reported. The software implementing the system described herein, is deliverable number D.WP.1.6.1.M2 in the ESPRIT project ParForce 6707.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1994, 1. , 42 p.
Series
SICS Research Report, ISSN 0283-3638 ; R94:13B
Keyword [en]
Concurrent Constraint Programming, Analysis, AKL, fixpoint computation
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-21385OAI: oai:DiVA.org:ri-21385DiVA: diva2:1041421
Note
Revised report.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(309 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 309 kBChecksum SHA-512
38c453c606b5345c3db4945890a6e059c030803b8507c4cde6e043558e52fd7020c959fe8ebcededccf13f7adb8b31af2fe2015af91fc5d8681582a1aefa21a6
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 2 hits
ReferencesLink to record
Permanent link

Direct link