Possibly not closed convex polyhedra and the Parma Polyhedra Library. The domain of convex polyhedra is employed in several systems for the analysis and verification of hardware and software components. Current applications span imperative, functional and logic languages, synchronous languages and synchronization protocols, real-time and hybrid systems. Since the seminal work of P. Cousot and N. Halbwachs, convex polyhedra have thus played an important role in the formal methods community and several critical tasks rely on their software implementations. Despite this, existing libraries for the manipulation of convex polyhedra are still research prototypes and suffer from limitations that make their usage problematic, especially in critical applications. Furthermore, there is inadequate support for polyhedra that are Not Necessarily Closed (NNC), i.e., polyhedra that are described by systems of constraints where strict inequalities are allowed to occur. This paper presents the Parma Polyhedra Library, a new, robust and complete implementation of NNC convex polyhedra, concentrating on the distinctive features of the library and on the novel theoretical underpinnings. (Source: http://freecode.com/)

References in zbMATH (referenced in 79 articles , 1 standard article )

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

1 2 3 4 next

  1. Bezděk, Peter; Beneš, Nikola; Černá, Ivana; Barnat, Jiří: On clock-aware LTL parameter synthesis of timed automata (2018)
  2. Doyen, Laurent; Frehse, Goran; Pappas, George J.; Platzer, André: Verification of hybrid systems (2018)
  3. Jovanović, Aleksandra; Kwiatkowska, Marta: Parameter synthesis for probabilistic timed automata using stochastic game abstractions (2018)
  4. Kafle, Bishoksan; Gallagher, John P.; Ganty, Pierre: Tree dimension in verification of constrained Horn clauses (2018)
  5. Majumdar, Rupak; Raskin, Jean-François: Symbolic model checking in non-Boolean domains (2018)
  6. Anders Jensen, Jeff Sommars, Jan Verschelde: Computing Tropical Prevarieties in Parallel (2017) arXiv
  7. Assarf, Benjamin; Gawrilow, Ewgenij; Herr, Katrin; Joswig, Michael; Lorenz, Benjamin; Paffenholz, Andreas; Rehn, Thomas: Computing convex hulls and counting integer points with polymake (2017)
  8. Benerecetti, Massimo; Faella, Marco: Tracking smooth trajectories in linear hybrid systems (2017)
  9. Firsching, Moritz: Realizability and inscribability for simplicial polytopes via nonlinear optimization (2017)
  10. Jovanović, Aleksandra; Kwiatkowska, Marta; Norman, Gethin; Peyras, Quentin: Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (2017)
  11. Kafle, Bishoksan; Gallagher, John P.: Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (2017)
  12. Köppe, Matthias; Zhou, Yuan: New computer-based search strategies for extreme functions of the Gomory-Johnson infinite group problem (2017)
  13. Rodríguez, Margarita M. L.; Vicente-Pérez, José: On finite linear systems containing strict inequalities (2017)
  14. Sharma, Tushar; Reps, Thomas: Sound bit-precise numerical domains (2017)
  15. Singh, Gagandeep; Püschel, Markus; Vechev, Martin: Fast polyhedra abstract domain (2017)
  16. Toth, Csaba D. (ed.); Goodman, Jacob E. (ed.); O’Rourke, Joseph (ed.): Handbook of discrete and computational geometry (2017)
  17. André, Étienne: Parametric deadlock-freeness checking timed automata (2016)
  18. Bezděk, Peter; Beneš, Nikola; Barnat, Jiří; Černá, Ivana: LTL parameter synthesis of parametric timed automata (2016)
  19. Köppe, Matthias; Zhou, Yuan: Toward computer-assisted discovery and automated proofs of cutting plane theorems (2016)
  20. Maréchal, Alexandre; Fouilhé, Alexis; King, Tim; Monniaux, David; Périn, Michael: Polyhedral approximation of multivariate polynomials using handelman’s theorem (2016)

1 2 3 4 next

Further publications can be found at: http://bugseng.com/products/ppl/documentation/bibliography