VSTTE 2008 Verified Software: Theories, Tools, Experiments October 6 to 9 Toronto All talks, tutorials, and panels take place in the Champagne

Source URL: www.cs.york.ac.uk

• Harbourfront
• PATH
• Toronto Transit Commission
• Ontario
• Yonge Street
• Union station
• King station
• Queens Quay
• Queen station
• Gardiner Expressway
• Bay station

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis? , Albert Oliveras? , and Cesare Tinelli ??

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Automated theorem proving
• Boolean algebra
• Constraint programming
• Logic in computer science
• Formal methods
• DPLL algorithm
• Conflict-driven clause learning
• Boolean satisfiability problem
• Satisfiability modulo theories

DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic Robert Nieuwenhuis and Albert Oliveras? Abstract. At CAV’04 we presented the DPLL(T ) approach for satisfiability modulo theories T . I

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Mathematical logic
• Boolean algebra
• Formal methods
• Logic in computer science
• Electronic design automation
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Unit propagation
• Literal

Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Logic in computer science
• Formal methods
• Propositional calculus
• Satisfiability modulo theories
• DPLL algorithm
• Unit propagation
• Solver

Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. Catalonia

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Boolean algebra
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Phnom Penh
• Solver
• Propositional calculus

13th International Satisfiability Modulo Theories Competition SMT-COMPMatthias Heizmann Aina Niemetz

Source URL: smtcomp.sourceforge.net

Integrating Theories into Inference Systems DIPLOMARBEIT zur Erlangung des akademischen Grades Diplom-Ingenieur/in

Source URL: www.logic.at

• Mathematical logic
• Logic
• Theoretical computer science
• Automated theorem proving
• Proof theory
• Logic programming
• Logic in computer science
• Type theory
• Unification
• Uninterpreted function
• Equational logic
• Variety

Abstract DPLL and Abstract DPLL Modulo Theories Robert Nieuwenhuis1 , Albert Oliveras1 , and Cesare Tinelli2 1 Technical University of Catalonia

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• DPLL
• Phase-locked loop
• Satisfiability

11th International Satisfiability Modulo Theories Competition SMT-COMPSylvain Conchon

Source URL: user.it.uu.se

• Computing
• Theoretical computer science
• Constraint programming
• Electronic design automation
• Logic in computer science
• Satisfiability modulo theories
• Benchmark
• Standard Performance Evaluation Corporation
• K computer

Cohomological field theory calculations Rahul Pandharipande February 2018 Abstract Cohomological field theories (CohFTs) were defined in the mid 1990s by Kontsevich and Manin to capture the formal properties of the virtu

Source URL: eta.impa.br

• Geometry
• Algebra
• Abstract algebra
• Moduli theory
• String theory
• Symplectic topology
• Algebraic geometry
• GromovWitten invariant
• Quantum cohomology
• Moduli of algebraic curves
• Stable map
• Orbifold