5863 search results - page 364 / 1173 » On Model-Checking of P Systems |
347
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
221
click to vote
HYBRID
2010
Springer
16 years 2 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
215
click to vote
LICS
2003
IEEE
16 years 24 days ago
2003
IEEE
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
201
click to vote
CONCUR
2003
Springer
16 years 23 days ago
2003
Springer
Patterns of Compositional Reasoning Nina Amla1 , E. Allen Emerson2 , Kedar Namjoshi3 , and Richard Trefler4 1 Cadence Design Systems 2 Univ. of Texas at Austin 3 Bell Labs, Lucent...
211
click to vote
ICLP
2001
Springer
15 years 12 months ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...