4502 search results - page 507 / 901 » Regular Model Checking |
151
Voted
SIAMMA
2010
15 years 1 months ago
2010
This paper is concerned with a system that couples the incompressible Navier-Stokes equations to the Vlasov-Fokker-Planck equation. Such a system arises in the modeling of sprays,...
228
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
168
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
228
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
191
click to vote
COMPSAC
2009
IEEE
16 years 1 months ago
2009
IEEE
Along with the popularity of software-intensive systems, the interactions between system components and between humans and software applications are becoming more and more complex...