A bridging model for parallel computation
Communications of the ACM
Theoretical Computer Science
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Principles of Program Analysis
Principles of Program Analysis
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Hume: a domain-specific language for real-time embedded systems
Proceedings of the 2nd international conference on Generative programming and component engineering
Generalizing parametric timing analysis
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Bayesian Analysis of Lidar Signals with Multiple Returns
IEEE Transactions on Pattern Analysis and Machine Intelligence
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Static determination of quantitative resource usage for higher-order programs
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Multivariate amortized resource analysis
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Closed-Form Upper Bounds in Static Cost Analysis
Journal of Automated Reasoning
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
| Hi-index | 0.00 |
We present a new compositional approach for analysing the resource usage of reactive box-based systems, as exemplified by Hume. Our analysis deals with a key aspect of reactivity, namely determining the worst-case execution time between some external input event and the associated output event, taking into account repeated box iterations and the possible interactions between boxes in terms of input/output values. In order to achieve this, we capture the system behaviour by abstract interpretation, obtaining counter automata, finite state automata with additional counters that can be used to represent sizes/resource costs and control repetitions. These counter automata precisely capture cost information from the original box-based system, but in a way that is more abstract and therefore easier to analyse. The key contribution of this paper over previous work is that we are able to analyse box-based computations for cyclic systems whose costs may depend on some input parameters and in which the cost formulae are non-linear.