201 search results - page 14 / 41 » On the Decidability of Model-Checking for P Systems |
103
click to vote
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
Logical properties of iterations of relational structures are studied and these decidability results are applied to the model checking of a powerful extension of pushdown systems....
ISSTA
2006
ACM
15 years 5 months ago
2006
ACM
Model checking can be an effective technique for detecting concurrency-related errors in software systems. However, due to scalability issues, to handle industrial-strength softw...
FOSSACS
2010
Springer
15 years 3 months ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
104
click to vote
CAV
2008
Springer
15 years 1 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
FM
2003
Springer
15 years 4 months ago
2003
Springer
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...