A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-22110-1_23
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Controlling Polyvariance for Specialization-Based Verification

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Extending Pruning Techniques to Polymorphic Second Order Λ-Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Verification Condition Generation for Permission Logics With Abstract Predicates and Abstraction Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Verification Support Environment

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1996English

BProVe: Tool Support for Business Process Verification

2017English

Equivalences for Truth Predicates

Review of Symbolic Logic
MathematicsPhilosophyLogic
2017English

Dag-Calculus: A Calculus for Parallel Computation

2016English

Inductive Verification of Hybrid Automata With Strongest Postcondition Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy