Scalable and precise refinement of cache timing analysis via path-sensitive verification
type: Item
instance of: scholarly article
title: Scalable and precise refinement of cache timing analysis via path-sensitive verification
zbMATH Open document ID: 1291.68068
author: Sudipta Chattopadhyay
author: Abhik Roychoudhury
published in: Real-Time Systems
publication date: 2014-07-14T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 6316639
zbMATH Keywords: WCET analysis
zbMATH Keywords: abstract interpretation
zbMATH Keywords: model checking
zbMATH Keywords: constraint solving
describes a project that uses: SPIN
describes a project that uses: DART
describes a project that uses: CBMC
describes a project that uses: KLEE
describes a project that uses: WPDS++
MaRDI profile type: MaRDI publication profile
full work available at URL: s11241-013-9178-0
OpenAlex ID: W2054701692
cites work: Compiler Construction
cites work: Computer Aided Verification
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Bounded model checking using satisfiability solving
cites work: Symbolic execution and program testing
cites work: Analysis of cache-related preemption delay in fixed-priority preemptive scheduling
cites work: Chronos: A timing analyzer for embedded software
cites work: Timing predictability of cache replacement policies
DOI: 10.1007/S11241-013-9178-0
description: scientific article; zbMATH DE number 6316639