Sciweavers

4666 search results - page 93 / 934
» Equations on Timed Languages
Sort
View
210
Voted
POPL
2006
ACM
16 years 1 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
106
Voted
FORMATS
2005
Springer
15 years 6 months ago
Real Time Temporal Logic: Past, Present, Future
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
Oded Maler, Dejan Nickovic, Amir Pnueli
CGO
2008
IEEE
15 years 7 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
73
Voted
IPPS
2006
IEEE
15 years 6 months ago
Modeling user perceived unavailability due to long response times
In this paper, we introduce a simple analytical modeling approach for computing service unavailability due to long response time, for infinite and finite single-server systems a...
Magnos Martinello, Mohamed Kaâniche, Karama ...
89
Voted
HYBRID
2005
Springer
15 years 6 months ago
Non-uniqueness in Reverse Time of Hybrid System Trajectories
Under standard Lipschitz conditions, trajectories of systems described by ordinary differential equations are well defined in both forward and reverse time. (The flow map is inv...
Ian A. Hiskens