Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
390
METAMOC: Modular Execution Time Analysis using Model Checking
- In 10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010
, 2010
"... Safe and tight worst-case execution times (WCETs) are important when scheduling hard real-time systems. This paper presents METAMOC, a path-based, modular method, based on model checking and static analysis, that determines safe and tight WCETs for programs running on platforms fea-turing caching an ..."
Abstract
-
Cited by 13 (1 self)
- Add to MetaCart
Safe and tight worst-case execution times (WCETs) are important when scheduling hard real-time systems. This paper presents METAMOC, a path-based, modular method, based on model checking and static analysis, that determines safe and tight WCETs for programs running on platforms fea-turing caching
Coloured Petri Nets and CPN Tools for Modelling and Validation of Concurrent Systems
- INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER
, 2007
"... Coloured Petri Nets (CPNs) is a language for the modelling and validation of systems in which concurrency, communication, and synchronisation play a major role. Coloured Petri Nets is a discrete-event modelling language combining Petri nets with the functional programming language Standard ML. Petri ..."
Abstract
-
Cited by 172 (2 self)
- Add to MetaCart
to execute events in the modelled system. CPN Tools is an industrial-strength computer tool for constructing and analysing CPN models. Using CPN Tools, it is possible to investigate the behaviour of the modelled system using simulation, to verify properties by means of state space methods and model checking
Schedulability and modular analysis: how to fit timing model?
"... In real-time systems, program execution must fulfill timing constraints and respect deadlines. Schedulability analysis checks the feasibility of a schedule according to those timing constraints. In such analysis, a task i is abstracted by a timing model, typically (at least) made of a period Ti, a d ..."
Abstract
- Add to MetaCart
In real-time systems, program execution must fulfill timing constraints and respect deadlines. Schedulability analysis checks the feasibility of a schedule according to those timing constraints. In such analysis, a task i is abstracted by a timing model, typically (at least) made of a period Ti, a
LTL Model Checking for Modular Petri Nets
- In Proc. 25th Int. Conf. Application and Theory of Petri Nets (ICATPN’04
, 2004
"... We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTL-X model checking. We have implemented our method in the r ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTL-X model checking. We have implemented our method
Using model checking for verification of partitioning properties in integrated modular avoinics
- In Proceedings of the Digital Avionics Systems Conference
, 2000
"... Time partitioning is a crucial property for integrated moduIar avionics architectures, particularly those in which applications of different criticalities run on the same processor. In a time-partitioned operating system, the scheduler is responsible for ensuring that the actions of one thread canno ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
cannot affect other threads ' guaranteed access to CPU execution time. However, the large number of variables affecting application execution interleavings makes it difficult and costly to verify time partitioning by traditional means. We believe that automated model checking is a promising
Automatic timing model generation by CFG partitioning and model checking
- In Proceedings of the Conference on Design, Automation, and Test in Europe
, 2005
"... In this paper we present a new measurement-based worst-case execution time (WCET) analysis method. Exhaustive end-to-end measurements are computationally intractable in most cases. Therefore, we propose to measure execution times of subparts of the application. We use heuristic methods and model che ..."
Abstract
-
Cited by 29 (9 self)
- Add to MetaCart
In this paper we present a new measurement-based worst-case execution time (WCET) analysis method. Exhaustive end-to-end measurements are computationally intractable in most cases. Therefore, we propose to measure execution times of subparts of the application. We use heuristic methods and model
A Modular and Retargetable Framework for Tree-based WCET Analysis
- In Proc. of the 13th Euromicro Conference on Real-Time Systems
, 2001
"... A fundamental requirement for hard real-time systems is the knowledge of tasks' worst case execution times (WCET). Static worst-case execution time analysis (WCET analysis'), thanks' to the static analysis of a piece of source code, returns an upper bound of the time required to execu ..."
Abstract
-
Cited by 63 (27 self)
- Add to MetaCart
A fundamental requirement for hard real-time systems is the knowledge of tasks' worst case execution times (WCET). Static worst-case execution time analysis (WCET analysis'), thanks' to the static analysis of a piece of source code, returns an upper bound of the time required
Partial Order reduction for Model Checking of Timed Automata
, 1999
"... Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored control states and the number of generated time zones. The approach is based on a local-time semantics for networks of ti ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
of timed automata defined by Bengtsson et al. [1998], and used originally for local reachability analysis. In this semantics, each component automaton executes asynchronously, in its own local time scale, which is tracked by an auxiliary reference clock. On communication transitions, the automata
Higher-Order Modules and the Phase Distinction
- In Seventeenth ACM Symposium on Principles of Programming Languages
, 1990
"... Typed λ-calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their relation to each other. In earlier work we introduced a predicative function calculus, XML, for modeling several ..."
Abstract
-
Cited by 136 (25 self)
- Add to MetaCart
several aspects of the Standard ML type system. Following MacQueen, our study focused on the use of dependent types to represent the modularity constructs of Standard ML. In addition to shedding some light on the trade-offs between language features, our analysis suggested that the first-order modules
Comparison of ILP and model checking based WCET analysis
, 2008
"... In this report, we present our new worst-case execution time (WCET) analysis tool for Java processors, supporting both implicit path enumeration (IPET) and model checking based execution time estimation. Even though model checking is significantly more expensive than IPET, it offers new possibilitie ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
In this report, we present our new worst-case execution time (WCET) analysis tool for Java processors, supporting both implicit path enumeration (IPET) and model checking based execution time estimation. Even though model checking is significantly more expensive than IPET, it offers new
Results 1 - 10
of
390
