Programming with angelic nondeterminism

DOI10.1145/1706299.1706339zbMath1312.68053OpenAlexW2130371489MaRDI QIDQ5255092

Casey Rodarmor, Doug Kimelman, Satish Chandra, Rastislav Bodík, Joel Galenson, Nicholas Tung, Shaon Barman

Publication date: 11 June 2015

Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1706299.1706339

zbMATH Keywords

refinementconstraintstracesangelic non-determinismbounded model-checking

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Symbolic Model Checking in Non-Boolean Domains ⋮ Integrating discrete controller synthesis into a reactive programming language compiler ⋮ Bootstrapping library-based synthesis ⋮ A Machine-Checked Framework for Relational Separation Logic

This page was built for publication: Programming with angelic nondeterminism