Sciweavers

93 search results - page 15 / 19
» Partial Order Reduction for Model Checking of Timed Automata
Sort
View
CSFW
2000
IEEE
15 years 1 months ago
Information Flow Analysis in a Discrete-Time Process Algebra
Some of the non interference properties studied in [4, 6, 18] for information flow analysis in computer systems, notably Æ , are reformulated here in a realtime setting. This is...
Riccardo Focardi, Roberto Gorrieri, Fabio Martinel...
ISTA
2003
14 years 10 months ago
Formal Modeling of Communication Traces
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
Sergiy Boroday, Hesham Hallal, Alexandre Petrenko,...
PPOPP
2009
ACM
15 years 10 months ago
Formal verification of practical MPI programs
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...
Anh Vo, Sarvani S. Vakkalanka, Michael Delisi, Gan...
CAV
2008
Springer
113views Hardware» more  CAV 2008»
14 years 11 months ago
Producing Short Counterexamples Using "Crucial Events"
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
Sujatha Kashyap, Vijay K. Garg
CONCUR
1998
Springer
15 years 1 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert