Go to:
Logótipo
Você está em: Start > Publications > View > bGSL: An imperative language for specification and refinement of backtracking programs
Map of Premises
Principal
Publication

bGSL: An imperative language for specification and refinement of backtracking programs

Title
bGSL: An imperative language for specification and refinement of backtracking programs
Type
Article in International Scientific Journal
Year
2023
Authors
Dunne, S
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Ferreira, JF
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Mendes, A
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Ritchie, C
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Stoddart, B
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Zeyda, F
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 130
ISSN: 2352-2208
Publisher: Elsevier
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Other information
Authenticus ID: P-00X-8V3
Abstract (EN): We present an imperative refinement language for the development of backtracking programs and discuss its semantic foundations. For expressivity, our language includes prospective values and preference - the latter being a variant of Nelson's biased choice that backtracks from infeasibility of a continuation. Our key contribution is to examine feasibility-preserving refinement as a basis for developing backtracking programs, and several key refinement laws that enable compositional refinement in the presence of non -monotonic program combinators.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 14
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Logic and Calculi for All on the occasion of Luis Barbosa's 60th birthday (2025)
Another Publication in an International Scientific Journal
Madeira, A; Oliveira, JN; Proença, J; Neves, R
Location automata for synchronised shuffle expressions (2023)
Article in International Scientific Journal
Broda, S; António Machiavelo; Nelma Moreira; Rogério Reis
Deciding Kleene algebra terms equivalence in Coq (2015)
Article in International Scientific Journal
Nelma Moreira; David Pereira; Simao Melo de Sousa
Branching pomsets: Design, expressiveness and applications to choreographies (2024)
Article in International Scientific Journal
Edixhoven, L; Jongmans, SS; Proença, J; Castellani, I
A formal treatment of the role of verified compilers in secure computation (2022)
Article in International Scientific Journal
Almeida, JCB; Barbosa, M; Barthe, G; Pacheco, H; Pereira, V; Portela, B

See all (7)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-19 at 13:19:50 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book