Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules | 0 | 0.34 | 2022 |
Decidable Entailments in Separation Logic with Inductive Definitions - Beyond Establishment. | 0 | 0.34 | 2021 |
Unifying Decidable Entailments In Separation Logic With Inductive Definitions | 0 | 0.34 | 2021 |
Structural Invariants for the Verification of Systems with Parameterized Architectures. | 0 | 0.34 | 2020 |
The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates | 0 | 0.34 | 2020 |
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard | 0 | 0.34 | 2020 |
Abstraction Refinement And Antichains For Trace Inclusion Of Infinite State Systems | 0 | 0.34 | 2020 |
Structural Invariants for Parametric Verification of Systems with Almost Linear Architectures. | 0 | 0.34 | 2019 |
The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. | 0 | 0.34 | 2019 |
Alternating Automata Modulo First Order Theories | 0 | 0.34 | 2019 |
SL-COMP: Competition of Solvers for Separation Logic | 0 | 0.34 | 2019 |
Prenex Separation Logic with One Selector Field. | 0 | 0.34 | 2019 |
The Complexity of Prenex Separation Logic with One Selector. | 0 | 0.34 | 2018 |
First Order Alternation. | 0 | 0.34 | 2018 |
Program Verification with Separation Logic. | 0 | 0.34 | 2018 |
An Entailment Checker for Separation Logic with Inductive Definitions. | 0 | 0.34 | 2018 |
Checking deadlock-freedom of parametric component-based systems | 1 | 0.35 | 2018 |
Abstraction Refinement for Emptiness Checking of Alternating Data Automata. | 0 | 0.34 | 2018 |
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic. | 0 | 0.34 | 2018 |
Complete Cyclic Proof Systems for Inductive Entailments. | 0 | 0.34 | 2017 |
The Impact of Alternation. | 0 | 0.34 | 2017 |
Reasoning In The Bernays-Schonfinkel-Ramsey Fragment Of Separation Logic | 0 | 0.34 | 2017 |
How hard is it to verify flat affine counter systems with the finite monoid property ? | 0 | 0.34 | 2016 |
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. | 1 | 0.36 | 2016 |
A Decision Procedure for Separation Logic in SMT. | 5 | 0.41 | 2016 |
Interprocedural Reachability for Flat Integer Programs. | 0 | 0.34 | 2015 |
Generating Bounded Languages Using Bounded Control Sets. | 0 | 0.34 | 2014 |
Safety Problems Are Np-Complete For Flat Integer Programs With Octagonal Loops | 4 | 0.41 | 2014 |
Deciding Conditional Termination | 0 | 0.34 | 2014 |
Abstraction Refinement for Trace Inclusion of Data Automata. | 0 | 0.34 | 2014 |
Deciding Entailments in Inductive Separation Logic with Tree Automata. | 13 | 0.57 | 2014 |
Automata-Based Termination Proofs | 2 | 0.41 | 2013 |
The tree width of separation logic with recursive definitions | 36 | 1.03 | 2013 |
Deciding conditional termination | 12 | 0.63 | 2013 |
Underapproximation of procedure summaries for integer programs | 4 | 0.43 | 2013 |
A Verification Toolkit for Numerical Transition Systems - Tool Paper. | 15 | 0.62 | 2012 |
Accelerating interpolants | 9 | 0.50 | 2012 |
Programs with lists are counter automata | 42 | 1.86 | 2011 |
Tool Demonstration of the FLATA Counter Automata Toolset. | 2 | 0.37 | 2010 |
Fast acceleration of ultimately periodic relations | 36 | 1.09 | 2010 |
Flat Parametric Counter Automata | 26 | 1.08 | 2009 |
Automatic Verification of Integer Array Programs | 22 | 0.79 | 2009 |
What else is decidable about integer arrays? | 27 | 1.42 | 2008 |
A Logic of Singly Indexed Arrays | 6 | 0.49 | 2008 |
Proving termination of tree manipulating programs | 6 | 0.57 | 2007 |
On flat programs with lists | 3 | 0.42 | 2007 |
Automata-Based verification of programs with tree updates | 10 | 0.64 | 2006 |
On decidability within the arithmetic of addition and divisibility | 9 | 0.63 | 2005 |
Translating Java for Multiple Model Checkers: The Bandera Back-End | 8 | 0.51 | 2005 |
On Logics of Aliasing | 11 | 0.69 | 2004 |