Introduction to the special issue on computational logic for verification
DOI10.1017/S1471068418000029zbMATH Open1475.00076OpenAlexW2801549662WikidataQ129891778 ScholiaQ129891778MaRDI QIDQ4644352FDOQ4644352
Authors:
Publication date: 31 May 2018
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068418000029
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Truly concurrent constraint programming
- Horn clauses as an intermediate representation for program analysis and transformation
- Linear concurrent constraint programming: Operational and phase semantics
- Transformation of logic programs: Foundations and techniques
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
- Newtonian program analysis via tensor product
- Horn clause solvers for program verification
- Newtonian program analysis
- A Brief History of Strahler Numbers
Cited In (2)
This page was built for publication: Introduction to the special issue on computational logic for verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644352)