default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsabelle Gnaedig
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c18]Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion:
Abstraction-Based Malware Analysis Using Rewriting and Model Checking. ESORICS 2012: 806-823- 2011
- [j4]Isabelle Gnaedig, Hélène Kirchner
:
Proving weak properties of rewriting. Theor. Comput. Sci. 412(34): 4405-4438 (2011) - 2010
- [c17]Isabelle Gnaedig, Matthieu Kaczmarek, Daniel Reynaud, Stéphane Wloka:
Unconditional self-modifying code elimination with dynamic compiler optimizations. MALWARE 2010: 47-54 - [c16]Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion:
Behavior Abstraction in Malware Analysis. RV 2010: 168-182
2000 – 2009
- 2009
- [j3]Isabelle Gnaedig, Hélène Kirchner:
Termination of rewriting under strategies. ACM Trans. Comput. Log. 10(2): 10:1-10:52 (2009) - [c15]Isabelle Gnaedig:
Termination of Priority Rewriting. LATA 2009: 386-397 - 2007
- [c14]Isabelle Gnaedig, Hélène Kirchner:
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations. Rewriting, Computation and Proof 2007: 44-67 - [c13]Isabelle Gnaedig:
Induction for positive almost sure termination. PPDP 2007: 167-178 - 2006
- [c12]Isabelle Gnaedig, Hélène Kirchner:
Computing constructor forms with non terminating rewrite programs. PPDP 2006: 121-132 - 2005
- [i1]Isabelle Gnaedig, Hélène Kirchner:
Termination of rewriting strategies: a generic approach. CoRR abs/cs/0507064 (2005) - 2004
- [c11]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
A Proof of Weak Termination Providing the Right Way to Terminate. ICTAC 2004: 356-371 - 2003
- [c10]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Simplification and termination of strategies in rule-based languages. PPDP 2003: 124-135 - 2002
- [c9]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
System Presentation -- CARIBOO: An induction based proof tool for termination with strategies. PPDP 2002: 62-73 - [c8]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Outermost ground termination. WRLA 2002: 188-207 - 2001
- [c7]Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner:
Termination of Rewriting with Local Strategies. STRATEGIES@IJCAR 2001: 155-188 - 2000
- [c6]Hélène Kirchner, Isabelle Gnaedig:
Termination and normalisation under strategy Proofs in ELAN. WRLA 2000: 93-120
1990 – 1999
- 1997
- [c5]Thomas Genet, Isabelle Gnaedig:
Termination Proofs Using gpo Ordering Constraints. TAPSOFT 1997: 249-260 - 1992
- [c4]Isabelle Gnaedig:
Termination of Order-sorted Rewriting. ALP 1992: 37-52 - [c3]Isabelle Gnaedig:
ELIOS-OBJ Theorem Proving in a Specification Language. ESOP 1992: 182-199 - 1990
- [j2]Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:
Equational Completion in Order-Sorted Algebras. Theor. Comput. Sci. 72(2&3): 169-202 (1990)
1980 – 1989
- 1988
- [c2]Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner:
Equational Completion in Order-Sorted Algebras (Extended Abstract). CAAP 1988: 165-184 - 1987
- [j1]Isabelle Gnaedig:
Knuth-Bendix procedure and non-deterministic behaviour - An example. Bull. EATCS 32: 86-92 (1987) - 1986
- [c1]Isabelle Gnaedig, Pierre Lescanne:
Proving Termination of Associative Commutative Rewriting Systems by Rewriting. CADE 1986: 52-61
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
