An incremental formal semantics for promela Export

@misc{citeulike:3058180, abstract = {An approach to a formal semantics for PROMELA is presented. The approach uses SOS rules to define a labeled transition system model for a PROMELA program. The approach is a bottom-up, incremental approach with three basic steps (declarations, single processes, parallel processes). PROMELA before version 2.0 is treated nearly entirely. Especially assertions, never claims and correctness conditions are discussed.}, author = {Weise, C.}, citeulike-article-id = {3058180}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8378}, keywords = {copy, model-checking, print, spin}, posted-at = {2008-07-30 03:18:08}, priority = {2}, title = {An incremental formal semantics for promela}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8378}, year = {1997} }

TY - GEN ID - citeulike:3058180 L3 - citeulike-article-id:3058180 N2 - An approach to a formal semantics for PROMELA is presented. The approach uses SOS rules to define a labeled transition system model for a PROMELA program. The approach is a bottom-up, incremental approach with three basic steps (declarations, single processes, parallel processes). PROMELA before version 2.0 is treated nearly entirely. Especially assertions, never claims and correctness conditions are discussed. TI - An incremental formal semantics for promela KW - copy KW - model-checking KW - print KW - spin AU - Weise, C PY - 1997/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8378 ER -