Analysis of Boolean Programs
From MaRDI portal
Recommendations
- Analysis of Boolean Functions
- Analysis of programs and binary relations
- scientific article; zbMATH DE number 512939
- Structural analysis of Boolean equation systems
- Analysis of affinely equivalent Boolean functions
- Static Analysis Techniques for Parameterised Boolean Equation Systems
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
- Logical approximation for program analysis
- scientific article; zbMATH DE number 1471980
Cited in
(15)- Verification of Boolean programs with unbounded thread creation
- Review of Boole
- scientific article; zbMATH DE number 1670555 (Why is no real title available?)
- scientific article; zbMATH DE number 1701764 (Why is no real title available?)
- Splitting the Control Flow with Boolean Flags
- Rewriting Models of Boolean Programs
- scientific article; zbMATH DE number 1982200 (Why is no real title available?)
- scientific article; zbMATH DE number 1538027 (Why is no real title available?)
- Worst-case groundness analysis using positive Boolean functions
- Minimization, Learning, and Conformance Testing of Boolean Programs
- The complexity gap in the static analysis of cache accesses grows if procedure calls are added
- Automated synthesis of asynchronizations
- Decidability and complexity of decision problems for affine continuous vass
- On recursion-free Horn clauses and Craig interpolation
- Model-checking structured context-free languages
This page was built for publication: Analysis of Boolean Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326327)