Sciweavers

5015 search results - page 232 / 1003
» Model Checking a Path
Sort
View
FMCAD
2000
Springer
15 years 10 months ago
The Semantics of Verilog Using Transition System Combinators
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
Gordon J. Pace
ICALP
2000
Springer
15 years 10 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
STTT
2008
86views more  STTT 2008»
15 years 6 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
CCS
2006
ACM
15 years 10 months ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...
CBSE
2006
Springer
15 years 10 months ago
Defining and Checking Deployment Contracts for Software Components
Ideally in the deployment phase, components should be composable, and their composition checked. Current component models fall short of this ideal. Most models do not allow composi...
Kung-Kiu Lau, Vladyslav Ukis