Replacing Conjectures by Positive Knowledge: Inferring Proven Precise Worst-Case Execution Time Bounds Using Symbolic Execution

Jens Knoop; Laura Kovacs; Jakob Zwirchmayr

doi:10.1016/j.jsc.2016.07.023

Replacing Conjectures by Positive Knowledge: Inferring Proven Precise Worst-Case Execution Time Bounds Using Symbolic Execution
Journal article, 2017

static symbolic execution

worst-case execution time (WCET) analysis

symbolic computation

Author

Jens Knoop

Laura Kovacs

Formal Methods

Other publications Research

Jakob Zwirchmayr

Journal of Symbolic Computation

0747-7171 (ISSN) 1095-855X (eISSN)

Vol. 80 101-124

Subject Categories (SSIF 2011)

Computer Science

DOI

10.1016/j.jsc.2016.07.023

Publication data connected to DOI

More information

Created

10/8/2017

If you have questions, need help, find a bug or just want to give us feedback you may use this form, or contact us per e-mail research.lib@chalmers.se.

Message

Your email address

Research.chalmers.se contains research information from Chalmers University of Technology, Sweden. It includes information on projects, publications, research funders and collaborations.

More about coverage period and what is publicly available

Privacy and cookies

Accessibility

Citation Style Language
citeproc-js (Frank Bennett)

Chalmers Library

Chalmers Research

Chalmers Student Theses

SE-412 96 GOTHENBURG, SWEDEN
PHONE: +46 (0)31-772 10 00
WWW.CHALMERS.SE

Replacing Conjectures by Positive Knowledge: Inferring Proven Precise Worst-Case Execution Time Bounds Using Symbolic Execution Journal article, 2017