| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Cantu, Bundy, Smaill, Basin
(Ed: Srivas, Camilleri)
[Cantu, Bundy, Smaill, Srivas, Camilleri] | 1996 | | Experiments in Automating Hardware Verification using Inductive Proof Planning
In: Proceedings of the Formal Methods for Computer-Aided Design Conference (FMCAD'96), 94-108 | Proceedings Article |
Chadha, Plaisted
[-] | 1993 | | On the mechanical derivation of loop invariants
In: Journal of Symbolic Computation [15], 705-744 | Journal Article |
Chadha, Plaisted
[Chadha] | 1994 | | Correctness of unification without occur check in Prolog
In: Journal of Logic Programming [18], 99-122 | Journal Article |
Charatonik
(Ed: Smolka)
[Smolka] | 2000 | | Directional Type Checking for Logic Programs: Beyond Discriminative Types
In: Proceedings of the 8th European Symposium on Programming (ESOP-00), 72-87 | Proceedings Article |
Charatonik
[-] | 2002 | | Direktionale Typen in der Logischen Programmierung
Universität des Saarlandes | Thesis - Habilitation thesis |
Charatonik
[-] | 1998 | | An Undecidable Fragment of the Theory of Set Constraints
In: Information Processing Letters [68], 147-151 | Journal Article |
Charatonik
[-] | 1998 | | Set Constraints in Some Equational Theories
In: Information and Computation [142], 40-75 | Journal Article |
Charatonik, Amadio
(Ed: Brim, Jancar, Kretinsky, Kucera)
[-] | 2002 | | On Name Generation and Set-Based Analysis in the Dolev-Yao Model
In: CONCUR 2002 - Concurrency Theory. 13th International Conference, 499-514 | Proceedings Article |
Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot
(Ed: Honsell, Miculan)
[-] | 2001 | | The Complexity of Model Checking Mobile Ambients
In: Foundations of Software Science and Computation Structures. Proceedings of the 4th International Conference (FOSSACS-01). Held as Part of the Joint European Conferences on Theory and Practice of Software (ETAPS-01), 152-167 | Proceedings Article |
Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot
[-] | 2003 | | Model checking mobile ambients
In: Theoretical Computer Science [308], 277-331 | Journal Article |
Charatonik, Dal Zilio, Gordon, Mukhopadhyay, Talbot
[Dal Zilio, Gordon, Talbot] | 2001 | | The Complexity of Model Checking Mobile Ambients | Report |
Charatonik, Georgieva, Maier
(Ed: Ong)
[-] | 2005 | | Bounded Model Checking of Pointer Programs
In: Computer Science Logic; 19th International Workshop, CSL 2005; 14th Annual Conference of the EACSL, 397-412 | Proceedings Article |
Charatonik, Gordon, Talbot
(Ed: Le Métayer)
[-] | 2002 | | Finite-Control Mobile Ambients
In: Programming languages and systems: 11th European Symposium on Programming, ESOP 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, 295-313 | Proceedings Article |
Charatonik, McAllester, Niwinski, Podelski, Walukiewicz
(Ed: Pratt)
[McAllester, Niwinski, Walukiewicz, Pratt] | 1998 | | The Horn Mu-calculus
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 58-69 | Proceedings Article |
Charatonik, Mukhopadhyay, Podelski
(Ed: Cortesi)
[-] | 2002 | | Compositional Termination Analysis of Symbolic Forward Analysis
In: Verification, Model Checking, and Abstract Interpretation. Third International Workshop, VMCAI 2002, 109-125 | Proceedings Article |
Charatonik, Mukhopadhyay, Podelski
(Ed: Stuckey)
[-] | 2002 | | Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
In: Logic Programming. 18th International Conference, ICLP 2002, 115-129 | Proceedings Article |
Charatonik, Podelski
(Ed: Freuder)
[Freuder] | 1996 | | The Independence Property of a Class of Set Constraints
In: Principles and Practice of Constraint Programming, Proceedings of the Second International Conference (CP'96), 76-90 | Proceedings Article |
Charatonik, Podelski
(Ed: Levi)
[Levi] | 1998 | | Directional Type Inference for Logic Programs
In: Proceedings of the 5th International Symposium in Static Analysis (SAS-98), 278-294 | Proceedings Article |
Charatonik, Podelski
(Ed: Nipkow)
[Nipkow] | 1998 | | Co-definite Set Constraints
In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), 211-225 | Proceedings Article |
Charatonik, Podelski
(Ed: Steffen)
[Steffen] | 1998 | | Set-Based Analysis of Reactive Infinite-state Systems
In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS-98), 358-375 | Proceedings Article |
Charatonik, Podelski
(Ed: Winskel)
[Winskel] | 1997 | | Set Constraints with Intersection
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 362-372 | Proceedings Article |
Charatonik, Podelski
[-] | 2002 | | Set Constraints with Intersection
In: Information and Computation [179], 213-229 | Journal Article |
Charatonik, Podelski, Talbot
[-] | 2000 | | Paths vs. Trees in Set-based Program Analysis
In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), 330-337 | Proceedings Article |
Charatonik, Talbot
(Ed: Fribourg)
[Talbot] | 2001 | | The Decidability of Model Checking Mobile Ambients
In: Computer science logic (CSL-01) : 15th International Workshop, CSL 2001, Annual Conference of the EACSL, 339-354 | Proceedings Article |
Charatonik, Talbot
(Ed: Tison)
[-] | 2002 | | Atomic Set Constraints with Projection
In: Rewriting Techniques and Applications. 13th International Conference, RTA 2002, 311-325 | Proceedings Article |
Chaudhuri, Dimopoulos, Zaroliagis
[-] | 1996 | | On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230 | Journal Article |
Christen
[-] | 1997 |  | A Calculus of Simplification for Superposition
Universität des Saarlandes | Thesis - Masters thesis |
Chu, Plaisted
(Ed: Bundy)
[Chu] | 1994 | | Semantically Guided First-Order Theorem Proving using Hyper-Linking
In: Proceedings of the 12th International Conference on Automated Deduction (CADE-12), 192-206 | Proceedings Article |
Claus, Hopf, Schwefel (ed.)
(Ed: Claus, Hopf, Schwefel)
[Claus, Schwefel] | 1996 | | Evolutionary Algorithms and their Application | Report |
Cook, Gotsman, Podelski, Rybalchenko, Vardi
(Ed: Hofmann, Felleisen)
[-] | 2007 | | Proving that programs eventually do something good
In: 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007), 265-276 | Proceedings Article |
