Amanote Research

Amanote Research

    RegisterSign In

Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-49099-x_12
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1999

Authors
Andreas PodelskiWitold CharatonikMartin Müller
Publisher

Springer Berlin Heidelberg


Related search

Ordering Optimisations for Concurrent Logic Programs

English

On Termination of Constraint Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Synthesizing Concurrent Programs Using Answer Set Programming

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

Logic Programs for Consistency-Based Diagnosis.

English

Incremental Analysis of Logic Programs

1995English

Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

The Roadrunner Dynamic Analysis Framework for Concurrent Programs

2010English

Reexecution-Based Analysis of Logic Programs With Delay Declarations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Permission-Based Separation Logic for Multithreaded Java Programs

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy