Proving Acceptability Properties of Relaxed Nondeterministic Approximate Programs

ACM SIGPLAN Notices - United States
doi 10.1145/2345156.2254086
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

On Proving Syntactic Properties of CPS Programs

BRICS Report Series
1999English

Proving Properties of Constraint Logic Programs by Eliminating Existential Variables

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Proactive Control of Approximate Programs

2016English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Debugging Nondeterministic Failures in Linux Programs Through Replay Analysis

Scientific Programming
Computer Science ApplicationsSoftware
2018English

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy