FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

A
Alt, Leonardo	SMT-based Compile-time Verification of Safety Properties for Smart Contracts
B
Backeman, Peter	The next 10^4 UppSAT Approximations
Barbosa, Haniel	Revisiting Enumerative Instantiation Higher-Order SMT Solving Rewrites for SMT Solvers using Syntax-Guided Enumeration
Barrett, Clark	Rewrites for SMT Solvers using Syntax-Guided Enumeration
Benzmüller, Christoph	Invited talk: Experiments in Universal Logical Reasoning --- How to utilise ATPs and SMT solvers for the exploration of axiom systems for category theory in free logic
Biró, Csaba	Puli - A Problem-Specific OMT Solver
Bobot, François	Centralizing Equality Reasoning in MCSAT
Bonacina, Maria Paola	Proofs in conflict-driven theory combination
Brain, Martin	Building Better Bit-Blasting for Floating-Point Problems
Bury, Guillaume	Centralizing Equality Reasoning in MCSAT SMT Solving Modulo Tableau and Rewriting Theories
C
Conchon, Sylvain	Alt-Ergo 2.2
Coquereau, Albin	Alt-Ergo 2.2
Cruanes, Simon	SMT Solving Modulo Tableau and Rewriting Theories
D
Delahaye, David	SMT Solving Modulo Tableau and Rewriting Theories
Dvijotham, Krishnamurthy	Invited talk: Verifying Learners and Learning Verifiers
E
El Ouraoui, Daniel	Higher-Order SMT Solving
Erdélyi, Balázs	Puli - A Problem-Specific OMT Solver
F
Fontaine, Pascal	Revisiting Enumerative Instantiation Higher-Order SMT Solving
G
Graham-Lengrand, Stephane	Centralizing Equality Reasoning in MCSAT Proofs in conflict-driven theory combination
Gurfinkel, Arie	Discovering Universally Quantified Solutions for Constrained Horn Clauses
I
Iguernlala, Mohamed	Alt-Ergo 2.2
J
Jovanović, Dejan	Selfless Interpolation for Infinite-State Model Checking
K
Kovásznai, Gergely	Puli - A Problem-Specific OMT Solver
M
Marre, Bruno	Centralizing Equality Reasoning in MCSAT
N
Niemetz, Aina	Rewrites for SMT Solvers using Syntax-Guided Enumeration
Noetzli, Andres	Rewrites for SMT Solvers using Syntax-Guided Enumeration
P
Preiner, Mathias	Rewrites for SMT Solvers using Syntax-Guided Enumeration
R
Reger, Giles	What is the Point of an SMT-LIB Problem?
Reitwiessner, Christian	SMT-based Compile-time Verification of Safety Properties for Smart Contracts
Reynolds, Andrew	Revisiting Enumerative Instantiation Higher-Order SMT Solving Rewrites for SMT Solvers using Syntax-Guided Enumeration
Riener, Martin	What is the Point of an SMT-LIB Problem?
Ruemmer, Philipp	The next 10^4 UppSAT Approximations
S
Schanda, Florian	Building Better Bit-Blasting for Floating-Point Problems
Schindler, Tanja	Selfless Interpolation for Infinite-State Model Checking
Shankar, Natarajan	Proofs in conflict-driven theory combination
Shoham, Sharon	Discovering Universally Quantified Solutions for Constrained Horn Clauses
Smt-Comp Organizers,	SMT-COMP 2018 Report
Sun, Youcheng	Building Better Bit-Blasting for Floating-Point Problems
T
Tinelli, Cesare	Higher-Order SMT Solving Rewrites for SMT Solvers using Syntax-Guided Enumeration
V
Vizel, Yakir	Discovering Universally Quantified Solutions for Constrained Horn Clauses
W
Wies, Thomas	Invited talk: Automating Separation Logics using SMT
Wintersteiger, Christoph M.	The next 10^4 UppSAT Approximations
Z
Zeljić, Aleksandar	The next 10^4 UppSAT Approximations

Disclaimer | Powered by EasyChair Smart Program