The following pages link to (Q5310200):
Displaying 47 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Symbolic execution of Reo circuits using constraint automata (Q433344) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Pointfree expression and calculation: From quantification to temporal logic (Q633283) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- A deductive approach towards reasoning about algebraic transition systems (Q1666122) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates (Q2031420) (← links)
- Possible models computation and revision -- a practical approach (Q2096456) (← links)
- A symbolic programming approach to the rendezvous search problem (Q2120120) (← links)
- Logical reduction of metarules (Q2203321) (← links)
- Efficient strategies for CEGAR-based model checking (Q2209549) (← links)
- Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant (Q2233841) (← links)
- Conflict-driven satisfiability for theory combination: transition system and completeness (Q2303254) (← links)
- Inductive theorem proving based on tree grammars (Q2344621) (← links)
- Book review of: Daniel Kroening and Ofer Strichman, Decision procedures: an algorithmic point of view (Q2351398) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
- Metalevel algorithms for variant satisfiability (Q2413027) (← links)
- Preface to the special issue ``SI: satisfiability modulo theories'' (Q2441769) (← links)
- Colors Make Theories Hard (Q2817916) (← links)
- Metalevel Algorithms for Variant Satisfiability (Q2827841) (← links)
- A Survey of Satisfiability Modulo Theory (Q2830018) (← links)
- On Interpolation in Decision Procedures (Q3010355) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (Q3540175) (← links)
- Inferring Loop Invariants Using Postconditions (Q3586008) (← links)
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (Q3617773) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q4855375) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays (Q5043584) (← links)
- (Q5114831) (← links)
- SMT-based verification of data-aware processes: a model-theoretic approach (Q5139282) (← links)
- Loop invariants (Q5176169) (← links)
- A Roadmap to Decidability (Q5258981) (← links)
- Łukasiewicz Games (Q5277898) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
- On algebraic array theories (Q6192058) (← links)
- Realizability modulo theories (Q6561346) (← links)
- Succinct ordering and aggregation constraints in algebraic array theories (Q6561348) (← links)
- On the convexity of a fragment of pure set theory with applications within a Nelson-Oppen framework (Q6649524) (← links)
