MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Pierre Ganty" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 4 documents found, showing 1 through 4.
ATOM RSS
  • Fixpoint-guided abstraction refinements  
  • by Patrick Cousot, Pierre Ganty, Jean-françois Raskin — 2007 — In Proc. 14th Int. Symp. on Static Analysis (SAS’07), LNCS
  • …Abstract. In this paper, we present an abstract fixpoint checking algorithm with automatic refinement by backward completion in Moore closed abstract domains. We study the properties of our algorithm and prove it to be more precise than the counterexample guided abstract refinement algorithm (CEGAR)…
  • Cited by 1 (0 self) – Add To MetaCart
  • S.: Locality-based abstractions  
  • by Javier Esparza, Pierre Ganty, Stefan Schwoon, Université Libre De Bruxelles — 2005 — In: SAS ’05: Proc. 12th Int. Symp. on Static Analysis. Volume 3672 of LNCS., Springer-Verlag
  • …Abstract. We present locality-based abstractions, in which a set of states of a distributed system is abstracted to the collection of views that some observers have of the states. Special cases of locality-abstractions have been used in different contexts (planning, analysis of concurrent programs, …
  • Cited by 1 (1 self) – Add To MetaCart
  • L.: A complete abstract interpretation framework for coverability properties of WSTS  
  • by Pierre Ganty, Jean-françois Raskin, Laurent Van Begin — 2006 — In: Proc. of Verification, Model Checking and Abstract Interpretation (VMCAI). Volume 3855 of LNCS., Springer-Verlag (2006) 49–64
  • …Abstract. We present an abstract interpretation based approach to solve the coverability problem of well-structured transition systems. Our approach distinguishes from other attempts in that (1) we solve this problem for the whole class of well-structured transition systems using a forward algorithm…
  • Cited by 4 (2 self) – Add To MetaCart
  • L.: From many places to few: Automatic abstraction refinement for Petri nets  
  • by Pierre Ganty, Jean-françois Raskin, Laurent Van Begin, Université Libre De Bruxelles — 2007 — In Proc. 28th Int. Conf. on Applications and Theory of Petri Nets (ICATPN’07). LNCS
  • …Abstract. Current algorithms for the automatic verification of Petri nets suffer from the explosion caused by the high dimensionality of the interpretation analysis that reduces the dimensionality of state spaces that are explored during verification. In our approach, the dimensionality is reduced b…
  • Cited by 2 (1 self) – Add To MetaCart
Help! Showing 1 through 4.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB