Sciweavers

ATVA
2010
Springer
129views Hardware» more  ATVA 2010»
13 years 5 months ago
CRI: Symbolic Debugger for MCAPI Applications
We present a trace-driven SMT-based symbolic debugging tool for MCAPI (Multicore Association Communication API) applications. MCAPI is a newly proposed standard that provides an AP...
Mohamed Elwakil, Zijiang Yang, Liqiang Wang
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 5 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 5 months ago
GAVS: Game Arena Visualization and Synthesis
Chih-Hong Cheng, Christian Buckl, Michael Luttenbe...
ATVA
2010
Springer
284views Hardware» more  ATVA 2010»
13 years 5 months ago
YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
Ukachukwu Ndukwu, A. K. McIver
ATVA
2010
Springer
151views Hardware» more  ATVA 2010»
13 years 5 months ago
Abstraction Learning
Joxan Jaffar, Jorge Navas, Andrew E. Santosa
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
13 years 5 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 5 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 5 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia