Checking reachability using matching logic
- 19 October 2012
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 47 (10), 555-574
- https://doi.org/10.1145/2398857.2384656
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- An overview of the K semantic frameworkThe Journal of Logic and Algebraic Programming, 2010
- Mechanized Semantics for the Clight Subset of the C LanguageJournal of Automated Reasoning, 2009
- Parametric shape analysis via 3-valued logicACM Transactions on Programming Languages and Systems, 2002
- Winskel is (almost) Right: Towards a Mechanized Semantics TextbookFormal Aspects of Computing, 1998
- A Syntactic Approach to Type SoundnessInformation and Computation, 1994
- The revised report on the syntactic theories of sequential control and stateTheoretical Computer Science, 1992
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- The chemical abstract machineTheoretical Computer Science, 1992
- Dynamic LogicPublished by Springer Science and Business Media LLC ,1984
- Assigning meanings to programsProceedings of Symposia in Applied Mathematics, 1967