Amanote Research
Register
Sign In
A Practical Type Analysis for Verification of Modular Prolog Programs
doi 10.1145/1328408.1328418
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2008
Authors
Pawel S. Pietrzak
Jesús Correas Fernández
Germán Puebla
Manuel V. Hermenegildo
Publisher
ACM Press
Related search
Modular Verification of Programs With Effects and Effect Handlers in Coq
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Practical Approach for Performance Analysis of Shared-Memory Programs
A Framework for the Principled Debugging of Prolog Programs: How to Debug Non-Terminating Programs
Programs as Collections of Communicating Prolog Units
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Modular Verification of Higher-Order Methods With Mandatory Calls Specified by Model Programs
ACM SIGPLAN Notices
Computer Science
Modular Verification of Higher-Order Methods With Mandatory Calls Specified by Model Programs
A Comparison of Modular Verification Techniques
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Automatic Compile-Time Parallelization of Prolog Programs for Dependent And-Parallelism
Relatively Complete Refinement Type System for Verification of Higher-Order Non-Deterministic Programs
Proceedings of the ACM on Programming Languages
