Sciweavers

102 search results - page 9 / 21
» Symbolic Model Checking for Probabilistic Processes
Sort
View
RTSS
2008
IEEE
15 years 6 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
107
Voted
QEST
2006
IEEE
15 years 5 months ago
LiQuor: A tool for Qualitative and Quantitative Linear Time analysis of Reactive Systems
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
Frank Ciesinski, Christel Baier
ICALP
2001
Springer
15 years 4 months ago
Symbolic Trace Analysis of Cryptographic Protocols
A cryptographic protocol can be described as a system of concurrent processes, and analysis of the traces generated by this system can be used to verify authentication and secrecy ...
Michele Boreale
CORR
2010
Springer
144views Education» more  CORR 2010»
14 years 11 months ago
Algorithmic Verification of Single-Pass List Processing Programs
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...
Rajeev Alur, Pavol Cerný
LICS
2009
IEEE
15 years 6 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...