Sciweavers

3224 search results - page 576 / 645
» On Checking Model Checkers
Sort
View
PASTE
2005
ACM
15 years 11 months ago
An empirical framework for comparing effectiveness of testing and property-based formal analysis
Today, many formal analysis tools are not only used to provide certainty but are also used to debug software systems – a role that has traditional been reserved for testing tool...
Jeremy S. Bradbury, James R. Cordy, Jürgen Di...
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 11 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
EMSOFT
2005
Springer
15 years 11 months ago
A structural approach to quasi-static schedulability analysis of communicating concurrent programs
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
Cong Liu, Alex Kondratyev, Yosinori Watanabe, Albe...
PPDP
2005
Springer
15 years 11 months ago
Trace effects and object orientation
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
Christian Skalka
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 11 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki