References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Gleiss, Bernhard; Kovács, Laura; Robillard, Simon: Loop analysis by quantification over iterations (2018)
  2. Kafle, Bishoksan; Gallagher, John P.; Gange, Graeme; Schachte, Peter; Søndergaard, Harald; Stuckey, Peter J.: An iterative approach to precondition inference using constrained Horn clauses (2018)
  3. Kafle, Bishoksan; Gallagher, John P.: Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (2017)
  4. Cimatti, Alessandro; Griggio, Alberto; Mover, Sergio; Tonetta, Stefano: Infinite-state invariant checking with IC3 and predicate abstraction (2016)
  5. Ahrendt, Wolfgang; Kovács, Laura; Robillard, Simon: Reasoning about loops using Vampire in KeY (2015)
  6. Dragan, Ioan; Kovács, Laura: Lingva: generating and proving program properties using symbol elimination (2015)
  7. Sharma, Rahul; Gupta, Saurabh; Hariharan, Bharath; Aiken, Alex; Liang, Percy; Nori, Aditya V.: A data driven approach for algebraic loop invariants (2013)
  8. Amato, Gianluca; Parton, Maurizio; Scozzari, Francesca: Discovering invariants via simple component analysis (2012)
  9. Neider, Daniel: Computing minimal separating DFAs and regular invariants using SAT and SMT solvers (2012)
  10. Colón, Michael A.; Sankaranarayanan, Sriram: Generalizing the template polyhedral domain (2011)
  11. Gaudel, Marie-Claude: Checking models, proving programs, and testing systems (2011) ioport
  12. Henzinger, Thomas A.; Hottelier, Thibaud; Kovács, Laura; Rybalchenko, Andrey: Aligators for arrays (tool paper) (2010)
  13. Jung, Yungbum; Kong, Soonho; Wang, Bow-Yaw; Yi, Kwangkeun: Deriving invariants by algorithmic learning, decision procedures, and predicate abstraction (2010)
  14. Gupta, Ashutosh; Rybalchenko, Andrey: InvGen: an efficient invariant generator (2009) ioport