ParSAT: parallel solving of floating-point satisfiability

DOI10.1016/J.JLAMP.2026.101149MaRDI QIDQ7320672zbMATH OpenFDO

Authors Markus Krahl, Matthias Güdemann, Stefan Wallentowitz

Publication date 27 August 2026

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.2026.101149

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Abstract acceleration of general linear loops
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs
• Bitwuzla
• Bounded model checking using satisfiability solving
• Decision procedures. An algorithmic point of view
• Global optimization by controlled random search
• Loop summarization using state and transition invariants
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Scrambled linear pseudorandom number generators
• Some variants of the controlled random search algorithm for global optimization
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Procee
• Tools and algorithms for the construction and analysis of systems. 25th international conference, TACAS 2019, held as part of the European joint conferences on theory and practice of software, ETAPS 2019, Prague, Czech Republic, April 6--11, 2019. Proceed
• Under-approximating loops in C programs for fast counterexample detection

This page was built for publication: ParSAT: parallel solving of floating-point satisfiability

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