article

Verifying the determinant in parallel

Authors:

Miklos Santha,

Sovanna TanAuthors Info & Claims

Computational Complexity, Volume 7, Issue 2

Pages 128 - 151

https://doi.org/10.1007/PL00001596

Published: 01 November 1998 Publication History

Abstract

No abstract available.

Cited By

View all

Fefferman BRemscrim ZKhuller SVassilevska Williams V(2021)Eliminating intermediate measurements in space-bounded Quantum computationProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451051(1343-1356)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451051
Hoang TThierauf T(2003)The complexity of the characteristic and the minimal polynomialTheoretical Computer Science10.5555/2780705.2781183295:1(205-222)Online publication date: 24-Feb-2003
https://dl.acm.org/doi/10.5555/2780705.2781183
Hoang TThierauf T(2002)The Complexity of the InertiaProceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science10.5555/646840.708824(206-217)Online publication date: 12-Dec-2002
https://dl.acm.org/doi/10.5555/646840.708824
Show More Cited By

Recommendations

Verifying Time Partitioning in the DEOS Scheduling Kernel

This paper describes an experiment to use the Spin model checking system to support automated verification of time partitioning in the Honeywell DEOS real-time scheduling kernel. The goal of the experiment was to investigate whether model checking with ...
Verifying Code and Its Optimizations: An Experience Report
ICSTW '11: Proceedings of the 2011 IEEE Fourth International Conference on Software Testing, Verification and Validation Workshops

We present our experience in formally verifying the correctness of a 200-line industrial C implementation of Cyclic Redundancy Check (CRC) and its optimizations. Our experience indicates that (a) both the specification and verification of even such ...
Verifying higher-order functional programs with pattern-matching algebraic data types
POPL '11

Type-based model checking algorithms for higher-order recursion schemes have recently emerged as a promising approach to the verification of functional programs. We introduce pattern-matching recursion schemes (PMRS) as an accurate model of computation ...

Comments

Information & Contributors

Information

Published In

Computational Complexity Volume 7, Issue 2

Nov. 1998

93 pages

ISSN:1016-3328

Editor:
Joachim von zur Gathen
Univ. of GH Paderborn, Paderborn, Germany

Issue’s Table of Contents

Publisher

Birkhauser Verlag

Switzerland

Publication History

Published: 01 November 1998

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fefferman BRemscrim ZKhuller SVassilevska Williams V(2021)Eliminating intermediate measurements in space-bounded Quantum computationProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451051(1343-1356)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451051
Hoang TThierauf T(2003)The complexity of the characteristic and the minimal polynomialTheoretical Computer Science10.5555/2780705.2781183295:1(205-222)Online publication date: 24-Feb-2003
https://dl.acm.org/doi/10.5555/2780705.2781183
Hoang TThierauf T(2002)The Complexity of the InertiaProceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science10.5555/646840.708824(206-217)Online publication date: 12-Dec-2002
https://dl.acm.org/doi/10.5555/646840.708824
Allender EReinhardt KZhou S(1999)Isolation, Matching, and Counting Uniform and Nonuniform Upper BoundsJournal of Computer and System Sciences10.1006/jcss.1999.164659:2(164-181)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1006/jcss.1999.1646

Abstract

Cited By

Recommendations

Verifying Time Partitioning in the DEOS Scheduling Kernel

Verifying Code and Its Optimizations: An Experience Report

Verifying higher-order functional programs with pattern-matching algebraic data types

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations