On Proving Syntactic Properties of CPS Programs

BRICS Report Series
doi 10.7146/brics.v6i23.20092
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Aarhus University Library

Related search

Proving Acceptability Properties of Relaxed Nondeterministic Approximate Programs

ACM SIGPLAN Notices
Computer Science
2012English

Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Syntactic Fault Patterns in OO Programs

English

Regression Verification: Proving the Equivalence of Similar Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Proving Safety Properties of Rewrite Theories

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Proving Safety Properties of Software

English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Proving Bounds for Real Linear Programs in Isabelle/Hol

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy