4047 search results - page 724 / 810 » Algebraic Model Checking |
126
click to vote
PASTE
2005
ACM
15 years 10 months ago
2005
ACM
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...
135
click to vote
PLDI
2005
ACM
15 years 10 months ago
2005
ACM
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
134
click to vote
ATVA
2005
Springer
15 years 10 months ago
2005
Springer
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 ...
159
click to vote
EMSOFT
2005
Springer
15 years 10 months ago
2005
Springer
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...
130
click to vote
PPDP
2005
Springer
15 years 10 months ago
2005
Springer
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...