BGSL: an imperative language for specification and refinement of backtracking programs

DOI10.1016/J.JLAMP.2022.100811OpenAlexW4295708873WikidataQ114159181 ScholiaQ114159181MaRDI QIDQ2096419

João F. Ferreira, Steve Dunne, Alexandra Mendes, Frank Zeyda, Campbell Ritchie, Bill Stoddart

Publication date: 16 November 2022

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2022.100811

zbMATH Keywords

semanticsnondeterminismbacktrackingpreferential choice

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (1)

BGSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bunch theory: A simple set theory for computer science
• Combining angels, demons and miracles in program specifications
• A source of inconsistency in theories of nondeterministic functions
• The Algorithmics of Solitaire-Like Games
• Preference and Non-deterministic Choice
• Irreversibility and Heat Generation in the Computing Process
• Guarded commands, nondeterminacy and formal derivation of programs
• The B-Book
• ZB 2005: Formal Specification and Development in Z and B
• A theory of bunches

This page was built for publication: BGSL: an imperative language for specification and refinement of backtracking programs