Amanote Research

Amanote Research

    RegisterSign In

Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms

IEEE Transactions on Software Engineering - United States
doi 10.1109/32.815324
Full Text
Open PDF
Abstract

Available in full text

Categories
Software
Date

January 1, 1999

Authors
J. Rushby
Publisher

Institute of Electrical and Electronics Engineers (IEEE)


Related search

An Overview of Formal Verification for the Time-Triggered Architecture

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Approximation Algorithms for Fault Tolerant Facility Allocation

SIAM Journal on Discrete Mathematics
Mathematics
2013English

Fault-Tolerant Text Data Compression Algorithms

International Journal of Information Technology and Web Engineering
Computer Science
2009English

Formal Verification of Conflict Detection Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Formal Verification of IA-64 Division Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Toward Systematic Design of Fault-Tolerant Systems

Computer
Computer Science
1997English

The Fault Hypothesis for the Time-Triggered Architecture

English

Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Formal Analysis of a Fault-Tolerant Routing Algorithm for a Network-On-Chip

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy