Results 251 to 260 of about 133,463 (288)

Analysis of Boolean Programs

2013
Boolean programs are a popular abstract domain for static-analysis-based software model checking. Yet little is known about the complexity of model checking for this model of computation. This paper aims to fill this void by providing a comprehensive study of the worst-case complexity of several basic analyses of Boolean programs, including ...
Patrice Godefroid, Mihalis Yannakakis
openaire   +1 more source

Bilevel Biobjective Pseudo Boolean Programming Problems

Journal of Mathematical Modelling and Algorithms, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Logics of Programs with Boolean Memory

Fundamenta Informaticae, 1988
We discuss the computational power of programs with boolean (propositional) push-down stores and arrays, and the expressive power of logics based on these programs. In particular we show that over unary structures, the mentioned logics occur to be equivalent to their “algebraic counterparts.
openaire   +2 more sources

Extensions of Pseudo-Boolean Programming

1968
In this chapter, various generalizations of the problem of minimizing a pseudo-Boolean function will be studied.
Peter L. Hammer, Sergiu Rudeanu
openaire   +1 more source

Pseudo-Boolean programming

1979
Various problems in life and industry require deciding amongst various choices in order to give the greatest good or the least evil. These decisions can sometimes be made in a straightforward manner, but often there are restrictions upon the actions we can take. This complicates the decision process, so various techniques have been invented to aid the
openaire   +1 more source

Pseudo-Boolean programming

1965
Many a problem in combinatorial operations research (including, in particular, linear and nonlinear integer programming), can be formulated with the aid of real-valued functions with bivalent (0, 1) variables. This paper surveys the methods originated and developed by the authors for solving such problems.
openaire   +1 more source

Programming Boolean expressions for testability

2004 IEEE Aerospace Conference Proceedings (IEEE Cat. No.04TH8720), 2005
This paper proposes several methods for programming the Boolean expressions in a flight control program that makes them amenable for exhaustive testing. It first describes the current FAA approach that accepts arbitrary Boolean expressions and attempts to apply the test known as modified condition/decision coverage (MC/DC).
openaire   +1 more source

Programming with Boolean Satisfaction

2012
In recent years, research on Boolean satisfiability (SAT) is generating remarkably powerful SAT solvers capable of handling larger and larger SAT instances. With the availability of progressively stronger SAT solvers, an accumulating number of applications have been developed which demonstrate that real world problems can often be solved by encoding ...
openaire   +1 more source

Scalable program analysis using Boolean satisfiability

Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2006. MEMOCODE '06. Proceedings., 2006
Summary form only given. Static program analysis suffers from a fundamental trade-off between precision and scalability, and the analyses that scale to the largest programs are generally not the most precise methods known. This talk describes how recent advances in algorithms for solving instances of Boolean satisfiability (SAT) can be exploited to ...
openaire   +1 more source

CTL Model Checking for Boolean Program

2006
Nowadays, there are some subtle errors in a software system. So verification technique is very important. The one of important verification technique is model checking technique. Model checking is a technique to verify behavior of system with desired property. There are many researches about software model checking.
Taehoon Lee, Gihwon Kwon, Hyuksoo Han
openaire   +1 more source