On Flat Programs with Lists

DOI10.1007/978-3-540-69738-1_9zbMATH Open1132.68334OpenAlexW1753242230MaRDI QIDQ5452602FDOQ5452602

Authors: Marius Bozga, Radu Iosif 

Publication date: 4 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69738-1_9

Recommendations

• Towards Model-Checking Programs with Lists
• Programs with lists are counter automata
• Programs with Lists Are Counter Automata
• Propositional reasoning about safety and termination of heap-manipulating programs
• Verifying properties of well-founded linked lists

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (6)

• Flat Petri nets (invited talk)
• Propositional reasoning about safety and termination of heap-manipulating programs
• Towards Model-Checking Programs with Lists
• Programs with lists are counter automata
• Programs with Lists Are Counter Automata
• A list processing language TAO with multiple programming paradigms

This page was built for publication: On Flat Programs with Lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452602)