232 search results - page 13 / 47 » Symbolic Bounded Conformance Checking of Model Programs |
107
click to vote
APLAS
2007
ACM
15 years 3 months ago
2007
ACM
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
102
click to vote
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
102
click to vote
CAV
2003
Springer
15 years 4 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
SIGSOFT
2009
ACM
16 years 13 days 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...
CAV
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We consider the verification of parameterized Boolean proabstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such prog...