Proceedings of the 21st International Conference on Real-Time Networks and Systems 2013
DOI: 10.1145/2516821.2516841
|View full text |Cite
|
Sign up to set email alerts
|

Timing analysis enhancement for synchronous program

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…Mendler et al [20] propose an algebraic approach for the WCRT analysis for Esterel programs. Raymond et al [25] have been concerned with infeasible paths in the binary code under timing analysis that are implied by high-level functional properties given in synchronous languages, the concrete language in their design being the dataflow language Lustre [5]. This work is related to our concept of reactive infeasible paths, however the authors use an existing model checker to verify the feasibility of paths according to high-level semantics and to trace the functional properties from Lustre to C and from C to binary code.…”
Section: Related Workmentioning
confidence: 99%
“…Mendler et al [20] propose an algebraic approach for the WCRT analysis for Esterel programs. Raymond et al [25] have been concerned with infeasible paths in the binary code under timing analysis that are implied by high-level functional properties given in synchronous languages, the concrete language in their design being the dataflow language Lustre [5]. This work is related to our concept of reactive infeasible paths, however the authors use an existing model checker to verify the feasibility of paths according to high-level semantics and to trace the functional properties from Lustre to C and from C to binary code.…”
Section: Related Workmentioning
confidence: 99%
“…But in a parallel system the environment of M is constrained and may not be able to exercise the sequence of sensitisations to reach the worst case configuration. In order to get tighter WCET results practical approaches have used full state space exploration [1], context-sensitive WCET analysis [15] or iterative narrowing using flow facts generated by model checking [20], or tick expressions [24]. All these approaches depend on preserving some or all of the sequencing information of the IO-BTCAs and their synchronisation via signals to detect incompatibility of local states or transitions.…”
Section: The Wcet Of a Composition Of Io-btcasmentioning
confidence: 99%
“…Existing WCET techniques for ISP [21,24,20] have been largely guided by heuristics using general-purpose analysis tools such as ILP, model-checking, SATsolving, and micro-architectural modelling. The evaluations of the methods are based on empirical benchmarking.…”
Section: Introductionmentioning
confidence: 99%
“…Mendler et al [31] propose an algebraic approach for the WCRT analysis for Esterel programs running on a reactive processor. Raymond et al [32] propose an approach to improve WCET analysis by checking feasibility of computed longest paths using model checking at the modeling level. Want et al propose an ILP-based approach that exploits concurrency explicitly in the ILP formulation to avoid state space explosion [33].…”
Section: Related Workmentioning
confidence: 99%