activity
20072026
most citedSolving QBF with Counterexample Guided Refinement

150 citations · 619 across the 52 of their papers we have counts for

collaborators
Showing 2009Show all

7 papers · 1 filter

cs.LO2009

Industrial-Strength Formally Certified SAT Solving

Ashish Darbari, Bernd Fischer, Joao Marques-Silva

Boolean Satisfiability (SAT) solvers are now routinely used in the verification of large industrial problems. However, their application in safety-critical domains such as the rail…

cs.SE2009

Continuous Verification of Large Embedded Software using SMT-Based Bounded Model Checking

Lucas Cordeiro, Bernd Fischer, Joao Marques-Silva

The complexity of software in embedded systems has increased significantly over the last years so that software verification now plays an important role in ensuring the overall pro…

cs.SE2009★ 3 cited

How to Complete an Interactive Configuration Process?

Mikolas Janota, Goetz Botterweck, Radu Grigore +1

When configuring customizable software, it is useful to provide interactive tool-support that ensures that the configuration does not breach given constraints. But, when is a confi…

cs.DS2009★ 2 cited

Algorithms for finding dispensable variables

Mikolas Janota, Joao Marques-Silva, Radu Grigore

This short note reviews briefly three algorithms for finding the set of dispensable variables of a boolean formula. The presentation is light on proofs and heavy on intuitions.

cs.SE2009

SMT-Based Bounded Model Checking for Embedded ANSI-C Software

Lucas Cordeiro, Bernd Fischer, Joao Marques-Silva

Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structure…

cs.LO2009★ 25 cited

On Solving Boolean Multilevel Optimization Problems

Josep Argelich, Ines Lynce, Joao Marques-Silva

Many combinatorial optimization problems entail a number of hierarchically dependent optimization problems. An often used solution is to associate a suitably large cost with each i…

cs.AI2009★ 11 cited

Algorithms for Weighted Boolean Optimization

Vasco Manquinho, Joao Marques-Silva, Jordi Planes

The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, differen…