2881 search results - page 127 / 577 » Model Checking for Programming Languages using Verisoft |
171
Voted
FOSSACS
2005
Springer
16 years 7 days ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
163
click to vote
KBSE
2007
IEEE
16 years 1 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
156
click to vote
EMNLP
2008
15 years 8 months ago
2008
The intersection of tree transducer-based translation models with n-gram language models results in huge dynamic programs for machine translation decoding. We propose a multipass,...
185
Voted
IJFCS
2006
15 years 6 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
156
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...