A modular and generic analysis server system for functional logic programs

Authors:
Michael Hanus;Fabian Skrlac
Affiliations:
University of Kiel, Kiel, Germany;University of Kiel, Kiel, Germany
Venue:
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
Year:
2014

Citing 19
Cited 0

A unified computation model for functional and logic programming

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types as abstract interpretations

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A needed narrowing strategy

Journal of the ACM (JACM)
Data flow analysis of applicative programs using minimal function graphs

POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
TOY: A Multiparadigm Declarative System

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
The Theory and Practice of Transforming Call-by-need into Call-by-value

Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Definitional Trees

Proceedings of the Third International Conference on Algebraic and Logic Programming
Constructor-based conditional narrowing

Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Definitional interpreters for higher-order programming languages

ACM '72 Proceedings of the ACM annual conference - Volume 2
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Functional logic programming

Communications of the ACM
Operational semantics for declarative multi-paradigm languages

Journal of Symbolic Computation
Hoopl: a modular, reusable library for dataflow analysis and transformation

Proceedings of the third ACM Haskell symposium on Haskell
KiCS2: a new compiler from Curry to Haskell

WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Nondeterminism analysis of functional logic programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Declarative programming with function patterns

LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
An ER-based framework for declarative web programming

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
An overview of ciao and its design philosophy

Theory and Practice of Logic Programming - Prolog Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the design, implementation, and application of a system, called CASS, for the analysis of functional logic programs. The system is generic so that various kinds of analyses (e.g., groundness, non-determinism, demanded arguments) can be easily integrated. In order to analyze larger applications consisting of dozens or hundreds of modules, CASS supports a modular and incremental analysis of programs. Moreover, it can be used by different programming tools, like documentation generators, analysis environments, program optimizers, as well as Eclipse-based development environments. For this purpose, CASS can also be invoked as a server system to get a language-independent access to its functionality. CASS is completely implemented in the functional logic language Curry as a master/worker architecture to exploit parallel or distributed execution environments.