skip to main content
Idioma:
Primo Search
Clear Search Box
Search in: Busca Geral
Busca Avançada
Busca por Índices
Tipo de recurso Mostra resultados com: Mostra resultados com: Índice

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

Hermenegildo, Manuel ; Puebla, German

Lecture notes in computer science, 2002, Vol.2477, p.213-229 [Periódico revisado por pares]

Germany: Springer Berlin / Heidelberg

Texto completo disponível

Citações Citado por
  • Título:
    Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
  • Autor: Hermenegildo, Manuel ; Puebla, German
  • Assuntos: Abstract Interpretation ; Applied sciences ; Closure Point ; Computer science; control theory; systems ; Constraint System ; Convex Polyhedron ; Exact sciences and technology ; Minimal Form ; Software ; Software engineering
  • É parte de: Lecture notes in computer science, 2002, Vol.2477, p.213-229
  • Notas: This work has been partly supported by MURST projects “Abstract Interpretation, type systems and control-flow analysis” and “Aggregate- and number-reasoning for computing: from decision algorithms to constraint programming with multisets, sets, and maps” and by EPSRC grant GR/R53401/01.
  • Descrição: 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.
  • Títulos relacionados: Lecture Notes in Computer Science
  • Editor: Germany: Springer Berlin / Heidelberg
  • Idioma: Inglês
Links
Voltar para lista de resultados

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.